Serialized k-means for adaptative color image segmentation : application to document images and others

Abstract : This paper introduces an adaptative segmentation system that was designed for color document image analysis. The method is based on the serialization of a k-means algorithm that is applied sequentially by using a sliding window over the image. During the window’s displacement, the algorithm reuses information from the clusters computed in the previous window and automatically adjusts them in order to adapt the classifier to any new local variation of the colors. To improve the results, we propose to define several different clusters in the color feature space for each logical class. We also reintroduce the user into the initialization step to define the number of classes and the different samples for each class. This method has been tested successfully on ancient color manuscripts, video images and multiple natural and non-natural images having heavy defects and showing illumination variation and transparency. The proposed algorithm is generic enough to be applied on a large variety of images for different purposes such as color image segmentation as well as binarization.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01592812
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Monday, September 25, 2017 - 2:23:20 PM
Last modification on : Wednesday, October 31, 2018 - 12:24:07 PM

Links full text

Identifiers

Citation

Yann Leydier, Frank Le Bourgeois, Hubert Emptoz. Serialized k-means for adaptative color image segmentation : application to document images and others. 6th International Workshop on Documents Analysis Systems, DAS2004, Sep 2004, Florence, Italy. pp.252-263, ⟨10.1007/978-3-540-28640-0_24⟩. ⟨hal-01592812⟩

Share

Metrics

Record views

150