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

Long-patch Base Excision Repair01:02

Long-patch Base Excision Repair

Since the discovery of the two BER pathways, there has been a debate about how a cell chooses one pathway over the other and the factors determining this selection. Numerous in vitro experiments have pointed out multiple determinants for the sub-pathway selection. These are:
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...
Patch Clamp01:18

Patch Clamp

Many fundamental cell functions such as muscle contraction and nerve transmission rely on the electrical signals produced by the movement of positively and negatively charged ions across the cell membrane. One competent method to record current flowing across the whole cell or single ion channel is the patch-clamp technique.
In this method, a glass micropipette containing electrolyte solution is tightly sealed against a small portion of the cell membrane. As a result, a patch of the cell...

You might also read

Related Articles

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

Sort by
Same author

Characterization and employment of novel α-ketoglutarate dependent oxygenases for efficient synthesis of antifungal alkyl citrates.

Bioresource technology·2025
Same author

Doublesex and GATAβ4 synergistically regulate the sex-dimorphic expression of storage protein 1 in Bombyx mori.

PLoS genetics·2025
Same author

The novel synbiotic (Lactiplantibacillus plantarum and galacto-oligosaccharides) ameliorates obesity-related metabolic dysfunction: Arginine as a key mediator signaling molecule.

Journal of advanced research·2025
Same author

Lycopene regulates intestinal dysmotility and behavioral disorders by regulating enteric neurons and the cholinergic system.

Food & function·2025
Same author

IllumiDiff: Indoor Illumination Estimation From a Single Image With Diffusion Model.

IEEE transactions on visualization and computer graphics·2025
Same author

Portrait Shadow Removal Using Context-aware Illumination Restoration Network.

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

MesoSplats: Texture Synthesis with Gaussian Splatting.

IEEE transactions on visualization and computer graphics·2026
Same journal

GLLA: A Unified Force-Directed Graph Layout Framework Supporting Local Adjustments.

IEEE transactions on visualization and computer graphics·2026
Same journal

Multi-Perception Crowd: Learning to combine entity and implicit perception for diverse crowd simulation.

IEEE transactions on visualization and computer graphics·2026
Same journal

Hiding in Plain Sight: Camouflaging Real-world Objects.

IEEE transactions on visualization and computer graphics·2026
Same journal

RTF2Mesh: Restricted Tangent Face Based Mesh Compression With Neural Displacement Fields.

IEEE transactions on visualization and computer graphics·2026
Same journal

Practical Occluder Generation for Mobile Games.

IEEE transactions on visualization and computer graphics·2026
See all related articles

Related Experiment Video

Updated: Jun 1, 2026

A Nonsequencing Approach for the Rapid Detection of RNA Editing
08:50

A Nonsequencing Approach for the Rapid Detection of RNA Editing

Published on: April 21, 2022

Fast exact nearest patch matching for patch-based image editing and processing.

Chunxia Xiao1, Meng Liu, Yongwei Nie

  • 1Computer School, Wuhan University, Wuhan, Hubei, China. 430072. cxxiao@whu.edu.cn

IEEE Transactions on Visualization and Computer Graphics
|June 11, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces an efficient exact nearest patch matching algorithm for accurate image analysis. It significantly improves speed and accuracy over traditional methods by optimizing patch comparisons.

More Related Videos

Application of Automated Image-guided Patch Clamp for the Study of Neurons in Brain Slices
09:05

Application of Automated Image-guided Patch Clamp for the Study of Neurons in Brain Slices

Published on: July 31, 2017

Related Experiment Videos

Last Updated: Jun 1, 2026

A Nonsequencing Approach for the Rapid Detection of RNA Editing
08:50

A Nonsequencing Approach for the Rapid Detection of RNA Editing

Published on: April 21, 2022

Application of Automated Image-guided Patch Clamp for the Study of Neurons in Brain Slices
09:05

Application of Automated Image-guided Patch Clamp for the Study of Neurons in Brain Slices

Published on: July 31, 2017

Area of Science:

  • Computer Vision
  • Image Processing
  • Computational Geometry

Background:

  • Traditional nearest patch matching often yields approximate results.
  • Existing methods do not fully leverage sequential patch overlaps.
  • Hierarchical data structures like kd-trees can be inefficient for exact matching.

Purpose of the Study:

  • To develop an efficient exact nearest patch matching algorithm.
  • To improve accuracy and speed in finding similar patch-pairs.
  • To enable real-time image and video editing applications.

Main Methods:

  • Eliminates redundant similarity computations by exploiting sequential patch overlap.
  • Employs a brute-force approach optimized for linear time complexity relative to patch size.
  • Leverages multicore graphics hardware for significant acceleration (≥10×).

Main Results:

  • Achieves exact nearest patch matching with improved speed.
  • Demonstrates linear time complexity on patch size, outperforming approximate methods.
  • Achieves a speedup of at least an order of magnitude on modern hardware.

Conclusions:

  • The proposed algorithm is the fastest known exact nearest patch matching method for high-dimensional data.
  • Offers minimal extra memory requirements.
  • Suitable for interactive editing of images and videos due to its efficiency.