• DocumentCode
    1783633
  • Title

    Discussions on Implementing Iterative Hard Thresholding Algorithm

  • Author

    Feng-Cheng Chang ; Hsiang-Cheh Huang

  • Author_Institution
    Dept. of Innovative Inf. & Technol., Tamkang Univ., Ilan, Taiwan
  • fYear
    2014
  • fDate
    27-29 Aug. 2014
  • Firstpage
    17
  • Lastpage
    20
  • Abstract
    Compressive sensing is a potential technology for lossy image compression. With a given quality, we may represent an image with a few significant coefficients in the transform domain. When the number of the significant coefficients is much less than the number of the pixels, the assumption of sparse representation is satisfied. Based on the sparse modeling theories, an image could be sensed with a relatively simple hardware and reconstructed with a powerful computer. We are interested in how to implement the iterative hard thresholding algorithm. The formula is not complex, but the implementation is not straightforward when the image resolution is high. Therefore, the computation complexity and the memory consumptions are analyzed. With the analysis result and the implementation experiences, we discuss the issues that should be considered carefully when implementing the algorithm in this paper.
  • Keywords
    computational complexity; data compression; image coding; image segmentation; computation complexity; image resolution; iterative hard thresholding algorithm; lossy image compression; sparse representation; Complexity theory; Compressed sensing; Image reconstruction; Memory management; Minimization; Sensors; Vectors; compressive sensing; iterative hard thresholding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP), 2014 Tenth International Conference on
  • Conference_Location
    Kitakyushu
  • Print_ISBN
    978-1-4799-5389-9
  • Type

    conf

  • DOI
    10.1109/IIH-MSP.2014.12
  • Filename
    6998257