Related Experiment Video
Updated: May 27, 2026

Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Constrained Nonnegative Matrix Factorization for Image Representation
Haifeng Liu1, Zhaohui Wu, Xuelong Li
1College of Computer Science, Zhejiang University, 38 ZheDa Road, Hangzhou, Zhejiang 310027, China. haifengliu@zju.edu.cn
Abstract:
Nonnegative matrix factorization (NMF) is a popular technique for finding parts-based, linear representations of nonnegative data. It has been successfully applied in a wide range of applications such as pattern recognition, information retrieval, and computer vision. However, NMF is essentially an unsupervised method and cannot make use of label information. In this paper, we propose a novel semi-supervised matrix decomposition method, called Constrained Nonnegative Matrix Factorization (CNMF), which incorporates the label information as additional constraints. Specifically, we show how explicitly combining label information improves the discriminating power of the resulting matrix decomposition. We explore the proposed CNMF method with two cost function formulations and provide the corresponding update solutions for the optimization problems. Empirical experiments demonstrate the effectiveness of our novel algorithm in comparison to the state-of-the-art approaches through a set of evaluations based on real-world applications.
Related Concept Videos
Cartesian Vector Notation
Cartesian Form for Vector Formulation
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Application of Nonlinear Inequalities
Gaussian Elimination: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...