Abstract
Inter-pixel boundaries provide a robust and consistent description of segmented images but have a poor visual aspect, especially when being enlarged. Approximation curve are sometimes used to smooth discrete boundaries but they do not provide error free reconstruction and may be uneasy to use in this context. In this paper we show the advantages of using Euclidean paths in order to smooth inter-pixel boundaries and we demonstrate the interest of inter-pixel Euclidean paths for the purpose of image segmentation and analysis.
This work is granted by the Région Aquitaine and the C.N.R.S.
Chapter PDF
References
E. Ahronovitz, J.P Aubert, and C. Fiorio. The star-topology: a topology for image analysis. In In 5th Discrete Geometry for Computer Imagery, Proceedings, pages 107–116, September 1995.
Jean-Pierre Braquelaire and Luc Brun. Image segmentation with topological maps and inter-pixel representation. Technical report, LaBRI, Université Bordeaux I, 1996. submited.
Jean-Pierre Braquelaire and Jean-Philippe Domenger. Intersection of discrete contours. In Proc. of Compugraphics'91, pages 14–23, 1991.
Jean-Pierre Braquelaire and Jean-Philippe Domenger. Representation of segmented images with discrete maps. Technical report, LaBRI, Université Bordeaux I, 1996. submited.
Luc Brun and Jean-Philippe Domenger. Segmentation. Technical report, LaBRI, Université Bordeaux I, 1996. submited.
C.R. Brice and C.L. Fennema. Scene analysis using regions. Artificial intelligence, 1:205–226, 1970.
H. Bieri. Hyperimages — an alternative to the conventional digital images. In Eurographics'90 proceedings, pages 341–352, 1990.
Jean-Pierre Braquelaire and Anne Vialard. Euclidean paths: a new representation of boundaries of discrete regions. Technical Report 1088-95, LaBRI, Université Bordeaux I, 1995. submited.
Long-Wen Chang and Kuen-Long Leu. A fast algorithm for the restoration of images based on chain codes descriptions and its applications. Computer Vision, Graphics, and Image Processing, 50:296–307, 1990.
Robert Cori. Un code pour les graphes planaires et ses applications. Thèse d'état de l'université Paris VII, and Astŕisque 27, 1973 and 1975.
Jean-Philippe Domenger. Conception et implementation du noyau graphique d'un environnement 2D 1/2 d'édition d'images discrètes. PhD thesis, Univ. Bordeaux I, avril 1992.
I. Debled and J.P. Reveilles. Un algorithme linéaire de polygonalisation des courbes discrètes. In Collogue Géométrie discrète en imagerie, pages 243–253, Grenoble, 1992.
Christophe Fiorio. Approche interpixel en analyse d'images: une topologie et des algorithmes de segmentation. Thèse de doctorat, Université Montpellier II, 24 novembre 1995.
Jean Françon. Topologie de khalimsky et kovalevsky et algorithmes graphiques. In First Colloquium on Discrete Geometry in Computer Imagery, Strasbourg, September 1991.
Jean Françon. Topologie de khalimski-kovalevsky et algorithmique graphique. TSI, 14(10):119–121, 1995.
H. Freeman. On the encoding of arbitrary geometric configurations. IRE Trans., EC-10(2):260–268, 1961.
H. Freeman. Computer processing of line drawing images. ACM Comput. Surveys, 6(1):57–98, 1974.
M. Gangnet and J.M. Van Thong. Robust boolean operations on 2d paths. In Proc. of COMPUGRAPHICS'91, pages 434–444, 1991, 1991.
E. Khalimsky, R. Kopperman, and P.R. Meyer. Boundaries in digital planes. Journal of applied Math. and Stocastic Analysis, 3:27–55, 1990.
E. Khalimsky, R. Kopperman, and P.R. Meyer. Computer graphics and connected topologies on finite ordered sets. Topology and its Applications, 36:1–17, 1990.
V.A. Kovalevsky. Finite topology as applied to image analysis. Computer Vision, Graphics, and Image Processing, 46:141–161, 1989.
T.Y. Kong and A. Rosenfeld. Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing, 48:357–393, 1989.
R.D. Merrill. Representation of contours and regions for efficient computer search. Communications of the ACM, 16(2):69–82, 1973.
P. Morse. Concepts of use in contour map processing. Communications of the ACM, 12(3):147–152, 1969.
T. Pavlidis. Algorithms for Graphics and Image Processing. Computer Sci., Washington, 1982.
J.P. Reveilles. Géométrie discrète, Calcul en nombres entiers et algorithmique. PhD thesis, Université Louis Pasteur, Strasbourg, 1991.
A. Rosenfeld and A.C. Kak. Digital Picture Processing, volume 2. Academic Press, 1982.
Anne Vialard. Geometrical parameters extraction from discrete paths. Technical report, LaBRI, Université Bordeaux I, 1996. submited.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braquelaire, JP., Brun, L., Vialard, A. (1996). Inter-pixel Euclidean paths for image analysis. In: Miguet, S., Montanvert, A., Ubéda, S. (eds) Discrete Geometry for Computer Imagery. DGCI 1996. Lecture Notes in Computer Science, vol 1176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62005-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-62005-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62005-1
Online ISBN: 978-3-540-49595-6
eBook Packages: Springer Book Archive