Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for k_a Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...

Area Computation by the Alternative Coordinate Method

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Linearization and Approximation

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Reconstruction-Contrast Coupling Learning for Open-Set Semi-Supervised Hyperspectral Image Classification.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026

Same author

ReCoTR: Reducing Semantic Cognitive Shift via Dual-Consensus Token Compression for Remote Sensing Image-Text Retrieval.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026

Same author

Noise fingerprint-based infrared fixed pattern noise removal.

Applied optics·2026

Same author

Preoperative MRI-Guided Freehand Ultrasound Volume Reconstruction.

Chemical & biomedical imaging·2026

Same author

Like Human Rethinking: Contour Transformer AutoRegression for Referring Remote Sensing Interpretation.

IEEE transactions on pattern analysis and machine intelligence·2026

Same author

Facial appearance prediction for orthognathic surgery with diffusion models.

Medical image analysis·2026

Same journal

Strategic Ability Updating in Concurrent Games by Coalitional Commitment.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2015

Same journal

Meta-Analysis of the First Facial Expression Recognition Challenge.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Adjustable model-based fusion method for multispectral and panchromatic images.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Face Feature Weighted Fusion Based on Fuzzy Membership Degree for Video Face Recognition.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

A New Adaptive Fast Cellular Automaton Neighborhood Detection and Rule Identification Algorithm.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Human-arm-and-hand-dynamic model with variability analyses for a stylus-based haptic interface.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

See all related articles

Search research articles

Related Experiment Video

Updated: May 24, 2026

Operation of the Collaborative Composite Manufacturing (CCM) System

Operation of the Collaborative Composite Manufacturing (CCM) System

Published on: October 1, 2019

Robust alternative minimization for matrix completion.

Xiaoqiang Lu¹, Tieliang Gong, Pingkun Yan

¹Center for Optical Imagery Analysis and Learning, State Key Laboratory of Transient Optics and Photonics, Xi’an Institute of Optics and Precision Mechanics, Chinese Academy of Sciences, Xi’an, China. luxq666666@126.com

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|February 21, 2012

Summary

This summary is machine-generated.

A new robust alternative minimization (RAM) algorithm efficiently completes low-rank matrices, reducing reconstruction errors for applications in computer vision and recommendation systems.

Related Experiment Videos

Last Updated: May 24, 2026

Operation of the Collaborative Composite Manufacturing (CCM) System

Operation of the Collaborative Composite Manufacturing (CCM) System

Published on: October 1, 2019

Area of Science:

Computer Science
Data Science
Applied Mathematics

Background:

Matrix completion is crucial in diverse fields like computer vision and recommendation systems.
Existing methods face challenges in efficiency and stability for large-scale problems.

Purpose of the Study:

To introduce a novel algorithm, robust alternative minimization (RAM), for low-rank matrix completion.
To enhance the accuracy and efficiency of matrix recovery.

Main Methods:

Developed the robust alternative minimization (RAM) algorithm based on low-rank constraints.
Established the convergence properties of the RAM algorithm.
Evaluated performance against existing matrix completion methods.

Main Results:

The RAM algorithm significantly reduces relative reconstruction error.
Demonstrated superior numerical stability and efficiency for large-scale matrix completion.
Achieved competitive recovery accuracy and running times compared to state-of-the-art methods.
Showcased satisfactory performance in low-rank image recovery applications.

Conclusions:

The RAM algorithm offers a robust and efficient solution for low-rank matrix completion.
RAM provides a stable and accurate method for recovering incomplete matrices.
The algorithm shows promise for practical applications in image recovery and other fields.