- The performance of monocular vision based target tracking is a strong function of camera motion. Without motion, the target estimation problem is unsolvable. By designing the cam...
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...