A Fast Poisson Solver of Arbitrary Order Accuracy in Rectangular Regions
SIAM Journal on Scientific Computing
An Accurate Discrete Fourier Transform for Image Processing
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
PHLST5: A Practical and Improved Version of Polyharmonic Local Sine Transform
Journal of Mathematical Imaging and Vision
A Fourier Domain Framework for Variational Image Registration
Journal of Mathematical Imaging and Vision
An FFT-based technique for translation, rotation, and scale-invariant image registration
IEEE Transactions on Image Processing
Rotation, scale, and translation resilient watermarking for images
IEEE Transactions on Image Processing
Dequantizing image orientation
IEEE Transactions on Image Processing
Improvement of DCT-Based Compression Algorithms Using Poisson's Equation
IEEE Transactions on Image Processing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
| Hi-index | 0.00 |
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the "periodic" image generally presents strong discontinuities across the frame border. These edge effects cause several artifacts in the Fourier Transform, in particular a well-known "cross" structure made of high energy coefficients along the axes, which can have strong consequences on image processing or image analysis techniques based on the image spectrum (including interpolation, texture analysis, image quality assessment, etc.). In this paper, we show that an image can be decomposed into a sum of a "periodic component" and a "smooth component", which brings a simple and computationally efficient answer to this problem. We discuss the interest of such a decomposition on several applications.