Combinatorial maps for 2D and 3D image segmentation

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

Abstract

This chapter shows how combinatorial maps can be used for 2D or 3D image segmentation. We start by introducing combinatorial maps and we show how they can be used to describe image partitions. Then, we present a generic segmentation algorithm that uses and modifies the image partition represented by a combinatorial map. One advantage of this algorithm is that one can mix different criteria and use different image features which can be associated with the cells of the partition. In particular, it is interesting that the topological properties of the image partition can be controlled through this approach. This property is illustrated by the computation of classical topological invariants, known as Betti numbers, which are then used to control the number of cavities or the number of tunnels of regions in the image partition. Finally, we present some experimental results of 2D and 3D image segmentation using different criteria detailed in this chapter.

Author supplied keywords

Cite

CITATION STYLE

APA

Damiand, G., & Dupas, A. (2012). Combinatorial maps for 2D and 3D image segmentation. In Lecture Notes in Computational Vision and Biomechanics (Vol. 2, pp. 359–393). Springer Netherlands. https://doi.org/10.1007/978-94-007-4174-4_12

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