Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 8 (1998), S. 27-40 
    ISSN: 1573-7683
    Keywords: discrete iterative processes ; discrete deformation of sets ; contour evolution ; discrete active models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Following the study of migration processes in the continuous domain in Part I of this paper, we reformulate the concept of migration in the discrete domain (Zm) and define Discrete Migration Processes (DMP). We demonstrate that this model is a natural discrete representation of the continuous model and maintains the model's features in a qualitative sense. We show that under discrete migration any discrete set shrinks to a limit in finitely many iterations. The discrete representation provides an advantageous basis for digitally implementing the MP model. Using this implementation we illustrate the discrete migration of various types of sets under various types of constraints.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 8 (1998), S. 5-25 
    ISSN: 1573-7683
    Keywords: iterative processes ; discrete deformation of sets ; contour evolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper the general concept of a migration process (MP) is introduced; it involves iterative displacement of each point in a set as function of a neighborhood of the point, and is applicable to arbitrary sets with arbitrary topologies. After a brief analysis of this relatively general class of iterative processes and of constraints on such processes, we restrict our attention to processes in which each point in a set is iteratively displaced to the average (centroid) of its equigeodesic neighborhood. We show that MPs of this special class can be approximated by “reaction-diffusion”-type PDEs, which have received extensive attention recently in the contour evolution literature. Although we show that MPs constitute a special class of these evolution models, our analysis of migrating sets does not require the machinery of differential geometry. In Part I of the paper we characterize the migration of closed curves and extend our analysis to arbitrary connected sets in the continuous domain (Rm) using the frequency analysis of closed polygons, which has been rediscovered recently in the literature. We show that migrating sets shrink, and also derive other geometric properties of MPs. In Part II we will reformulate the concept of migration in a discrete representation (Zm).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    International journal of computer vision 31 (1999), S. 83-98 
    ISSN: 1573-1405
    Keywords: time to collision ; rate of approach ; Green's theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The rate of approach (ROA) of a moving observer toward a scene point, as estimated at a given instant, is proportional to the component of the observer's instantaneous velocity in the direction of the point. In this paper we analyze the applicability of Green's theorem to ROA estimation. We derive a formula which relates three quantities: the average value of the ROA for a surface patch in the scene; a surface integral that depends on the surface slant of the patch; and the contour integral of the normal motion field around the image of the boundary of the patch. We analyze how much larger the ROA on the surface patch can be than the value of the contour integral, for given assumptions about the variability of the distance to points on the surface patch. We illustrate our analysis quantitatively using synthetic data, and we also validate it qualitatively on real image sequences.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...