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

Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Parallel-axis Theorem01:06

Parallel-axis Theorem

The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...
Parallel-Axis Theorem for an Area01:12

Parallel-Axis Theorem for an Area

The moment of inertia is a fundamental concept in mechanical engineering that plays a significant role in designing rotationally symmetric objects such as flywheels, gears, and other mechanical systems. In this context, we will discuss the moment of inertia of a flywheel rotating about its centroidal axis and how it relates to the moment of inertia about an axis parallel to it.
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...
Scalar and Vector Triple Products01:06

Scalar and Vector Triple Products

Two vectors can be multiplied using a scalar product or a vector product. The resultant of a scalar product is scalar, while with vector products, the resultant is a vector. These rules of the scalar or vector product between two vectors can be applied to multiple vectors to obtain meaningful combinations. The scalar triple product is the dot product of a vector with the cross product of two vectors.
The scalar triple product is the dot product of a vector with the cross product of two vectors.

You might also read

Related Articles

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

Sort by
Same author

A VLSI Systolic Architecture for Pattern Clustering.

IEEE transactions on pattern analysis and machine intelligence·2011
Same author

Synthesis and kinetic studies of an amidine-containing phosphonofluoridate: a novel potent inhibitor of trypsin-like enzymes.

Bioorganic & medicinal chemistry·1998
Same author

Synthesis and evaluation of diphenyl phosphonate esters as inhibitors of the trypsin-like granzymes A and K and mast cell tryptase.

Journal of medicinal chemistry·1998
Same author

Homomeric interactions between transmembrane proteins of Moloney murine leukemia virus.

Journal of virology·1996
Same author

Detection of apoptosis and DNA replication by differential labeling of DNA strand breaks with fluorochromes of different color.

Experimental cell research·1996
Same author

Hypertrophic gastropathy in Helicobacter felis-infected wild-type C57BL/6 mice and p53 hemizygous transgenic mice.

Gastroenterology·1996
Same journal

Benchmarking the Robustness of Autonomous Driving to Environmental Illusions: A Lane Perception Perspective.

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

Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation.

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

TraGraph-GS: Trajectory Graph-based Gaussian Splatting for Arbitrary Large-Scale Scene Rendering.

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

SWIFT: A Small-World Interaction Framework for Flow-Aware Trajectory Prediction in Autonomous Driving.

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

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

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

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Video

Updated: May 29, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers.

Z Fang1, X Li, L M Ni

  • 1Department of Computer Science, Wichita State University, Wichita, KS 67208.

IEEE Transactions on Pattern Analysis and Machine Intelligence
|August 27, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces parallel algorithms for image template matching, significantly reducing computation time on SIMD hypercube systems. These advanced methods optimize processing for large images and windows, enhancing efficiency.

More Related Videos

High-throughput Image Analysis of Tumor Spheroids: A User-friendly Software Application to Measure the Size of Spheroids Automatically and Accurately
08:39

High-throughput Image Analysis of Tumor Spheroids: A User-friendly Software Application to Measure the Size of Spheroids Automatically and Accurately

Published on: July 8, 2014

Related Experiment Videos

Last Updated: May 29, 2026

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography
10:14

Chromatographic Fingerprinting by Template Matching for Data Collected by Comprehensive Two-Dimensional Gas Chromatography

Published on: September 2, 2020

High-throughput Image Analysis of Tumor Spheroids: A User-friendly Software Application to Measure the Size of Spheroids Automatically and Accurately
08:39

High-throughput Image Analysis of Tumor Spheroids: A User-friendly Software Application to Measure the Size of Spheroids Automatically and Accurately

Published on: July 8, 2014

Area of Science:

  • Computer Science
  • Parallel Computing
  • Image Processing

Background:

  • Image template matching is crucial for pattern recognition.
  • Serial algorithms are computationally intensive for large datasets.
  • Efficient parallel processing is needed to overcome computational bottlenecks.

Purpose of the Study:

  • To develop and present novel parallel algorithms for image template matching.
  • To analyze the time complexity of these algorithms on SIMD hypercube systems.
  • To demonstrate significant performance improvements over serial approaches.

Main Methods:

  • Implementation of parallel algorithms on a Single Instruction, Multiple Data (SIMD) array processor.
  • Utilizing a hypercube interconnection network for inter-processor communication.
  • Analysis of time complexity for different parallel system configurations (N^2K^2-PE and L^2-PE systems).

Main Results:

  • Achieved reduced time complexity from O(N^2M^2) for serial to O(M^2/K^2 + M * log2 N/K + log2 N * log2 K) or O(N^2M^2/L^2) for parallel algorithms.
  • Demonstrated efficient use of the communication network, minimizing data transmissions.
  • Showcased reduced local memory requirements per processing element (PE).

Conclusions:

  • The proposed parallel algorithms offer substantial speedups for image template matching.
  • Optimized inter-PE communication and reduced memory usage contribute to efficiency.
  • These algorithms are well-suited for high-performance computing environments and large-scale image analysis.