We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...