Continuity of discrete curve evolution

Longin Jan Latecki; R. R. Ghadially; Rolf Lakaemper; Ulrich Eckhardt

doi:10.1117/1.482748

1 July 2000 Continuity of discrete curve evolution

Longin Jan Latecki, R. R. Ghadially, Rolf Lakaemper, Ulrich Eckhardt

Journal of Electronic Imaging, Vol. 9, Issue 3, (July 2000). https://doi.org/10.1117/1.482748

Recently Latecki and Lakämper [Computer Vision and Image Understanding 73(3) (1999)] reported a process called discrete curve evolution. This process has various application possibilities, in particular, for noise removal and shape simplification of boundary curves in digital images. In this paper we prove that the process of the discrete curve evolution is continuous: if polygon Q is close to polygon P, then the polygons obtained by their evolution remain close. This result follows directly from the fact that the evolution of Q corresponds to the evolution of P if Q approximates P. This intuitively implies that first all vertices of Q are deleted that are not close to any vertex of P, and then, whenever a vertex of P is deleted, then a vertex of Q that is close to it is deleted in the corresponding evolution step of Q.

Citation Download Citation

Longin Jan Latecki, R. R. Ghadially, Rolf Lakaemper, and Ulrich Eckhardt "Continuity of discrete curve evolution," Journal of Electronic Imaging 9(3), (1 July 2000). https://doi.org/10.1117/1.482748

Published: 1 July 2000

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available