This paper presents a sparse approach of solving the onesided 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.
Alexander Lorbert, Peter J. Ramadge