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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Spira, A., Kimmel, R., & Sochen, N. (2003). Efficient Beltrami flow using a short time kernel. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2695, 511–522. https://doi.org/10.1007/3-540-44935-3_35
Mendeley helps you to discover research relevant for your work.