Fully reversible image rotation by 1-D filtering

  title={Fully reversible image rotation by 1-D filtering},
  author={Laurent Condat and Dimitri Van De Ville},
  journal={2008 15th IEEE International Conference on Image Processing},
  • Laurent Condat, D. Ville
  • Published 12 December 2008
  • Mathematics, Computer Science
  • 2008 15th IEEE International Conference on Image Processing
In this work, we propose a new image rotation algorithm. The main feature of our approach is the symmetric reversibility, which means that when using the same algorithm for the converse operation, then the initial data is recovered exactly. To that purpose, we decompose the lattice conversion process into three successive shear operations. The translations along the shear directions are implemented by 1-D convolutions, with new appropriate fractional delay filters. Also, the method is fast and… Expand

Figures, Tables, and Topics from this paper

Evaluation of Half Gaussian Filter Rotation for Edge Detection
Different methods of discrete rotating the half Gaussian filter are compared and evaluated to detect contours in synthetic and real images, validating which rotation technique is most beneficial for edge detection. Expand
Automatic Rotation Recovery Algorithm for Accurate Digital Image and Video Watermarks Extraction
A new automatic rotation recovery algorithm is proposed that can be plugged to any image or video watermarking algorithm extraction component and the main job is to detect the geometrical distortion happens to the watermarked image/images sequence; recover the distorted scene to its original state in a blind and automatic way. Expand
Evolution of image regularization with PDEs toward a new anisotropic smoothing based on half kernels
A new smoothing method preserving structures which drives the diffusion function of the angle between the two edge directions and the gradient value enables to preserve edges and corners, contrary to other anisotropic diffusion methods. Expand
Stabilization and optimization of PLUS factorization and its application in image coding
Three stable PLUS factorization algorithms are proposed, the stability theorem under no perturbation is proved, and a closed-form formula for transform error is obtained and used to design an algorithm for optimal PLUS factorizations. Expand
Array set addressing: Enabling efficient hexagonally sampled image processing
This dissertation introduces a new hexagonal addressing technique called array set addressing (ASA), that solves the problems exhibited by other methods and demonstrates the superior bandwidth of hexagonal sampling using real sensor hardware. Expand


Reversible, Fast, and High-Quality Grid Conversions
A new grid conversion method is proposed to resample between two 2-D periodic lattices with the same sampling density, which means that when using the same algorithm for the converse operation, then the initial data is recovered exactly. Expand
High quality alias free image rotation
  • C. Owen, F. Makedon
  • Computer Science, Mathematics
  • Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers
  • 1996
A new resampling filter design methodology is presented which minimizes the problem for conventional convolution-based image rotation and exhibits improved performance in term of reduction in artifacts and an efficient O(N/sup 2/logN) running time. Expand
Convolution-based interpolation for fast, high-quality rotation of images
The results indicate that the present algorithm in its higher-order versions outperforms all standard high-accuracy methods of which it is aware, both in terms of speed and quality. Expand
Two-Pass Image and Volume Rotation
We present a novel two-pass approach for both 2D image and 3D volume rotation. Each pass is a pseudo shear. However, it has the similar regularity to a pure shear in that a beam remains rigid.Expand
3-D transformations of images in scanline order
Instead of calculating the lighting based on the position of the polygon, lights, and eye, the lights and eye can be transformed to a corresponding position for a unit square which the authors can consider to be a canonical polygon. Expand
Cubic convolution interpolation for digital image processing
Cubic convolution interpolation is a new technique for resampling discrete data. It has a number of desirable features which make it useful for image processing. The technique can be performedExpand
Two-Dimensional Resampling of Line Scan Imagery by One-Dimensional Processing
Geometric correction of remote sensing data, such as Landsat M S S data, requires two-dimensional resumpling. The resampling operation is typically curried out in two one-dimensional operations:Expand
Rotation of 3D volumes by Fourier-interpolated shears
In general, six different patterns of four shears can be used to implement a given 3D rotation, and a classification of these patterns is provided, it is demonstrated that a consistent scheme must be used for various rotations, and several such consistent schemes are presented. Expand
Wavelet families of increasing order in arbitrary dimensions
This work builds discrete-time compactly supported biorthogonal wavelets and perfect reconstruction filter banks for any lattice in any dimension with any number of primal and dual vanishing moments using the lifting scheme. Expand
Modulo transforms - an alternative to lifting
  • S. Srinivasan
  • Mathematics, Computer Science
  • IEEE Transactions on Signal Processing
  • 2006
A new paradigm for the construction of reversible transforms that map integers to integers is introduced, wherein certain Pythagorean triples can be scalar quantized to produce a reversible, normalized, scalefree transform matrix. Expand