• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.698-706
• /
• 2016

In order to move mobile robots to desired locations in a minimum time, optimal control problems have to be solved; however, their analytic solutions are almost impossible to obtain due to robot nonlinear equations. This paper presents a method to get optimal control gains of mobile robots using genetic algorithms. Since the optimal control gains of mobile robots depend on the initial conditions, the initial condition range is discretized to form some grid points, and genetic algorithms are applied to provide the optimal control gains for the corresponding grid points. The optimal control gains for general initial conditions may be obtained by use of neural networks. So the optimal control gains and the corresponding grid points are used to train neural networks. The trained neural networks can supply pseudo-optimal control gains. Finally simulation studies have been conducted to verify the effectiveness of the method presented in this paper.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.357-364
• /
• 2003

The main difficulty in estimating the fundamental matrix stems from the unavoidable outliers inherent in the given correspondence matches. Several researches showed that the estimation results are much dependent on selecting the corresponding points. These represent that it is important to solve the problems due to errors on the point locations and mismatches. In this paper, our analysis shows that if the evenly distributed corresponding points are selected, we can estimate a more precise fundamental matrix. This paper presents novel approaches to estimate the fundamental matrix by considering the inlier distributions. In order to select evenly distributed points, we divide the entire image into the subregions, and then examine the number of the inliers in each subregion and the area of each region. The simulation results showed that our consideration of the inlier distribution can provide a more precise estimation of the fundamental matrix.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.2
• /
• pp.91-100
• /
• 2023

The existing indoor localization method using Wi-Fi fingerprinting has a high collection cost and relatively low accuracy, thus requiring integrated correction of convergence with other technologies. This paper proposes a new method that significantly reduces collection costs compared to existing methods using Wi-Fi fingerprinting. Furthermore, it does not require labeling of data at collection and can estimate pedestrian travel paths even in large indoor spaces. The proposed pedestrian movement path estimation process is as follows. Data collection is accomplished by setting up a feature area near an indoor space intersection, moving through the set feature areas, and then collecting data without labels. The collected data are processed using Kernel Linear Discriminant Analysis (KLDA) and the valley point of the Euclidean distance value between two data is obtained within the feature space of the data. We build learning data by labeling data corresponding to valley points and some nearby data by feature area numbers, and labeling data between valley points and other valley points as path data between each corresponding feature area. Finally, for testing, data are collected randomly through indoor space, KLDA is applied as previous data to build test data, the K-Nearest Neighbor (K-NN) algorithm is applied, and the path of movement of test data is estimated by applying a correction algorithm to estimate only routes that can be reached from the most recently estimated location. The estimation results verified the accuracy by comparing the true paths in indoor space with those estimated by the proposed method and achieved approximately 90.8% and 81.4% accuracy in two experimental spaces, respectively.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.375-384
• /
• 2011

This paper suggests a method to recognize facial expressions of animation characters by means of dominant colors and feature points. The proposed method defines a simplified mesh model adequate for the animation character and detects its face and facial components by using dominant colors. It also extracts edge-based feature points for each facial component. It then classifies the feature points into corresponding AUs(action units) through neural network, and finally recognizes character facial expressions with the suggested AU specification. Experimental results show that the suggested method can recognize facial expressions of animation characters reliably.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.683-686
• /
• 2005

This study addresses a photogrammetric approach to generate Mars topographic products from mapping data of Mars Global Surveyor (MGS). High-resolution stereo images and laser altimetry data collected from the MGS mission are combined and processed to produce Digital Elevation Models (DEM) and orthoimages. First, altimeter data is registered to high resolution images and considerable registration offset (around 325 m) is discovered on high resolution stereo images. Altimetry data, exterior orientation elements of the camera and conjugate points are used for bundle adjustment to solve this mis-registration and detennine the ground coordinates. The mis-registration of altimetry data are effectively eliminated after the bundle adjustment. Using the adjusted exterior orientation the ground coordinates of conjugate points are detennined. A sufficient number of corresponding points collected through image matching and their precise 3-D ground coordinates are used to generate DEM and orthoimages. A posteriori standard deviations of ground points after bundle adjustment indicate the accuracy of OEM generated in this study. This paper addresses the photogrammetric procedure: the registration of altimetry data to stereo pair images, the bundle adjustment and the evaluation, and the generation of OEM and orthoimages.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.267-274
• /
• 2006

This paper describes a method to achieve different level of detail for the given volumetric data by assigning weight for the given data points. The relation between wavelet transformation and alpha shape was investigated to define the different level of resolution. Scattered data are defined as a collection of data that have little specified connectivity between data points. The quality of interpolant in volumetric trivariate space depends not only on the distribution of the data points in ${\Re}^3$, but also on the data value (intensity). We can improve the quality of an approximation by using wavelet coefficient as weight for the corresponding data points.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1418-1433
• /
• 2019

In computer graphics, 3D mesh segmentation is a challenging research field. This paper presents a 3D mesh model segmentation algorithm that focuses on removing exterior salient parts from the original 3D mesh model based on prominent feature points and marching plane. To begin with, the proposed approach uses multi-dimensional scaling to extract prominent feature points that reside on the tips of each exterior salient part of a given mesh. Subsequently, a set of planes intersect the 3D mesh; one is the marching plane, which start marching from prominent feature points. Through the marching process, local cross sections between marching plane and 3D mesh are extracted, subsequently, its corresponding area are calculated to represent local volumes of the 3D mesh model. As the boundary region of an exterior salient part generally lies on the location at which the local volume suddenly changes greatly, we can simply cut this location with the marching plane to separate this part from the mesh. We evaluated our algorithm on the Princeton Segmentation Benchmark, and the evaluation results show that our algorithm works well for some categories.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.650-663
• /
• 2021

Subsurface topology estimation is an important factor in the geophysical survey. Electrical impedance tomography is one of the popular methods used for subsurface imaging. The EIT inverse problem is highly nonlinear and ill-posed; therefore, reconstructed conductivity distribution suffers from low spatial resolution. The subsurface region can be approximated as piece-wise separate regions with constant conductivity in each region; therefore, the conductivity estimation problem is transformed to estimate the shape and location of the layer boundary interface. Each layer interface boundary is treated as an open boundary that is described using front points. The subsurface domain contains multi-layers with very complex configurations, and, in such situations, conventional methods such as the modified Newton Raphson method fail to provide the desired solution. Therefore, in this work, we have implemented a 7-layer artificial neural network (ANN) as an inverse problem algorithm to estimate the front points that describe the multi-layer interface boundaries. An ANN model consisting of input, output, and five fully connected hidden layers are trained for interlayer boundary reconstruction using training data that consists of pairs of voltage measurements of the subsurface domain with three-layer configuration and the corresponding front points of interface boundaries. The results from the proposed ANN model are compared with the gravitational search algorithm (GSA) for interlayer boundary estimation, and the results show that ANN is successful in estimating the layer boundaries with good accuracy.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_1
• /
• pp.1089-1100
• /
• 2018

In this paper, we analyze the feasibility of establishing a precise sensor model for high-resolution satellite imagery using unified control points. For this purpose, we integrated unified control points and the aerial orthoimages from the national land information map (http://map.ngii.go.kr/ms/map/NlipMap.do) operated by the National Geographic Information Institute (NGII). Then, we collected the image coordinates corresponding to the unified control point's location in the satellite image. The unified control points were used as observation data for establishing a precise sensor model. For the experiment, we compared the results of precise sensor modeling using GNSS survey data and those using unified control points. Our experimental results showed that it is possible to establish a precise sensor model with around 2 m accuracy when using unified control points.