NACVOct 3, 2014

Group Orbit Optimization: A Unified Approach to Data Normalization

arXiv:1410.0868v11 citations
Originality Incremental advance
AI Analysis

This work provides a foundational framework for data normalization and matrix decomposition, potentially benefiting researchers in machine learning and numerical analysis, though it appears incremental in unifying existing methods.

The paper tackles the problem of unifying matrix decomposition techniques by proposing Group Orbit Optimization (GOO), which induces methods like SVD and QR decomposition, and extends it to tensor decomposition, with experimental results showing effective recovery from distortions such as shearing and rotation in point cloud data normalization.

In this paper we propose and study an optimization problem over a matrix group orbit that we call \emph{Group Orbit Optimization} (GOO). We prove that GOO can be used to induce matrix decomposition techniques such as singular value decomposition (SVD), LU decomposition, QR decomposition, Schur decomposition and Cholesky decomposition, etc. This gives rise to a unified framework for matrix decomposition and allows us to bridge these matrix decomposition methods. Moreover, we generalize GOO for tensor decomposition. As a concrete application of GOO, we devise a new data decomposition method over a special linear group to normalize point cloud data. Experiment results show that our normalization method is able to obtain recovery well from distortions like shearing, rotation and squeezing.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes