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

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

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka 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...
Extraction: Partition and Distribution Coefficients01:14

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...
Vector Algebra: Method of Components01:08

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...
Sampling Methods: Overview01:06

Sampling Methods: Overview

A sample refers to a smaller subset representative of a larger population. In analytical chemistry, studying or analyzing an entire population is often impractical or impossible. Therefore, samples are used to draw inferences and generalize the whole population. The sampling method selects individuals or items from a population to create a sample. Standard sampling methods include random, judgemental, systematic, stratified, and cluster sampling. 
In analytical chemistry, the choice of sampling...
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.
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

You might also read

Related Articles

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

Sort by
Same author

EDSF-Net : An enhanced dynamic spatiotemporal-frequency attention network for robust EEG decoding in motor imagery.

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

Breaking the Depth Barrier in Motor Imagery Classification via a Residual Depthwise-Separable Network.

IEEE transactions on cybernetics·2026
Same author

Enhancing Target Recognition Performance in SSVEP-Based Brain-Computer Interfaces via Deep Neural Networks With Pyramid Squeeze Attention.

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

BR-SFDA: A Source-Target Bidirectional Refined SFDA for Privacy Preserving EEG-based BCIs.

IEEE journal of biomedical and health informatics·2026
Same author

Enhancing the Capability and Accuracy of Motor Imagery Classification: A Deep Neural Network-Powered Multifaceted Strategy Model.

IEEE transactions on cybernetics·2026
Same author

TBMSCCN: Two-Branch Multi-Scale Convolutional Correlation Network for Steady-State Visual Evoked Potential Classification.

IEEE transactions on bio-medical engineering·2026

Related Experiment Video

Updated: Jun 20, 2026

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
08:45

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

Estimation of sparse nonnegative sources from noisy overcomplete mixtures using MAP.

Cesar F Caiafa1, Andrzej Cichocki

  • 1LABSP, RIKEN Brain Science Institute, Wako, Saitama 351-0198, Japan. ccaiafa@brain.riken.jp

Neural Computation
|September 22, 2009
PubMed
Summary

This study introduces a novel Bayesian algorithm for sparse nonnegative source estimation from noisy linear mixtures. The method effectively recovers highly sparse, overlapped sources even in underdetermined, high-noise conditions.

More Related Videos

Cortical Source Analysis of High-Density EEG Recordings in Children
09:32

Cortical Source Analysis of High-Density EEG Recordings in Children

Published on: June 30, 2014

High-Throughput Analysis of Optical Mapping Data Using ElectroMap
07:36

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

Related Experiment Videos

Last Updated: Jun 20, 2026

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
08:45

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

Cortical Source Analysis of High-Density EEG Recordings in Children
09:32

Cortical Source Analysis of High-Density EEG Recordings in Children

Published on: June 30, 2014

High-Throughput Analysis of Optical Mapping Data Using ElectroMap
07:36

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

Area of Science:

  • Signal Processing
  • Statistical Inference
  • Machine Learning

Background:

  • Estimating sparse nonnegative sources from noisy linear mixtures is challenging, especially in underdetermined cases (more sources than sensors) and high noise levels.
  • Existing methods like Independent Component Analysis (ICA), Non-negative Matrix Factorization (NMF), FOCUSS, and sparse representation often struggle with severe noise and underdetermined scenarios.

Purpose of the Study:

  • To propose a new Bayesian algorithm for robust sparse nonnegative source estimation.
  • To address challenging scenarios including high noise and underdetermined systems.
  • To demonstrate the recovery of highly sparse and overlapped sources even with low signal-to-noise ratios and fewer sensors than sources.

Main Methods:

  • A Bayesian approach modeling sparse signals using mixed-state random variables with l(0) norm-based priors.
  • Development of an algorithm for non-overlapped (1-sparse) sources, simplifying posterior maximum search.
  • Recursive derivation of algorithms for overlapped (2-sparse and k-sparse) sources.
  • Integration of the proposed MAP algorithm with NN-KSVD for blind simultaneous estimation of mixing matrix and sources.

Main Results:

  • The algorithm demonstrates effective recovery of sparse nonnegative sources under high noise and underdetermined conditions.
  • Theoretical analysis shows strong connections to existing sparse signal recovery techniques.
  • Successful recovery of overlapped sources is achieved even with very low signal-to-noise ratios.
  • Simulations confirm the algorithm's strong performance in various challenging scenarios.

Conclusions:

  • The proposed Bayesian algorithm offers a robust solution for sparse nonnegative source estimation in difficult environments.
  • The method advances sparse signal recovery by effectively handling underdetermined systems and low signal-to-noise ratios.
  • The recursive approach and combination with NN-KSVD provide flexible and powerful tools for blind source separation.