We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...