Abstract
This paper presents a first step in analyzing how digital shapes behave with respect to multiresolution. We first present an analysis of the covering of a standard digital straight line by a multi-resolution grid. We then study the multi-resolution of Digital Straight Segments (DSS): we provide a sublinear algorithm computing the exact characteristics of a DSS whenever it is a subset of a known standard line. We finally deduce an algorithm for computing a multiscale representation of a digital shape, based only on a DSS decomposition of its boundary.
Part of this work was funded by ANR project GeoDIB (ANR-06-BLAN-0225-03).
Chapter PDF
Similar content being viewed by others
Keywords
References
Coeurjolly, D., Grard, Y., Reveills, J.-P., Tougne, L.: An elementary algorithm for digital arc segmentation. Discrete Applied Mathematics 139, 31–50 (2004)
de Vieilleville, F., Lachaud, J.-O.: Revisiting digital straight segment recognition. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 355–366. Springer, Heidelberg (2006)
Debled-Rennesson, I.: Etude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur, Strasbourg (1995)
Debled-Rennesson, I., Reveillès, J.-P.: A linear algorithm for segmentation of discrete curves. International Journal of Pattern Recognition and Artificial Intelligence 9, 635–662 (1995)
Dorst, L., Smeulders, A.W.M.: Discrete representation of straight lines. IEEE transactions Pattern Analysis Machine Intelligence 6, 450–463 (1984)
Feschet, F.: Canonical representations of discrete curves. Pattern Anal. Appl. 8(1-2), 84–94 (2005)
Feschet, F., Tougne, L.: Optimal time computation of the tangent of a discrete curve: Application to the curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 31–40. Springer, Heidelberg (1999)
Figueiredo, O.: Advances in discrete geometry applied to the extraction of planes and surfaces from 3D volumes. PhD thesis, EPFL, Lausanne (1994)
Hardy, G.H., Wright, E.M.: An introduction to the Theory of Numbers. Oxford Society (1989)
Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Koenderink, J.J.: The structure of images. Biol. Cyb. 50, 363–370 (1984)
Lachaud, J.-O., Vialard, A., de Vieilleville, F.: Fast, accurate and convergent tangent estimation on digital contours. Image Vision Comput. 25(10), 1572–1587 (2007)
Lindeberg, T.: Discrete derivative approximations with scale-space properties: A basis for low-level features extraction. Journal of Mathematical Imaging and Vision 3(4), 349–376 (1993)
Vacavant, A., Coeurjolly, D., Tougne, L.: Dynamic reconstruction of complex planar objects on irregular isothetic grids. In: Bebis, G., Boyle, R., Parvin, B., Koracin, D., Remagnino, P., Nefian, A., Meenakshisundaram, G., Pascucci, V., Zara, J., Molineros, J., Theisel, H., Malzbender, T. (eds.) ISVC 2006. LNCS, vol. 4292, pp. 205–214. Springer, Heidelberg (2006)
Witkin, A.P.: Scale-space filtering. In: Proc. 8th Int. Joint Conf. Art. Intell., Larlsruhe, Germany, pp. 1019–1022 (1983)
Yaacoub, J.: Enveloppes convexes de réseaux et applications au traitement d’images. PhD thesis, Université Louis Pasteur, Strasbourg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Said, M., Lachaud, JO., Feschet, F. (2009). Multiscale Discrete Geometry. In: Brlek, S., Reutenauer, C., Provençal, X. (eds) Discrete Geometry for Computer Imagery. DGCI 2009. Lecture Notes in Computer Science, vol 5810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04397-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-04397-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04396-3
Online ISBN: 978-3-642-04397-0
eBook Packages: Computer ScienceComputer Science (R0)