Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

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...
Gaussian Elimination: Problem Solving01:30

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...
Linearization and Approximation01:26

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...
Quadratic Models01:23

Quadratic Models

Quadratic models are mathematical representations used to describe relationships in which the rate of change changes at a constant rate. These models appear in a wide variety of natural and engineered systems, especially those involving motion, forces, and optimization. One common application is analyzing the vertical motion of objects influenced by gravity, such as a ball thrown into the air.In such scenarios, the object's height changes over time in a curved pattern, rising to a maximum point...
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
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.

You might also read

Related Articles

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

Sort by
Same author

Low-Temperature Triggered Shape Transformation of Liquid Metal Microdroplets.

ACS applied materials & interfaces·2020
Same author

Survival Benefit of Metformin Use for Pancreatic Cancer Patients Who Underwent Pancreatectomy: Results From a Meta-Analysis.

Frontiers in medicine·2020
Same author

Organohalogen compounds of emerging concern in Baltic Sea biota: Levels, biomagnification potential and comparisons with legacy contaminants.

Environment international·2020
Same author

Water-Soluble Anthraquinone Photocatalysts Enable Methanol-Driven Enzymatic Halogenation and Hydroxylation Reactions.

ACS catalysis·2020
Same author

Integrated sequencing and array comparative genomic hybridization in familial Parkinson disease.

Neurology. Genetics·2020
Same author

Treatment for tuberculosis of the subaxial cervical spine: a systematic review.

Archives of orthopaedic and trauma surgery·2020
Same journal

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

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

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

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

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

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

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

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

DiffRES: Unleashing Text-to-Image Diffusion Models for Generative Referring Expression Segmentation without Information Leakage.

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

Location Matters: Frequency-Spatial Dual Space Adaptation for Cross-Domain Few-Shot Segmentation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Videos

Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

Naiyang Guan1, Dacheng Tao, Zhigang Luo

  • 1School of Computer Science, National University of Defense Technology, Changsha, China. ny_guan@nudt.edu.cn

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|January 15, 2011
PubMed
Summary
This summary is machine-generated.

Manifold Regularized Discriminative Nonnegative Matrix Factorization (MD-NMF) enhances data representation by incorporating local geometry and class information. A fast gradient descent (FGD) optimization method significantly speeds up convergence compared to traditional multiplicative update rules.

Related Experiment Videos

Area of Science:

  • Computer Vision
  • Machine Learning
  • Data Science

Background:

  • Nonnegative Matrix Factorization (NMF) is a popular data representation technique, particularly in image processing and pattern recognition.
  • NMF's parts-based representation aligns with human intuition but often overlooks local data geometry and class-discriminative information for classification tasks.
  • Existing NMF methods lack explicit constraints, leading to representations that are not necessarily parts-based.

Purpose of the Study:

  • To introduce manifold regularization and margin maximization into NMF to create Manifold Regularized Discriminative NMF (MD-NMF).
  • To address the limitations of standard NMF in capturing local geometry and discriminative class information.
  • To develop a faster optimization algorithm for MD-NMF and NMF variants.

Main Methods:

  • Developed MD-NMF by integrating manifold regularization and margin maximization into the NMF framework.
  • Proposed a Fast Gradient Descent (FGD) optimization method for MD-NMF, featuring a Newton method for optimal step length search.
  • Demonstrated that FGD converges significantly faster than the traditional Multiplicative Update Rule (MUR), with MUR as a special case.

Main Results:

  • MD-NMF effectively incorporates local geometry and discriminative information, overcoming NMF limitations.
  • FGD optimization for MD-NMF showed a substantial speed improvement, converging in 28 seconds versus 282 seconds for MUR on a sample problem.
  • Experimental validation on face image datasets confirmed the effectiveness of MD-NMF and the efficiency of the FGD optimization method.

Conclusions:

  • MD-NMF offers a more robust and discriminative data representation compared to standard NMF.
  • The proposed FGD optimization method provides a significant acceleration for training MD-NMF and other NMF variants.
  • MD-NMF combined with FGD presents a powerful approach for image processing and pattern recognition tasks.