Sciweavers

463 search results - page 40 / 93
» A General Framework for Graph Sparsification
Sort
View
ICCV
2011
IEEE
12 years 10 months ago
Object Detection and Segmentation from Joint Embedding of Parts and Pixels
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
Michael Maire, Stella X. Yu, Pietro Perona
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
13 years 26 days ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn
SIGIR
2006
ACM
14 years 4 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 10 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...