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

Reconstruction of Signal using Interpolation

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...

Residuals and Least-Squares Property

Residuals and Least-Squares Property

The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...

Calibration Curves: Linear Least Squares

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...

Linear Approximation in Time Domain

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...

Linear Approximation in Frequency Domain

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.

Lagrange Multipliers: Two Constraints

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.

You might also read

Related Articles

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

Sort by

Same author

Radial and angular moment invariants for image identification.

IEEE transactions on pattern analysis and machine intelligence·2011

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 15, 2026

Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

Published on: January 30, 2019

Constrained least-squares image restoration: an improved computational scheme.

|March 6, 2010

Summary

This study introduces an efficient computational method for solving Fredholm integral equations, crucial for image restoration. The new technique significantly speeds up iterative solutions for inverse filtering problems.

Area of Science:

Computational Mathematics
Image Processing
Applied Mathematics

Background:

Fredholm integral equations of the first kind are fundamental in inverse problems.
Image restoration and inverse filtering commonly utilize these equations.
Existing methods, such as those by Phillips, Twomey, and Hunt, provide foundational approaches.

Purpose of the Study:

To present an improved computational technique for solving Fredholm integral equations of the first kind.
To enhance the efficiency of iterative solutions in image restoration and inverse filtering.
To offer a faster alternative to existing iterative methods.

Main Methods:

Developing an iterative computational technique based on established works (Phillips, Twomey, Hunt).

Related Experiment Videos

Last Updated: Jun 15, 2026

Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

Measuring the Shape and Size of Activated Sludge Particles Immobilized in Agar with an Open Source Software Pipeline

Published on: January 30, 2019

Analyzing the computational complexity for integral equations representing convolutions.

Comparing the speed of the new technique against Hunt's implementation.

Main Results:

The improved technique solves convolved Fredholm integral equations iteratively.
Each iteration requires O(n) operations, where n is the number of sample points.
The method is approximately (1 + p/4) times faster than Hunt's method for p iterations.

Conclusions:

The presented computational technique offers significant speed improvements for solving Fredholm integral equations.
This advancement is particularly beneficial for image restoration and inverse filtering applications.
Reductions in computation by a factor of 2 to 4 are achievable for typical iteration counts (p=3-12).