Readings in Cognitive Science 1988
DOI: 10.1016/b978-1-4832-1446-7.50046-7
|View full text |Cite
|
Sign up to set email alerts
|

A computational theory of human stereo vision

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
170
0

Year Published

1988
1988
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 130 publications
(171 citation statements)
references
References 47 publications
1
170
0
Order By: Relevance
“…In stereo snakes, the stereo match actually affects the detection and localization of the features on which the match is based. This differs importantly, for example, from the Marr-Poggio stereo theory [12] in which the basic stereo matching primitive zero-crossings always remain unchanged by the matching process. Figure 7 shows an example of a 3D surface reconstructed from disparities measured along a Fig.…”
Section: Stereomentioning
confidence: 71%
“…In stereo snakes, the stereo match actually affects the detection and localization of the features on which the match is based. This differs importantly, for example, from the Marr-Poggio stereo theory [12] in which the basic stereo matching primitive zero-crossings always remain unchanged by the matching process. Figure 7 shows an example of a 3D surface reconstructed from disparities measured along a Fig.…”
Section: Stereomentioning
confidence: 71%
“…The reason for using the above search window about the point P~,i (described above) is as follows. Grimson (1981,1985) conducted experiments based upon the Marr-Poggio theory (Marr & Poggio 1979) of stereopsis with random dot stereograms whose edge points were extracted using the V2G operator. Marr and Poggio proposed that if the expected disparity for a certain binocular match is known and if an edge point is located within +to/2 of the expected disparity position, then a 95% probability exists that it is a correct match.…”
Section: Binocular and Trinocular Matchingmentioning
confidence: 99%
“…In the local matching stage, for every feature point in the base image, an attempt is made to find a set of candidate match-points in a second image which have similar local properties and which satisfy the epipolar constraint. In the global matching stage, a scheme for imposing a global consistency among the local matches, like coarse-to-fine (Grimson 1985;Marr & Poggio 1979), disparity gradient limit (Pollard et al 1981), neighborhood relationships (Ayache & Faverjon 1987;Medioni & Nevatia 1980), or relaxation labeling (Barnard & Thompson 1980;Kim & Aggarwal 1987), is used to disambiguate multiple local match-point candidates.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Color features is the most widely used in image recognition visual features, has the high stability. The shape of the image features, also known as contour, commonly used are longer than wide, area, perimeter, eccentricity, methods and so on [3] . Image topological properties are adjacent and connected, distance, euler number, etc.…”
Section: Image Feature Extraction and Analysismentioning
confidence: 99%