• Korean Journal of Remote Sensing
• /
• v.13 no.2
• /
• pp.85-98
• /
• 1997

A geometric model of pushbroom-type linear CCD camera images is proposed in this paper. At present, this type of cameras are used for obtaining almost all kinds of high-resolution optical images from satellites. The proposed geometric model includes not only a forward transformation which is much more efficient. An inverse transformation function cannot be derived analytically in a closed form because the focal point of an image varies with time. In this paper, therefore, an iterative algorithm in which a focal point os converged to a given pixel position is proposed. Although the proposed model can be applied to any pushbroom-type linear CCD camera images, the geometric model of the high-resolution multi-spectral camera on-board KITSAT-3 is used in this paper as an example. The flight model of KITSAT-3 is in development currently and it is due to be launched late 1998.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.6
• /
• pp.621-626
• /
• 2010

For geometric correction of high-resolution images, the authors matched corresponding objects between a large-scale digital map and a QuickBird image to obtain the coefficients of the first order polynomial. Proximity corrections were performed, using the Boolean operation, to perform automated matching accurately. The modified iterative closest point (ICP) algorithm was used between the point data of the surface linear objects and the point data of the edge objects of the image to determine accurate transformation coefficients. As a result of the automated geometric correction for the study site, an accuracy of 1.207 root mean square error (RMSE) per pixel was obtained.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.415-418
• /
• 2008

Some embedded microprocessors do not have an FPU(Floating Point Unit) due to a circuit complexity and power consumption. The performance speed of MPEG-4 AAC decoder on this hardware environment would be slower than corresponding speed for playing back of the decoded results. Therefore, irritating and high-pitched noises are interleaved in the original the audio data. So, in order to play MPEG-4 AAC file on such PDA, a new algorithm that transforms floating-point arithmetic to one with integers, is needed. We have developed a transformation algorithm from floating-point operation to integer operation and implemented the PDA's AAC Player. We also show the efficiency of our proposed method with the experimental results.

• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.765-774
• /
• 2019

In this paper, we propose a point cloud matching algorithm for multiple RGB-D cameras. In general, computer vision is concerned with the problem of precisely estimating camera position. Existing 3D model generation methods require a large number of cameras or expensive 3D cameras. In addition, the conventional method of obtaining the camera external parameters through the two-dimensional image has a large estimation error. In this paper, we propose a method to obtain coordinate transformation parameters with an error within a valid range by using depth image and function optimization method to generate omni-directional three-dimensional model using 8 low-cost RGB-D cameras.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.883-887
• /
• 2016

Navigating an unknown environment is a challenging task for a robot, especially when a large number of obstacles exist and the odometry lacks reliability. Pose tracking allows the robot to determine its location relative to its previous location. The ICP (iterative closest point) has been a powerful method for matching two point clouds and determining the transformation matrix between the maps. However, in a situation where odometry is not available and the robot moves far from its original location, the ICP fails to calculate the exact displacement. In this paper, we suggest a method that is able to match two different point clouds taken a long distance apart. Without using any odometry information, it only exploits the features of corner points containing information on the surroundings. The algorithm is fast enough to run in real time.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.331-341
• /
• 2019

With the popularity of sensor-rich environments, smartphones have become one of the major platforms for obtaining and sharing information. Since it is difficult to utilize GNSS (Global Navigation Satellite System) inside the area with many buildings, the localization of smartphone in this case is considered as a challenging task. To resolve problem of localization using smartphone a four step image-based localization method and procedure is proposed. To improve the localization accuracy of smartphone datasets, MMS (Mobile Mapping System) and Google Street View were utilized. In our approach first, the searching for candidate matching image is performed by the query image of smartphone's using GNSS observation. Second, the SURF (Speed-Up Robust Features) image matching between the smartphone image and reference dataset is done and the wrong matching points are eliminated. Third, the geometric transformation is performed using the matching points with 2D affine transformation. Finally, the smartphone location and attitude estimation are done by PnP (Perspective-n-Point) algorithm. The location of smartphone GNSS observation is improved from the original 10.204m to a mean error of 3.575m. The attitude estimation is lower than 25 degrees from the 92.4% of the adjsuted images with an average of 5.1973 degrees.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.296-300
• /
• 1996

This paper presents 3D position estimation algorithm with the images of 2D vision sensors which issues Red Laser Slit light and recieves the line images. Since the sensor usually measures 2D position of corner(or edge) of a body and the measured point is not fixed in the body, the additional information of the corner(or edge) is used. That is, corner(or edge) line is straight and fixed in the body. For the body which moves in a plane, the Transformation matrix between the body coordinate and the reference coordinate is analytically found. For the 3D motion body, linearization technique and least mean squares method are used.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.228-233
• /
• 1997

An efficient corner matching algorithm is developed to minimize the amount of calculation. To reduce the amount of calculation, all available information from a corner detector is used to make model. This information has uncertainties due to discretization noise and geometric distortion, and this is represented by fuzzy rule base which can represent and handle the uncertainties. Form fuzzy inference procedure, a matched segment list is extracted, and resulted segment list is used to calculate the transformation between object of model and scene. To reduce the false hypotheses, a vote and re-vote method is developed. Also an auto tuning scheme of the fuzzy rule base is developed to find out the uncertainties of features from recognized results automatically. To show the effectiveness of the developed algorithm, experiments are conducted for images of real electronic components.

• Communications for Statistical Applications and Methods
• /
• v.17 no.4
• /
• pp.541-550
• /
• 2010

The $L_1$-regression estimator is susceptible to the leverage points, even though it is highly robust to the vertical outliers. This article is concerned with the improvement of robustness of the $L_1$-estimator. To improve its robustness, in terms of the breakdown point, we attempt to dampen the influence of the leverage points by means of reducing the weights corresponding to the leverage points. In addition the algorithm employs the linear scaling transformation technique, for higher computational efficiency with the large data sets, to solve the linear programming problem of $L_1$-estimation. Monte Carlo simulation results indicate that the proposed algorithm yields $L_1$-estimates which are robust to the leverage points as well as the vertical outliers.

• Korean Journal of Cognitive Science
• /
• v.14 no.1
• /
• pp.10-10
• /
• 2003

This paper extracts the edge of main components of face with Gabor wavelets transformation in facial expression images. FCM(Fuzzy C-Means) clustering algorithm then extracts the representative feature points of low dimensionality from the edge extracted in neutral face. The feature-points of the neutral face is used as a template to extract the feature-points of facial expression images. To match point to Point feature points on an expression face against each feature point on a neutral face, it consists of two steps using a dynamic linking model, which are called the coarse mapping and the fine mapping. This paper presents an automatic extraction of feature-points by dynamic linking model based on Gabor wavelets and fuzzy C-means(FCM) algorithm. The result of this study was applied to extract features automatically in facial expression recognition based on dimension[1].