• DocumentCode
    2515883
  • Title

    Reversible Interger 2-D Discrete Fourier Transform by Control Bits

  • Author

    Dursun, Serkan ; Grigoryan, Artyom M.

  • Author_Institution
    Electr. & Comput. Eng. Dept., Univ. of Texas at San Antonio, San Antonio, TX, USA
  • fYear
    2010
  • fDate
    23-26 Aug. 2010
  • Firstpage
    4436
  • Lastpage
    4439
  • Abstract
    This paper describes the 2-D reversible integer discrete Fourier transform (RiDFT), which is based on the concept of the paired representation of the 2-D image, which is referred to as the unique 2-D frequency and 1-D time representation. The 2-D DFT of the image is split into a minimum set of short transforms, and the image is represented as a set of 1-D signals. The paired 2-DDFT involves a few operations of multiplication that can be approximated by integer transforms, such as one-point transforms with one control bit. 24 control bits are required to perform the 8×8-point RiDFT, and 264 control bits for the 16×16-point 2-D RiDFT of real inputs. The fast paired method of calculating the 1-D DFT is used. The computational complexity of the proposed 2-D RiDFTs is comparative with the complexity of the fast 2-D DFT.
  • Keywords
    discrete Fourier transforms; image representation; 1D time representation; 2D RiDFT; 2D frequency; 2D image; computational complexity; control bit; image representation; integer transform; minimum set; one-point transform; reversible integer 2D discrete Fourier transform; Approximation methods; Bridges; Discrete Fourier transforms; Discrete cosine transforms; Signal processing; Signal processing algorithms; Signal/image representation; image transformations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition (ICPR), 2010 20th International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    1051-4651
  • Print_ISBN
    978-1-4244-7542-1
  • Type

    conf

  • DOI
    10.1109/ICPR.2010.1077
  • Filename
    5597859