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

Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
Graphs of Two-Variable Functions01:27

Graphs of Two-Variable Functions

A weather map provides a practical example of a function of two variables. Across a wide region such as the United States, temperatures vary from one location to another. Each location can be identified by two geographic coordinates: longitude and latitude. Since a single temperature value is assigned to each coordinate pair, the situation can be represented mathematically as a function with two inputs and one output.In mathematical notation, longitude and latitude can be labeled as x and y,...
Graphs of Functions01:30

Graphs of Functions

Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in value between...
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...

You might also read

Related Articles

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

Sort by
Same author

Teaching With Picture Books on Deaf and Hard-of-Hearing Students'Creativity.

Journal of deaf studies and deaf education·2021
Same author

Quantitative Evaluation of Burn Injuries Based on Electrical Impedance Spectroscopy of Blood with a Seven-Parameter Equivalent Circuit.

Sensors (Basel, Switzerland)·2021
Same author

Two New Nonenolides from Diaporthe sp. SXZ-19, an Endophytic Fungus of Camptotheca Acuminata.

Chemistry & biodiversity·2021
Same author

Effect of cassava starch structure on scalding of dough and baking expansion ability.

Food chemistry·2021
Same author

Role of PKA/CREB/BDNF signaling in PM2.5-induced neurodevelopmental damage to the hippocampal neurons of rats.

Ecotoxicology and environmental safety·2021
Same author

A multicenter survey of pediatric flexible bronchoscopy in western China.

Translational pediatrics·2021
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

Learning Shape Anchors for Holistic Indoor Scene Understanding.

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

Related Experiment Video

Updated: Jun 23, 2026

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

Learning graph matching.

Tibério S Caetano1, Julian J McAuley, Li Cheng

  • 1Statistical Machine Learning Group, NICTA, Locked Bag 8001, Canberra, ACT 2601, Australia. tiberio.caetano@nicta.com.au

IEEE Transactions on Pattern Analysis and Machine Intelligence
|April 18, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel learning approach for graph matching, enhancing pattern recognition accuracy. By learning compatibility functions from human-provided matches, this method significantly improves graph matching algorithm performance.

Related Experiment Videos

Last Updated: Jun 23, 2026

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

Area of Science:

  • Computer Science
  • Pattern Recognition
  • Artificial Intelligence

Background:

  • Graph matching is crucial for pattern recognition across diverse fields like computer vision and computational biology.
  • The problem is often formulated as a quadratic assignment problem, which is NP-hard, necessitating approximate solutions.
  • Existing research focuses on efficient algorithms for solving the quadratic assignment problem.

Purpose of the Study:

  • To develop a method for learning graph matching compatibility functions.
  • To enable graph matching solutions to align with human-provided matches.
  • To improve the performance of graph matching algorithms through learned parameters.

Main Methods:

  • A supervised learning framework for graph matching is proposed.
  • Training data consists of pairs of graphs with corresponding human-generated matches as labels.
  • Compatibility functions are estimated based on these training examples.

Main Results:

  • Learned graph matching significantly enhances the performance of standard algorithms.
  • A simple linear assignment method with learning outperforms a state-of-the-art quadratic assignment relaxation algorithm (Graduated Assignment with bistochastic normalisation).
  • Experimental results demonstrate substantial performance gains due to the learning approach.

Conclusions:

  • Learning compatibility functions is an effective strategy to improve graph matching.
  • This approach offers a promising direction for developing more accurate and human-aligned graph matching systems.
  • The proposed learning method provides a practical alternative to traditional optimization techniques for graph matching.