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

Survival Tree01:19

Survival Tree

453
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
453
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

448
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...
448
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

554
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...
554
Phylogenetic Trees03:21

Phylogenetic Trees

51.1K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
51.1K
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

320
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...
320
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

333
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...
333

You might also read

Related Articles

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

Sort by
Same author

Automated assessment of Knosp grade from pituitary adenoma MRI: Experimental comparison of a rule-based and a machine learning-based approach.

Brain & spine·2026
Same author

Student Performance in Bitewing Caries Detection: Artificial Intelligence Versus Alternative E-learning.

International dental journal·2026
Same author

Precise Electrode Co-Alignment in Deep Brain Stimulation Fusing Neuroimaging and Electrophysiology.

The European journal of neuroscience·2025
Same author

Utility of artificial intelligence in radiosurgery for pituitary adenoma: a deep learning-based automated segmentation model and evaluation of its clinical applicability.

Journal of neurosurgery·2025
Same author

Temporally-Consistent Surface Reconstruction Using Metrically-Consistent Atlases.

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

Harnessing deep learning to detect bronchiolitis obliterans syndrome from chest CT.

Communications medicine·2025
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: Mar 8, 2026

Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection
06:57

Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection

Published on: September 22, 2023

1.5K

Geometric Graph Matching Using Monte Carlo Tree Search.

Miguel Amavel Pinheiro, Jan Kybic, Pascal Fua

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |January 24, 2017
    PubMed
    Summary
    This summary is machine-generated.

    We developed an efficient graph matching method for complex structures like road or vessel networks. This novel approach uses Monte Carlo Tree Search for fast and accurate image registration, even with partial or distorted data.

    More Related Videos

    Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies
    07:34

    Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies

    Published on: November 7, 2025

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

    Pattern-based Search of Epigenomic Data Using GeNemo

    Published on: October 8, 2017

    5.4K

    Related Experiment Videos

    Last Updated: Mar 8, 2026

    Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection
    06:57

    Author Spotlight: Advancing Cardiovascular Imaging - Introducing the Spatially Weighted Calcium Score for Early Disease Detection

    Published on: September 22, 2023

    1.5K
    Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies
    07:34

    Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies

    Published on: November 7, 2025

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

    Pattern-based Search of Epigenomic Data Using GeNemo

    Published on: October 8, 2017

    5.4K

    Area of Science:

    • Computer Vision
    • Medical Imaging
    • Computational Geometry

    Background:

    • Generalized geometric graphs represent real-world structures like road and vessel networks.
    • Graph matching is crucial for fast and multimodal image registration.
    • Existing methods struggle with large graphs, topological differences, and require initial alignment.

    Purpose of the Study:

    • To present an efficient and robust graph matching method for generalized geometric graphs.
    • To enable fast and accurate image registration of complex structures.
    • To overcome limitations of existing graph matching techniques.

    Main Methods:

    • Formulating graph matching as a single-player game.
    • Solving the game using Monte Carlo Tree Search (MCTS).
    • MCTS balances exploration of new matches and extension of existing ones.

    Main Results:

    • The method efficiently matches graphs with thousands of nodes, an order of magnitude improvement.
    • Matching is completed in seconds, significantly faster than competing methods.
    • Handles partial matches, topological differences, and geometrical distortion without appearance information or initial alignment.

    Conclusions:

    • The proposed Monte Carlo Tree Search-based graph matching is highly efficient and scalable.
    • This method offers a robust solution for image registration of complex networks.
    • It significantly advances the state-of-the-art in geometric graph matching.