• DocumentCode
    1208324
  • Title

    On sparse representation in pairs of bases

  • Author

    Feuer, Arie ; Nemirovski, Arkadi

  • Author_Institution
    Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
  • Volume
    49
  • Issue
    6
  • fYear
    2003
  • fDate
    6/1/2003 12:00:00 AM
  • Firstpage
    1579
  • Lastpage
    1581
  • Abstract
    In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l0 optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.
  • Keywords
    linear programming; matrix algebra; minimisation; signal representation; Elad-Bruckstein condition; linear programming minimization; necessary condition; optimization problems; orthogonal matrices; pairs of bases; signal representation; sparse representation; sufficient condition; Cities and towns; Dictionaries; Industrial engineering; Laboratories; Linear programming; Robot control; Service robots; Sparse matrices; Sufficient conditions; Technology management;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.811926
  • Filename
    1201084
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1208324