• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.6
• /
• pp.49-59
• /
• 2008

SIFT(Scale Invariant Feature Transform) is an algorithm to extract vectors at pixels around keypoints, in which the pixel colors are very different from neighbors, such as vortices and edges of an object. The SIFT algorithm is being actively researched for various image processing applications including 3-D image constructions, and its most computation-intensive stage is a keypoint localization. In this paper, we develope a fixed-point model of the keypoint localization and propose its efficient hardware architecture for embedded applications. The bit-length of key variables are determined based on two performance measures: localization accuracy and error rate. Comparing with the original algorithm (implemented in Matlab), the accuracy and error rate of the proposed fixed point model are 93.57% and 2.72% respectively. In addition, we found that most of missing keypoints appeared at the edges of an object which are not very important in the case of keypoints matching. We estimate that the hardware implementation will give processing speed of $10{\sim}15\;frame/sec$, while its fixed point implementation on Pentium Core2Duo (2.13 GHz) and ARM9 (400 MHz) takes 10 seconds and one hour each to process a frame.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.170-178
• /
• 2008

A high performance object recognition algorithm using Fourier description of the 3D information of the objects is proposed. Object boundaries contain sufficient information for recognition in most of objects. However, it is not well utilized as the key solution of the object recognition since obtaining the accurate boundary information is not easy. Also, object boundaries vary highly depending on the size or orientation of object. The proposed object recognition algorithm is based on 1) the accurate object boundaries extracted from the 3D shape which is obtained by the laser scan device, and 2) reduction of the required database using the size and rotational invariant feature of the Fourier Descriptor. Such Fourier information is compared with the database and the recognition is done by selecting the best matching object. The experiments have been done on the rich database of MPEG 7 Part B.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.51-59
• /
• 1999

In this paper we propose the technique for tracking players and a ball and for obtaining players' ground traces using image mosaic in general soccer sequences. Here, general soccer sequences mean the case that there is no extreme zoom-in or zoom-out of TV camera. Obtaining player's ground traces requires that the following three main problems be solved. There main problems: (1) ground field extraction (2) player and ball tracking and team indentification (3) player positioning. The region of ground field is extracted on the basis of color information. Players are tracked by template matching and Kalman filtering. Occlusion reasoning between overlapped players in done by color histogram back-projection. To find the location of a player, a ground model is constructed and transformation between the input images and the field model is computed using four or more feature points. But, when feature points extracted are insufficient, image-based mosaic technique is applied. By this image-to-model transformation, the traces of players on the ground model can be determined. We tested our method on real TV soccer sequence and the experimental results are given.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.54-60
• /
• 2004

Face recognition is one of the problems to be solved by appearance based matching technique. However, the appearance of face image is very sensitive to variation in illumination. One of the easiest ways for better performance is to collect more training samples acquired under variable lightings but it is not practical in real world. ]:n object recognition, it is desirable to focus on feature extraction or normalization technique rather than focus on classifier. This paper presents a simple approach to normalization of faces subject to directional illumination. This is one of the significant issues that cause error in the face recognition process. The proposed method, ICR(illumination Compensation based on Multiple Linear Regression), is to find the plane that best fits the intensity distribution of the face image using the multiple linear regression, then use this plane to normalize the face image. The advantages of our method are simple and practical. The planar approximation of a face image is mathematically defined by the simple linear model. We provide experimental results to demonstrate the performance of the proposed ICR method on public face databases and our database. The experimental results show a significant improvement of the recognition accuracy.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.3
• /
• pp.249-255
• /
• 2017

The finger vein recognition technology is a method to acquire a finger vein image by illuminating infrared light to the finger and to authenticate a person through processes such as feature extraction and matching. In order to recognize a finger vein, a 2D mask-based two-dimensional convolution method can be used to detect a finger edge but it takes too much computation time when it is applied to a low cost micro-processor or micro-controller. To solve this problem and improve the recognition rate, this study proposed an extraction method for the region of interest based on virtual core points and moving average filtering based on the threshold and absolute value of difference between pixels without using 2D convolution and 2D masks. To evaluate the performance of the proposed method, 600 finger vein images were used to compare the edge extraction speed and accuracy of ROI extraction between the proposed method and existing methods. The comparison result showed that a processing speed of the proposed method was at least twice faster than those of the existing methods and the accuracy of ROI extraction was 6% higher than those of the existing methods. From the results, the proposed method is expected to have high processing speed and high recognition rate when it is applied to inexpensive microprocessors.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.36-41
• /
• 2017

