Hostname: page-component-5c6d5d7d68-wbk2r Total loading time: 0 Render date: 2024-08-19T11:52:26.219Z Has data issue: false hasContentIssue false
  • English
  • Français

On the computational basis of synchronized codes

Published online by Cambridge University Press:  01 December 1997

DeLiang L. Wang
DeLiang L. Wang
Affiliation:
Department of Computer and Information Science and Center for Cognitive Science, The Ohio State University, Columbus, OH 43210-1277 dwang@cis.ohio-state.edu www.cis.ohio-state.edu/dwang
Get access Rights & Permissions [Opens in a new window]

Abstract

For scene analysis, it is important to ask the question of how synchronized population codes – the basic representation employed in the target article – are generated. Recent computational advances have resolved the critical challenges of rapid synchronization with local coupling and rapid desynchronization. The synchronized codes make real contributions to tackling the problem of scene analysis.

Type
Open Peer Commentary
Information
Behavioral and Brain Sciences , Volume 20 , Issue 4 , December 1997 , pp. 700 - 701
Copyright
© 1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)