DocumentCode
134636
Title
Using affine features for an efficient binary feature descriptor
Author
Desai, Amish ; Dah-Jye Lee ; Wilson, Campbell
Author_Institution
Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA
fYear
2014
fDate
6-8 April 2014
Firstpage
49
Lastpage
52
Abstract
A feature descriptor that is robust to a number of image deformations is a basic requirement for vision based applications. Most feature descriptors work well in image deformations such as compression artifacts, illumination changes, and blurring. To develop a feature descriptor that works well apart from these image deformations like transformations caused by long baseline is a challenging task. This paper introduces a compact and efficient binary feature descriptor called PRObabilistic (PRO). A method for removing non-affine features from the initial feature list is developed, which results in further improved performance with the PRO descriptor when dealing with many deformations including long baseline between images. Feature matching accuracy using only affine features is compared with accuracy using both affine and non-affine features on benchmark datasets to demonstrate the advantages of using affine feature point for PRO descriptor.
Keywords
affine transforms; computer vision; data compression; feature extraction; image coding; image matching; PRO descriptor; PRObabilistic method; affine feature point; binary feature descriptor; blurring; compression artifacts; feature matching; illumination changes; image deformations; nonaffine features removal; vision based applications; Robustness; affine feature; an efficient descriptor; feature descriptor;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Analysis and Interpretation (SSIAI), 2014 IEEE Southwest Symposium on
Conference_Location
San Diego, CA
Type
conf
DOI
10.1109/SSIAI.2014.6806026
Filename
6806026
Link To Document