Sciweavers

6005 search results - page 183 / 1201
» Graph-Theoretical Methods in Computer Vision
Sort
View
CVPR
2006
IEEE
15 years 8 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
HRI
2006
ACM
15 years 8 months ago
FOCUS: a generalized method for object discovery for robots that observe and interact with humans
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
Manuela M. Veloso, Paul E. Rybski, Felix von Hunde...
NAR
2011
190views Computer Vision» more  NAR 2011»
14 years 5 months ago
New tools and methods for direct programmatic access to the dbSNP relational database
Genome-wide association studies often incorporate information from public biological databases in order to provide a biological reference for interpreting the results. The dbSNP d...
Scott F. Saccone, Jiaxi Quan, Gaurang Mehta, Rapha...
ECCV
2010
Springer
15 years 7 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
132
Voted
CVPR
2006
IEEE
16 years 4 months ago
An Intensity-augmented Ordinal Measure for Visual Correspondence
Determining the correspondence of image patches is one of the most important problems in Computer Vision. When the intensity space is variant due to several factors such as the ca...
Anurag Mittal, Visvanathan Ramesh