QQ客服 官方微博 反馈留言

	Efficient Euclidean Distance Transform Using Perpendicular Bisector Segmentation
	Wang, Jun ; Tan, Ying
	2011
关键词	LINEAR-TIME PROPAGATION ALGORITHMS NEIGHBORHOODS PICTURE
英文摘要	In this paper, we propose an efficient algorithm for computing the Euclidean distance transform of two-dimensional binary image, called PBEDT (Perpendicular Bisector Euclidean Distance Transform). PBEDT is a two-stage independent scan algorithm. In the first stage, PBEDT computes the distance from each point to its closest feature point in the same column using one time column-wise scan. In the second stage, PBEDT computes the distance transform for each point by row with intermediate results of the previous stage. By using the geometric properties of the perpendicular bisector, PBEDT directly computes the segmentation by feature points for each row and each segment corresponding to one feature point. Furthermore, by using integer arithmetic to avoid time consuming float operations, PBEDT still achieves exact results. All these methods reduce the computational complexity significantly. Consequently, an efficient and exact linear time Euclidean distance transform algorithm is implemented. Detailed comparison with state-of-the-art linear time Euclidean distance transform algorithms shows that PBEDT is the fastest on most cases, and also the most stable one with respect to image contents.; Computer Science, Artificial Intelligence; EI; CPCI-S(ISTP); 1
语种	英语
DOI标识	10.1109/CVPR.2011.5995644
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/293100]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang, Jun,Tan, Ying. Efficient Euclidean Distance Transform Using Perpendicular Bisector Segmentation. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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