检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨晓东[1] 吴玲达[1] 谢毓湘[1] 杨征[1] 周文[1]
机构地区:[1]国防科学技术大学信息系统与管理学院,长沙410073
出 处:《计算机应用》2010年第1期65-67,共3页journal of Computer Applications
基 金:国家自然科学基金资助项目(60802080);国家863计划项目(2009AA01Z335)
摘 要:提出了一种针对二值图像的基于轮廓分解和局部描述的检索策略。首先从二值图像中提取物体轮廓,采用特定的方法对轮廓进行分解,得到轮廓的参考点集。求取每一个参考点的对应弧线段,构造从参考点指向对应弧线上各点的向量集合。对向量集合进行Fourier变换,得到Fourier系数可以作为该参考点的特征向量,从而原图像就被表示为特征空间中的特征点集。最后,采用点匹配的方法来计算图像之间的距离,实现二值图像的检索。实验结果表明,与目前已有的方法相比该方法具有较高的检索精度。This paper proposed a strategy for retrieving binary images based on contour decomposition and local description. Firstly, the contour of object was extracted from binary image and decomposed by special method, and then the set of reference points were acquired. For each reference point, the curve to which the point corresponds was gained. A set of vectors which connect the reference point to all the points in the curve were computed. After that, Fourier transform was applied to the set of vectors and Fourier coefficients were treated as the eigenvector of the reference point. As a result, the image could be represented by a set of feature vectors in feature space. Finally, the distance between two images could be calculated by the method of points matching and the retrieval of binary images could be implemented. Experiments show that this method has higher retrieval precision, compared with some classical methods.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30