Name
Abstract | ||
|---|---|---|
Many image processing algorithms are implemented in a combination of spatial and frequency domains. The fast Fourier transform (FFT) is the workhorse of such algorithms. One limitation of the FFT is artefacts that result from the implicit periodicity within the spatial domain. A new periodic plus smooth decomposition has recently been proposed for removing such artefacts, although this comes at the cost of an additional 2D FFT. In this paper, we restructure the decomposition to enable it to be calculated with a single 1D FFT, which can significantly accelerate artefact free Fourier transformation. The cost of this acceleration is a small amount of additional storage to hold the representation of the smooth image component. |
Year | Venue | Field |
|---|---|---|
2017 | HEART | Sliding window protocol,Internal medicine,Cardiology,Image processing,Algorithm,Field-programmable gate array,Fourier transform,Fast Fourier transform,Acceleration,Digital image processing,Medicine,Periodic graph (geometry) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. G. Bailey | 1 | 71 | 16.88 |
| Faisal Mahmood | 2 | 53 | 10.24 |
| Ulf Skoglund | 3 | 0 | 0.68 |