کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
528827 869612 2012 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Conjugate gradient on Grassmann manifolds for robust subspace estimation
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Conjugate gradient on Grassmann manifolds for robust subspace estimation
چکیده انگلیسی

Most geometric computer vision problems involve orthogonality constraints. An important subclass of these problems is subspace estimation, which can be equivalently formulated into an optimization problem on Grassmann manifolds. In this paper, we propose to use the conjugate gradient algorithm on Grassmann manifolds for robust subspace estimation in conjunction with the recently introduced generalized projection based M-Estimator (gpbM). The gpbM method is an elemental subset-based robust estimation algorithm that can process heteroscedastic data without any user intervention. We show that by optimizing the orthogonal parameter matrix on Grassmann manifolds, the performance of the gpbM algorithm improves significantly. Results on synthetic and real data are presented.

Figure optionsDownload high-quality image (205 K)Download as PowerPoint slideHighlights
► The problem of subspace estimation is formulated as an optimization problem over Grassmann manifold.
► Conjugate gradient algorithm is used in conjunction with generalized projection based M-estimator (gpbM).
► Improved performance as compared to the original gpbM algorithm is demonstrated.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Image and Vision Computing - Volume 30, Issues 6–7, June 2012, Pages 417–427
نویسندگان
, ,