期刊文献+

基于层次分析法的广义M-J集颜色特征向量描述

AHP-BASED GENERALIZED M-J SET COLOR FEATURE VECTOR DESCRIPTION
下载PDF
导出
摘要 针对广义M-J集,提出一种基于层次分析法的颜色特征向量描述。在对广义M-J集颜色特征描述的过程中,利用层次分析法原理,只需两两比较不同颜色特征的表示方法来描述目标图像颜色的重要性,方法简单,可以避免原始方法中因为人的主观性、随意性而带来的不一致、不统一的现象。实验结果表明,该描述方法相对单一方法更有效。 Aiming at generalized M-J set, a kind of AHP-based color feature vector description is proposed. During the generalized M-J set color feature description process, taking advantage of a hierarchical analysis principle, it is only required to compare pairwisely the importance of presentation methods of different color features to describing an object image color. The method is simple and can eliminate inconsistency and variation phenomena caused by people' s subjectivity and arbitrariness with the original method. Experimental results show that the described method is more effective than using just a single method.
出处 《计算机应用与软件》 CSCD 2011年第11期199-201,217,共4页 Computer Applications and Software
基金 山东省教育厅科技计划项目(J09LG52) 山东省科技发展计划项目(2010G0020807)
关键词 广义M—J集 层次分析法 颜色特征 Generalized M-J set Analytic hierarchy process (AHP) Color feature
  • 相关文献

参考文献4

二级参考文献31

  • 1金琪,戴汝为.矩,不变矩,角度矩及傅里叶描绘子[J].模式识别与人工智能,1993,6(3):181-188. 被引量:13
  • 2董卫军,周明全,耿国华.基于综合特征图像检索技术研究[J].计算机应用与软件,2005,22(11):34-35. 被引量:19
  • 3孙君顶,毋小省.基于分块主色和形状特征的彩色图像检索[J].光电工程,2006,33(12):85-90. 被引量:9
  • 4黄元元,何云峰.利用颜色进行基于内容的图像检索[J].小型微型计算机系统,2007,28(7):1277-1281. 被引量:6
  • 5Rui Y, Huang TS, Chang SF. Image retrieval: Current techniques, promising directions and open issues. Journal of Visual Communication and Image Representation, 1999,10(4):39-62.
  • 6Rui Y, Huang TS, Ortega M, Mehrotra S. Relevance feedback: A power tool for interactive content-based image retrieval. IEEE Trans. on Circuits and Systems for Video Technology, 1998,8(5):644-655.
  • 7Nievergelt J, Hinterberger H, Sevcik K. The gridfile: An adaptable symmetric multikey file structure. ACM Trans. on Database Systems, 1984,9(1):38-71.
  • 8Robinson J. The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In: Edmund YL, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1981.10-18.
  • 9Beckmann N, Kriegel HP, Schneider R, Seeger B. The R*-tree: An efficient and robust access method for points and rectangles. In:Garcia-Molina H, Jagadish HV, eds. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1990.322~33
  • 10Katayama N, Satoh S. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Peckham J, ed. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 1997. 369~380.

共引文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部