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

Discrete-time Fourier transform01:26

Discrete-time Fourier transform

1.1K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
1.1K
Basic Discrete Time Signals01:16

Basic Discrete Time Signals

741
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
741
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

719
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
719
BIBO stability of continuous and discrete -time systems01:24

BIBO stability of continuous and discrete -time systems

946
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
946
The Extracellular Matrix01:42

The Extracellular Matrix

89.4K
Overview
89.4K
Fischer Projections02:18

Fischer Projections

16.7K
Learning to draw Fischer projections of molecules and understanding their relevance plays a crucial role in the visual depiction of organic molecules. A Fischer projection is a two-dimensional projection on a planar surface to simplify the three-dimensional wedge–dash representation of molecules. This is especially helpful in the case of molecules with multiple chiral centers that can be difficult to draw. Here, all the bonds of interest are represented as horizontal or vertical lines. While...
16.7K

You might also read

Related Articles

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

Sort by
Same author

Self-supervised semantic graph propagation for multi-view clustering.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

Tensorized anchor alignment for incomplete multi-view clustering.

Neural networks : the official journal of the International Neural Network Society·2025
Same author

Beyond Euclidean Structures: Collaborative Topological Graph Learning for Multiview Clustering.

IEEE transactions on neural networks and learning systems·2025
Same author

Two-step graph propagation for incomplete multi-view clustering.

Neural networks : the official journal of the International Neural Network Society·2024
Same author

Self-paced regularized adaptive multi-view unsupervised feature selection.

Neural networks : the official journal of the International Neural Network Society·2024
Same author

Distributed Neurodynamic Models for Solving a Class of System of Nonlinear Equations.

IEEE transactions on neural networks and learning systems·2023
Same journal

Dynamic analysis and reliable mechanical optimization application of ring HNN effected with a memristive neuron.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

DAFF-Net: A detection and search method for small-scale low surface brightness galaxies.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Quasi-synchronization for complex networks with hybrid pinning intermittent control.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Physics-encoded convolutional neural operators for parametric PDEs: A convergence-guaranteed framework via pre-computed kernel fields.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Exploiting audio-visual modalities in videos: Object detection via multi-stage bilateral coupling network.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

Reliability-aware modality completion with cross-modal distillation for federated learning with missing modalities.

Neural networks : the official journal of the International Neural Network Society·2026
See all related articles

Related Experiment Video

Updated: Feb 12, 2026

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

10.0K

A nonnegative matrix factorization algorithm based on a discrete-time projection neural network.

Hangjun Che1, Jun Wang1

  • 1Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Hong Kong; Shenzhen Research Institute, City University of Hong Kong, Shenzhen, China.

Neural Networks : the Official Journal of the International Neural Network Society
|April 12, 2018
PubMed
Summary
This summary is machine-generated.

This study introduces a novel algorithm for nonnegative matrix factorization using biconvex optimization. The method ensures iterative objective function reduction for improved partial optima in factorization tasks.

Keywords:
Biconvex optimizationDiscrete-time projection neural networkNonnegative matrix factorization

More Related Videos

Real-time Video Projection in an MRI for Characterization of Neural Correlates Associated with Mirror Therapy for Phantom Limb Pain
11:29

Real-time Video Projection in an MRI for Characterization of Neural Correlates Associated with Mirror Therapy for Phantom Limb Pain

Published on: April 20, 2019

10.4K
Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

1.1K

Related Experiment Videos

Last Updated: Feb 12, 2026

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

10.0K
Real-time Video Projection in an MRI for Characterization of Neural Correlates Associated with Mirror Therapy for Phantom Limb Pain
11:29

Real-time Video Projection in an MRI for Characterization of Neural Correlates Associated with Mirror Therapy for Phantom Limb Pain

Published on: April 20, 2019

10.4K
Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

1.1K

Area of Science:

  • Optimization
  • Machine Learning
  • Neural Networks

Background:

  • Nonnegative matrix factorization (NMF) is a crucial dimensionality reduction technique.
  • Existing NMF algorithms face challenges in convergence and efficiency.
  • Biconvex optimization offers a promising framework for NMF problems.

Purpose of the Study:

  • To develop an efficient and stable algorithm for nonnegative matrix factorization.
  • To leverage biconvex optimization for improved NMF performance.
  • To introduce a discrete-time projection neural network for NMF.

Main Methods:

  • A biconvex optimization formulation for NMF is presented.
  • A discrete-time projection neural network is introduced with a derived step-size upper bound for stability.
  • A backtracking step-size adaptation is integrated into the algorithm.
  • The algorithm's convergence properties are theoretically analyzed.

Main Results:

  • The proposed algorithm iteratively reduces the objective function value.
  • Guaranteed convergence to a partial optimum of the biconvex problem is demonstrated.
  • Experimental results on diverse datasets validate the algorithm's efficacy.
  • The discrete-time projection neural network ensures stable operation.

Conclusions:

  • The developed algorithm provides an effective approach to nonnegative matrix factorization.
  • The biconvex optimization formulation combined with the neural network enhances NMF performance.
  • The algorithm offers a stable and efficient method for achieving partial optima in NMF.