Browse > Article
http://dx.doi.org/10.5392/JKCA.2012.12.06.009

Effective Marker Placement Method By De Bruijn Sequence for Corresponding Points Matching  

Park, Gyeong-Mi (부산대학교 U-Port 정보기술산학공동 사업부)
Kim, Sung-Hwan (부산대학교 U-Port 정보기술산학공동 사업부)
Cho, Hwan-Gue (부산대학교 U-Port 정보기술산학공동 사업부)
Publication Information
The Journal of the Korea Contents Association / v.12, no.6, 2012 , pp. 9-20 More about this Journal
Abstract
In computer vision, it is very important to obtain reliable corresponding feature points. However, we know it is not easy to find the corresponding feature points exactly considering by scaling, lighting, viewpoints, etc. Lots of SIFT methods applies the invariant to image scale and rotation and change in illumination, which is due to the feature vector extracted from corners or edges of object. However, SIFT could not find feature points, if edges do not exist in the area when we extract feature points along edges. In this paper, we present a new placement method of marker to improve the performance of SIFT feature detection and matching between different view of an object or scene. The shape of the markers used in the proposed method is formed in a semicircle to detect dominant direction vector by SIFT algorithm depending on direction placement of marker. We applied De Bruijn sequence for the markers direction placement to improve the matching performance. The experimental results show that the proposed method is more accurate and effective comparing to the current method.
Keywords
Feature Detection; Feature Description; Feature Matching; De Bruijn Sequence;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 C. Harris and M. J. Stephens, "A combined corner and edge detector," In Alvey Vision Conference, pp.147-152, 1988.
2 A. Lempel, "On a Homomorphism of the De Brijn Graph and Its Allpications to the Design of Feadback Shift Registers," IEEE Trans. Computers, Vol.19. pp.1204-1209, 1970(12).   DOI   ScienceOn
3 S. W. Golomb, Shift Register Sequences. Aegean Park Press, Laguna Hills, CA, USA, 1981.
4 A. H. Chan, R. A Games, and E. L. Key, "On the complexites of de Bruijn Sequences," J comb. Theory, Ser. A, Vol.33, pp.233-246, 1982(4).   DOI
5 T. Helleseth and T Klove, "The Number of Cross-jon Pairs in Maximum Lenth Linear Sequences," IEEE Trans. Inform Theory, Vol. 37, pp.1731-1733, 1991(11).   DOI   ScienceOn
6 T. Chang, I. Song, H. M. Kim, and S. H. Cho, "Cross-Joins in de Bruijn Sequences and Maximum Length Linears Sequences," IEICE Trans. Fundamentals, Vol.E76A, pp.1494-1501, 1993(9).
7 F. Schweiger, B. Zeisl, P. Georgel, G. Schroth, E. Steinbach, and N. Navab, "Maximum detector response markers for SIFT and SURF," In Vision, Modeling and Visualization Workshop, 2009.
8 오인권, 김현진, 남궁재찬, "해마신경망과 SURF를 이용한 실시간 얼굴인식", 한국콘텐츠학회논문지, 제10권, 제1호, pp.177-185, 2011.
9 김영원, 장승익, 이성준, "SIFT를 이용한 우편영상의 송신자 인식", 한국콘텐츠학회논문지, 제10권, 제10호, pp.48-57, 2011.   과학기술학회마을   DOI
10 조동욱, 김태우, 신승수, 김지영, 김동원, 조태경, "마커 기반과 특징기반에 기초한 뇌 영상의 3차원 정합방법의 비교.고찰", 한국콘텐츠학회논문지, 제3권, 제3호, pp85-97, 2003.   과학기술학회마을
11 B. D. Lucas and T. Kanade, "An Iterative Image Registration Technique with an Application to Stereo Vision," IJCAI81, pp.121-130, 1981
12 G. J. Burghouts and J. M. Geusebroek, "Performance evaluation of local colour invariants," Computer Vision and Image Understanding, Vol.113, No.1, pp.48-62, 2009.   DOI   ScienceOn
13 K. van de Sande, T. Gevers, and C. Snoek, "A comparison of color features for visual concept classification," in Conference On Image And Video Retrieval, pp.141-150, 2008.
14 K. Mikolajczyk and C. Schmid, "A performance evaluation of local descriptors," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.27, No.10, pp.1615-1630, 2005.   DOI   ScienceOn
15 D. Lowe, "Distinctive image features from scale-invariant keypoints," Int'l J. Computer Vision, Vol.60, No.2, pp.91-110, 2004.   DOI   ScienceOn
16 H. Bay, T. Tuytelaars, and L. V. Gool, "Surf: Speeded up robust features," European Conference on Computer Vision, Vol.3951, No.2, pp.404-417, 2006.
17 X. Zhang, S. Fron, and N. Navab, "Visualmarker detection and decoding in ar systems:a comparative study," in In Proceedings of the 1st International Symposium on Mixed and Augmented Reality. IEEE Computer Society Washington, pp.97-106, 2002.
18 A. Alhakim, "A simple combinatorial algorithm for de bruijn sequences," American Mathematical Monthly, Vol.117, No.8, pp.728-732, 2010.   DOI   ScienceOn
19 N. G. de Bruijn, "A combinatorial problem," in Koninklijke Nederlandse Akademie v. Wetenschappen Vol.49, pp.758-764, 1946.
20 T. Etzion and A. Lempe, "Construction of de bruijn sequences of minimal complexity," IEEE Transactions on Information Theory, Vol.30, No.5, pp.705-708, 1984.   DOI
21 H. Fredricksen, "A survey of full length nonlinear shift register cycle algorithms," j-SIAM-REVIEW, Vol.24, No.2, pp.195-221, 1982.
22 D. Lowe, "Object Recognition from Local Scale variant Features," In International Conference on Computer Vision, pp.1150-1157, 1999.
23 W Cheung and G Hamarneh, "N-SIFT: NDIMENSIONAL SCALE INVARIANT FEATURE TRANSFORM FOR MATCHING MEDICAL IMAGES," IEEE International Symposium on Biomedical Imaging, 2007.
24 Y Ke, R Sukthankar, "PCA-SIFT: A more distinctiverepresentation for local image descriptors," IEEE CVPR, 2004.