Accelerated Convolutions for Efficient Multi-Scale Time to Contact Computation in Julia
Not on the map. Why?
Abstract (arXiv)
Convolutions have long been regarded as fundamental to applied mathematics, physics and engineering. Their mathematical elegance allows for common tasks such as numerical differentiation to be computed efficiently on large data sets. Efficient computation of convolutions is critical to artificial intelligence in real-time applications, like machine vision, where convolutions must be continuously and efficiently computed on tens to hundreds of kilobytes per second. In this paper, we explore how convolutions are used in fundamental machine vision applications. We present an accelerated n-dimensional convolution package in the high performance computing language, Julia, and demonstrate its efficacy in solving the time to contact problem for machine vision. Results are measured against synthetically generated videos and quantitatively assessed according to their mean squared error from the ground truth. We achieve over an order of magnitude decrease in compute time and allocated memory for comparable machine vision applications. All code is packaged and integrated into the official Julia Package Manager to be used in various other scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 28 Dec 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Fuzzy-Pattern Tsetlin Machinecited by 0
- 2025Fuzzy-Pattern Tsetlin Machine11 Aug 2025