Abstract
The present contribution studies a geodesic-based and a projection-based learning algorithm over a curved parameter space for blind deconvolution (BD) application. The chosen deconvolving structure appears as a single neuron model whose learning rules naturally arise from criterion-function minimization over a smooth manifold. We consider the BD performances of the two classes of algorithms as well as their computational burden. Also, numerical comparisons with seven BD algorithms known from the scientific literature are illustrated and discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.