• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > IPIU (¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥) > IPIU 1998 (Á¦10ȸ ¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥)

IPIU 1998 (Á¦10ȸ ¿µ»óó¸® ¹× ÀÌÇØ¿¡ °üÇÑ ¿öÅ©¼¥)

Current Result Document : 4 / 8 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) A Robust and Fast Template Matching Method for Rotation and Illumintion Invariance
¿µ¹®Á¦¸ñ(English Title) A Robust and Fast Template Matching Method for Rotation and Illumintion Invariance
ÀúÀÚ(Author) Min-Seok Choi   Yong-Sup Park   Whoi-Yul Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 10 NO. 01 PP. 0122 ~ 0126 (1998. 01)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Template matching is the process of determining the presence and the location of a reference image or an object inside a scene image under analysis by a spatial cross-correlation process. Conventional cross-correlation type algorithms are computationally expensive. Furthermore, when the object in the image is rotated, the conventional algorithms can not be used for practical purposes. In this paper, an algorithm for rotation invariant template matching method based on the combination of projection method and the Zernike moments is proposed. The algorithm consists of two stages. In the first stage the matching candidates are selected using a computationally low cost feature. Frequency domain calculation was adopted to reduce the computation cost in the computation of low cost feature for the whole image. In the second stage rotation invariant template matching is performed only on the matching candidates using Zernike moments.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå