• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.200-208
• /
• 2003

This paper proposes a separation and feature extraction of image signals using the independent component analysis(ICA) based on neural networks of efficient learning rule. The proposed learning rule is a hybrid fixed-point(FP) algorithm based on secant method and momentum. Secant method is applied to improve the performance by simplifying the 1st-order derivative computation for optimizing the objective function, which is to minimize the mutual informations of the independent components. The momentum is applied for high-speed convergence by restraining the oscillation in the process of converging to the optimal solution. The proposed algorithm has been applied to the composite images generated by random mixing matrix from the 10 images of $512\times512$-pixel. The simulation results show that the proposed algorithm has better performances of the separation speed and rate than those using the FP algorithm based on Newton and secant method. The proposed algorithm has been also applied to extract the features using a 3 set of 10,000 image patches from the 10 fingerprints of $256\times256$-pixel and the front and the rear paper money of $480\times225$-pixel, respectively, The simulation results show that the proposed algorithm has also better extraction speed than those using the another methods. Especially, the 160 basis vectors(features) of $16\times16$-pixel show the local features which have the characteristics of spatial frequency and oriented edges in the images.

• Journal of Mechanical Science and Technology
• /
• v.19 no.12
• /
• pp.2213-2223
• /
• 2005

In order to reconstruct a full 3D human model in reverse engineering (RE), a 3D scanner needs to be placed arbitrarily around the target model to capture all part of the scanned surface. Then, acquired multiple scans must be registered and merged since each scanned data set taken from different position is just given in its own local co-ordinate system. The goal of the registration is to create a single model by aligning all individual scans. It usually consists of two sub-steps: rough and fine registration. The fine registration process can only be performed after an initial position is approximated through the rough registration. Hence an automated rough registration process is crucial to realize a completely automatic RE system. In this paper an automated rough registration method for aligning multiple scans of complex human face is presented. The proposed method automatically aligns the meshes of different scans with the information of features that are extracted from the estimated principal curvatures of triangular meshes of the human face. Then the roughly aligned scanned data sets are further precisely enhanced with a fine registration step with the recently popular Iterative Closest Point (ICP) algorithm. Some typical examples are presented and discussed to validate the proposed system.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.939-947
• /
• 2019

With the revitalization of the media market, the necessity of compression, searching, editing and copyright protection of videos is increasing. In this paper, we propose a method to detect scene change in all these fields. We propose a pre-processing, feature point extraction using SIFT, and matching algorithm for detecting the same scene change even if distortions such as resolution change, subtitle insertion, compression, and flip are added in the distribution process. Also, it is applied to filtering technology and it is confirmed that it is effective for all transformations other than considering transform.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.8
• /
• pp.98-103
• /
• 2019

A more accurate method of feature point extraction and matching for three-dimensional reconstruction using low-resolution images of crops is proposed herein. This method is important in basic computer vision. In addition to three-dimensional reconstruction from exact matching, map-making and camera location information such as simultaneous localization and mapping can be calculated. The results of this study suggest applicable methods for low-resolution images that produce accurate results. This is expected to contribute to a system that measures crop growth condition.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.34-39
• /
• 2002

Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.853-867
• /
• 2005

A number of content-based image search methods have been proposed to this point. Each of these systems uses different image data and generates different data depending on the extraction method of different characteristics that the search capabilities of each system cannot be compared and assessed. In particular, there is a problem of applying the identical image data onto the contents based image search system on the web that cannot be compared and assessed. To resolve such a problem, the XML-based FEMAL is hereby presented for extracting data of characteristics generated from specific search system in a way that can be recognized from other starch system. In the experiment using FEMAL, the extract data for characteristics is mutually communicated and integrated and the comparison assessment of search capability is seemed to be available.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.808-816
• /
• 2004

This paper proposes the method of implementation of practical online face verification system based on multiple feature combination and a similarity space. The main issue in face verification is to deal with the variability in appearance. It seems difficult to solve this issue by using a single feature. Therefore, combination of mutually complementary features is necessary to cope with various changes in appearance. From this point of view, we describe the feature extraction approaches based on multiple principal component analysis and edge distribution. These features are projected on a new intra-person/extra-person similarity space that consists of several simple similarity measures, and are finally evaluated by a support vector machine. From the experiments on a realistic and large database, an equal error rate of 0.029 is achieved, which is a sufficiently practical level for many real- world applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2335-2340
• /
• 2009

This paper presents how to implement Markerless Augmented Reality and how to create and apply reference data sets. There are three parts related with implementation: setting camera, creation of reference data set, and tracking. To create effective reference data sets, we need a 3D model such as CAD model. It is also required to create reference data sets from various viewpoints. We extract the feature points from the mode1 image and then extract 3D positions corresponding to the feature points using ray tracking. These 2D/3D correspondence point sets constitute a reference data set of the model. Reference data sets are constructed for various viewpoints of the model. Fast tracking can be done using a reference data set the most frequently matched with feature points of the present frame and model data near the reference data set.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.868-874
• /
• 2014

This paper proposes a novel mapping algorithm in Omni-directional Vision SLAM based on an obstacle's feature extraction using Lucas-Kanade Optical Flow motion detection and images obtained through fish-eye lenses mounted on robots. Omni-directional image sensors have distortion problems because they use a fish-eye lens or mirror, but it is possible in real time image processing for mobile robots because it measured all information around the robot at one time. In previous Omni-Directional Vision SLAM research, feature points in corrected fisheye images were used but the proposed algorithm corrected only the feature point of the obstacle. We obtained faster processing than previous systems through this process. The core of the proposed algorithm may be summarized as follows: First, we capture instantaneous $360^{\circ}$ panoramic images around a robot through fish-eye lenses which are mounted in the bottom direction. Second, we remove the feature points of the floor surface using a histogram filter, and label the candidates of the obstacle extracted. Third, we estimate the location of obstacles based on motion vectors using LKOF. Finally, it estimates the robot position using an Extended Kalman Filter based on the obstacle position obtained by LKOF and creates a map. We will confirm the reliability of the mapping algorithm using motion estimation based on fisheye images through the comparison between maps obtained using the proposed algorithm and real maps.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.47-52
• /
• 2006

This paper proposes a method of content-based image retrieval using region feature vector in order to overcome disadvantages of existing color histogram methods. The color histogram methods have a weak point that reduces accuracy because of quantization error, and more. In order to solve this, we convert color information to HSV space and quantize hue factor being purecolor information and calculate histogram and then use thus for retrieval feature that is robust in brightness, movement, and rotation. Also we solve an insufficient part that is the most serious problem in color histogram methods by dividing an image into sixteen regions and then comparing each region. We improve accuracy by edge and DC of DCT transformation. As a result of experimenting with 1,000 color images, the proposed method has showed better precision than the existing methods.