Conference Paper

Fast segmentation based on a hybrid of clustering and morphological approaches

Fac. of Electron. & Telecommun., Hanoi Univ. of Technol., Hanoi
DOI: 10.1109/CCE.2008.4578952 Conference: Communications and Electronics, 2008. ICCE 2008. Second International Conference on
Source: IEEE Xplore

ABSTRACT This paper proposes a fast segmentation method for still image based on a hybrid of clustering and morphological segmentation approach. The objective of the clustering is to partition an input image into a number of clusters such that the gray levels within each cluster are similar. The clustered image is further processed by using morphological segmentation approach, in which a seeded region growing however plays a role of the decision tool instead of a watershed algorithm for a remarkable improvement of processing time. The performance of the proposed method is evaluated by comparing its region-based coding results with those of the morphological watershed-based segmentation method and the split-and-merge algorithm. The experiments results showed that region-based coding using the proposed algorithm yields PSNR improvement of about 1.5 dB over the morphological watershed-based method. Especially, the total time elapsed to segment an image using the proposed method is reduced about 1/6 and 1/3 compared with those of the watershed-based segmentation and the split-and-merge methods, respectively.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A fast and flexible algorithm for computing watersheds in digital gray-scale images is introduced. A review of watersheds and related motion is first presented, and the major methods to determine watersheds are discussed. The algorithm is based on an immersion process analogy, in which the flooding of the water in the picture is efficiently simulated using of queue of pixel. It is described in detail provided in a pseudo C language. The accuracy of this algorithm is proven to be superior to that of the existing implementations, and it is shown that its adaptation to any kind of digital grid and its generalization to n -dimensional images (and even to graphs) are straightforward. The algorithm is reported to be faster than any other watershed algorithm. Applications of this algorithm with regard to picture segmentation are presented for magnetic resonance (MR) imagery and for digital elevation models. An example of 3-D watershed is also provided
    IEEE Transactions on Pattern Analysis and Machine Intelligence 07/1991; 13(6):583-598. · 4.80 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the past, picture segmentation has been performed by merging small primitive regions or by recursively splitting the whole picture. This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements. The data structure is described in detail and examples of implementations are given.
    Journal of the ACM 01/1976; 23:368-388. · 2.37 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The generalized Lloyd algorithm plays an important role in the design of vector quantizers (VQ) and in feature clustering for pattern recognition. In the VQ context, this algorithm provides a procedure to iteratively improve a codebook and results in a local minimum that minimizes the average distortion function. We propose an efficient method to obtain a good initial codebook that can accelerate the convergence of the generalized Lloyd algorithm and achieve a better local minimum as well.< >
    IEEE Signal Processing Letters 11/1994; · 1.67 Impact Factor