Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Wilcoxon Signed-Ranks Test for Matched Pairs

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

High-Resolution Mass Spectrometry (HRMS)

High-Resolution Mass Spectrometry (HRMS)

The resolution of a mass spectrometer depends on the efficiency of separating ions with different ion masses. The mass of an atom is approximated to the sum of the masses of protons and neutrons inside, considering the masses of protons and neutrons as equal. However, the masses of the proton (1.6726 × 10−24 g) and neutron (1.6749 × 10−24 g) are not truly equal. There is a minor error in the expression of atomic masses relative to the simplest atom of hydrogen. For example, the mass of helium...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Sign Test for Matched Pairs

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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Optimizing Chromatographic Separations

Optimizing Chromatographic Separations

Optimizing chromatographic separations is crucial for obtaining clean separations in a minimum amount of time. Optimization is required for several factors, including kinetic effects related to band broadening, plate height, capacity factor, and separation factor.
Band broadening refers to spreading solute bands as they travel through the column. This broadening can impact resolution. Plate height (H) represents the length required for one theoretical plate. A lower plate height corresponds to...

You might also read

Related Articles

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

Sort by

Same author

Hierarchical Attention-Based Age Estimation and Bias Analysis.

IEEE transactions on pattern analysis and machine intelligence·2023

Same author

Coarse-to-Fine Multi-Scene Pose Regression With Transformers.

IEEE transactions on pattern analysis and machine intelligence·2023

Same author

Deep Convolutional Tables: Deep Learning Without Convolutions.

IEEE transactions on neural networks and learning systems·2023

Same author

FSGANv2: Improved Subject Agnostic Face Swapping and Reenactment.

IEEE transactions on pattern analysis and machine intelligence·2022

Same author

Learning to Embed Semantic Similarity for Joint Image-Text Retrieval.

IEEE transactions on pattern analysis and machine intelligence·2021

Same author

DeepFake Detection Based on Discrepancies Between Faces and Their Context.

IEEE transactions on pattern analysis and machine intelligence·2021

Search research articles

Related Experiment Video

Updated: Jun 7, 2026

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Efficient high order matching.

Michael Chertok¹, Yosi Keller

¹School of Engineering, Bar-Ilan University, Ramat Gan, Israel. michael.chertok@gmail.com

IEEE Transactions on Pattern Analysis and Machine Intelligence

|October 27, 2010

Summary

This study introduces a novel computational method for high-order data matching using tensor approximations. This approach enhances data affinity measures for more accurate matching in IR(d) spaces.

Area of Science:

Computational mathematics
Data science
Computer vision

Background:

Traditional matching methods often rely on pairwise affinities, limiting accuracy for complex datasets.
High-order affinity measures, representing interactions among multiple data points, are computationally challenging.
Existing hypergraph matching techniques require extension for efficient high-order spectral matching.

Purpose of the Study:

To develop a computational framework for high-order matching of datasets in IR(d) spaces.
To represent and approximate high-order affinities using tensor decomposition.
To establish a computationally efficient spectral matching scheme based on dual-marginalization.

Main Methods:

Utilizing tensor rank-one approximation to represent high-order affinities.

Related Experiment Videos

Last Updated: Jun 7, 2026

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

Extending hypergraph matching to high-order spectral matching for theoretical justification.

Applying random matrix theory to enable sparse representation of affinity tensors.

Developing a dual-marginalization spectral matching algorithm.

Main Results:

A novel computational approach for high-order data matching is presented.
The method is rigorously justified through extensions of spectral matching techniques.
Random sparsification of affinity tensors is shown to maintain matching accuracy.
Experimental validation on synthetic and real datasets confirms the approach's efficacy.

Conclusions:

The proposed tensor-based method offers an efficient and accurate solution for high-order data matching.
The dual-marginalization spectral matching scheme provides computational advantages.
Random sparsification presents a viable strategy for handling large-scale high-order affinity tensors.