{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:17:13Z","timestamp":1775819833424,"version":"3.50.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["UMO-2018\/31\/B\/ST7\/01888"],"award-info":[{"award-number":["UMO-2018\/31\/B\/ST7\/01888"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>\n            This article introduces an effective approach to performing matching pursuit calculations with continuous (quasi-infinite) dictionaries. Simulating continuous parameter space is accomplished by combining optimal dictionary construction as introduced previously with local parameter optimization. At the same time, the calculations can be performed not only with Gabor atoms, but with any type of oscillating atoms, or even multiple types of atoms at once. The proposed method is confirmed by introducing a first stable version of a high-performance implementation\n            <jats:italic>empi<\/jats:italic>\n            , supporting calculations with continuous as well as discrete dictionaries, further accelerated by the use of multi-threading and GPU support.\n          <\/jats:p>","DOI":"10.1145\/3674832","type":"journal-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T17:04:43Z","timestamp":1719594283000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["empi: GPU-Accelerated Matching Pursuit with Continuous Dictionaries"],"prefix":"10.1145","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0457-6731","authenticated-orcid":false,"given":"Piotr T.","family":"R\u00f3\u017ca\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"issue":"1","key":"e_1_3_2_2_2","first-page":"97","article-title":"Remark AS R15: Function minimization using a simplex procedure","volume":"25","author":"Benyon P. R.","year":"1976","unstructured":"P. R. Benyon. 1976. Remark AS R15: Function minimization using a simplex procedure. Journal of the Royal Statistical Society. Series C (Applied Statistics) 25, 1 (1976), 97\u201397. Retrieved from http:\/\/www.jstor.org\/stable\/2346539","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)"},{"issue":"2","key":"e_1_3_2_3_2","first-page":"250","article-title":"Remark AS R11: A remark on Algorithm AS 47 \u201cFunction Minimization using a Simplex Procedure\u201d","volume":"23","author":"Chambers John M.","year":"1974","unstructured":"John M. Chambers and J. E. Ertel. 1974. Remark AS R11: A remark on Algorithm AS 47 \u201cFunction Minimization using a Simplex Procedure\u201d. Journal of the Royal Statistical Society: Series C (Applied Statistics) 23, 2 (1974), 250\u2013251. Retrieved from http:\/\/www.jstor.org\/stable\/2347015","journal-title":"Journal of the Royal Statistical Society: Series C (Applied Statistics)"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02678430"},{"key":"e_1_3_2_5_2","volume-title":"Matching Pursuit and Unification in EEG analysis","author":"Durka Piotr J.","year":"2007","unstructured":"Piotr J. Durka. 2007. Matching Pursuit and Unification in EEG analysis. Artech House, Norwood, MA. ISBN 978-1-58053-304-1."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/s24030842"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.905866"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02345286"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.3389\/fnhum.2015.00258"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/569147.569151"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"issue":"3","key":"e_1_3_2_12_2","first-page":"380","article-title":"Remark AS R28: A remark on algorithm AS 47: Function minimization using a simplex procedure","volume":"27","author":"Hill I. D.","year":"1978","unstructured":"I. D. Hill. 1978. Remark AS R28: A remark on algorithm AS 47: Function minimization using a simplex procedure. Journal of the Royal Statistical Society: Series C (Applied Statistics) 27, 3 (1978), 380\u2013382. DOI: http:\/\/www.jstor.org\/stable\/2347187","journal-title":"Journal of the Royal Statistical Society: Series C (Applied Statistics)"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1660699"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1186\/1475-925X-12-94"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"e_1_3_2_17_2","unstructured":"NVIDIA P\u00e9ter Vingelmann and Frank H. P. Fitzek. 2020. CUDA release: 10.2.89. Retrieved from https:\/\/developer.nvidia.com\/cuda-toolkit"},{"issue":"3","key":"e_1_3_2_18_2","first-page":"338","article-title":"Algorithm AS 47: Function minimization using a simplex procedure","volume":"20","author":"O\u2019Neill R.","year":"1971","unstructured":"R. O\u2019Neill. 1971. Algorithm AS 47: Function minimization using a simplex procedure. Journal of the Royal Statistical Society: Series C (Applied Statistics) 20, 3 (1971), 338\u2013345. DOI: http:\/\/www.jstor.org\/stable\/2346772","journal-title":"Journal of the Royal Statistical Society: Series C (Applied Statistics)"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447958"},{"issue":"2","key":"e_1_3_2_20_2","first-page":"187","article-title":"Normalization effects in matching pursuit algorithm with Gabor dictionaries","volume":"26","author":"R\u00f3\u017ca\u0144ski Piotr T.","year":"2018","unstructured":"Piotr T. R\u00f3\u017ca\u0144ski. 2018. Normalization effects in matching pursuit algorithm with Gabor dictionaries. Journal of Applied Computer Science 26, 2 (2018), 187\u2013199.","journal-title":"Journal of Applied Computer Science"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-spr.2019.0246"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065718500491"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3674832","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3674832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:02Z","timestamp":1750291562000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3674832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3674832"],"URL":"https:\/\/doi.org\/10.1145\/3674832","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"2023-07-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}