𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subgraph Matching with Semidefinite Programming

✍ Scribed by C. Schellewald; C. Schnörr

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
539 KB
Volume
12
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

✦ Synopsis

We present a convex programming approach to the problem of matching subgraphs which represent object views against larger graphs which represent scenes. Starting from a linear programming formulation for computing optimal matchings in bipartite graphs, we extend the linear objective function in order to take into account the relational constraints given by both graphs. The resulting combinatorial optimization problem is approximately solved by a semidefinite program. Preliminary results are promising with respect to view-based object recognition subject to relational constraints.

📜 SIMILAR VOLUMES

H∞ optimization with plant uncertainty a
H∞ optimization with plant uncertainty and semidefinite programming
✍ J. William Helton; Orlando Merino; Trent E. Walker 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB

The fundamental H problem of control is that of finding the stable frequency response function that best fits worst case frequency domain specifications. This is a non-smooth optimization problem that underlies the frequency domain formulation of the H problem of control; it is the main optimization