The mobile mapping system first introduced at Ohio State University in 1991 is being developed in various forms as sensor technology develops. The mobile mapping system can acquire geospatial information around amoving object quickly using the information gathered using the position and attitude information of the moving object and the data from various sensors. The mobile mapping system can rapidly acquire large amounts of Geospatial information and MMS provides maximum productivity in the same measurement methods as existing GNSS and total stations. Currently, a variety of systems are being launched, mainly by foreign companies, and they are applied to the construction of geospatial information. On the other hand, the application of domestic technology development or production is insufficient. This paper provides basic data for the introduction of a mobile mapping system to geospatial information related business by conducting the status survey and feature analysis of a commercialized system focusing on the ground-based mobile mapping system. The research identified the current status and characteristics of high-priced, low-priced, indoor, and handheld mobile mapping systems based on vehicles and suggest that the recent system development trends are moving toward lowering the unit prices. The mobile mapping system is currently being developed as a platform for the application of geospatial information construction and the launch of low-cost models. The development of data processing technologies, such as automatic matching and the launch of low-cost models, are forming a basis for the application of mobile mapping systems in the field of geospatial information construction.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.786-792
• /
• 2010

This paper presents a real-time lane detection method which can accurately find the lane-mark boundaries in complex road environment. Unlike many existing methods that pay much attention on the post-processing stage to fit lane-mark position among a great deal of outliers, the proposed method aims at removing those outliers as much as possible at feature extraction stage, so that the searching space at post-processing stage can be greatly reduced. To achieve this goal, a grid-based morphology operation is firstly used to generate the regions of interest (ROI) dynamically, in which a directional edge-linking algorithm with directional edge-gap closing is proposed to link edge-pixels into edge-links which lie in the valid directions, these directional edge-links are then grouped into pairs by checking the valid lane-mark width at certain height of the image. Finally, lane-mark colors are checked inside edge-link pairs in the YUV color space, and lane-mark types are estimated employing a Bayesian probability model. Experimental results show that the proposed method is effective in identifying lane-mark edges among heavy clutter edges in complex road environment, and the whole algorithm can achieve an accuracy rate around 92% at an average speed of 10ms/frame at the image size of $320{\times}240$.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1015-1023
• /
• 2022

The Entry-Descent-Landing process of a lander involves many environmental and technical challenges. To solve these problems, recently, terrestrial relative navigation (TRN) technology has been essential for landers. TRN is a technology for estimating the position and attitude of a lander by comparing Inertial Measurement Unit (IMU) data and image data collected from a descending lander with pre-built reference data. In this paper, we present a method for generating descent dataset and extracting landmarks, which are key elements for developing TRN technologies to be used on Mars. The proposed method generates IMU data of a descending lander using a simulated Mars landing trajectory and generates descent images from high-resolution ortho-map and digital elevation map through a ray tracing technique. Landmark extraction is performed by an area-based extraction method due to the low-textured surfaces on Mars. In addition, search area reduction is carried out to improve matching accuracy and speed. The performance evaluation result for the descent dataset generation method showed that the proposed method can generate images that satisfy the imaging geometry. The performance evaluation result for the landmark extraction method showed that the proposed method ensures several meters of positioning accuracy while ensuring processing speed as fast as the feature-based methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.3
• /
• pp.175-185
• /
• 2020

Three-dimensional registration is a process of matching data with or without a coordinate system to a reference coordinate system, which is used in various fields such as the absolute orientation of photogrammetry and data combining for producing precise road maps. Three-dimensional registration is divided into a method using points and a method using linear features. In the case of using points, it is difficult to find the same conjugate point when having different spatial resolutions. On the other hand, the use of linear feature has the advantage that the three-dimensional registration is possible by using not only the case where the spatial resolution is different but also the conjugate linear feature that is not the same starting point and ending point in point cloud type data. In this study, we proposed a method to determine the scale and the three-dimensional translation after determining the three-dimensional rotation angle between two data using quaternion to perform three-dimensional registration using linear features. For the verification of the proposed method, three-dimensional registration was performed using the linear features constructed an indoor and the linear features acquired through the terrestrial mobile mapping system in an outdoor environment. The experimental results showed that the mean square root error was 0.001054m and 0.000936m, respectively, when the scale was fixed and if not fixed, using indoor data. The results of the three-dimensional transformation in the 500m section using outdoor data showed that the mean square root error was 0.09412m when the six linear features were used, and the accuracy for producing precision maps was satisfied. In addition, in the experiment where the number of linear features was changed, it was found that nine linear features were sufficient for high-precision 3D transformation through almost no change in the root mean square error even when nine linear features or more linear features were used.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.6
• /
• pp.552-558
• /
• 2002

Recently, based on the human speech recognition (HSR) model of Fletcher, the multi-band speech recognition has been intensively studied by many researchers. As a new automatic speech recognition (ASR) technique, the multi-band speech recognition splits the frequency domain into several sub-bands and recognizes each sub-band independently. The likelihood scores of sub-bands are weighted according to reliabilities of sub-bands and re-combined to make a final decision. This approach is known to be robust under noisy environments. When the noise is stationary a sub-band SNR can be estimated using the noise information in non-speech interval. However, if the noise is non-stationary it is not feasible to obtain the sub-band SNR. This paper proposes the inverse sub-band distance (ISD) weighting, where a distance of each sub-band is calculated by a stochastic matching of input feature vectors and hidden Markov models. The inverse distance is used as a sub-band weight. Experiments on 1500∼1800㎐ band-limited white noise and classical guitar sound revealed that the proposed method could represent the sub-band reliability effectively and improve the performance under both stationary and non-stationary band-limited noise environments.