• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.479-483
• /
• 2006

Indoor positioning is recently highlighted and various kinds of indoor positioning systems are under developments. Since positioning systems have their own characteristics, proper positioning scheme should be chosen according to the required specifications. Positioning methods are often classified into time-based and angle-based one, and this paper presents the error analysis of these location methods. Because measurement equations of these methods are nonlinear, linearization is usually needed to get the position estimate. In this paper, Gauss-Newton method is used in the linearization. To analyze the position error, we investigate the error ellipse parameters that include eccentricity, rotation angle, and the size of ellipse. Simulation results show that the major axes of error ellipses of TOA and AOA method lie in different quadrants at most region of workspace, especially where the geometry is poor. When the TOA/AOA hybrid scheme is employed, it is found that the error ellipse is reduced to the intersection of ellipses of TOA and AOA method.

• The Journal of Korean Association of Computer Education
• /
• v.14 no.2
• /
• pp.83-94
• /
• 2011

In the biomedical domain, the longest matching method is frequently used for recognizing named entity written in the literature. This method uses a dictionary as a resource for named entity recognition. If there exist appropriated dictionary about target domain, the longest matching method has the advantage of being able to recognize the entities of target domain quickly and exactly. However, the longest matching method is difficult to recognize the enumerated named entities, because these entities are frequently expressed as being omitted some words. In order to resolve this problem, we propose the partial matching method using a dictionary. The proposed method makes several candidate entities on the assumption that the ellipses may be included. After that, the method selects the most valid one among candidate entities through the optimization algorithm. We tested the longest and partial matching method about HLA entities: HLA gene, antigen, and allele entities, which are frequently enumerated among biomedical entities. As preparing for named entity recognition, we built two new resource, extended dictionary and tag-based dictionary about HLA entities. And later, we performed the longest and partial matching method using each dictionary. According to our experiment result, the longest matching method was effective in recognizing HLA antigen entities, in which the ellipses are rare, and the partial matching method was effective in recognizing HLA gene and allele entities, in which the ellipses are frequent. Especially, the partial matching method had a high F-score 95.59% about HLA alleles.

• Proceedings of the Korean Magnestics Society Conference
• /
• 2007.05a
• /
• pp.100.2-100.2
• /
• 2007

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• v.12 no.6
• /
• pp.323-328
• /
• 2002

The model of the shortest chemical bonds is applied for the classification of acentric simple and binary Mo(VI) and W(VI) oxides. It is shown that on the plane of the shortest chemical bonds the compounds are located into the rosette of three intersected ellipses. The correlation between the optical nonlinearity and combination of the bond lengths is discussed.

• Journal of Educational Research in Mathematics
• /
• v.8 no.1
• /
• pp.59-71
• /
• 1998

Recently, most classrooms in Korea are fully equipped with multimedia environments such as a powerful pentium pc, a 43″large sized TV, and so on through the third renovation of classroom environments. However, there is not much software teachers can use directly in their teaching. Even with existing software such as GSP, and Mathematica, it turns out that it doesn####t fit well in a large number of students in classrooms and with all written in English. The study is to analyze the characteristics of problem-solving process and to develop a computer program which integrates the instruction of problem solving into a regular math program in areas of quadratic functions and ellipses. Problem Solving in this study included two sessions: 1) Learning of basic facts, concepts, and principles; 2) problem solving with problem contexts. In the former, the program was constructed based on the definitions of concepts so that students can explore, conjecture, and discover such mathematical ideas as basic facts, concepts, and principles. In the latter, the Polya#s 4 phases of problem-solving process contributed to designing of the program. In understanding of a problem, the program enhanced students#### understanding with multiple, dynamic representations of the problem using visualization. The strategies used in making a plan were collecting data, using pictures, inductive, and deductive reasoning, and creative reasoning to develop abstract thinking. In carrying out the plan, students can solve the problem according to their strategies they planned in the previous phase. In looking back, the program is very useful to provide students an opportunity to reflect problem-solving process, generalize their solution and create a new in-depth problem. This program was well matched with the dynamic and oscillation Polya#s problem-solving process. Moreover, students can facilitate their motivation to solve a problem with dynamic, multiple representations of the problem and become a powerful problem solve with confidence within an interactive computer environment. As a follow-up study, it is recommended to research the effect of the program in classrooms.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.3
• /
• pp.259-266
• /
• 2013

