Constrained subspace estimation via convex optimization
Ver/ Abrir
Identificadores
URI: http://hdl.handle.net/10902/13017ISBN: 978-0-9928626-7-1
ISBN: 978-1-5386-0751-0
Registro completo
Mostrar el registro completo DCAutoría
Santamaría Caballero, Luis Ignacio; Vía Rodríguez, Javier; Kirby, Michael; Marrinan, Tim; Peterson, Chris; Scharf, Louis L.Fecha
2017Derechos
© EURASIP. First published in the Proceedings of the 25th European Signal Processing Conference (EUSIPCO-2017) in 2017, published by EURASIP. IEEE is granted the nonexclusive, irrevocable, royalty-free worldwide rights to publish, sell and distribute the copyrighted work in any format or media without restriction.
Publicado en
25th European Signal Processing Conference (EUSIPCO), Kos island, Greece, 2017, 1200-1204
Editorial
IEEE
Enlace a la publicación
Palabras clave
Subspace averaging
Grassmann manifold
Convex optimization
Semidefinite relaxation
Resumen/Abstract
Given a collection of M experimentally measured subspaces, and a model-based subspace, this paper addresses the problem of finding a subspace that approximates the collection, under the constraint that it intersects the model-based subspace in a predetermined number of dimensions. This constrained subspace estimation (CSE) problem arises in applications such as beamforming, where the model-based subspace encodes prior information about the direction-of-arrival of some sources impinging on the array. In this paper, we formulate the constrained subspace estimation (CSE) problem, and present an approximation based on a semidefinite relaxation (SDR) of this non-convex problem. The performance of the proposed CSE algorithm is demonstrated via numerical simulation, and its application to beamforming is also discussed.
Colecciones a las que pertenece
- D12 Congresos [562]
- D12 Proyectos de Investigación [456]