Related Experiment Video
Updated: May 21, 2026

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
Published on: October 28, 2022
Efficient computation of robust weighted low-rank matrix approximations using the L1 norm
Anders Eriksson1, Anton van den Hengel
1Department of Computer Science, The University of Adelaide, North Terrace, SA 5005, Australia. anders.eriksson@adelaide.edu.au
This study introduces a novel low-rank matrix approximation method, a generalization of the Wiberg algorithm, designed to handle outliers and missing data effectively. The new approach minimizes the L1 norm for robust matrix factorization, outperforming traditional methods in practical scenarios.
Area of Science:
- Computer Vision
- Numerical Analysis
- Optimization
Background:
- Low-rank matrix approximation is crucial for many computer vision algorithms.
- Singular Value Decomposition (SVD) is a common method but fails with data outliers or missing values.
- Real-world data frequently contains such imperfections, limiting SVD's applicability.
Purpose of the Study:
- To develop a robust low-rank matrix approximation method adaptable to imperfect data.
- To generalize the Wiberg algorithm for enhanced matrix factorization.
- To minimize the L1 norm in rank-constrained factorization, accommodating missing data.
Main Methods:
- The proposed method generalizes the Wiberg algorithm.
- It formulates rank-constrained factorization minimizing the L1 norm.
- Exploits the differentiability of linear programs for efficient computation.
Main Results:
- The algorithm efficiently handles matrices with outliers and missing elements.
- Experimental results on synthetic and real data demonstrate effectiveness.
- The method is implementable using existing optimization software.
Conclusions:
- The presented algorithm offers a robust alternative to SVD for low-rank approximation.
- It effectively addresses the common challenges of outliers and missing data.
- The approach provides a computationally efficient solution for practical applications.
Related Concept Videos
Application of Linearization and Approximation
Linearization and Approximation
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Weighted Mean
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...