60 search results - page 2 / 12 » On Ullman's theorem in computer vision |
ACCV
2010
Springer
13 years 24 days ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
CVPR
1997
IEEE
13 years 10 months ago
1997
IEEE
We present a model of contour extraction in which the perceptual salience of contours arises from long-range interactions between orientation-selective filters. Ullman [19], Zucke...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
Images obtained with catadioptric sensors contain significant deformations which prevent the direct use of classical image treatments. Thus, Markov Random Fields (MRF) whose usefu...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
We introduce the `No Panacea Theorem' for classifier combination in the two-classifier, two-class case. It states that if the combination function is continuous and diverse, ...