The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olga Veksler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Piali Das, Olga Veksler
    Semiautomatic Segmentation with Compact Shapre Prior. [Citation Graph (0, 0)][DBLP]
    CRV, 2006, pp:28- [Conf]
  2. Yuri Boykov, Olga Veksler, Ramin Zabih
    Disparity Component Matching for Visual Correspondence. [Citation Graph (0, 0)][DBLP]
    CVPR, 1997, pp:470-475 [Conf]
  3. Yuri Boykov, Olga Veksler, Ramin Zabih
    Markov Random Fields with Efficient Approximations. [Citation Graph (0, 0)][DBLP]
    CVPR, 1998, pp:648-655 [Conf]
  4. Olga Veksler
    Image Segmentation by Nested Cuts. [Citation Graph (0, 0)][DBLP]
    CVPR, 2000, pp:1339-0 [Conf]
  5. Olga Veksler
    Semi-Dense Stereo Correspondence with Dense Features. [Citation Graph (0, 0)][DBLP]
    CVPR (2), 2001, pp:490-487 [Conf]
  6. Olga Veksler
    Fast Variable Window for Stereo Correspondence using Integral Images. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2003, pp:556-564 [Conf]
  7. Olga Veksler
    Extracting Dense Features for Visual Correspondence with Graph Cuts. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2003, pp:689-694 [Conf]
  8. Olga Veksler
    Stereo Correspondence by Dynamic Programming on a Tree. [Citation Graph (0, 0)][DBLP]
    CVPR (2), 2005, pp:384-390 [Conf]
  9. Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall F. Tappen, Carsten Rother
    A Comparative Study of Energy Minimization Methods for Markov Random Fields. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 2006, pp:16-29 [Conf]
  10. Yuri Boykov, Olga Veksler, Ramin Zabih
    A New Algorithm for Energy Minimization with Discontinuities. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 1999, pp:205-220 [Conf]
  11. Yuri Boykov, Olga Veksler, Ramin Zabih
    Fast Approximate Energy Minimization via Graph Cuts. [Citation Graph (0, 0)][DBLP]
    ICCV, 1999, pp:377-384 [Conf]
  12. Olga Veksler
    Stereo Matching by Compact Windows via Minimum Ratio Cycle. [Citation Graph (0, 0)][DBLP]
    ICCV, 2001, pp:540-547 [Conf]
  13. Olga Veksler
    Dense Features for Semi-Dense Stereo Correspondence. [Citation Graph (0, 0)][DBLP]
    International Journal of Computer Vision, 2002, v:47, n:1-3, pp:247-260 [Journal]
  14. Yuri Boykov, Olga Veksler, Ramin Zabih
    Fast Approximate Energy Minimization via Graph Cuts. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2001, v:23, n:11, pp:1222-1239 [Journal]
  15. Yuri Boykov, Olga Veksler, Ramin Zabih
    A Variable Window Approach to Early Vision. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1998, v:20, n:12, pp:1283-1294 [Journal]
  16. Olga Veksler
    Stereo Correspondence with Compact Windows via Minimum Ratio Cycle. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2002, v:24, n:12, pp:1654-1660 [Journal]
  17. Olga Veksler
    Graph Cut Based Optimization for MRFs with Truncated Convex Priors. [Citation Graph (0, 0)][DBLP]
    CVPR, 2007, pp:- [Conf]
  18. Yu Liu, Olga Veksler, Olivier Juan
    Simulating Classic Mosaics with Graph Cuts. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2007, pp:55-70 [Conf]

  19. Graph cut with ordering constraints on labels and its applications. [Citation Graph (, )][DBLP]


  20. Star Shape Prior for Graph-Cut Image Segmentation. [Citation Graph (, )][DBLP]


  21. Multi-label Moves for MRFs with Truncated Convex Priors. [Citation Graph (, )][DBLP]


  22. Animated Classic Mosaics from Video. [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002