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

Fixed Action Patterns01:06

Fixed Action Patterns

A fixed action pattern (FAP) is a specific, hard-wired sequence of behaviors that occurs in response to an external stimulus, called a sign stimulus. The behavior is “fixed” because it is essentially unchangeable—proceeding similarly across individuals of a species every time it occurs.
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
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...
Signal Sequences and Sorting Receptors01:41

Signal Sequences and Sorting Receptors

Signal sequences are short amino acid sequences that guide newly synthesized proteins to their proper location within the cell. Classical signal sequences are fifteen to sixty amino acids long and present at the N-terminus of a polypeptide chain. Each signal sequence has a conserved segment of basic residues towards their N terminus, a hydrophobic core, and a C-terminus rich in polar residues. The C-terminus also contains a signal cleavage site and features a -3 -1 sequence motif. The -3-1...
Sieve Analysis and Grading Curves01:19

Sieve Analysis and Grading Curves

Sieve analysis is a method used to determine the particle size distribution of aggregate materials. This process involves the following steps:

You might also read

Related Articles

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

Sort by
Same author

Improving protein and protein interactions using pseudo-dimers derived from monomeric proteins.

Nature communications·2026
Same author

CRA5 a high-fidelity compressed reanalysis atmospheric dataset for weather and climate research.

Scientific data·2026
Same author

CrystalX: High-Accuracy Crystal Structure Analysis Using Deep Learning.

Journal of the American Chemical Society·2026
Same author

Evidential deep learning for interatomic potentials.

Nature communications·2025
Same author

Glasses-free 3D display with ultrawide viewing range using deep learning.

Nature·2025
Same author

TripoSG: High-Fidelity 3D Shape Synthesis Using Large-Scale Rectified Flow Models.

IEEE transactions on pattern analysis and machine intelligence·2025
Same journal

Change-Prior-Guided Unsupervised Change Detection of Heterogeneous Remote Sensing Images.

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

AgonicDreamer: Enhancing Multi-View Consistency in Text-to-3D Generation via Rectified Score Distillation.

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

BiCM-Prompt: Bidirectional Cross-Modal Prompt Tuning for Class-Incremental Learning on Multisource Remote Sensing Images.

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

GoP-based Quality Enhancement on Video Compression.

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

Align then Tensorize: Multi-Level Consistent Anchor Graph Learning for Scalable Multi-View Clustering.

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

Beyond Fidelity: Diverse Image Synthesis via Retrieval-Augmented Diffusion.

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

Related Experiment Video

Updated: May 15, 2026

Automated Analysis of C. elegans Fluorescence Images using SegElegans
06:27

Automated Analysis of C. elegans Fluorescence Images using SegElegans

Published on: October 10, 2025

Segmented gray-code kernels for fast pattern matching.

Wanli Ouyang1, Renqi Zhang, Wai-Kuen Cham

  • 1Chinese University of Hong Kong, Hong Kong. wlouyang@ee.cuhk.edu.hk

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

The new G4-GCK algorithm speeds up gray-code kernel computations for efficient image analysis. Segmented GCK further enhances this, significantly accelerating pattern matching performance.

More Related Videos

Pattern-based Search of Epigenomic Data Using GeNemo
06:38

Pattern-based Search of Epigenomic Data Using GeNemo

Published on: October 8, 2017

Co-culture of Glioblastoma Stem-like Cells on Patterned Neurons to Study Migration and Cellular Interactions
10:08

Co-culture of Glioblastoma Stem-like Cells on Patterned Neurons to Study Migration and Cellular Interactions

Published on: February 24, 2021

Related Experiment Videos

Last Updated: May 15, 2026

Automated Analysis of C. elegans Fluorescence Images using SegElegans
06:27

Automated Analysis of C. elegans Fluorescence Images using SegElegans

Published on: October 10, 2025

Pattern-based Search of Epigenomic Data Using GeNemo
06:38

Pattern-based Search of Epigenomic Data Using GeNemo

Published on: October 8, 2017

Co-culture of Glioblastoma Stem-like Cells on Patterned Neurons to Study Migration and Cellular Interactions
10:08

Co-culture of Glioblastoma Stem-like Cells on Patterned Neurons to Study Migration and Cellular Interactions

Published on: February 24, 2021

Area of Science:

  • Computer Vision
  • Image Processing
  • Algorithm Analysis

Background:

  • Gray-code kernels (GCK) enable efficient image analysis via fast algorithms.
  • GCK, including Walsh Hadamard transform on sliding windows, is effective for pattern matching.

Purpose of the Study:

  • To introduce the G4-GCK algorithm for more efficient GCK computation.
  • To propose the segmented GCK (SegGCK) for further performance improvements.

Main Methods:

  • The G4-GCK algorithm achieves four additions per pixel for three basis vectors, independent of transform size.
  • The SegGCK algorithm segments data into L(s) parts, requiring four additions per pixel for 3L(s) basis vectors.

Main Results:

  • The G4-GCK algorithm demonstrates improved efficiency in computing GCK.
  • The SegGCK algorithm significantly accelerates full-search equivalent pattern matching.
  • Experimental results confirm the proposed algorithms outperform existing state-of-the-art methods.

Conclusions:

  • The G4-GCK and SegGCK algorithms offer substantial speedups for image analysis and pattern matching.
  • These novel algorithms represent a significant advancement in efficient computational methods for GCK.