QQ客服 官方微博 反馈留言

	Hausdorff Distance with k-Nearest Neighbors
	Wang, Jun ; Tan, Ying
	2012
关键词	Hausdorff distance k-Nearest neighbor face recognition HUMAN FACE RECOGNITION
英文摘要	Hausdorff distance (HD) is an useful measurement to determine the extent to which one shape is similar to another, which is one of the most important problems in pattern recognition, computer vision and image analysis. Howeverm, HD is sensitive to outliers. Many researchers proposed modifications of HD. HD and its modifications are all based on computing the distance from each point in the model image to its nearest point in the test image, collectively called nearest neighbor based Hausdorff distances (NNHDs). In this paper, we propose modifications of Hausdorff distance measurements by using k-nearest neighbors (kNN). We use the average distance from each point in the model image to its kNN in the test image to replace the NN procedures of NNHDs and obtain the Hausdorff distance based on kNN, named kNNHDs. When k = 1, kNNHDs are equal to NNHDs. kNNHDs inherit the properties of outliers tolerance from the prototypes in NNHDs and are more tolerant to noise.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000317101700032&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods; EI; CPCI-S(ISTP); 2
语种	英语
DOI标识	10.1007/978-3-642-31020-1_32
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/292808]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Jun,Tan, Ying. Hausdorff Distance with k-Nearest Neighbors. 2012-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。