• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2132-2143
• /
• 2015

This paper presents two distance geometry-based algorithms for wireless location in cellular network systems-distance geometry filtering (DGF) and distance geometry constraint (DGC). With time-of-arrival range measurements, the DGF algorithm estimates the mobile station position by selecting a set of measurements with relatively small NLOS (non-line-of-sight) errors, and the DGC algorithm optimizes the measurements first and then estimates the position using those optimized measurements. Simulation results show that the proposed algorithms can mitigate the impact of NLOS errors and effectively improve the accuracy of wireless location.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.79-86
• /
• 2013

Taxicab plane geometry and Cinese-Checker plane geometry are non-Euclidean and more practical notion than Euclidean geometry in the real world. The ${\alpha}$-distance is a generalization of the Taxicab distance and Chinese-Checker distance. It was first introduced by Songlin Tian in 2005, and generalized to n-dimensional space by Ozcan Gelisgen in 2006. In this paper, we studied the isoperimetric inequality in ${\alpha}$-plane.

• Journal of Science Education
• /
• v.47 no.3
• /
• pp.263-272
• /
• 2023

We consider how a pre-service teacher can understand and utilize various concepts of Euclidean geometry by learning conic sections using mathematical definitions in non-Euclidean geometry. In a third-grade class of D University, we used mathematical definitions to demonstrate that learning conic sections in non-Euclidean space, such as taxicab geometry and Minkowski distance space, can aid pre-service teachers by enhancing their ability to acquire and accept new geometric concepts. As a result, learning conic sections using mathematical definitions in taxicab geometry and Minkowski distance space is expected to contribute to enhancing the education of pre-service teachers for Euclidean geometry expertise by fostering creative and flexible thinking.

• Communications of Mathematical Education
• /
• v.24 no.3
• /
• pp.659-689
• /
• 2010

Taxicab distance function is a practical distance notion which gives us information of real world pathway distance that really taxi can go through. As one of the non-Euclidean geometry, this study of an ideal city with all roads running horizontal or vertical, was introduced by the Russian Mathematician H. Minkowski and synthetically reported by the E. F. Kraus in 1986. After that, there were many reports and papers on this topic and still being researched. At this point of view, our research about taxicab geometry provides its differences from Euclidean plane geometry, and considers about several theorems on plane geometry using the taxicab distance function.

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1189-1198
• /
• 2017

Computer-aided design (CAD)-based Monte Carlo radiation transport is of value to the nuclear engineering community for its ability to conduct transport on high-fidelity models of nuclear systems, but it is more computationally expensive than native geometry representations. This work describes the adaptation of a rendering data structure, the signed distance field, as a geometric query tool for accelerating CAD-based transport in the direct-accelerated geometry Monte Carlo toolkit. Demonstrations of its effectiveness are shown for several problems. The beginnings of a predictive model for the data structure's utilization based on various problem parameters is also introduced.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1195-1207
• /
• 2005

In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.49-52
• /
• 2002

This paper presents a fast algorithm for face detection from color images on internet. We use Mahalanobis distance between standard skin color and actual pixel color on IQ color space to segment skin color regions. The skin color regions are the candidate face region. Further, the locations of eyes and mouth regions are found by computing average pixel values on horizontal and vertical pixel lines. The geometry of mouth and eye locations is compared to the standard face geometry to eliminate false face regions. Our Method is simple and fast so that it can be applied to face search engine for internet.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.608-611
• /
• 2002

In GMAW(Gas Metal Arc Welding) process, bead geometry (penetration, bead width and height) is a criterion to estimate welding quality. Bead geometry is affected by welding current, arc voltage and travel speed, shielding gas, CTWB (contact- tip to workpiece distance) and so on. In this paper, welding process variables were selected as welding current, arc voltage and travel speed. And bead geometry was reasoned from the chosen welding process variables using negro-fuzzy algorithm. Neural networks was applied to design FL(fuzzy logic). The parameters of input membership functions and those of consequence functions in FL were tuned through the method of learning by backpropagation algorithm. Bead geometry could be reasoned from welding current, arc voltage, travel speed on FL using the results learned by neural networks.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.147-152
• /
• 2007

Face detection is a crucial part of the face recognition system. It determines the performance of the whole recognition system. Hausdorff distance metric has been used in face detection and recognition with good results. It defines the distance metric based only on the geometric similarity between two sets or points. However, not only the geometry but also the local patterns around the points are available in most cases. In this paper a new Hausdorff distance measure is proposed that makes hybrid use of the similarity of the geometry and the local patterns around the points. Several experiments shows that the new method outperforms the conventional method.