The Rotational Lasso

Alexander Lorbert, Peter J. Ramadge

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a sparse approach of solving the one-sided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation matrices, a new constraint is introduced into this classical problem in the form of a sparsity-inducing norm. We call the resulting optimization problem the Rotational Lasso. Experimental results are presented from a synthetic dataset.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings
Pages3896-3899
Number of pages4
DOIs
StatePublished - 2011
Event36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Prague, Czech Republic
Duration: May 22 2011May 27 2011

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011
Country/TerritoryCzech Republic
CityPrague
Period5/22/115/27/11

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Keywords

  • Orthogonal Procrustes problem
  • estimation
  • gradient methods
  • planar rotations
  • sparsity

Fingerprint

Dive into the research topics of 'The Rotational Lasso'. Together they form a unique fingerprint.

Cite this