Affine plane curve evolution: a fully consistent scheme

  title={Affine plane curve evolution: a fully consistent scheme},
  author={Lionel Moisan},
  journal={IEEE transactions on image processing : a publication of the IEEE Signal Processing Society},
  volume={7 3},
  • L. Moisan
  • Published 1 March 1998
  • Mathematics
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
We present an accurate numerical scheme for the affine plane curve evolution and its morphological extension to grey-level images. This scheme is based on the iteration of a nonlocal, fully affine invariant and numerically stable operator, which can be exactly computed on polygons. The properties of this operator ensure that a few iterations are sufficient to achieve a very good accuracy, unlike classical finite difference schemes that generally require a lot of iterations. Convergence results… 

Figures from this paper

Numerical methods for motion of level sets by affine curvature

We study numerical methods for the nonlinear partial differential equation that governs the motion of level sets by affine curvature. We show that standard finite difference schemes are nonlinearly


The affine morphological scale space (AMSS), a nonlinear diffusion equation, is uniquely characterized by a set of desirable axioms suggested for multiscale smoothing of images. Its numerical

A Proof of Equivalence between Level Lines Shortening and Curvature Motion in Image Processing

In this paper we define the continuous Level Lines Shortening evolution of a two-dimensional image as the curve shortening operator acting simultaneously and independently on all the level lines of

Geometric Computation of Curvature Driven Plane Curve Evolutions

No special parameterization is needed and the scheme is monotone (that is, if a curve initially surrounds another one, then this remains true during their evolution, which guarantees numerical stability), which proves consistency and convergence of this scheme in a weak sense.

Affine Invariant Distance Using Multiscale Analysis

This paper introduces an affine invariant distance definition from a $$2D$$2D point to the boundary of a bounded shape using morphological multiscale analysis and proves that the proposed distance is bounded in the convex hull of the shape and infinite otherwise.

Morphological Scale Space and Mathematical Morphology

  • F. Cao
  • Mathematics
  • 1999
It is proved that all iterated affine and contrast invariant monotone operators are equivalent to the unique affine invariant curvature motion.

A Fast Marching Method for the Area Based Affine Distance

The proposed algorithm has a lower computational complexity than the direct method and its convergence is proved, which offers a dynamic point of view for the area based affine distance.

Geometric curve evolution and image processing

  • F. Cao
  • Computer Science
    Lecture notes in mathematics
  • 2003
The curve smoothing problem: theoretical curve evolution and image processing and classical numerical methods for curve evolution.



On affine plane curve evolution

Abstract An affine invariant curve evolution process is presented in this work. The evolution studied is the affine analogue of the Euclidean Curve Shortening flow. Evolution equations, for both

Formalization and computational aspects of image analysis

A unified and axiomatized view of several theories and algorithms of image multiscale analysis (and low level vision) which have been developed in the past twenty years is presented and it is shown that under reasonable invariance and assumptions, all image analyses can be reduced to a single partial differential equation.

Curvature and the evolution of fronts

The evolution of a front propagating along its normal vector field with speedF dependent on curvatureK is considered. The change in total variation of the propagating front is shown to depend only

Axioms and fundamental equations of image processing

Image-processing transforms must satisfy a list of formal requirements. We discuss these requirements and classify them into three categories: “architectural requirements” like locality, recursivity

A Simple Proof of Convergence for an Approximation Scheme for Computing Motions by Mean Curvature

It is proved that the convergence of an approximation scheme recently proposed by Bence, Merriman, and Osher for computing motions of hypersurfaces by mean curvature is convergence.

User’s guide to viscosity solutions of second order partial differential equations

The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence

The heat equation shrinks embedded plane curves to round points

Soit C(•,0):S 1 →R 2 une courbe lisse plongee dans le plan. Alors C:S 1 ×[0,T)→R 2 existe en satisfaisant δC/δt=K•N, ou K est la courbure de C, et N est son vecteur unite normal entrant. C(•,t) est

The heat equation shrinking convex plane curves

Soient M et M' des varietes de Riemann et F:M→M' une application reguliere. Si M est une courbe convexe plongee dans le plan R 2 , l'equation de la chaleur contracte M a un point

Traitement numérique d'images et de films : équations aux dérivées partielles préservant forme et relief

La reconnaissance de formes planes partiellement masquees ne peut se faire que localement en calculant des points caracteristiques (extrema de courbure, points d'inflexions,), et ce calcul requiert