Stochastic Relaxation on Partitions With Connected Components and Its Application to Image Segmentation

@article{Wang1998StochasticRO,
  title={Stochastic Relaxation on Partitions With Connected Components and Its Application to Image Segmentation},
  author={Jia-Ping Wang},
  journal={IEEE Trans. Pattern Anal. Mach. Intell.},
  year={1998},
  volume={20},
  pages={619-636}
}
  • Jia-Ping Wang
  • Published 1 June 1998
  • Mathematics, Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
We present a new method of segmentation in which images are segmented in partitions with connected components. We give computationally inexpensive algorithms for probability simulation and simulated annealing on the space of partitions with connected components of a general graph. In particular, Hastings algorithms (1970) and generalized Metropolis algorithms are defined to avoid heavy computation. To achieve segmentation, we propose a hierarchical approach which at each step minimizes a cost… 

Image Segmentation via Energy Minimization on Partitions with Connected Components

A hierarchical approach which at each step, minimizes a cost function on the space of partitions with connected components of a graph is proposed to realize segmentation.

Colour image segmentation solving hard-constraints on graph partitioning greedy algorithms

This algorithm avoids the hard-constraints of others similar approaches such as the impossibility for some regions to grow after certain step of the algorithm and the uniqueness of the solution, and allows attaining global results by local approximations using a generalised concept of not over-segmentation.

Cellular learning automata-based color image segmentation using adaptive chains

Experimental results show the effectiveness of the proposed segmentation method, which is based on CLA and can adapt to its environment after some iterations and leads to a semi content-based segmentation process that performs well even in presence of noise.

Color image segmentation based on edge-preservation smoothing and soft C-means clustering

A new approach to color image segmentation is demonstrated here, where the three components are smoothed using a variation-based approach and the soft C-means clustering algorithm is employed to segment them after smoothing.

Unsupervised image segmentation using local homogeneity analysis

A criterion for homogeneity of a certain pattern is proposed, and a region growing method is used to segment the image based on the H-image, and visually similar regions are merged together to avoid over-segmentation.

Multiresolution image segmentation integrating Gibbs sampler and region merging algorithm

An Image Segmentation Method Based on Adaptive AnisotropicDiffusion Filtering

  • Yongxin YuZhiyong Feng
  • Computer Science
    Second International Multi-Symposiums on Computer and Computational Sciences (IMSCCS 2007)
  • 2007
An adaptive-anisotropic-diffusion filtering method, with an adaptive parameter K for coarseness, is used to filter images, and experiments show that such method is a good approach for image segmentation.

An Image Segmentation Method Based on Adaptive Anisotropic Diffusion Filtering

An adaptive-anisotropic-diffusion filtering method, with an adaptive parameter K for coarseness, is used to filter images, and experiments show that such method is a good approach for image segmentation.

Image Segmentation by Data-Driven Markov Chain Monte Carlo

The DDMCMC paradigm provides a unifying framework in which the role of many existing segmentation algorithms are revealed as either realizing Markov chain dynamics or computing importance proposal probabilities and generalizes these segmentation methods in a principled way.

A Region-Level Motion-Based Graph Representation and Labelling for Tracking a Spatial Image Partition

This paper addresses the problem of tracking an image partition along a sequence in which the regions composing such a partition display texture homogeneity properties, and presents a general-purpose methodology involving a region-level motion-based graph representation of the partition.
...

References

SHOWING 1-10 OF 39 REFERENCES

A multiscale algorithm for image segmentation by variational method

The authors prove that the most simple segmentation tool, the “region merging” algorithm, is enough to compute a local energy minimum belonging to a compact class and to achieve the job of most of the tools mentioned above.

Studies in Global and Local Histogram-Guided Relaxation Algorithms

An image segmentation algorithm based on histogram clustering and probabilistic relaxation labeling is explored and a potential solution is shown to be obtainable by using orientation dependent compatibility coefficients and localizing the scope of the algorithm to small subimages followed by a merging of the segmented subimages.

Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields

  • H. DerinH. Elliott
  • Computer Science
    IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1987
This paper presents random field models for noisy and textured image data based upon a hierarchy of Gibbs distributions, and presents dynamic programming based segmentation algorithms for chaotic images, considering a statistical maximum a posteriori (MAP) criterion.

Unsupervised segmentation of noisy and textured images using Markov random fields

  • C. WonH. Derin
  • Computer Science
    CVGIP Graph. Model. Image Process.
  • 1992

Multiple Resolution Segmentation of Textured Images

A multiple resolution algorithm is presented for segmenting images into regions with differing statistical behavior. In addition, an algorithm is developed for determining the number of statistically

Unsupervised Texture Segmentation Using Markov Random Field Models

The results of the adaptive segmentation algorithm of Lakshamanan and Derin are compared with a simple nearest-neighbor classification scheme to show that if enough information is available, simple techniques could be used as alternatives to computationally expensive schemes.

Simultaneous Parameter Estimation and Segmentation of Gibbs Random Fields Using Simulated Annealing

It is proven that the parameter estimates and the segmentations converge in distribution to the ML estimate of the parameters and the MAP segmentation with those parameter estimates, respectively.

Gibbs Random Fields, Fuzzy Clustering, and the Unsupervised Segmentation of Textured Images

An unsupervised segmentation strategy for textured images, based on a hierarchical model in terms of discrete Markov Random Fields, where the textures are modeled as Gaussian Gibbs Fields, while the image partition is modeled as a Markov Mesh Random Field.

Texture segmentation based on a hierarchical Markov random field model

  • R. HuM. Fahmy
  • Computer Science, Mathematics
    1991., IEEE International Sympoisum on Circuits and Systems
  • 1991
A novel texture segmentation technique for both supervised and unsupervised segmentation is presented, which can reach the global maxima of the posteriori distribution even if the textures are modeled by an MRF model.