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

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
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...
Relative Motion Analysis using Rotating Axes01:25

Relative Motion Analysis using Rotating Axes

Consider a component AB undergoing a linear motion. Along with a linear motion, point B also rotates around point A. To comprehend this complex movement, position vectors for both points A and B are established using a stationary reference frame.
However, to express the relative position of point B relative to point A, an additional frame of reference, denoted as x'y', is necessary. This additional frame not only translates but also rotates relative to the fixed frame, making it instrumental in...

You might also read

Related Articles

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

Sort by
Same author

Negative effects of chemical mutagenesis on the adaptive behavior of vesicular stomatitis virus.

Journal of virology·1997
Same author

Clinical importance of unilaterally enlarging lymph nodes on otherwise normal mammograms.

Radiology·1997
Same author

Angiogenesis and osteogenesis in an orthopedically expanded suture.

American journal of orthodontics and dentofacial orthopedics : official publication of the American Association of Orthodontists, its constituent societies, and the American Board of Orthodontics·1997
Same author

Posttransplantation lymphoproliferative disorders in bone marrow transplant recipients are aggressive diseases with a high incidence of adverse histologic and immunobiologic features.

American journal of clinical pathology·1997
Same author

Erythromycin treatment for gastrointestinal dysmotility in preterm infants.

Journal of paediatrics and child health·1997
Same author

A simple and rapid method for isolation of high quality genomic DNA from fruit trees and conifers using PVP.

Nucleic acids research·1997
Same journal

SinColor: Uncertainty-Guided Single-Step Diffusion for Image Colorization.

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

Through the Looking Glass: A Dual Perspective on Weakly-Supervised Few-Shot Segmentation.

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

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

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

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

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

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

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

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles

Related Experiment Video

Updated: Jul 7, 2026

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

A fast motion estimation algorithm based on the block sum pyramid.

C H Lee1, L H Chen

  • 1Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ., Hsinchu.

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|January 1, 1997
PubMed
Summary
This summary is machine-generated.

A novel block sum pyramid approach significantly speeds up motion estimation. This method reduces computational complexity while maintaining the accuracy of full search block matching algorithms.

Related Experiment Videos

Last Updated: Jul 7, 2026

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

Area of Science:

  • Digital image processing
  • Computer vision

Background:

  • Motion estimation is crucial for video compression and analysis.
  • Traditional methods like full search block matching are computationally intensive.

Purpose of the Study:

  • To present a fast algorithm for motion estimation.
  • To reduce the computational complexity of motion estimation.

Main Methods:

  • The algorithm constructs a sum pyramid structure for image blocks.
  • It employs hierarchical elimination of search positions from the pyramid's top to bottom.
  • Unnecessary search positions are pruned to minimize computation.

Main Results:

  • The block sum pyramid method effectively eliminates redundant search positions.
  • It achieves comparable estimation accuracy to full search block matching.
  • Significant reduction in computation time is observed.

Conclusions:

  • The proposed block sum pyramid approach offers an efficient solution for motion estimation.
  • This method provides a faster alternative to existing algorithms without sacrificing accuracy.