Abstract
Polytope Faces Pursuit is an algorithm that solves the standard sparse recovery problem. In this paper, we consider the case of block structured sparsity, and propose a novel algorithm based on the Polytope Faces Pursuit which incorporates this prior knowledge. The so-called Group Polytope Faces Pursuit is a greedy algorithm that adds one group of dictionary atoms at a time and adopts a path following approach based on the geometry of the polar polytope associated with the dual linear program. The complexity of the algorithm is of similar order to Group Orthogonal Matching Pursuit. Numerical experiments demonstrate the validity of the algorithm and illustrate that in certain cases the proposed algorithm outperforms the Group Orthogonal Matching Pursuit algorithm.
This research is supported by ESPRC Leadership Fellowship EP/G007144/1 and EU FET-Open Project FP7-ICT-225913 “SMALL”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Plumbley, M.D., Blumensath, T., Daudet, L., Gribonval, R., Davies, M.E.: Sparse representations in audio and music: From coding to source separation. Proceedings of the IEEE 98(6), 995–1005 (2010)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20(1), 33–61 (1998)
Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In: Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, November 1-3, pp. 40–44 (1993)
Mishali, M., Eldar, Y.C.: Blind multi-band signal reconstruction: Compressed sensing for analog signals. IEEE Transactions on Signal Processing 57(3), 993–1009 (2009)
Gribonval, R., Bacry, E.: Harmonic decomposition of audio signals with matching pursuit. IEEE Transactions on Signal Processing 51(1), 101–110 (2003)
Eldar, Y.C., Kuppinger, P., Bolcskei, H.: Block-sparse signals: Uncertainty relations and efficient recovery. IEEE Transactions on Signal Processing 58(6), 3042–3054 (2010)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
Plumbley, M.D.: On polar polytopes and the recovery of sparse representations. IEEE Transactions on Information Theory 53(9), 3188–3195 (2007)
Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68(1), 49–67 (2006)
van den Berg, E., Friedlander, M.P.: Joint-sparse recovery from multiple measurements, Technical Report (2009)
Gretsistas, A., Damnjanovic, I., Plumbley, M.D.: Gradient Polytope Faces Pursuit for large scale sparse recovery problems. In: IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), pp. 2030–2033 (2010)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gretsistas, A., Plumbley, M.D. (2012). Group Polytope Faces Pursuit for Recovery of Block-Sparse Signals. In: Theis, F., Cichocki, A., Yeredor, A., Zibulevsky, M. (eds) Latent Variable Analysis and Signal Separation. LVA/ICA 2012. Lecture Notes in Computer Science, vol 7191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28551-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-28551-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28550-9
Online ISBN: 978-3-642-28551-6
eBook Packages: Computer ScienceComputer Science (R0)