Computation of Locally Parallel Structure
A Moire-like effect can be observed in dot patterns consisting of two superimposed copies of a random dot pattern where one copy has been expanded, translated, or rotated. One perceives in these patterns a structure that is locally parallel. Our ability to perceive this structure is shown by e...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6265 |
| _version_ | 1826209985261993984 |
|---|---|
| author | Stevens, Kent A. |
| author_facet | Stevens, Kent A. |
| author_sort | Stevens, Kent A. |
| collection | MIT |
| description | A Moire-like effect can be observed in dot patterns consisting of two superimposed copies of a random dot pattern where one copy has been expanded, translated, or rotated. One perceives in these patterns a structure that is locally parallel. Our ability to perceive this structure is shown by experiment to be limited by the local geometry of the pattern, independent of the overall structure or the dot density. A simple representation of locally parallel structure is proposed, and it is found to be computable by a non-iterative, parallel algorithm. An implementation of this algorithm is demonstrated. Its performance parallels that observed experimentally, providing a potential explanation for human performance. Advantages are discussed for the early description of locally parallel structure in the course of visual processing. |
| first_indexed | 2024-09-23T14:38:32Z |
| id | mit-1721.1/6265 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:38:32Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/62652019-04-11T01:10:34Z Computation of Locally Parallel Structure Stevens, Kent A. A Moire-like effect can be observed in dot patterns consisting of two superimposed copies of a random dot pattern where one copy has been expanded, translated, or rotated. One perceives in these patterns a structure that is locally parallel. Our ability to perceive this structure is shown by experiment to be limited by the local geometry of the pattern, independent of the overall structure or the dot density. A simple representation of locally parallel structure is proposed, and it is found to be computable by a non-iterative, parallel algorithm. An implementation of this algorithm is demonstrated. Its performance parallels that observed experimentally, providing a potential explanation for human performance. Advantages are discussed for the early description of locally parallel structure in the course of visual processing. 2004-10-04T14:47:49Z 2004-10-04T14:47:49Z 1977-03-01 AIM-392 http://hdl.handle.net/1721.1/6265 en_US AIM-392 10617217 bytes 7492723 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Stevens, Kent A. Computation of Locally Parallel Structure |
| title | Computation of Locally Parallel Structure |
| title_full | Computation of Locally Parallel Structure |
| title_fullStr | Computation of Locally Parallel Structure |
| title_full_unstemmed | Computation of Locally Parallel Structure |
| title_short | Computation of Locally Parallel Structure |
| title_sort | computation of locally parallel structure |
| url | http://hdl.handle.net/1721.1/6265 |
| work_keys_str_mv | AT stevenskenta computationoflocallyparallelstructure |