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

Bandpass Sampling01:17

Bandpass Sampling

In signal processing, bandpass sampling is an effective technique for sampling signals that have most of their energy concentrated within a narrow frequency band. This type of signal is known as a bandpass signal. The key principle of bandpass sampling involves sampling the signal at a rate that is greater than twice the signal's bandwidth to prevent aliasing.
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
Upsampling01:22

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
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.
Difference from Background: Limit of Detection01:05

Difference from Background: Limit of Detection

The limit of detection (LOD) is the smallest amount of analyte that can be distinguished from the background noise. The LOD value corresponds to the concentration at which the analyte signal is three times larger than the standard deviation of the blank signal. Below this value, the analyte signal cannot be differentiated from the background noise. It is calculated by dividing the calibration slope by 3 times the standard deviation of the blank signals.
The LOD indicates the presence or absence...
Sampling Theorem01:15

Sampling Theorem

In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.

You might also read

Related Articles

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

Sort by
Same author

A generative adversarial network incorporating dual attention mechanisms for the segmentation of knee bone and cartilage.

Magma (New York, N.Y.)·2026
Same author

Application of artificial intelligence in lung cancer diagnosis, therapy, and prognosis.

BMC medical genomics·2026
Same author

Development of a nomogram for predicting cancer pain in lung cancer patients: An observational study.

Medicine·2024
Same author

Efficient registration of nonrigid 3-D bodies.

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

Efficient implementation of spatially-varying 3-D ultrasound deconvolution.

IEEE transactions on ultrasonics, ferroelectrics, and frequency control·2011
Same author

Estimation of average speed of sound using deconvolution of medical ultrasound data.

Ultrasound in medicine & biology·2010

Related Experiment Video

Updated: May 16, 2026

AMEBaS: Automatic Midline Extraction and Background Subtraction of Ratiometric Fluorescence Time-Lapses of Polarized Single Cells
06:03

AMEBaS: Automatic Midline Extraction and Background Subtraction of Ratiometric Fluorescence Time-Lapses of Polarized Single Cells

Published on: June 23, 2023

Improved bounds for subband-adaptive iterative shrinkage/thresholding algorithms.

Yingsong Zhang1, Nick Kingsbury

  • 1Department of Engineering, University of Cambridge, Cambridge, UK. yingsong.zhang@ic.ac.uk

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|December 4, 2012
PubMed
Summary
This summary is machine-generated.

New methods for computing step sizes in subband-adaptive iterative shrinkage-thresholding algorithms improve convergence speeds. These techniques enhance wavelet-domain bounds for efficient inverse filtering on large datasets.

Related Experiment Videos

Last Updated: May 16, 2026

AMEBaS: Automatic Midline Extraction and Background Subtraction of Ratiometric Fluorescence Time-Lapses of Polarized Single Cells
06:03

AMEBaS: Automatic Midline Extraction and Background Subtraction of Ratiometric Fluorescence Time-Lapses of Polarized Single Cells

Published on: June 23, 2023

Area of Science:

  • Signal Processing
  • Numerical Analysis
  • Wavelet Theory

Background:

  • Subband-adaptive iterative shrinkage-thresholding algorithms are crucial for signal processing tasks.
  • Existing methods for computing step sizes can limit convergence speed and applicability.
  • Efficient inverse filtering of large datasets, including 3D data, remains a challenge.

Purpose of the Study:

  • To introduce novel methods for calculating step sizes in specific adaptive algorithms.
  • To enhance the convergence rates of these iterative shrinkage-thresholding algorithms.
  • To adapt these methods for both non-redundant and redundant wavelet bases.

Main Methods:

  • Developing new techniques to compute optimal step sizes for subband-adaptive algorithms.
  • Deriving tighter bounds for the system matrix in the wavelet domain.
  • Adapting the methods for redundant frames and exploring practical simplifications like ignoring subband aliasing.

Main Results:

  • The proposed methods yield tighter wavelet-domain bounds, significantly improving convergence speeds.
  • The simplified step size setting, ignoring subband aliasing, proves effective in practice.
  • The algorithms are suitable for large-scale inverse filtering due to diagonal matrix inversions and fast transforms.

Conclusions:

  • The new step size computation methods offer enhanced performance for subband-adaptive iterative shrinkage-thresholding algorithms.
  • These algorithms are computationally efficient and well-suited for processing very large datasets.
  • The work provides practical improvements for inverse filtering applications in signal processing.