Diffusion runs low on persistence fast

Interpreting an image as a function on a compact subset of the Euclidean plane, we get its scale-space by diffusion, spreading the image over the entire plane. This generates a 1-parameter family of functions alternatively defined as convolutions with a progressively wider Gaussian kernel. We prove that the corresponding 1-parameter family of persistence diagrams have norms that go rapidly to zero as time goes to infinity. This result rationalizes experimental observations about scale-space. We hope this will lead to targeted improvements of related computer vision methods.

[1]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[2]  Stefano Soatto,et al.  On the set of images modulo viewpoint and contrast changes , 2009, CVPR.

[3]  Andrew P. Witkin,et al.  Scale-space filtering: A new approach to multi-scale description , 1984, ICASSP.

[4]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[5]  Tony Lindeberg,et al.  Effective Scale: A Natural Unit for Measuring Scale-Space Lifetime , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Christopher K. I. Williams,et al.  An isotropic Gaussian mixture can have more modes than components , 2003 .

[7]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[8]  J. Weickert,et al.  Information Measures in Scale-Spaces , 1999, IEEE Trans. Inf. Theory.

[9]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[10]  Tony Lindeberg,et al.  Scale-Space Theory in Computer Vision , 1993, Lecture Notes in Computer Science.

[11]  David Cohen-Steiner,et al.  Lipschitz Functions Have Lp-Stable Persistence , 2010, Found. Comput. Math..

[12]  Joachim H. Rieger.  Generic evolutions of edges on families of diffused greyvalue surfaces , 2005, Journal of Mathematical Imaging and Vision.

[13]  J. Koenderink.  The structure of images , 2004, Biological Cybernetics.

[14]  Alexander Russell,et al.  Computational topology: ambient isotopic approximation of 2-manifolds , 2003, Theor. Comput. Sci..

[15]  LA Vrence.  Segmentation Based on Intensity Extrema , 2004 .

[16]  Jean-Michel Morel,et al.  A non-local algorithm for image denoising , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[17]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[18]  Edward Courtney,et al.  2 = 4 M , 1993 .

[19]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[20]  Laurent Saloff-Coste,et al.  Aspects of Sobolev-type inequalities , 2001 .

[21]  Ivan Laptev,et al.  On Space-Time Interest Points , 2005, International Journal of Computer Vision.

[22]  Tony Lindeberg,et al.  Feature Detection with Automatic Scale Selection , 1998, International Journal of Computer Vision.

[23]  Mads Nielsen,et al.  On the Rate of Structural Change in Scale Spaces , 2009, SSVM.

[24]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[25]  J. Damon.  Local Morse Theory for Solutions to the Heat Equation and Gaussian Blurring , 1995 .

[26]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[27]  H. Freudenthal.  Simplizialzerlegungen von Beschrankter Flachheit , 1942 .