| Alternate document: Details Visual Simulation of Ice Crystal Growth (03) Theodore Kim and Ming C. Lin |
(Enter summary)
Abstract: We address visual correspondence problems without assuming
that scene points have similar intensities in different
views.This situation is common, usually due to
non-lambertian scenes or to di#erences between cameras.
We use maximization of mutual information, a
powerful technique for registering images that requires
no apriorimodel of the relationship between scene intensities
in di#erent views. However, it has proven
di#cult to use mutual information to compute dense
visual correspondence.... (Update)
Cited by: More
Illumination-Invariant Tracking via Graph Cuts - Daniel Freedman And
(Correct)
Multi-view Stereo Beyond Lambert - Hailin Jin Stefano (2002)
(Correct)
Active bibliography (related documents): More All
0.2: A Taxonomy and Evaluation of Dense Two-Frame Stereo.. - Scharstein, Szeliski (2001)
(Correct)
0.1: What Energy Functions can be Minimized via Graph Cuts? - Kolmogorov, Zabih (2002)
(Correct)
0.1: Multi-camera Scene Reconstruction via Graph Cuts - Kolmogorov, Zabih (2002)
(Correct)
Similar documents based on text: More All
0.8: Resume - Kolmogorov
(Correct)
0.5: Computing Visual Correspondence with Occlusions via Graph Cuts - Kolmogorov, Zabih (2001)
(Correct)
0.3: Computing Visual Correspondence with Occlusions using Graph Cuts - Kolmogorov, Zabih (2001)
(Correct)
Related documents from co-citation: More All
2: Fast Approximate Energy Minimization via Graph Cuts
- Boykov, Veksler et al. - 1999
BibTeX entry: (Update)
J. Kim, V. Kolmogorov and R. Zabih. Visual Correspondence Using Energy Minimization and Mutual Information. In Proc. of Intl. Conf. on Computer Vision, October 2003. http://citeseer.ist.psu.edu/kim03visual.html More
@misc{ kim03visual,
author = "J. Kim and V. Kolmogorov and R. Zabih",
title = "Visual Correspondence Using Energy Minimization and Mutual Information",
text = "J. Kim, V. Kolmogorov and R. Zabih. Visual Correspondence Using Energy
Minimization and Mutual Information. In Proc. of Intl. Conf. on Computer
Vision, October 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/kim03visual.html" }
Citations (may not include all citations):
272
Alignment by maximization of mutual information
- Viola, Wells - 1997
223
IEEE Transactions on Pattern Analysis and Machine Intelligen.. (context) - Geman, Geman et al. - 1984
192
The robust estimation of multiple motions: Parametric and pi.. (context) - Black, Anandan - 1996
132
Kalman filter-based algorithms for estimating depth from ima..
- Matthies, Szeliski et al. - 1989
125
Multi-modal volume registration by maximization of mutual in..
- Wells, Viola et al. - 1996
122
Fast approximate energy minimization via graph cuts
- Boykov, Veksler et al. - 2001
110
Markov Random Field Modeling in Computer Vision (context) - Li - 1995
106
A taxonomy and evaluation of dense two-frame stereo correspo..
- Scharstein, Szeliski - 2002
103
Probability distributions of optical flow
- Simoncelli, Adelson et al. - 1991
97
A mathematical theory of communication (context) - Shannon - 1948
92
A maximum-flow formulation of the n-camera stereo correspond..
- Roy, Cox - 1998
67
Non-parametric local transforms for computing visual corresp..
- Zabih, Woodfill - 1994
48
a and D. Geiger. Occlusions, discontinuities, and epipolar l.. (context) - Ishikaw - 1998
41
experimental comparison min cutmax flow algorithm energy min..
- Boykov, An et al. - 2001
19
Scientific Computing: An Introductory Survey (context) - Heath - 2002
13
Matching images by comparing their gradient fields
- Scharstein - 1994
13
Brightness-based stereo matching (context) - Gennert - 1988
10
Visual correspondence with occlusions using graph cuts (context) - Kolmogorov, Zabih - 2001
8
Intraoperative segmentation and nonrigid registration for im..
- Warfield - 2000
1
Mutual information as a stereo correspondence measure
- rey - 2000
1
A model for nonrigid mammogram registration using mutual inf.. (context) - Wirth, Narhan et al. - 2002
Documents on the same site (http://www.cs.cornell.edu/People/vnk/): More
What Energy Functions can be Minimized via Graph Cuts? - Kolmogorov, Zabih (2002)
(Correct)
An Experimental Comparison of Min-Cut/Max-Flow Algorithms.. - Boykov, Kolmogorov (2001)
(Correct)
Computing Visual Correspondence with Occlusions using Graph Cuts - Kolmogorov, Zabih (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC