Abstract
SUMMARYGroup sparsity is one of the important signal priors for regularization of inverse problems. Sparsity with group structure is encountered in numerous applications. However, despite the abundance of sparsity‐based adaptive algorithms, attempts at group sparse adaptive methods are very scarce. In this paper, we introduce novel recursive least squares (RLS) adaptive algorithms regularized via penalty functions, which promote group sparsity. We present a new analytic approximation for ℓp,0 norm to utilize it as a group sparse regularizer. Simulation results confirm the improved performance of the new group sparse algorithms over regular and sparse RLS algorithms when group sparse structure is present. Copyright © 2013 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Adaptive Control and Signal Processing
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.