skip to content
Seeing ghost solutions in stereo vision Preview this item
ClosePreview this item
Checking...

Seeing ghost solutions in stereo vision

Author: Daphna Weinshall; Massachusetts Institute of Technology. Artificial Intelligence Laboratory.; Whitaker College. Center for Biological Information Processing.
Publisher: Cambridge, Mass. : Massachusetts Institute of Technology, Artificial Intelligence Laboratory, 1988.
Series: A.I. memo, 1073.
Edition/Format:   Book : English
Database:WorldCat
Summary:
A unique matching is a stated objective of most computational theories of stereo vision. This report describes situations where humans perceive a small number of surfaces carried by non-unique matching of random dot patterns, although a unique solution exists and is observed unambiguously in the perception of isolated features. We find both cases where non-unique matchings compete and suppress each other and cases  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Daphna Weinshall; Massachusetts Institute of Technology. Artificial Intelligence Laboratory.; Whitaker College. Center for Biological Information Processing.
OCLC Number: 20679671
Notes: Cover title.
"September 1988."
"C.B.I.P. Memo No. 33."
Description: 11 pages : illustrations ; 28 cm.
Series Title: A.I. memo, 1073.
Responsibility: Daphna Weinshall.

Abstract:

A unique matching is a stated objective of most computational theories of stereo vision. This report describes situations where humans perceive a small number of surfaces carried by non-unique matching of random dot patterns, although a unique solution exists and is observed unambiguously in the perception of isolated features. We find both cases where non-unique matchings compete and suppress each other and cases where they are all perceived as transparent surfaces. The circumstances under which each behavior occurs are discussed and a possible explanation is sketched. It appears that matching reduces many false targets to a few, but may still yield multiple solutions in some cases through a (possibly different) process of surface interpolation.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/20679671>
library:oclcnum"20679671"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:contributor
schema:contributor
<http://viaf.org/viaf/141940489>
rdf:typeschema:Organization
schema:name"Massachusetts Institute of Technology. Artificial Intelligence Laboratory."
schema:creator
schema:datePublished"1988"
schema:description"A unique matching is a stated objective of most computational theories of stereo vision. This report describes situations where humans perceive a small number of surfaces carried by non-unique matching of random dot patterns, although a unique solution exists and is observed unambiguously in the perception of isolated features. We find both cases where non-unique matchings compete and suppress each other and cases where they are all perceived as transparent surfaces. The circumstances under which each behavior occurs are discussed and a possible explanation is sketched. It appears that matching reduces many false targets to a few, but may still yield multiple solutions in some cases through a (possibly different) process of surface interpolation."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/568791679>
schema:inLanguage"en"
schema:isPartOf
schema:name"Seeing ghost solutions in stereo vision"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.