Jove
Visualize
Contact Us

Related Concept Videos

Calibration Curves: Linear Least Squares01:20

Calibration Curves: Linear Least Squares

A calibration curve is a plot of the instrument's response against a series of known concentrations of a substance. This curve is used to set the instrument response levels, using the substance and its concentrations as standards. Alternatively, or additionally, an equation is fitted to the calibration curve plot and subsequently used to calculate the unknown concentrations of other samples reliably.
For data that follow a straight line, the standard method for fitting is the linear...
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...
Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
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...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...

You might also read

Related Articles

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

Sort by
Same author

Psychometric properties of the Chinese version of 21-item Fall Risk Index for community-dwelling older adults with stroke.

European journal of physical and rehabilitation medicine·2025
Same author

Pixel adaptive deep-unfolding neural network with state space model for image deraining.

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

Analysis and Application of Matrix-Form Neural Networks for Fast Matrix-Variable Convex Optimization.

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

Two Recurrent Neural Networks With Reduced Model Complexity for Constrained l₁-Norm Optimization.

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

Effective Blind Image Deblurring Using Matrix-Variable Optimization.

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

Matrix-Form Neural Networks for Complex-Variable Basis Pursuit Problem With Application to Sparse Signal Reconstruction.

IEEE transactions on cybernetics·2021
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
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 Experiment Video

Updated: Jul 7, 2026

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Neural data fusion algorithms based on a linearly constrained least square method.

Youshen Xia1, H Leung, E Bosse

  • 1Dept. of Electr. and Comput. Eng., Calgary Univ., Alta.

IEEE Transactions on Neural Networks
|February 5, 2008
PubMed
Summary
This summary is machine-generated.

Two novel neural data fusion algorithms enhance data integration by addressing issues in the linearly constrained least square method. These algorithms offer unbiased statistical properties and improved solution quality for image and signal fusion tasks.

Related Experiment Videos

Last Updated: Jul 7, 2026

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Area of Science:

  • Computational neuroscience
  • Signal processing
  • Machine learning

Background:

  • The linearly constrained least square (LCLS) method is widely used for data fusion but faces challenges with ill-conditioned or singular sample covariance matrices.
  • Existing fusion methods often require prior knowledge of noise covariance, limiting their applicability.

Purpose of the Study:

  • To introduce two novel neural network-based data fusion algorithms.
  • To overcome the limitations of the LCLS method, particularly concerning the sample covariance matrix.
  • To develop fusion algorithms with unbiased statistical properties and without requiring a priori noise covariance knowledge.

Main Methods:

  • Development of two neural network algorithms built upon the LCLS framework.
  • Implementation strategies suitable for both software and hardware.
  • Analysis of convergence properties for singular and nonsingular sample covariance matrices.

Main Results:

  • The proposed neural fusion algorithms demonstrate global convergence to optimal solutions, even with singular sample covariance matrices.
  • For nonsingular matrices, the algorithms exhibit exponential convergence rates.
  • The methods provide unbiased statistical properties and do not necessitate prior noise covariance information.
  • Significant enhancement in solution quality was observed when applied to image and signal fusion.

Conclusions:

  • The novel neural data fusion algorithms effectively address the limitations of traditional LCLS methods.
  • These algorithms offer robust performance, global convergence, and improved solution quality in data fusion applications.
  • The developed techniques are versatile, suitable for both software and hardware implementations, and advance the field of neural data fusion.