计算机科学 ›› 2014, Vol. 41 ›› Issue (8): 278-280.doi: 10.11896/j.issn.1002-137X.2014.08.058

• 图形图像与模式识别 • 上一篇    下一篇

拉普拉斯稀疏编码的图像检索算法

王瑞霞,彭国华,郑红婵   

  1. 西北工业大学理学院 西安710129;西北工业大学理学院 西安710129;西北工业大学理学院 西安710129
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(61070233)资助

Image Retrieval Algorithm Based on Laplacian Sparse Coding

WANG Rui-xia,PENG Guo-hua and ZHENG Hong-chan   

  • Online:2018-11-14 Published:2018-11-14

摘要: 由于稀疏编码中过完备的码本和独立的编码处理,在编码过程中图像块相似性信息被丢失。为了保留块与块之间的相似性信息,提出了拉普拉斯稀疏编码的图像检索算法。给定编码特征的初始稀疏码,计算拉普拉斯矩阵,将相似性合并到稀疏目标函数,结合特征符号搜索算法和黄金分割线搜索算法,逐个更新每个稀疏编码系数。实验表明,拉普拉斯稀疏编码增强了稀疏编码的鲁棒性,与SPM模型算法相比,拉普拉斯稀疏编码的图像检索算法有较高的准确率。

关键词: 稀疏编码,图像检索,码本,拉普拉斯矩阵,相似度矩阵

Abstract: Due to the overcomplete codebook and the independent coding processing,the similarity of the image is lost between block and block to be encoded.To preserve such similarity information,we proposed the image retrieval algorithm based on Laplacian sparse coding.Given initial sparse coding and calculating the Laplacian matrix,similarity preserving term was incorporated into the objective of sparse coding.We used the feature-sign search algorithm and the golden section line search algorithm to update one by one each coefficient of sparse coding.The experiments show that Laplacian sparse coding can enhance the robustness of sparse coding.Compared with the improved SPM model,the new image retrieval algorithm better improves the retrieval accuracy.

Key words: Sparse coding,Image retrieval,Codebook,Laplacian matrix,Similarity matrix

[1] Donoho D.For most large underdetermined systems of linearequations the minimal l1-norm solution is also the sparsest solution[J].Comm.Pure and Applied Math,2006,9(6):797-829
[2] Donoho D.For most large underdetermined systems of linear equations,the minimal l1-norm near-solution approximates the sparsest near-solution [R].The United States,California:Department of Statistics Stanford University,August 2004
[3] Sivic J,zisserman A.Video google:a text retrieval approach toobject matching in videos[C]∥IEEE International Conference on Computer Vision(ICCV).2003:1470-1477
[4] Philbin J,Chum O,Isard M,et al.Object retrieval with large vocabularies and fast spatial matching[C]∥Proc.IEEE Conf.Computer Vision and Pattern Recognition.2007
[5] Lazebnik S,Schmid C,Ponce J.Beyond bags of features:spatial pyramid matching for recognizing natural scene categories[C]∥Proc.IEEE Conf.Computer Vision and Pattern Recognition.2006
[6] Yang Jian-chao,Yu Kai,Gong Yi-hong,et al.Linear spatial py-ramid matching using sparse coding for image classification[C]∥IEEE Conference on Computer Vision and Pattern Recognition.2009:1794-1801
[7] Lee H,Battle A,Raina R,et al.Efficient sparse coding algo-rithms[C]∥Proc.Advances in Neural Information Processing Systems 19.2006:801-808
[8] Gao Sheng-hua,Tsang I W-H,Chia L-T.Laplacian sparse co-ding,hypergraph laplacian sparse coding,and applications[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2013,35(1):92-104
[9] Boureau Y-L,Ponce J,LeCun Y.A Theoretical analysis of feature pooling in visual recognition[C]∥Proceedings of the 27’th International Conference on machine Learning.Haifa,Israel,2010
[10] Boureau Y-L,Bach F,LeCun Y,et al.Learning mid-level fea-tures for recognition[C]∥IEEE Conf.Computer Vision and Pattern Recognition.2010
[11] L Fei-fei,Fergus R,Perona P.Learning generative visual models from few training examples:an incremental bayesian approach tested on 101 object categories[C]∥IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshop.2004:178
[12] 王保平,赵静,苏建康,等.基于局部颜色-空间特征的图像检索方法研究[J].计算机应用与软件,2012,29(5):28-31,4
[13] 兰冲.基于统计规则的中文分词研究[D].西安:西安电子科技大学,2011

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!