1 January 2006 New curve-tracing algorithm based on a minimum-spanning-tree model and regularized fuzzy clustering
Benson S. Y. Lam, Hong Yan
Author Affiliations +
Abstract
Extracting a smooth curve from unordered data has many applications to image analysis. However, many reported methods assume either that the shape of the input data is known a priori or that the boundary of the data is clearly defined. We present a method that can handle several types of data sets. The main idea of the method is to extract a generalized curve, which passes through the data set. The proposed method is able to extract a smooth curve from complicated unordered pattern data and without any prior knowledge of the shape of the input data. Experimental results show that our method can produce good results for many data sets including handwritten Chinese characters.
©(2006) Society of Photo-Optical Instrumentation Engineers (SPIE)
Benson S. Y. Lam and Hong Yan "New curve-tracing algorithm based on a minimum-spanning-tree model and regularized fuzzy clustering," Optical Engineering 45(1), 017201 (1 January 2006). https://doi.org/10.1117/1.2151127
Published: 1 January 2006
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fuzzy logic

Data modeling

Optical engineering

Data centers

Binary data

Detection and tracking algorithms

Distance measurement

RELATED CONTENT

Text line extraction in free style document
Proceedings of SPIE (January 19 2009)
Evaluation of decision forests on text categorization
Proceedings of SPIE (December 22 1999)

Back to Top