TY - GEN
T1 - SIFT-based Elastic sparse coding for image retrieval
AU - Shi, Jun
AU - Jiang, Zhiguo
AU - Feng, Hao
AU - Zhang, Liguo
PY - 2012
Y1 - 2012
N2 - Bag-of-features (BoF) model based on SIFT generally assumes each descriptor is related to only one visual word of the codebook. Therefore, the potential correlation between the descriptor and other visual words is ignored. On the other hand, sparse coding through l1-norm regularization fails to generate optimal sparse representations since l1-norm regularization randomly selected one variable from a group of highly correlated variables. In this study we propose a novel bag-of-features model for image retrieval called SIFT-based Elastic sparse coding. The method utilizes a large number of SIFT descriptors to construct the codebook. The Elastic Net regression framework, which combines both l1-norm and l2-norm penalties, is then used to obtain the sparse-coefficient vector corresponding to the SIFT descriptor. Finally each image can be represented by a unified sparse-coefficient vector. Experimental results on Coil20 dataset demonstrate the consistent superiority of the proposed method over the state-of-the-art algorithms including original SIFT matching, conventional BoF strategy and BoF model based on l1-norm sparse coding.
AB - Bag-of-features (BoF) model based on SIFT generally assumes each descriptor is related to only one visual word of the codebook. Therefore, the potential correlation between the descriptor and other visual words is ignored. On the other hand, sparse coding through l1-norm regularization fails to generate optimal sparse representations since l1-norm regularization randomly selected one variable from a group of highly correlated variables. In this study we propose a novel bag-of-features model for image retrieval called SIFT-based Elastic sparse coding. The method utilizes a large number of SIFT descriptors to construct the codebook. The Elastic Net regression framework, which combines both l1-norm and l2-norm penalties, is then used to obtain the sparse-coefficient vector corresponding to the SIFT descriptor. Finally each image can be represented by a unified sparse-coefficient vector. Experimental results on Coil20 dataset demonstrate the consistent superiority of the proposed method over the state-of-the-art algorithms including original SIFT matching, conventional BoF strategy and BoF model based on l1-norm sparse coding.
KW - Bag-of-features
KW - image retrieval
KW - scale invariant feature transform
KW - sparse representation
UR - https://www.scopus.com/pages/publications/84875831553
U2 - 10.1109/ICIP.2012.6467390
DO - 10.1109/ICIP.2012.6467390
M3 - 会议稿件
AN - SCOPUS:84875831553
SN - 9781467325332
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 2437
EP - 2440
BT - 2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings
T2 - 2012 19th IEEE International Conference on Image Processing, ICIP 2012
Y2 - 30 September 2012 through 3 October 2012
ER -