摘要
A Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, an implementation algorithm based on direct calculation of the Freeman code of expanded contours is proposed for generating area Voronoi diagram of connected components. A closed convex polygon is utilized to bound each connected component, as an approximate representation, and the contour is represented using Freeman chain coding, from which we can compute the corresponding Freeman chain coding of its expanded contour directly, without recourse to the operation on pixels. While the contours iteratively expand outwards, the Voronoi diagram is constructed by the intersections of the expanded contours from different connected components. The experimental results show that our proposed approach significantly improves the speed of constructing area Voronoi diagram in digital images.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 947-960 |
| 页数 | 14 |
| 期刊 | International Journal of Pattern Recognition and Artificial Intelligence |
| 卷 | 21 |
| 期 | 5 |
| DOI | |
| 出版状态 | 已出版 - 8月 2007 |
学术指纹
探究 'Constructing area voronoi diagram based on direct calculation of the Freeman code of expanded contours' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver