Modulo transforms - an alternative to lifting

No abstract is available for this paper.

• Publication year

  2006

• Venue

  IEEE Transactions on Signal Processing

• Publication date

  2006-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TSP.2006.872548
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Image processing

  2020cited by this paper
• Improved lossless audio coding using the noise-shaped IntMDCT

  2004cited by this paper
• A global method for invertible integer DCT and integer wavelet algorithms

  2004cited by this paper
• Reversible FFT and MDCT via matrix lifting

  2004cited by this paper
• Low-complexity transform and quantization in H.264/AVC

  2003cited by this paper
• Integer fast Fourier transform

  2002cited by this paper
• Matrix factorizations for reversible integer mapping

  2001cited by this paper
• Fast multiplierless approximations of the DCT with the lifting scheme

  2001cited by this paper
• The binDCT: fast multiplierless approximation of the DCT

  2000cited by this paper
• Fast multiplierless approximation of the DCT with the lifting scheme

  2000cited by this paper
• On implementing transforms from integers to integers

  1998cited by this paper
• Reversible discrete cosine transform

  1998influential reference
• Division Algorithms and Implementations

  1997cited by this paper
• Lossless image compression using integer to integer wavelet transforms

  1997cited by this paper
• Discrete Cosine Transform

  1996cited by this paper
• Lifting scheme: a new philosophy in biorthogonal wavelet constructions

  1995cited by this paper
• Division by invariant integers using multiplication

  1994cited by this paper
• New Networks for Perfect Inversion and Perfect Reconstruction

  1992cited by this paper
• Integer division using reciprocals

  1991cited by this paper
• Hartley Transforms over Finite Fields

  1990cited by this paper
• Practical fast 1-D DCT algorithms with 11 multiplications

  1989cited by this paper
• Reversible intraframe compression of medical images.

  1988cited by this paper
• A fast algorithm for general raster rotation

  1986cited by this paper
• A Fast Computational Algorithm for the Discrete Cosine Transform

  1977cited by this paper
• Image processing

  1971cited by this paper
• Special Functions and the Theory of Group Representations

  1968cited by this paper
• Elementary number theory

  1959cited by this paper

• Integer Approximate Cosine/Sine-Modulated Filter Banks

  2018cites this paper
• Infinity-Norm Rotation Transforms

  2009cites this paper
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks

  2009cites this paper
• Development of a New Transform:MRT

  2009cites this paper
• Compression de facteurs d'échelle audio par transformation bidimensionnelle

  2009cites this paper
• Reversible Resampling of Integer Signals

  2009cites this paper
• Fully reversible image rotation by 1-D filtering

  2008influential citation
• Reversible, Fast, and High-Quality Grid Conversions

  2008cites this paper
• Reversible image rotations with modulo transforms

  2005cites this paper