{"doi":"10.1109/tsp.2005.847822","page":"2018-2026","date_created":"2024-10-15T11:20:55Z","publication_status":"published","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1053-587X"]},"article_processing_charge":"No","year":"2005","month":"05","status":"public","day":"23","scopus_import":"1","title":"Relative optimization for blind deconvolution","date_published":"2005-05-23T00:00:00Z","extern":"1","quality_controlled":"1","date_updated":"2024-12-12T12:19:43Z","issue":"6","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","publication":"IEEE Transactions on Signal Processing","citation":{"chicago":"Bronstein, Alex M., M.M. Bronstein, and M. Zibulevsky. “Relative Optimization for Blind Deconvolution.” IEEE Transactions on Signal Processing. Institute of Electrical and Electronics Engineers (IEEE), 2005. https://doi.org/10.1109/tsp.2005.847822.","apa":"Bronstein, A. M., Bronstein, M. M., & Zibulevsky, M. (2005). Relative optimization for blind deconvolution. IEEE Transactions on Signal Processing. Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/tsp.2005.847822","mla":"Bronstein, Alex M., et al. “Relative Optimization for Blind Deconvolution.” IEEE Transactions on Signal Processing, vol. 53, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2005, pp. 2018–26, doi:10.1109/tsp.2005.847822.","short":"A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, IEEE Transactions on Signal Processing 53 (2005) 2018–2026.","ieee":"A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “Relative optimization for blind deconvolution,” IEEE Transactions on Signal Processing, vol. 53, no. 6. Institute of Electrical and Electronics Engineers (IEEE), pp. 2018–2026, 2005.","ista":"Bronstein AM, Bronstein MM, Zibulevsky M. 2005. Relative optimization for blind deconvolution. IEEE Transactions on Signal Processing. 53(6), 2018–2026.","ama":"Bronstein AM, Bronstein MM, Zibulevsky M. Relative optimization for blind deconvolution. IEEE Transactions on Signal Processing. 2005;53(6):2018-2026. doi:10.1109/tsp.2005.847822"},"_id":"18417","type":"journal_article","intvolume":" 53","volume":53,"author":[{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"full_name":"Bronstein, M.M.","first_name":"M.M.","last_name":"Bronstein"},{"first_name":"M.","last_name":"Zibulevsky","full_name":"Zibulevsky, M."}],"abstract":[{"lang":"eng","text":"We propose a relative optimization framework for quasi-maximum likelihood (QML) blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure allows fast Newton system construction and solution, resulting in a fast-convergent algorithm with iteration complexity comparable to that of gradient methods. We also propose the use of rational infinite impulse response (IIR) restoration kernels, which constitute a richer family of filters than the traditionally used finite impulse response (FIR) kernels. We discuss different choices of nonlinear functions that are suitable for deconvolution of super- and sub-Gaussian sources and formulate the conditions under which the QML estimation is stable. Simulation results demonstrate the efficiency of the proposed methods."}],"oa_version":"None"}