• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.147-150
• /
• 2000

Hausdorff distance(HD) commonly used measures for object matching, and calculates the distance between two point set of pixels in two-dimentional binary images without establishing correspondence. And it is realized as the image filter applying the fuzzy. In this paper, the fuzzy hardware realizes in order to construct the image filter applying HD, also, propose as the method for the noise removal using it in the image. MIN-MAX circuit designs the circuit using MAX-PLUS, and the fuzzy HD hardware results are obtained to the simulation. And then, the previous computer simulation is confirmed to the result by using MATLAB.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.129.1-129
• /
• 2001

In this paper, we present an approach for matching images from finding interesting points and applying new image interpolation algorithm. New algorithms are developed that automatically align the input images match them and reconstruct 3-D surfaces. The interpolation algorithm is designed to cope with simple shapes. The proposed image interpolation algorithm generate a rotation image about vertical axes by an any angle from 4 base images. Each base image that was obtained from CCD camera has an angle difference of 90$^{\circ}$ The proposed image interpolation algorithm use the geometric analysis of image and depth information.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.181.5-181
• /
• 2001

This paper presents the method of 3D reconstruction of the depth information from the endoscopic stereo scopic images. After camera modeling to find camera parameters, we performed feature-point based stereo matching to find depth information. Acquired some depth information is finally 3D reconstructed using the NURBS(Non Uniform Rational B-Spline) algorithm. The final result image is helpful for the understanding of depth information visually.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1799-1802
• /
• 2003

This paper has been studied a Adaptive feature-factors based fingerprints recognition in many biometrics. we study preprocessing and matching method of fingerprints image in various circumstances by using optical fingerprint input device. The Fingerprint Recognition Technology had many development until now. But, There is yet many point which the accuracy improves with operation speed in the side. First of all we study fingerprint classification to reduce existing preprocessing step and then extract a Feature-factors with direction information in fingerprint image. Also in the paper, we consider minimization of noise for effective fingerprint recognition system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.541-541
• /
• 2000

This paper Presents the method of 3D reconstruction of the depth information from the endoscopic stereo scopic images. After camera modeling to find camera parameters, we peformed feature-point based stereo matching to find depth information. Acquired some depth information is finally 3D reconstructed using the NURBS(Non Uniform Rational B-Spline) algorithm. The final result image is helpful for the understanding of depth information visually.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2018

Recently, the use of image stitching technology has been increasing as the number of contents based on virtual reality increases. Image Stitching is a method for matching multiple images to produce a high resolution image and a wide field of view image. The image stitching is used in various fields beyond the limitation of images generated from one camera. Image Stitching detects feature points and corresponding points to match multiple images, and calculates the homography among images using the RANSAC algorithm. Generally, corresponding points are needed for calculating conversion relation. However, the corresponding points include various types of noise that can be caused by false assumptions or errors about the conversion relationship. This noise is an obstacle to accurately predict the conversion relation. Therefore, RANSAC algorithm is used to construct an accurate conversion relationship from the outliers that interfere with the prediction of the model parameters because matching methods can usually occur incorrect correspondence points. In this paper, we propose an algorithm that extracts more accurate inliers and computes accurate transformation relations by using correspondence point relation information used in RANSAC algorithm. The correspondence point relation information uses distance ratio between corresponding points used in image matching. This paper aims to reduce the processing time while maintaining the same performance as RANSAC.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.2
• /
• pp.165-172
• /
• 2013

In this paper, high-quality mosaic image is generated by high-resolution hyperspectral strip images using scale-invariant feature transform (SIFT) algorithm, which is one of the representative image matching methods. The experiments are applied to AISA Eagle images geo-referenced by using GPS/INS information acquired when it was taken on flight. The matching points between three strips of hyperspectral images are extracted using SIFT method, and the transformation models between images are constructed from the points. Mosaic image is, then, generated using the transformation models constructed from corresponding images. Optimal band appropriate for the matching point extraction is determined by selecting representative bands of hyperspectral data and analyzing the matched results based on each band. Mosaic image generated by proposed method is visually compared with the mosaic image generated from initial geo-referenced AISA hyperspectral images. From the comparison, we could estimate geometrical accuracy of generated mosaic image and analyze the efficiency of our methodology.

• Korean Journal of Remote Sensing
• /
• v.32 no.6
• /
• pp.693-701
• /
• 2016

To make a mosaicked image, we need to estimate the geometric relationship between individual images. For such estimation, we needs tiepoint information. In general, feature-based methods are used to extract tiepoints. However, in the case of textureless images, feature-based methods are hardly applicable. In this paper, we propose a frequency domain matching method for automated mosaicking of textureless images. There are three steps in the proposed method. The first step is to convert color images to grayscale images, remove noise, and extract edges. The second step is to define a Region Of Interest (ROI). The third step is to perform phase correlation between two images and select the point with best correlation as tiepoints. For experiments, we used GOCI image slots and general frame camera images. After the three steps, we produced reliable tiepoints from textureless as well as textured images. We have proved application possibility of the proposed method.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1385-1398
• /
• 2004

This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.