Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Veksler, Olga - Department of Computer Science, University of Western Ontario
Markov Random Fields with Efficient Approximations Yuri Boykov Olga Veksler Ramin Zabih
Graph Cut with Ordering Constraints on Labels and its Applications Xiaoqing Liu
Dense Features for Semi-Dense Stereo Correspondence Olga Veksler
Stereo Matching by Compact Windows via Minimum Ratio Cycle Olga Veksler
UNCORRECTED 2 Semiautomatic segmentation with compact shape prior q
Simulating Classic Mosaics with Graph Cuts Yu Liu, Olga Veksler, and Olivier Juan
Disparity Component Matching for Visual Correspondence Yuri Boykov Olga Veksler Ramin Zabih
Stereo Correspondence by Dynamic Programming on a Tree Olga Veksler
Fast Variable Window for Stereo Correspondence using Integral Images Olga Veksler
Extracting Dense Features for Visual Correspondence with Graph Cuts Olga Veksler
Semi-Dense Stereo Correspondence with Dense Features Olga Veksler
Image Segmentation by Nested Cuts Olga Veksler
Tiered Scene Labeling with Dynamic Programming Pedro F. Felzenszwalb
Parameter Selection for Graph Cut Based Image Segmentation
A New Algorithm for Energy Minimization with Discontinuities
Animated Classic Mosaics from Video Yu Liu and Olga Veksler
DOI: 10.1111/j.1467-8659.2010.01752.x COMPUTER GRAPHICS forum Volume 29 (2010), number 8 pp. 23872399
A fast solver for truncated-convex priors: quantized-convex split moves
