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 Videos

Matching by linear programming and successive convexification.

Hao Jiang1, Mark S Drew, Ze-Nian Li

  • 1Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada. haoj@ece.ubc.ca

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

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

In-Depth Proteomic Quantification of Cell Secretome in Serum-Containing Conditioned Medium.

Analytical chemistry·2016
Same author

Homoharringtonine, aclarubicin and cytarabine (HAA) regimen as the first course of induction therapy is highly effective for acute myeloid leukemia with t (8;21).

Leukemia research·2016
Same author

[Morphology and Spectral Properties Study of LaCeF3:Tb Microcrystalline].

Guang pu xue yu guang pu fen xi = Guang pu·2016
Same author

A highly selective fluorogenic probe for the detection and in vivo imaging of Cu/Zn superoxide dismutase.

Chemical communications (Cambridge, England)·2016
Same author

Development of a disaggregation-induced emission probe for the detection of RecA inteins from Mycobacterium tuberculosis.

Chemical communications (Cambridge, England)·2016
Same author

Bias-polarity-dependent resistance switching in W/SiO2/Pt and W/SiO2/Si/Pt structures.

Scientific reports·2016
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
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

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

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

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

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads.

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

Achieving Text-based Person Retrieval with Any Granularity.

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

We developed a new convex programming method for matching problems with large search ranges and cluttered backgrounds. This approach efficiently refines search results for complex object detection and tracking tasks.

Area of Science:

  • Computer Vision
  • Optimization
  • Machine Learning

Background:

  • Matching problems in computer vision are often computationally intensive, especially with large search spaces and noisy data.
  • Existing methods struggle with efficiency and accuracy in scenarios involving cluttered backgrounds and extensive search ranges.

Purpose of the Study:

  • To introduce a novel convex programming scheme for solving challenging matching problems.
  • To address the limitations of current methods in large-scale and cluttered environments.

Main Methods:

  • Formulated matching as metric labeling with L1 regularization.
  • Developed a linear programming relaxation using a reduced set of basis labels.
  • Implemented an efficient successive convexification algorithm for coarse-to-fine refinement.

Related Experiment Videos

Main Results:

  • The proposed method significantly reduces the search space by using fewer basis labels.
  • Successive convexification refines solutions by reconvexifying the cost function in focused regions.
  • Demonstrated successful applications in object detection, motion estimation, and tracking.

Conclusions:

  • The novel convex programming scheme offers an efficient and effective solution for large-scale matching problems.
  • The method's ability to handle clutter and large search ranges makes it suitable for real-world applications.
  • This approach advances the state-of-the-art in computer vision tasks requiring accurate matching.