{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:21:04Z","timestamp":1762100464110},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540326304"},{"type":"electronic","value":"9783540326311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11679363_26","type":"book-chapter","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T13:35:52Z","timestamp":1140701752000},"page":"206-213","source":"Crossref","is-referenced-by-count":34,"title":["Recovery of Sparse Representations by Polytope Faces Pursuit"],"prefix":"10.1007","author":[{"given":"Mark D.","family":"Plumbley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1162\/089976603762552951","volume":"15","author":"K. Kreutz-Delgado","year":"2003","unstructured":"Kreutz-Delgado, K., Murray, J.F., Rao, B.D., Engan, K., Lee, T.W., Sejnowski, T.J.: Dictionary learning algorithms for sparse representation. Neural Computation\u00a015, 349\u2013396 (2003)","journal-title":"Neural Computation"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing\u00a020, 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S. Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing\u00a041, 3397\u20133415 (1993)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In: Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, pp. 40\u201344 (1993)","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Gribonval, R., Nielsen, M.: Approximation with highly redundant dictionaries. In: Wavelets: Applications in Signal and Image Processing, Proc. SPIE 2003, San Diego, USA, pp. 216\u2013227 (2003)","DOI":"10.1117\/12.504776"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J.A. Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory\u00a050, 2231\u20132242 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"J.J. Fuchs","year":"2004","unstructured":"Fuchs, J.J.: On sparse representations in arbitrary redundant bases. IEEE Transactions on Information Theory\u00a050, 1341\u20131344 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D.L. Donoho","year":"2003","unstructured":"Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization. Proc. Nat. Aca. Sci. 100, 2197\u20132202 (2003)","journal-title":"Proc. Nat. Aca. Sci."},{"key":"26_CR9","unstructured":"Donoho, D.L.: Neighborly polytopes and sparse solutions of underdetermined linear equations. Technical report, Statistics Department, Stanford University (2004)"},{"key":"26_CR10","unstructured":"Plumbley, M.D.: Polar polytopes and recovery of sparse representations (2005) (submitted for publication)"},{"key":"26_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons Ltd, Chichester (1998)"},{"key":"26_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0221. Springer, New York (2003)","edition":"2"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"25","author":"B.K. Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Computing\u00a025, 227\u2013234 (1995)","journal-title":"SIAM J. Computing"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Andrle, M., Rebollo-Neira, L.: A swapping-based refinement of orthogonal matching pursuit strategies. Signal Processing (2005) (to appear in Signal Processing)","DOI":"10.1016\/j.sigpro.2005.05.034"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Kvasnica, M., Grieder, P., Baoti\u0107, M.: Multi-Parametric Toolbox, MPT (2004)","DOI":"10.1007\/978-3-540-24743-2_30"}],"container-title":["Lecture Notes in Computer Science","Independent Component Analysis and Blind Signal Separation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11679363_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:00Z","timestamp":1619507760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11679363_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540326304","9783540326311"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11679363_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}