Sciweavers

1115 search results - page 89 / 223
» Active Graph Cuts
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 8 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
ICML
2010
IEEE
13 years 9 months ago
Fast Neighborhood Subgraph Pairwise Distance Kernel
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
Fabrizio Costa, Kurt De Grave
CVPR
2004
IEEE
14 years 10 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
CVPR
2006
IEEE
14 years 10 months ago
Seamless Image Stitching of Scenes with Large Motions and Exposure Differences
This paper presents a technique to automatically stitch multiple images at varying orientations and exposures to create a composite panorama that preserves the angular extent and ...
Ashley Eden, Matthew Uyttendaele, Richard Szeliski
CVPR
2007
IEEE
14 years 10 months ago
Layered Depth Panoramas
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...
Ke Colin Zheng, Sing Bing Kang, Michael F. Cohen, ...