Recovering one Missing Element at a Time in SFM under Occlusion

Jia Zhuo Wang

doi:10.4028/www.scientific.net/KEM.439-440.664

Paper Titles

Genetic Algorithm Based on Chaos Optimization
p.641

Research on the Intelligent Quality Management System of Supply Chains Based on Six Sigma Theory
p.646

Digital Watermarking System Design and Implementation Based on LSB Algorithm
p.652

Fault Diagnosis of Rotating Machinery Based on Empirical Mode Decomposition and Fractal Feature Parameter Classification
p.658

Recovering one Missing Element at a Time in SFM under Occlusion
p.664

The Research on Tikhonov Regularization Algorithm in Airborne Gravity Data Downward Continuation
p.674

Forecasting Volatility in Financial Markets
p.679

Fractal Properties of Financial Time Series
p.683

A Type of Customer Acquisition and Retaining Policy
p.688

HomeKey Engineering MaterialsKey Engineering Materials Vols. 439-440Recovering one Missing Element at a Time in SFM...

Recovering one Missing Element at a Time in SFM under Occlusion

Abstract:

When there is occlusion, the measurement matrix collecting trajectories of features points in SFM would be incomplete. In this paper, we have presented a method to recover missing elements in an incomplete measurement matrix one by one. We also discussed the concept of Relevance between a target missing element and its relevant known elements, and a measurement matrix transformation process, utilizing in determining the order of the recovery of missing elements. Experiments on both synthetic and real data showed that our method work efficiently.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Pages:

664-673

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.439-440.664

Citation:

Cite this paper

Online since:

June 2010

Authors:

Jia Zhuo Wang

Keywords:

Matrix Completion, Matrix Factorization, Missing Data Recovery, Occlusion, SFM

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Golub, G.H., & Loan, C.F.V., Matrix computation, 3rd ed., Baltimore: Johns Hopkins Press (1996).

Google Scholar

[2] Shum, H., Ikeuchi, K., & Reddy, R.: Principal component analysis with missing data and its application to polyhedral object modeling, IEEE Transactions on Pattern Analysis and machine Intelligence, 17(9), pp.854-876 (1995).

DOI: 10.1109/34.406651

Google Scholar

[3] Okatani, T., & Deguchi, K.: On the Wiberg algorithm for matrix factorization in the presence of missing components, International Journal of Computer Vision, 72(2), pp.329-337 (2006).

DOI: 10.1007/s11263-006-9785-5

Google Scholar

[4] Jacobs, D.: Linear fitting with missing data for structure from motion, Computer Vision and Image Understanding, 82, pp.57-81 (2001).

DOI: 10.1006/cviu.2001.0906

Google Scholar

[5] Buchanan, A.M., & Fitzgibbon, A.W.: Damped ewton algorithms for matrix factorization with missing data, In Proc. IEEE computer vision and pattern recognition (2005).

DOI: 10.1109/cvpr.2005.118

Google Scholar

[6] Pei Chen: Optimization Algorithms on Subspaces: Revisiting Missing data Problem in Low-Rank Matrix, International Journal of Computer Vision, 80, pp.125-142 (2008).

DOI: 10.1007/s11263-008-0135-7

Google Scholar

[7] Aeron Buchanan Morgan: Investigation into Matrix Factorization when Elements are Unknown, University of Oxford, Technical Report (2004).

Google Scholar

[8] Pedro M. Q. Aguiar, Marko Stosic: Spectrally Optimal Factorization of Incomplete Matrices, In Proc. Of CVPR (2008).

Google Scholar