• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1690-1704
• /
• 2013

An affine invariant descriptor is proposed, which is able to well represent the affine covariant regions. Estimating main orientation is still problematic in many existing method, such as SIFT (scale invariant feature transform) and SURF (speeded up robust features). Instead of aligning the estimated main orientation, in this paper ellipse orientation is directly used. According to ellipse orientation, affine covariant regions are firstly divided into 4 sub-regions with equal angles. Since affine covariant regions are divided from the ellipse orientation, the divided sub-regions are rotation invariant regardless the rotation, if any, of ellipse. Meanwhile, the affine covariant regions are normalized into a circular region. In the end, the gradients of pixels in the circular region are calculated and the partition-based descriptor is created by using the gradients. Compared with the existing descriptors including MROGH, SIFT, GLOH, PCA-SIFT and spin images, the proposed descriptor demonstrates superior performance according to extensive experiments.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.358-360
• /
• 2004

The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.517-519
• /
• 2004

This paper describes an approach to estimate a robot pose with an image. The algorithm of pose estimation with an image can be broken down into three stages : extracting scale-invariant features, matching these features and calculating affine invariant. In the first step, the robot mounted mono camera captures environment image. Then feature extraction is executed in a captured image. These extracted features are recorded in a database. In the matching stage, a Random Sample Consensus(RANSAC) method is employed to match these features. After matching these features, the robot pose is estimated with positions of features by calculating affine invariant. This algorithm is implemented and demonstrated by Matlab program.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.615-622
• /
• 2007

In general, Harris detector is commonly used for finding salient points in watermarking systems using feature points. Harris detector is a kind of combined comer and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. In this paper, we have used cross reference points which use not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we find cross reference points and take inverse normalization of these points. Next, we construct a group of triangles using tessellation with inversely normalized cross reference points. The watermarks are affine transformed and transformed-watermarks are embedded into not normalized image but original one. Only locations of watermarks are determined on the normalized image. Therefore, we can reduce data loss of watermark which is caused by inverse normalization. As a result, we can detect watermarks with high correlation after several digital attacks.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.260-262
• /
• 2003

New Image registration techniques are developed for determining geometric distortions between two images of the same scene. First, the properties of the Fourier transform of a two dimensional function under the affine transformation are given. As a result, techniques for the estimation of the coefficients of the distortion model using the spectral frequency information are developed. Image registration can be achieved by applying the fast Fourier transform (FFT) technique for cross correlation of misregistered imagery to determine spatial distances. The correlation results may be rather broad, making detection of the peak difficult, what can be suppressed by enhancing cross-correlation technique. Yield greatly improves the delectability and high precision of image misregistration.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.124-129
• /
• 2003

A novel watermark registration method based on Radon transform for self-referencing watermark is presented. The novel method was successful in registering the watermark of the image that has undergone affine transformations and severe lossy compression, whereas the conventional method based on peak detection failed to register the watermark.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.55-65
• /
• 2011

In this paper, a novel method of marker detection robust against marker occlusion in augmented reality is proposed. the proposed method consists of four steps. In the first step, in order to effectively detect an occluded marker, we first utilize the Affine-SIFT (ASIFT, Affine-Scale Invariant Features Transform) for detecting matching points between an enrolled marker and an input images with an occluded marker. In the second step, we apply the Principal Component Analysis (PCA) for eliminating outlier of the matching points in the enrolled marker. And then matching points are projected to the first and second axis for longest value and the shortest value of an ellipse are determined by average distance between the projected points and a center of the points. In the third step, Convex-hull vertices including matching points are considered as polygon vertices for estimating a geometric affine transformation. In the final step, by estimating the geometric affine transformation of the points, a marker robust against a marker occlusion is detected. Experimental results have shown that the proposed method effectively detects occlude markers.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.127-135
• /
• 2009

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2006.06a
• /
• pp.41-44
• /
• 2006

본 논문은 안면영상의 인증 요소로 사용되는 눈동자영역을 SIFT를 이용하여 추출해내는 방법을 제안하고 있다. 모델이 되는 눈동자영상과 추출 하고자 하는 입력영상의 SET 결과인 Keypoint descriptor를 이용하여 각각의 특징벡터를 구성하고 서로 정합한 후 두 특징 점들 사이에 affine transform이 존재하는지 판단하여 반수 이상에 대응하는 특징 점들에 대해 동일한 affine transform이 존재할 경우 눈동자영역이라고 판단하였다. 실험결과 학습과정이 없으므로 기존의 인식방법 보다 빠르게 영역을 추출하는 결과를 얻을 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.221-225
• /
• 1998

This paper is to present a method for recognizing an image of a tracking object by processing the image from a camera, whose attitude is controlled in inertial space with inertial co-ordinate system. In order to recognize an object, a pseudo-random M-array is attached on the object and it is observed by the camera which is controlled on inertial coordinate basis by inertial stabilization unit. When the attitude of the camera is changed, the observed image of M-array is transformed by use of affine transformation to the image in inertial coordinate system. Taking the cross-correlation function between the affine-transformed image and the original image, we can recognize the object. As parameters of the attitude of the camera, we used the azimuth angle of camera, which is de-fected by gyroscope of an inertial sensor, and elevation an91e of camera which is calculated from the gravitational acceleration detected by servo accelerometer.