Abstract
In this paper, we present different recent segmentation works based on discrete maps. Discrete maps provide an efficient framework for region based segmentation methods. A discrete map is a mixed model combining an encoding of the discrete boundaries of the image regions with topological graphs which represent the topology of the image.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beveridge, J. R., Griffith, J., Kohler, R., Hanson, A. R., Riseman, E. M.: Segmenting images using localized histograms and region merging. Int. J. Comput Vision 2, 311–347 (1989).
Braquelaire, J. P., Domenger, J. P.: Representation of region segmented images with discrete maps. Technical report, RR-112797 LaBRI, available on http://www.labri.u-bordeaux.fr/LaBRI/Publications/index.html, June 1996.
Brice, R., Fennema, C. L.: Scene analysis using regions. Art. Intell. 1, 205–226 (1970).
Browning, J. D.: Segmentation of pictures into regions with tile-by-tile method. Pattern Rec. 15, 1–10 (1982).
Brun, L., Domenger, J. P.: Incremental modifications on segmented image defined by discrete maps. Technical report, RR-112696 LaBRI, available on http://www.labri.u-bordeaux.fr/LaBRI/Publications/index.html, may 1996.
Brun, L., Domenger, J. Ph.: A new split and merge algorithm with topological maps and interpixel boundaries. In: Proc. WSCG ‘97 1, 21–30 (1997).
Celenk, M.: A color clustering technique for image segmentation. Comput. Vision Gaphics Image Proc. 52, 145–170 (1990).
Cheevasuvut, F., Maitre, H., Vidal-Madjar, D.: A robust method for picture segmentation based on a split and merge procedure. Comput. Vision Graphics Image Proc. 34, 268–281 (1986).
Dyer, R. C., Rosenfeld, A., Hanan, S.: Region representation: Boundary codes from quadtrees. ACM: Graphics Image Proc. 23, 171–179 (1980).
Fiorio, C., Gustedt, J.: Two linear time union-find strategies for image processing. Technical Report 375/1994, Technische Universitat Berlin, 1994.
Horowitz, S. L., Pavlidis, T.: Picture segmentation by a tree traversal algorithm. J. Assoc. Comput. Mach. 23, 368–388 (1976).
Jolion, J. M., Montanvert, A.: The adaptative pyramid: A framework for 2d image analysis. Comput. Vision Graphics Image Proc. 55, 339–348 (1992).
Khalimsky, E., Kopperman, R., Meyer, P. R.: Boundaries in digital planes. J. Appl. Math. Stoch. Anal. 3, 27–55 (1990).
Nicol, C. J.: A systolic approach for real time connected component labeling. Comput. Vision Image Underst. 61, 17–31 (1995).
Ohlander, R., Price, K., Reddy, D. R.: Picture segmentation using a recursive region splitting method. Comput. Graphics Image Proc. 8, 313–333 (1978).
Pietikainen, M., Rosenfeld, A., Walter, I.: Split and link algorithms for image segmentation. Pattern Rec. 15, 287–298 (1982).
Samet, H.: Region representation: Quadtrees from boundary codes. ACM Graph Image Proc. 23, 163–170 (1980).
Tutte, W. T.: A census of planar maps. Can. J. Math. 15, 249–271 (1963).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Brun, L., Domenger, J., Braquelaire, J. (1998). Discrete Maps: a Framework for Region Segmentation Algorithms. In: Jolion, JM., Kropatsch, W.G. (eds) Graph Based Representations in Pattern Recognition. Computing Supplement, vol 12. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6487-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6487-7_9
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83121-2
Online ISBN: 978-3-7091-6487-7
eBook Packages: Springer Book Archive