Regularized data fusion improves image segmentation

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The ability of a segmentation algorithm to uncover an interesting partition of an image critically depends on its capability to utilize and combine all available, relevant information. This paper investigates a method to automatically weigh different data sources, such that a meaningful segmentation is uncovered. Different sources of information naturally arise in image segmentation, e.g. as intensity measurements, local texture information or edge maps. The data fusion is controlled by a regularization mechanism, favoring sparse solutions. Regularization parameters as well as the clustering complexity are determined by the concept of cluster stability yielding maximally reproducible segmentations. Experiments on the Berkeley segmentation database show that our segmentation approach outperforms competing segmentation algorithms and performs comparably to supervised boundary detectors. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Lange, T., & Buhmann, J. (2007). Regularized data fusion improves image segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4713 LNCS, pp. 234–243). Springer Verlag. https://doi.org/10.1007/978-3-540-74936-3_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free