# Fast Calculation of Multiple Line Integrals

@article{Brandt1999FastCO, title={Fast Calculation of Multiple Line Integrals}, author={Achi Brandt and Jonathan Dym}, journal={SIAM J. Sci. Comput.}, year={1999}, volume={20}, pages={1417-1429} }

A line integral is defined as the integral of two-dimensional data along a (one-dimensional, straight) line of given length and orientation. Line integrals are used in various forms of edge and line detectors in images and in the computation of the Radon transform. We present a recursive algorithm which enables approximation of discretized line integrals at all lengths, orientations, and locations to within a prescribed error bound in at most O(n, log n, log log n) operations, where $n$ is the…

## 44 Citations

### Fast computation of attenuated Radon transform

- Mathematics
- 2004

The subject of this thesis is an algorithm for fast computation of a large set of line integrals, primarily in 2-dimensional space. The algorithm in question is previously known and is here…

### Fast slant stack: a notion of Radon transform for data in a Cartesian grid which is rapidly computib

- Computer Science
- 2001

This Radon transform is one-to-one and hence invertible on its range; it is rapidly invertable to any degree of desired accuracy using a preconditioned conjugate gradient solver.

### Exposing parallelism of discrete radon transform

- Computer ScienceProceedings of the 3rd International Conference on Telecommunications and Communication Engineering
- 2019

A parallel oriented algorithm is provided, and the speedups obtained are compared with alternative algorithms that compute Radon transform, and non-parallel version of multiscale DRT.

### A Framework for Discrete Integral Transformations II-The 2D Discrete Radon Transform

- Computer ScienceSIAM J. Sci. Comput.
- 2008

A notion of 2D discrete Radon transforms for2D discrete images, which is based on summation along lines of absolute slope less than 1, is defined, and is shown to be geometrically faithful: the summation avoids wrap-around effects.

### Central and Periodic Multi-Scale Discrete Radon Transforms

- Computer ScienceApplied Sciences
- 2021

periodic DRT is proven to have a fast inversion, whereas central DRT does not, and can provide almost a 2× speedup over conventional DRT, probably becoming the faster Radon transform algorithm available, at the cost of ignoring 15% of the summations in the corners.

### APPLICATIONS OF BEAMLETS TO DETECTION AND EXTRACTION OF LINES , CURVES AND OBJECTS IN VERY NOISY IMAGES

- Mathematics, Computer Science
- 2001

The beamlet pyramid is considered a natural platform on which to build new methods for detecting linear and curvilinear features in very noisy data, and is able, in examples, to detect objects which seem practically invisible to the unaided eye.

### Three-dimensional multiscale discrete Radon and John transforms

- Mathematics
- 2020

Abstract. Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3-D) volumes while considering its…

### Fast X-Ray and Beamlet Transforms for Three-Dimensional Data

- Computer Science
- 2002

This paper develops tools for the analysis of 3-D data which may contain structures built from lines, line segments, and filaments, and describes three principles for computing these transforms: exact, approximate, and recursive evaluation based on a multiscale divide-and-conquer approach.

### Near-optimal detection of geometric objects by fast multiscale methods

- Computer ScienceIEEE Transactions on Information Theory
- 2005

A general approach to detectors for "geometric" objects in noisy data is described, which covers several classes of geometrically defined signals, and allows for asymptotically optimal detection thresholds and fast algorithms for near-optimal detectors.

### A New Efficient Algorithm for Exact Calculation of Discrete X-Ray Transforms with Extension to Real-Time Dynamic Implementation

- Computer Science
- 2007

This work presents an iterative solver for the inverse transform as well as dynamic version of the algorithm using a sliding window where the computational cost of the updates is ( ) n O ( n O log ) ( ) 1 O per coefficient.

## 5 References

### Completion energies and scale

- Computer ScienceProceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- 1997

The notion of completion energy is examined and a fast method to compute the most likely completions in images is introduced and two novel analytic approximations to the curve of least energy are developed.

### A fast digital Radon transform--An efficient means for evaluating the Hough transform

- Computer SciencePattern Recognit.
- 1995

### A Fast and Accurate Multilevel Inversion of the Radon Transform

- MathematicsSIAM J. Appl. Math.
- 2000

An O(N2 log N) multilevel backprojection method that is implemented with a Fourier-domain postprocessing technique and the resulting image quality is similar or superior to the image quality of the classical back projection technique is presented.

### Multilevel Methods for Early Vision

- Weizmann Institute of Science
- 1994

### Ein Schnelle Diskrete Radon Transformation Basierend auf reckursiv definiertern Digitalen Geraden

- Ein Schnelle Diskrete Radon Transformation Basierend auf reckursiv definiertern Digitalen Geraden
- 1993