An automated cell tracking system is used to automatically analyze and track the changes in cell behavior in time-lapse cell images acquired using a microscope with a cell culture. Clustering is the partial overlapping of neighboring cells in the process of cell change. Separating clusters into individual cells is very important for cell tracking. In this study, we proposed an algorithm for separating clusters by using ellipse fitting based on a direct least square method. We extracted the contours of clusters, divided them into line segments, and then produced their fitted ellipses using a direct least square method for each line segment. All of the fitted ellipses could be used to separate their corresponding clusters. In experiments, our algorithm separated clusters with average precisions of 91% for two overlapping cells, 84% for three overlapping cells, and about 73% for four overlapping cells.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.469-486
• /
• 2018

We propose an enhanced version of the local binary pattern (LBP) operator for texture extraction in images in the context of image retrieval. The novelty of our proposal is based on the observation that the LBP exploits only the lowest kind of local information through the global histogram. However, such global Histograms reflect only the statistical distribution of the various LBP codes in the image. The block based LBP, which uses local histograms of the LBP, was one of few tentative to catch higher level textural information. We believe that important local and useful information in between the two levels is just ignored by the two schemas. The newly developed method: gradual locality integration of binary patterns (GLIBP) is a novel attempt to catch as much local information as possible, in a gradual fashion. Indeed, GLIBP aggregates the texture features present in grayscale images extracted by LBP through a complex structure. The used framework is comprised of a multitude of ellipse-shaped regions that are arranged in circular-concentric forms of increasing size. The framework of ellipses is in fact derived from a simple parameterized generator. In addition, the elliptic forms allow targeting texture directionality, which is a very useful property in texture characterization. In addition, the general framework of ellipses allows for taking into account the spatial information (specifically rotation). The effectiveness of GLIBP was investigated on the Corel-1K (Wang) dataset. It was also compared to published works including the very effective DLEP. Results show significant higher or comparable performance of GLIBP with regard to the other methods, which qualifies it as a good tool for scene images retrieval.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.27-32
• /
• 2013

It plays an important role to detect the shape of an ellipse in many application areas of image processing. But it is very difficult to detect the ellipse in the real image because the noise was involved in the image, other objects obscured the ellipse or the ellipses were overlap with each other. In this paper, we extract the boundary (edge) to detect ellipse in the image and perform the grouping process in order to reduce amount of information. As a result, the speed of the ellipse detection was improved. Also in order to the ellipse detection, we selected the five ellipse parameters at random And then to select the optimal parameters of the ellipse, the linear least-squares approximation is applied. To verify the ellipse detection, RANSAC algorithm is applied. After the algorithm proposed in this study was implemented, the results applied to the real images showed an aocuracy of 75% and speed was very fast to compared with other researches. It mean that the proposed algorithm was valuable to detect the ellipses in the image.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.61-64
• /
• 2001

This paper proposes an automatic method for generating and 3D draping the skirt 3D models. The method constructs a 3D basic model of the skirts using elliptic cylinder and generates the various skirt 3D models by controlling the ellipses of the basic model. B-Spline approximates the wrinkles around the ellipse for the various 3D draping changing according to designs and textiles. We make some real skirts and investigate appearances for their drapes. This paper simulates their appearances and obtains good results. Furthermore, adaptation of the skirt 3D model to a personal character implements realistic coordination of the various skirts.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.21-32
• /
• 1997

This paper proposes an elliptical world-modeling mehtrod in order to secure the safety of the mobile robot from the unreliability of ultrasonic sensors and to estimate the lateral orientation of the detected objects. This method is advnatageous because the total amount of data that the robot utilizes is reduced when historical and new data are clusterd during each sensing period and also because the objects in the environment can be almost exactly recognized. This paper also proposes a new local path planning algorithm which is divided into four different situations and gudies the robot through the safe local path using dat acollected in elliptical form. This algorithm can help the AMR navigate by allowing it to sum up the virtual vector forces made form the ellipses in order to select a safe subgoal. This local path plannin gmehtod using the elliptical world model has been proved by several navigation experiments.