Year: 2010
Numerical Mathematics: Theory, Methods and Applications, Vol. 3 (2010), Iss. 2 : pp. 223–244
Abstract
Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CVT (EWCVT). The concept of EWCVT is expected to build a mathematical base for all CVT related data classifications with requirement of smoothness of the cluster boundaries. The EWCVT method is easy in implementation, fast in computation, and natural for any number of clusters.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/nmtma.2010.32s.7
Numerical Mathematics: Theory, Methods and Applications, Vol. 3 (2010), Iss. 2 : pp. 223–244
Published online: 2010-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 22
Keywords: Centroidal Voronoi tessellations cluster boundary edge detection clustering image processing.
-
VCells: Simple and Efficient Superpixels Using Edge-Weighted Centroidal Voronoi Tessellations
IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34 (2012), Iss. 6 P.1241
https://doi.org/10.1109/TPAMI.2012.47 [Citations: 82]