A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Stochastic relaxation on partitions with connected components and its application to image segmentation
1998
IEEE Transactions on Pattern Analysis and Machine Intelligence
We present a new method of segmentation in which images are segmented by partitions with connected components. For this, rst we de ne two di erent types of neighborhoods on the space of partitions with connected components of a general graph; neighborhoods of the rst type are simple but small, while those of the second type are large but complex; second, we give algorithms which are not computationally costly, for probability simulation and simulated annealing on such spaces using the
doi:10.1109/34.683775
fatcat:mgaalm55mng5rpqy7yvxmnv46e