Handwritten chinese text line segmentation by clustering with distance metric learning
From MaRDI portal
Publication:733043
DOI10.1016/j.patcog.2008.12.013zbMath1186.68428OpenAlexW2090914336MaRDI QIDQ733043
Publication date: 15 October 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.12.013
clusteringminimal spanning treedistance metric learninghandwritten text line segmentationhypervolume reduction
Cites Work
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
- Text line extraction from multi-skewed handwritten documents
- Optimal matching problem in detection and recognition performance evaluation
- Semidefinite Programming
- A Simplex Method for Function Minimization
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Unnamed Item
This page was built for publication: Handwritten chinese text line segmentation by clustering with distance metric learning