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

Vector Algebra: Method of Components

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

Fundamental Theorem of Algebra

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as: with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...

Partial Fractions

Partial Fractions

A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...

Extraction: Partition and Distribution Coefficients

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...

Inertia Tensor

Inertia Tensor

The concept of the inertia tensor is employed to depict the mass distribution and rotational inertia of a solid or rigid object. This tensor is expressed through a three-by-three matrix. Each component within this matrix corresponds to varying moments of inertia about specific axes.
The diagonal components of the inertia tensor matrix represent the moments of inertia concerning the principal axes of the object. These primary axes are defined as the axes where the object experiences the least...

You might also read

Related Articles

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

Sort by

Same author

Latent alignment in deep learning models for EEG decoding.

Journal of neural engineering·2025

Same author

EEGminer: discovering interpretable features of brain activity with learnable filters.

Journal of neural engineering·2024

Same author

A causal perspective on brainwave modeling for brain-computer interfaces.

Journal of neural engineering·2024

Same author

Inverse Image Frequency for Long-Tailed Image Recognition.

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

Same author

BrainWave-Scattering Net: a lightweight network for EEG-based motor imagery recognition.

Journal of neural engineering·2023

Same author

Redesigning Multi-Scale Neural Network for Crowd Counting.

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

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 26, 2026

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

Discriminant nonnegative tensor factorization algorithms.

Stefanos Zafeiriou¹

¹Imperial College London, Department of Electrical and Electronic Engineering, Communications and Signal Processing Research Group, South Kensington Campus, London SW7 2AZ, UK. s.zafeiriou@imperial.ac.uk

IEEE Transactions on Neural Networks

|January 20, 2009

Summary

This summary is machine-generated.

Nonnegative tensor factorization (NTF) methods are introduced to overcome information loss in nonnegative matrix factorization (NMF) for image analysis. These new NTF approaches show superior performance in face verification and recognition tasks.

More Related Videos

Tracking the Mammary Architectural Features and Detecting Breast Cancer with Magnetic Resonance Diffusion Tensor Imaging

Tracking the Mammary Architectural Features and Detecting Breast Cancer with Magnetic Resonance Diffusion Tensor Imaging

Published on: December 15, 2014

Related Experiment Videos

Last Updated: Jun 26, 2026

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

Tracking the Mammary Architectural Features and Detecting Breast Cancer with Magnetic Resonance Diffusion Tensor Imaging

Tracking the Mammary Architectural Features and Detecting Breast Cancer with Magnetic Resonance Diffusion Tensor Imaging

Published on: December 15, 2014

Area of Science:

Computer Vision
Machine Learning
Pattern Recognition

Background:

Nonnegative matrix factorization (NMF) is effective for image analysis but requires data vectorization, potentially losing local structure.
Nonnegative tensor factorization (NTF) offers a solution by directly processing tensor data, preserving local object structure.

Purpose of the Study:

To introduce novel unsupervised and supervised nonnegative tensor factorization (NTF) methods.
To develop discriminant NTF methods by incorporating constraints for improved feature extraction.
To evaluate the efficacy of proposed NTF methods in face verification and facial expression recognition.

Main Methods:

Extension of existing NMF techniques to arbitrary valence tensors for NTF.
Development of discriminant NTF by integrating classification constraints into tensor decomposition.
Application and comparison of proposed methods against popular subspace approaches.

Main Results:

The proposed unsupervised and supervised NTF methods effectively handle tensor data without information loss from vectorization.
Discriminant NTF methods demonstrate enhanced performance by leveraging classification information.
Experimental results show that the developed NTF approaches outperform existing subspace methods for face verification and facial expression recognition.

Conclusions:

NTF provides a more robust framework than NMF for image analysis tasks involving complex object representations.
Discriminant NTF offers a powerful tool for supervised learning in computer vision, particularly for facial analysis.
The proposed NTF methods represent a significant advancement in image representation and recognition techniques.