Skip to main content

Efficient Beltrami Flow Using a Short Time Kernel

  • Conference paper
  • First Online:
Scale Space Methods in Computer Vision (Scale-Space 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2695))

Included in the following conference series:

Abstract

We introduce a short time kernel for the Beltrami image enhancing flow. The flow is implemented by ‘convolving’ the image with a space dependent kernel in a similar fashion to the implementation of the heat equation by a convolution with a gaussian kernel. The expression for the kernel shows, yet again, the connection between the Beltrami flow and the Bilateral filter. The kernel is calculated by measuring distances on the image manifold by an efficient variation of the fast marching method. The kernel, thus obtained, can be used for arbitrary large time steps in order to produce adaptive smoothing and/or a new scale-space. We apply it to gray scale and color images to demonstrate its flow like behavior.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.cs.technion.ac.il/~ron/.

    Google Scholar 

  2. D. Barash. Fundamental relationship between bilateral filtering, adaptive smoothing, and the nonlinear diffusion equation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(6):844–847, June 2002.

    Article  Google Scholar 

  3. M. Elad. On the bilateral filter and ways to improve it. IEEE Transactions on Image Processing, 11(10):1141–1151, October 2002.

    Article  MathSciNet  Google Scholar 

  4. R. Kimmel, R. Malladi, and N. Sochen. Image processing via the beltrami operator. In Proc. of 3-rd Asian Conf. on Computer Vision, Hong Kong, January 1998.

    Google Scholar 

  5. R. Kimmel and J. Sethian. Computing geodesic paths on manifolds. Proceedings of National Academy of Sciences, 95(15):8431–8435, July 1998.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Mémoli and G. Sapiro. Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces. Journal of Computational Physics, 173(2):730–764, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Sethian. A fast marching level set method for monotonically advancing fronts. Proceedings of National Academy of Sciences, 93(4):1591–1595, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Sethian and A. Vladimirsky. Ordered upwind methods for static hamilton-jacobi equations: theory and applications. Technical Report PAM-792(UCB), Center for Pure and Applied Mathematics, May 2001. submitted for publication to SIAM Journal on Numerical Analysis in July 2001.

    Google Scholar 

  9. N. Sochen. Stochastic processes in vision: From langevin to beltrami. In Proc. of International Conference on Computer Vision, Vancouver, Canada, July 2001.

    Google Scholar 

  10. N. Sochen, R. Kimmel, and A. Bruckstein. Diffusions and confusions in signal and image processing. Journal of Mathematical Imaging and Vision, 14(3):195–209, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. Sochen, R. Kimmel, and R. Malladi. From high energy physics to low level vision. LBNL report LBNL-39243, UC Berkeley, August 1996.

    Google Scholar 

  12. N. Sochen, R. Kimmel, and R. Malladi. A general framework for low level vision. IEEE Trans. on Image Processing, 7(3):310–318, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  13. N. Sochen and Y. Y. Zeevi. Representation of colored images by manifolds embedded in higher dimensional non-euclidean space. In Proc. of ICIP98, pages 166–170, Chicago, IL, January 1998.

    Google Scholar 

  14. A. Spira and R. Kimmel. An efficient solution to the eikonal equation on parametric manifolds. Submitted for publication, March 2003.

    Google Scholar 

  15. C. Tomasi and R. Manduchi. Bilateral filtering for gray and color images. In Sixth International Conference on Computer Vision, Bombay, India, January 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spira, A., Kimmel, R., Sochen, N. (2003). Efficient Beltrami Flow Using a Short Time Kernel. In: Griffin, L.D., Lillholm, M. (eds) Scale Space Methods in Computer Vision. Scale-Space 2003. Lecture Notes in Computer Science, vol 2695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44935-3_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-44935-3_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40368-5

  • Online ISBN: 978-3-540-44935-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics