Fast k-means image quantization algorithm and its application to iris segmentation

MaRDI QIDQ3170511zbMATH OpenFDO

Authors Nicolaie Popescu-Bodorin

Publication date 27 September 2011

zbMATH Keywords

\(k\)-means\(k\)-means clustering\(k\)-means quantization\(k\)-median filterchromatic clusteringdownsamplingequipotential chromatic mapfast \(k\)-means image quantization algorithmimage quantizationiris segmentationoptimal \(k\)-means downsampling

Mathematics Subject Classification ID

Image analysis in multivariate analysis (62H35) Applications of statistics in engineering and industry; control charts (62P30) Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10)

Recommendations

• A fast algorithm for image vector quantization
• Image segmentation by fissive K-mean clustering method
• A \(K\)-means color image quantization method based on particle swarm optimization
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
• An improved \(K\)-means clustering algorithm for fish image segmentation

Cited in

(1)

• A fast pixel mapping algorithm using principal component analysis

This page was built for publication: Fast \(k\)-means image quantization algorithm and its application to iris segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170511)