.png){kind=icon}
.png){kind=icon}
Return
Fast Convolutional Distance Transform
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2019.2910466.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose convolutional distance transform-efficient implementations of distance transform. Specifically, we leverage approximate minimum functions to rewrite the distance transform in terms of convolution operators. Thanks to the fast Fourier transform, the proposed convolutional distance transforms have O(N log N) complexity, where N is the total number of pixels. The proposed acceleration technique is distance metric agnostic. In the special case that the distance function is a p-norm, the distance transform can be further reduced to separable convolution filters; and for Euclidean norm, we achieve O( N) using constant-time Gaussian filtering.
Keywords:
Convolution
distance transform
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W