https://doi.org/10.7490/f1000research.1114784.1
Poster
NOT PEER REVIEWED
Download
metrics
VIEWS
152
 
downloads
22
CITE
How to cite this poster:
Datta D and Hock HS. Solving the complexity of object occlusions in scenes: The grouping of adjacent surfaces and non-adjacent but connected surfaces [version 1; not peer reviewed]. F1000Research 2017, 6:1551 (poster) (https://doi.org/10.7490/f1000research.1114784.1)
NOTE: it is important to ensure the information in square brackets after the title is included in this citation.

Solving the complexity of object occlusions in scenes: The grouping of adjacent surfaces and non-adjacent but connected surfaces

Debarshi Datta1, Howard S. Hock
Author Affiliations
  • Metrics
  • 152 Views
  • 22 Downloads
Browse by related subjects
Published 23 Aug 2017

Solving the complexity of object occlusions in scenes: The grouping of adjacent surfaces and non-adjacent but connected surfaces

[version 1; not peer reviewed]

Debarshi Datta1, Howard S. Hock
Author Affiliations
1 Florida Atlantic University, USA
Presented at
17th Vision Sciences Society Annual Meeting 2017
Competing Interests

No competing interests were disclosed

Keywords
Amodal completion, dynamic grouping motion, object recognition, aparent motion
Comments
0 Comments
 
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.