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

IR Frequency Region: Fingerprint Region01:03

IR Frequency Region: Fingerprint Region

IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the C=O, C=N, and C=C occur between 1600–1850 cm−1.
The...
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
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...
Transformations of Functions I01:29

Transformations of Functions I

A function's graph can be modified by changing its position or size without altering its overall shape. These transformations allow the graph to be moved across the coordinate plane while preserving its pattern and structure. One of the most common transformations is shifting, which repositions the graph without distorting it.When the output of a function is adjusted by adding or subtracting a constant, the graph shifts vertically. A positive value moves the graph upward, while a negative value...
Transformations of Functions III01:20

Transformations of Functions III

Transformations modify the graphical representation of a function without changing its fundamental form. One common transformation is reflection, which flips the graph across a designated axis. When the vertical coordinates of all points are multiplied by the negative one, the entire graph is mirrored over the horizontal axis. This transformation reverses the vertical orientation of peaks and troughs, akin to signal inversion in electrical systems, where a waveform is flipped, but the timing of...

You might also read

Related Articles

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

Sort by
Same author

De-coherent parallel laser processing of ultradense nanopores for high-density, large-area 3D optical phase encoding.

Nature communications·2026
Same author

Synthesis of phospholipid vesicles using an electrokinetic turbulent microreactor.

Lab on a chip·2025
Same author

Unveiling Nonlinear Modes of Induced-Charge Electro-Osmosis in AC Electric Fields.

Langmuir : the ACS journal of surfaces and colloids·2025
Same author

A Discussion on the Critical Electric Rayleigh Number for AC Electrokinetic Flow of Binary Fluids in a Divergent Microchannel.

Langmuir : the ACS journal of surfaces and colloids·2025
Same author

From Chips-in-Lab to Point-of-Care Live Cell Device: Development of a Microfluidic Device for On-Site Cell Culture and High-Throughput Drug Screening.

ACS biomaterials science & engineering·2024
Same author

A Multi-Drug Concentration Gradient Mixing Chip: A Novel Platform for High-Throughput Drug Combination Screening.

Biosensors·2024
Same journal

RETRACTED: Zhang et al. A Novel Framework for Reconstruction and Imaging of Target Scattering Centers via Wide-Angle Incidence in Radar Networks. <i>Sensors</i> 2025, <i>25</i>, 6802.

Sensors (Basel, Switzerland)·2026
Same journal

Enhancing Unsupervised Multi-Source Domain Adaptation for Person Re-Identification via Mixture of Experts and Graph-Based Relation.

Sensors (Basel, Switzerland)·2026
Same journal

Development of an Instrumented Glove for Palmar Pressure Assessment in Kayakers.

Sensors (Basel, Switzerland)·2026
Same journal

Development and Experimental Validation of an Autonomous IoT-Based Monitoring System for Real-Time Water Quality Assessment in the Amazon River.

Sensors (Basel, Switzerland)·2026
Same journal

Semi-Supervised Adversarial Learning Framework for Controller Area Network Bus Intrusion Detection.

Sensors (Basel, Switzerland)·2026
Same journal

Smart Optimization Method for Safety Signs in Innovative Manufacturing Environments Integrating Industrial Field IoT Sensors and Knowledge Graphs.

Sensors (Basel, Switzerland)·2026
See all related articles

Related Experiment Video

Updated: Jun 20, 2026

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy iPALM
11:57

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy iPALM

Published on: December 1, 2016

10.7K

Local-Peak Scale-Invariant Feature Transform for Fast and Random Image Stitching.

Hao Li1, Lipo Wang2, Tianyun Zhao3

  • 1State Key Laboratory of Photon-Technology in Western China Energy, International Collaborative Center on Photoelectric Technology and Nano Functional Materials, Institute of Photonics & Photon Technology, Northwest University, Xi'an 710127, China.

Sensors (Basel, Switzerland)
|September 14, 2024
PubMed
Summary
This summary is machine-generated.

A new fast feature point detection algorithm, local-peak scale-invariant feature transform (LP-SIFT), significantly speeds up image stitching. This method offers comparable or better results than existing techniques for creating wide field-of-view images.

Keywords:
LP-SIFTimage mosaicimage stitching

More Related Videos

Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.4K
Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing
06:25

Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing

Published on: February 23, 2024

548

Related Experiment Videos

Last Updated: Jun 20, 2026

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy iPALM
11:57

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy iPALM

Published on: December 1, 2016

10.7K
Quantifying Intermembrane Distances with Serial Image Dilations
07:45

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

6.4K
Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing
06:25

Author Spotlight: Assessment of Visual Acuity in Central Vision Loss Through Motion-Based Peripheral Vision Testing

Published on: February 23, 2024

548

Area of Science:

  • Computer Vision
  • Image Processing
  • Computational Geometry

Background:

  • Image stitching creates wide field-of-view images with high resolution.
  • Conventional stitching methods are computationally expensive, especially for large raw images.
  • Deep learning methods offer alternatives but can be complex.

Purpose of the Study:

  • To develop a computationally efficient image stitching algorithm.
  • To improve stitching speed without sacrificing result quality.
  • To address the limitations of traditional image stitching techniques.

Main Methods:

  • Developed a fast feature point detection algorithm: local-peak scale-invariant feature transform (LP-SIFT).
  • LP-SIFT is inspired by the multiscale features of fluid turbulence.
  • Combined LP-SIFT with RANSAC for robust image stitching.

Main Results:

  • LP-SIFT improved stitching speed by orders of magnitude compared to the original SIFT method.
  • Achieved comparable or better stitching results than other common algorithms.
  • Successfully stitched nine large images (2600x1600 pixels) in under 159 seconds.

Conclusions:

  • LP-SIFT offers a significant speed improvement for image stitching.
  • The algorithm provides practical solutions for applications needing wide field-of-view imaging.
  • LP-SIFT is suitable for diverse applications like terrain mapping and biological analysis.