Now showing items 1-7 of 7

    • Computing Visual Correspondence with Occlusions via Graph Cuts 

      Kolmogorov, Vladimir; Zabih, Ramin (Cornell University, 2001-03-07)
      Several new algorithms for visual correspondence based on graph cuts have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat ...
    • EM-Style Geo-Cuts Segmentation for MRI Brain Images 

      Zhu, Jie; Raj, Ashish; Zabih, Ramin (Cornell University, 2007-02-27)
      Segmentation of MRI brain images has great clinical and academic importance. The overlap of MR intensities of different tissue types and the vast amount of thin structures in brain images make segmentation of MRI brain ...
    • Feature-Based Algorithms for Detecting and Classifying Scene Breaks 

      Zabih, Ramin; Miller, Justin; Mai, Kevin (Cornell University, 1995-07)
      We describe a new approach to the detection and classification of scene breaks in video sequences. Our method can detect and classify a variety of scene breaks, including cuts, fades, dissolves and wipes, even in ...
    • Markov Random Fields with Efficient Approximations 

      Boykov, Yuri; Veksler, Olga; Zabih, Ramin (Cornell University, 1997-12)
      Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we address the estimation of first-order MRF's with a particular clique potential that resembles a well. We show that the ...
    • A Variable Window Approach to Early Vision 

      Boykov, Yuri; Veksler, Olga; Zabih, Ramin (Cornell University, 1997-12)
      Early vision relies heavily on rectangular windows for tasks such as smoothing and computing correspondence. While rectangular windows are efficient, they yield poor results near object boundaries. We describe an efficient ...
    • What Energy Functions can be Minimized via Graph Cuts? 

      Kolmogorov, Vladimir; Zabih, Ramin (Cornell University, 2001-11-27)
      Many problems in computer vision can be naturally phrased in terms of energy minimization. In the last few years researchers have developed a powerful class of energy minimization methods based on graph cuts. These ...