Migration processes

Optimization processes based on "active models" play central roles in many areas of computational vision as well as computational geometry. However, current models usually require highly complex and sophisticated mathematical machinery and at the same time they also suffer from a number of limitations which impose restrictions on their applicability. In this paper a simple class of discrete active models, called migration processes, is presented. The processes are based on iterated averaging over neighborhoods defined by constant geodesic distance. It is demonstrated that the migration process model combines a number of advantages of different active models. The processes can be applied to derive natural solutions to a variety of optimization problems which include: defining (minimal) surface patches given their boundary curves; finding shortest paths joining set of points; and decomposing objects into "primitive" parts.

[1]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

[2]  Farzin Mokhtarian,et al.  A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Tommaso Toffoli,et al.  Cellular Automata Machines , 1987, Complex Syst..

[4]  C. L. Chiang,et al.  On a solution of the migration process and the application to a problem in epidemiology , 1973, Journal of Applied Probability.

[5]  Benjamin B. Kimia,et al.  Three-dimensional shape representation from curvature dependent surface evolution , 1994, Proceedings of 1st International Conference on Image Processing.

[6]  Alfred M. Bruckstein,et al.  Finding Shortest Paths on Surfaces Using Level Sets Propagation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  S. Angenent.  Parabolic equations for curves on surfaces Part II. Intersections, blow-up and generalized solutions , 1991 .

[8]  C. L. Chiang,et al.  A survival model and estimation of time to tumor. , 1989, Mathematical biosciences.

[9]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[10]  Azriel Rosenfeld,et al.  'Continuous' functions on digital pictures , 1986, Pattern Recognit. Lett..

[11]  John Oliensis.  Local Reproducible Smoothing Without Shrinkage , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Jan J. Koenderink,et al.  Solid shape , 1990 .

[13]  Azriel Rosenfeld,et al.  Discrete active models in vision geometry , 1996, Optics & Photonics.

[14]  P. Lions,et al.  Axioms and fundamental equations of image processing , 1993 .

[15]  Guillermo Sapiro,et al.  Area and Length Preserving Geometric Invariant Scale-Spaces , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Behrooz Kamgar-Parsi,et al.  Quantization error in spatial sampling: comparison between square and hexagonal pixels , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  G. Huisken.  Flow by mean curvature of convex surfaces into spheres , 1984 .

[18]  Benjamin B. Kimia,et al.  On the evolution of curves via a function of curvature , 1992 .

[19]  Sally McClean,et al.  A continuous-time population model with poisson recruitment , 1976, Journal of Applied Probability.

[20]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[21]  James H. Matis,et al.  On the time-dependent reversible stochastic compartmental model—II. A class of n-compartment systems , 1975 .

[22]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[23]  M. J. Maron,et al.  Numerical Analysis: A Practical Approach , 1982 .

[24]  M. Gage,et al.  The heat equation shrinking convex plane curves , 1986 .

[25]  Richard Szeliski,et al.  Modeling surfaces of arbitrary topology with dynamic particles , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[26]  Farzin Mokhtarian,et al.  Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Gabriel Taubin,et al.  Curve and surface smoothing without shrinkage , 1995, Proceedings of IEEE International Conference on Computer Vision.

[28]  S. Zucker,et al.  Toward a computational theory of shape: an overview , 1990, eccv 1990.

[29]  A. Pentland.  Recognition by Parts , 1987 .

[30]  Gábor Székely,et al.  Estimating shortest paths and minimal distances on digitized three-dimensional surfaces , 1993, Pattern Recognit..

[31]  M. J. Faddy,et al.  Stochastic compartmental models as approximations to more general stochastic systems with the general stochastic epidemic as an example , 1977, Advances in Applied Probability.

[32]  Scott F. Thompson.  Growth models for shapes , 1994 .

[33]  Gabriel Taubin,et al.  Estimating the tensor of curvature of a surface from a polyhedral approximation , 1995, Proceedings of IEEE International Conference on Computer Vision.

[34]  P. Woodward,et al.  SLIC (Simple Line Interface Calculation) , 1976 .

[35]  Cleve Moler,et al.  Mathematical Handbook for Scientists and Engineers , 1961 .

[36]  Alan L. Yuille,et al.  Scaling Theorems for Zero Crossings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[37]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[38]  Andrew P. Witkin,et al.  Uniqueness of the Gaussian Kernel for Scale-Space Filtering , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[39]  A. M. Turing,et al.  The chemical basis of morphogenesis , 1952, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.

[40]  M. Grayson.  The heat equation shrinks embedded plane curves to round points , 1987 .

[41]  Peter Chambers,et al.  Visualization of solid reaction-diffusion systems , 1995, IEEE Computer Graphics and Applications.

[42]  M. Grayson.  Shortening embedded curves , 1989 .

[43]  A. Chorin.  Flame advection and propagation algorithms , 1980 .