Migration Processes I: The Continuous Case

  • Authors:
  • Sándor Fejes;Azriel Rosenfeld

  • Affiliations:
  • Computer Vision Laboratory, Center for Automation Research, University of Maryland, College Park, MD 20742-3275. E-mail: fejes@cfar.umd.edu, ar@cfar.umd.edu;Computer Vision Laboratory, Center for Automation Research, University of Maryland, College Park, MD 20742-3275. E-mail: fejes@cfar.umd.edu, ar@cfar.umd.edu

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper the general concept of a migration process (MP) isintroduced; it involves iterative displacement of each point in a set asfunction of a neighborhood of the point, and is applicable to arbitrary setswith arbitrary topologies. After a brief analysis of this relatively generalclass of iterative processes and of constraints on such processes, werestrict our attention to processes in which each point in a set isiteratively displaced to the average (centroid) of its equigeodesicneighborhood. We show that MPs of this special class can be approximated by “reaction-diffusion”-type PDEs, which have received extensiveattention recently in the contour evolution literature. Although we showthat MPs constitute a special class of these evolution models, our analysisof migrating sets does not require the machinery of differential geometry.In Part I of the paper we characterize the migration of closed curves andextend our analysis to arbitrary connected sets in the continuous domain (R^m) using the frequency analysis of closed polygons,which has been rediscovered recently in the literature. We show thatmigrating sets shrink, and also derive other geometric properties of MPs. InPart II we will reformulate the concept of migration in a discreterepresentation (Z^m).