Her main research concerns Artificial intelligence, Energy minimization, Cut, Graph cuts in computer vision and Computer vision. A large part of her Artificial intelligence studies is devoted to Pixel. Her study in Graph cuts in computer vision is interdisciplinary in nature, drawing from both Mathematical optimization, Algorithm, Approximation algorithm and Markov chain.
Her work on Minimum cut as part of general Algorithm study is frequently linked to Large class, therefore connecting diverse disciplines of science. Her Approximation algorithm research incorporates themes from Computational complexity theory and Standard algorithms. Her Computer vision study integrates concerns from other disciplines, such as Computer graphics and Pattern recognition.
Olga Veksler spends much of her time researching Artificial intelligence, Cut, Algorithm, Segmentation and Computer vision. Her Pattern recognition research extends to Artificial intelligence, which is thematically connected. Her biological study spans a wide range of topics, including Graph theory and Graphics.
Her work deals with themes such as Submodular set function, Mathematical optimization and Combinatorics, which intersect with Algorithm. Her study in the fields of Approximation algorithm under the domain of Mathematical optimization overlaps with other disciplines such as Trust region and Discrete optimization. In her study, which falls under the umbrella issue of Approximation algorithm, Standard algorithms and Computational complexity theory is strongly linked to Simulated annealing.
Olga Veksler mostly deals with Artificial intelligence, Segmentation, Algorithm, Regularization and Cut. Her research integrates issues of Machine learning, Computer vision and Pattern recognition in her study of Artificial intelligence. The various areas that Olga Veksler examines in her Segmentation study include Object, Pixel and Distance transform.
Her Algorithm study frequently links to adjacent areas such as Mathematical optimization. Her studies in Mathematical optimization integrate themes in fields like Image segmentation, Scale-space segmentation and Pairwise comparison. Her Cut study often links to related topics such as Submodular set function.
Her scientific interests lie mostly in Segmentation, Artificial intelligence, Algorithm, Convexity and Pixel. Her study involves Distance transform and Cut, a branch of Artificial intelligence. The study incorporates disciplines such as Vector field, Submodular set function, Combinatorics and Surface in addition to Distance transform.
Her work on Regularization as part of her general Algorithm study is frequently connected to Prior probability, thereby bridging the divide between different branches of science. The Regularization study combines topics in areas such as Disjoint sets, CRFS and Approximation algorithm. Olga Veksler has researched Pixel in several fields, including Feature learning, Invariant, Conditional random field and Color image.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Fast approximate energy minimization via graph cuts
Y. Boykov;O. Veksler;R. Zabih.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
R. Szeliski;R. Zabih;D. Scharstein;O. Veksler.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)
Markov random fields with efficient approximations
Y. Boykov;O. Veksler;R. Zabih.
computer vision and pattern recognition (1998)
Superpixels and supervoxels in an energy optimization framework
Olga Veksler;Yuri Boykov;Paria Mehrani.
european conference on computer vision (2010)
Fast approximate energy minimization via graph cuts
Y. Boykov;O. Veksler;R. Zabih.
international conference on computer vision (1999)
Fast variable window for stereo correspondence using integral images
O. Veksler.
computer vision and pattern recognition (2003)
A comparative study of energy minimization methods for markov random fields
Richard Szeliski;Ramin Zabih;Daniel Scharstein;Olga Veksler.
european conference on computer vision (2006)
Stereo correspondence by dynamic programming on a tree
O. Veksler.
computer vision and pattern recognition (2005)
Efficient graph-based energy minimization methods in computer vision
Ramin Zabih;Olga Veksler.
(1999)
Star Shape Prior for Graph-Cut Image Segmentation
Olga Veksler.
european conference on computer vision (2008)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Waterloo
Cornell University
École de Technologie Supérieure
University of Iowa
Institute of Science and Technology Austria
Middlebury College
Adobe Systems (United States)
University of Washington
Heidelberg University
University of Crete
Delft University of Technology
Centre national de la recherche scientifique, CNRS
University College London
University of Córdoba
University of Chicago
University of Duisburg-Essen
University of Illinois at Urbana-Champaign
Tel Aviv University
Harvard University
Old Dominion University
Johns Hopkins University
Nagoya University
University of Colorado Denver
Indiana University
Indiana University
Mayo Clinic