• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5750-5757
• /
• 2014

This paper proposes an image stabilization method for arbitrary disturbances, such as rotation, translation and zoom movement, using the SIFT (Scale Invariant Feature Transform). In addition, image stabilization was carried out using the image division and merge technique when moving objects appear on the scene. Finally, the experimental results showed that the suggested image stabilization scheme produced superior performance compared to the previous ones.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.1
• /
• pp.89-99
• /
• 2009

Let $\mu$ be a finite positive Borel measure on the unit ball $B{\subset}\mathbb{C}^n$ and $\nu$ be the Euclidean volume measure such that ${\nu}(B)=1$. For the unit sphere $S=\{z:{\mid}z{\mid}=1\}$, $\sigma$ is the rotation-invariant measure on S such that ${\sigma}(S)=1$. Let $\mathcal{P}[f]$ be the invariant Poisson integral of f. We will show that there is a constant M > 0 such that $\int_B{\mid}{\mathcal{P}}[f](z){\mid}^{p}d{\mu}(z){\leq}M\;{\int}_B{\mid}{\mathcal{P}}[f](z)^pd{\nu}(z)$ for all $f{\in}L^p({\sigma})$ if and only if ${\parallel}{\mu}{\parallel_r}\;=\;sup_{z{\in}B}\;\frac{\mu(E(z,r))}{\nu(E(z,r))}\;<\;\infty$.

• Journal of the Semiconductor & Display Technology
• /
• v.12 no.3
• /
• pp.59-64
• /
• 2013

Accurate and robust image registration is important task in many applications such as image retrieval and computer vision. To perform the image registration, essential required steps are needed in the process: feature detection, extraction, matching, and reconstruction of image. In the process of these function, feature extraction not only plays a key role, but also have a big effect on its performance. There are two representative algorithms for extracting image features, which are scale invariant feature transform (SIFT) and speeded up robust feature (SURF). In this paper, we present and evaluate two methods, focusing on comparative analysis of the performance. Experiments for accurate and robust feature detection are shown on various environments such like scale changes, rotation and affine transformation. Experimental trials revealed that SURF algorithm exhibited a significant result in both extracting feature points and matching time, compared to SIFT method.

• Journal of Convergence for Information Technology
• /
• v.11 no.10
• /
• pp.20-26
• /
• 2021

In this paper, we studied the rotation angle estimation methods required for image alignment in an image recognition environment. In particular, a rotation angle estimation method applicable to a low specification embedded-based environment was proposed and compared with the existing method using complex moment. The proposed method estimates the rotation angle through similarity mathcing of the 1D projection profile along the radial axis after converting an image into polar coordinates. In addition, it is also possible to select a method of using vector sum of the projection profile, which more simplifies the calculation. Through experiments conducted on binary pattern images and gray-scale images, it was shown that the estimation error of the proposed method is not significantly different from that of complex moment-based method and requires less computation and system resources. For future expansion, a study on how to match the rotation center in gray-scale images will be needed.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.108-118
• /
• 1994

By using a concept of interrelation vector between line segments a new algorithm for partial shape recognition of two-dimensional objects is introduced. The interrelation vector which is invariant under translation rotation and scaling of a pair of line segments is used as a feature information for polygonal shape recognition. Several useful properties of the interrelation vector are also derived in relation to efficient partial shape recognition. The proposed algorithm requires only small space of storage and is shown to be computationally simple and efficient.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.933-938
• /
• 1990

A method of recognizing 2-dimensional polygonal object is proposed by using a concept of generalized incremental circle transform. The generalized incremental circle transform, which maps boundaries of an object into a circular disc, represents efficiently the shape of the boundaries that are obtained from digirized binary images of the objects. It is proved that the generalized incremental circle transform of an object is invariant to object translation, rotation, and size, and can be used as feature information for recognizing two dimensional polygonal object efficiently.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.836-843
• /
• 1988

For the efficient recognition of Korean alphabets, a new procedure which is applicable for the generation of phase filters with reduced resolution requirements and capable of implementing distortion tolerant pattern recognition is proposd. The performance of these filters and their advantages for Korean alphabets recognition is demonstrated.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.861-870
• /
• 1990

A method of recognizing objects is proposed that uses a concept of modified incremental circle transform. The modified incremental circle transform, which maps bundaries of an object into an unit circle, represnets efficiently the shape of the boundaries detected in digitized binary images of the objects. It is proved that modified incremental circle transform of object, which is invariant under object translation, rotation, and size, can be used as feature information for recognizing two dimensional polygonal object efficiently.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.573-576
• /
• 1999

This paper presents a new shape segmentation algorithm. The procedure to achieve complete segmentation consists of two steps : the first step is mapping shape into two dimension by the using Distance Transform, the second step is partitioning the region by using the Watershed algorithm. As a application of the proposed algorithm, we perform the matching experiment for several objects by the use of segmented region. Simulation results demonstrate the efficiency of the proposed method, and the method has scale, rotation, and shift invariant properties.