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 Experiment Video

Updated: Jun 19, 2026

Pattern Generation for Micropattern Traction Microscopy
09:26

Pattern Generation for Micropattern Traction Microscopy

Published on: February 17, 2022

Faster graphical models for point-pattern matching.

Tibério S Caetano1, Julian J McAuley

  • 1Statistical Machine Learning Program, NICTA, and the Research School of Information Sciences and Engineering, ANU, Canberra, Australia.

Spatial Vision
|October 10, 2009
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

Velocity and Position by Graphical Method01:34

Velocity and Position by Graphical Method

Velocity and position can be calculated from the known function of acceleration as a function of time. The total area under the acceleration-time graph and the velocity-time graph gives the change in velocity and position, respectively. In the case of an airplane, its acceleration is tracked using the inertial navigation system. The pilot provides the input of the airplane's initial position and velocity before takeoff. The inertial navigation system then uses the acceleration data to calculate...
Real-World Applications of Space Curves01:29

Real-World Applications of Space Curves

Modern aerospace navigation depends on the accurate prediction of motion in three-dimensional space. In defense applications, radar systems continuously track both interceptors and moving aerial targets to find whether their flight paths will result in a collision. These motions are modeled mathematically as space curves, which represent paths that change continuously with time. Each object’s position is described by a vector function that specifies its location in terms of time-dependent...

You might also read

Related Articles

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

Sort by
Same author

Active subnetwork recovery with a mechanism-dependent scoring function; with application to angiogenesis and organogenesis studies.

BMC bioinformatics·2013
Same author

Fast Inference with Min-Sum Matrix Product.

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

Inferring differential leukocyte activity from antibody microarrays using a latent variable model.

Genome informatics. International Conference on Genome Informatics·2009
Same author

Learning graph matching.

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

Graph rigidity, cyclic belief propagation, and point pattern matching.

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

Graphical models and point pattern matching.

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

Comment on 'angle illusion on a picture's surface' by Hammad et al. (2008).

Spatial vision·2009
Same journal

Feature-based attentional modulation increases with stimulus separation in divided-attention tasks.

Spatial vision·2009
Same journal

Spatial distance between target and irrelevant patch modulates detection in a texture segmentation task.

Spatial vision·2009
Same journal

Inhibition related impairments of coherent motion perception in the attention-induced motion blindness paradigm.

Spatial vision·2009
Same journal

Recognition units in reading: backward masking experiments.

Spatial vision·2009
Same journal

Spatial-temporal modeling of interactive image interpretation.

Spatial vision·2009
See all related articles

This study presents a faster algorithm for solving isometric matching problems. The new method achieves comparable accuracy to existing iterative solutions but requires only one iteration, significantly improving practical speed.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Graph Theory

Background:

  • Isometric matching problems are computationally intensive.
  • Existing exact polynomial-time solutions utilize Junction Trees.
  • Recent iterative algorithms offer faster convergence but require multiple iterations.

Purpose of the Study:

  • To develop a significantly faster algorithm for isometric matching problems.
  • To reduce the computational complexity of solving these problems.
  • To maintain accuracy while improving efficiency.

Main Methods:

  • Combines Junction Tree methods with iterative approaches.
  • Employs a single iteration of belief propagation.
  • Leverages small maximal clique size in the Junction Tree.

More Related Videos

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Related Experiment Videos

Last Updated: Jun 19, 2026

Pattern Generation for Micropattern Traction Microscopy
09:26

Pattern Generation for Micropattern Traction Microscopy

Published on: February 17, 2022

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Main Results:

  • Achieves the same asymptotic running time as faster iterative solutions.
  • Requires only a single iteration of belief propagation.
  • Demonstrates practical speed improvements over existing methods while maintaining similar error rates.

Conclusions:

  • The novel algorithm offers a substantial speedup for isometric matching.
  • Single-iteration belief propagation provides an efficient solution.
  • This approach balances computational speed and accuracy effectively.