{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:17Z","timestamp":1725795857419},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_49","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"588-599","source":"Crossref","is-referenced-by-count":7,"title":["Nearly Linear-Time Model-Based Compressive Sensing"],"prefix":"10.1007","author":[{"given":"Chinmay","family":"Hegde","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[]},{"given":"Ludwig","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Ailon, N., Rauhut, H.: Fast and RIP-optimal transforms (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1301.0878\n                    \n                    \n                   (preprint)"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Baraniuk, R.: Optimal tree approximation with wavelets. In: SPIE Wavelet Applications in Signal and Image Processing (1999)","DOI":"10.1117\/12.366780"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Bohanec, M., Bratko, I.: Trading accuracy for simplicity in decision trees. Machine Learning (1994)","DOI":"10.1007\/BF00993345"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Bah, B., Baldassarre, L., Cevher, V.: Model-based sketching and recovery with expanders. In: Symposium on Discrete Algorithms (SODA) (2014)","DOI":"10.1137\/1.9781611973402.112"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Baraniuk, R., Cevher, V., Duarte, M., Hegde, C.: Model-based compressive sensing. IEEE Trans. Inform. Theory (2010)","DOI":"10.1109\/TIT.2010.2040894"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Blumensath, T., Davies, M.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. (2009)","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constructive Approximation (2008)","DOI":"10.1007\/s00365-007-9003-x"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Baraniuk, R., Jones, D.: A signal-dependent time-frequency representation: Fast algorithm for optimal kernel design. IEEE Trans. Sig. Proc. (1994)","DOI":"10.1109\/78.258128"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V., Velingker, A.: Restricted isometry of Fourier matrices and list decodability of random linear codes. In: Symposium on Discrete Algorithms (SODA) (2013)","DOI":"10.1137\/1.9781611973105.31"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Candes, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory (2006)","DOI":"10.1109\/TIT.2005.862083"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Candes, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. (2006)","DOI":"10.1117\/12.620143"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Cartis, C., Thompson, A.: An exact tree projection algorithm for wavelets. IEEE Signal Process. Lett. (2013)","DOI":"10.1109\/LSP.2013.2278147"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Do Ba, K., Indyk, P., Price, E., Woodruff, D.: Lower bounds for sparse recovery. In: Symposium on Discrete Algorithms (SODA) (2010)","DOI":"10.1137\/1.9781611973075.95"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Donoho, D.: CART and best-ortho-basis: a connection. Annals of Statistics (1997)","DOI":"10.1214\/aos\/1069362377"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inform. Theory (2006)","DOI":"10.1109\/TIT.2006.871582"},{"key":"49_CR16","unstructured":"Foucart, S., Pajor, A., Rauhut, H., Ullrich, T.: The Gelfand widths of \u2113\n                    p\n                  -balls for 0\u2009\u2264\u2009p\u2009\u2264\u20091. Journal of Complexity (2010)"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer (2013)","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. In: Proc. IEEE (2010)","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Nearly optimal sparse Fourier transform. In: Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2214029"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Hegde, C., Indyk, P., Schmidt, L.: Approximation algorithms for model-based compressive sensing (2014), \n                    \n                      http:\/\/people.csail.mit.edu\/ludwigs\/papers\/approxmodels.pdf\n                    \n                    \n                   (preprint)","DOI":"10.1137\/1.9781611973402.113"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Hegde, C., Indyk, P., Schmidt, L.: Approximation-tolerant model-based compressive sensing. In: Symposium on Discrete Algorithms (SODA) (2014)","DOI":"10.1137\/1.9781611973402.113"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Hegde, C., Indyk, P., Schmidt, L.: A fast approximation algorithm for tree-sparse recovery. In: International Symposium on Information Theory (ISIT) (2014)","DOI":"10.1109\/ISIT.2014.6875152"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Indyk, P., Razenshteyn, I.: On model-based RIP-1 matrices. In: International Colloquium on Automata, Languages, and Programming (2013)","DOI":"10.1007\/978-3-642-39206-1_48"},{"key":"49_CR24","doi-asserted-by":"crossref","unstructured":"Lustig, M., Donoho, D., Pauly, J.: Sparse MRI: The application of compressed sensing for rapid MR imaging. In: Magnetic Resonance in Medicine (2007)","DOI":"10.1002\/mrm.21391"},{"key":"49_CR25","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. In: Foundations and Trends in Theoretical Computer Science (2005)","DOI":"10.1561\/0400000002"},{"key":"49_CR26","doi-asserted-by":"crossref","unstructured":"Nelson, J., Price, E., Wootters, M.: New constructions of RIP matrices with fast multiplication and fewer rows. In: Symposium on Discrete Algorithms (SODA) (2014)","DOI":"10.1137\/1.9781611973402.111"},{"key":"49_CR27","doi-asserted-by":"crossref","unstructured":"Needell, D., Tropp, J.: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. (2009)","DOI":"10.1145\/1859204.1859229"},{"key":"49_CR28","doi-asserted-by":"crossref","unstructured":"Rauhut, H., Schnass, K., Vandergheynst, P.: Compressed sensing and redundant dictionaries. IEEE Trans. Inform. Theory (2008)","DOI":"10.1109\/TIT.2008.920190"},{"key":"49_CR29","doi-asserted-by":"crossref","unstructured":"Rudelson, M., Vershynin, R.: On sparse reconstruction from Fourier and Gaussian measurements. In: Comm. Pure Appl. Math. (2008)","DOI":"10.1002\/cpa.20227"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:12:31Z","timestamp":1558908751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}