计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 123-127.

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

基于ISODATA聚类的词汇树图像检索算法

张婷,戴芳,郭文艳   

  1. 西安理工大学理学院 西安710054;西安理工大学理学院 西安710054;西安理工大学理学院 西安710054
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家重大研究计划培育项目(91120014),陕西省教育厅科研计划项目(12JK0534)资助

Image Retrieval of Vocabulary Tree Method Based on ISODATA

ZHANG Ting,DAI Fang and GUO Wen-yan   

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

摘要: 词汇树图像检索是一种基于视觉关键词结构的高效的图像检索算法。该算法在特征提取和聚类过程中分别采用SIFT算法和K-means算法。然而,K-means算法对初值比较依赖,当聚类个数未知时,聚类易出现强分现象,且SIFT算法易造成数据溢出和增加检索时间。对此,给出了两种新的特征提取方法,分别称为SIFT_CRONE特征和Color_HU特征,同时引入了ISODATA算法对特征进行聚类。SIFT_CRONE特征提取方法基于SIFT算法确定图像的关键点,采用CRONE算子计算关键点周围像素的梯度,对关键点进行向量描述,其优点是既保持了SIFT特征的优点又减少了检索时间。Color_HU 特征是利用SIFT确定关键点和有效区域,对关键点的邻域提取该感兴趣区域的颜色直方图和HU矩特征,降低特征维数,缩短检索时间。在使用ISODATA算法时,设计了一种自适应参数确定算法。实验结果表明,ISODATA算法克服了K-means对初值的依赖,当聚类个数未知时有较好的聚类效果;两种新特征有各自的特点,均可以缩短图像的检索时间,提高检索效率。

关键词: 词汇树,图像检索,K-means,ISODATA,CRONE算子,SIFT特征

Abstract: Vocabulary tree image retrieval is a kind of efficient image retrieval algorithm based on the structure of visual words.It employes SIFT algorithm and K-means algorithm in the process of feature extraction and cluster respectively.K-means algorithm,however,is heavily dependent on the initial value.The cluster result of K-means is easy to appear forced cluster when the class number is unknown.And SIFT algorithm is easy to cause data overflow and increase the retrieval time.Two novel feature extraction methods,called SIFT_CRONE and Color_HU respectively,were proposed and ISODATA algorithm was introduced in this paper.The SIFT_CRONE feature extraction method determines the key points of the image using SIFT algorithm,calculates the pixel gradient around the key points using CRONE operator and describes the key points by vector.Its advantages are that it keeps the advantages of SIFT features and reduces the time costs of retrieval.In Color_HU feature extraction method,we determined the key points and the effective area by SIFT,and calculated color histogram and HU moment of the effective area to reduce the feature dimension and the retrieval time costs.Meanwhile,we presented an adaptive parameter estimation algorithm for ISODATA.The experimental results show that the ISODATA algorithm can avoid the dependence on initial value of K-means,and can obtain ideal results when the cluster number is unknown.Two proposed feature extraction methods have their own advertages,and both can shorten the time of image retrieval and improve the retrieval efficiency.

Key words: Vocabulary tree,Image retrieval,K-means,ISODATA,CRONE,SIFT

[1] Nister D.Scalable Recognition with a Vocabulary Tree.Proc.of the Intl Conf[C]∥ on Computer Vision and Pattern Recognition.2006,2:2161-2168
[2] Lowe D G.Distinctive image features from scale-invariant keypoints[J].International journal of Computer Vision,2004,60(2):91-110
[3] Qi Jin,Zhao Jian,Xie Yu,et al.Large-Scale Image RetrievalMethod Based on Voeabulary Tree[C]∥12th Amiual Meeting of China Assoeiation for Seienec and Technology on Information and Communication Technology and Smart Grid.Seientific Research Publishing,2010:219-223
[4] 齐锦.基于仿射传播聚类算法的词汇树生成研究[D].西安:西北大学,2011
[5] 陈晓宁.基于词汇树的图像检索中对视觉关键词的提取和研究[D].西安:西北大学,2011
[6] 汪成亮,兰利彬.采用分数阶微分边缘检测的图像插值[J].北京理工大学学报,2011,31(9):1085-1089
[7] Mathieu B,Melchior P,Oustaloup A,et al.Fractional differentiation for edge detection [J].Signal Processing,2003,83(11):2421-2432
[8] 张舒娟,王庆民.基于多特征的图像检索研究[J].计算机与现代化,2010,173(1):124-127
[9] 孙即祥.现代模式识别[M].北京:高等教育出版社,2008
[10] 陈平生.K-means和ISODATA聚类算法的比较研究[J].江西理工大学学报,2012,3(1):78-82

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!