Minimizing Binding Errors Using Learned Conjunctive Features
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We have studied some of the design trade-offs governing visual representations based on spatially invariant conjunctive feature detectors, with an emphasis on the susceptibility of such systems to false-positive recognition errors—Malsburg's classical binding problem. We begin by deriving an analytical model that makes explicit how recognition performance is affected by the number of objects that must be distinguished, the number of features included in the representation, the complexity of individual objects, and the clutter load, that is, the amount of visual material in the field of view in which multiple objects must be simultaneously recognized, independent of pose, and without explicit segmentation. Using the domain of text to model object recognition in cluttered scenes, we show that with corrections for the nonuniform probability and nonindependence of text features, the analytical model achieves good fits to measured recognition rates in simulations involving a wide range of clutter loads, word sizes, and feature counts. We then introduce a greedy algorithm for feature learning, derived from the analytical model, which grows a representation by choosing those conjunctive features that are most likely to distinguish objects from the cluttered backgrounds in which they are embedded. We show that the representations produced by this algorithm are compact, decorrelated, and heavily weighted toward features of low conjunctive order. Our results provide a more quantitative basis for understanding when spatially invariant conjunctive features can support unambiguous perception in multiobject scenes, and lead to several insights regarding the properties of visual representations optimized for specific recognition tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Speed of processing in the human visual system
Thorpe, S., Fize, D., & Marlot, C. (1996) · Nature · doi:10.1038/381520a0 · Cited by 3,538
Yin, R. K. (1969) · Journal of Experimental Psychology · doi:10.1037/h0027474 · Cited by 2,624
Context-sensitive coding, associative memory, and serial order in (speech) behavior.
Wickelgran, W. A. (1969) · Psychological Review · doi:10.1037/h0026823 · Cited by 376
Cited by
Neuronal Synchrony: A Versatile Code for the Definition of Relations?
Singer, W. (1999) · Neuron · doi:10.1016/s0896-6273(00)80821-1 · Cited by 2,581
Neural mechanisms for the recognition of biological movements
Giese, M. A., & Poggio, T. (2003) · Nature Reviews Neuroscience · doi:10.1038/nrn1057 · Cited by 955
Unsupervised Statistical Learning of Higher-Order Spatial Structures from Visual Scenes
Fiser, J., & Aslin, R. N. (2001) · Psychological Science · doi:10.1111/1467-9280.00392 · Cited by 805
Self-citationShadlen, M. N., & Movshon, J. A. (1999) · Neuron · doi:10.1016/s0896-6273(00)80822-3 · Cited by 606
Computational Neuroscience of Vision
Rolls, E., & Deco, G. (2001) · doi:10.1093/acprof:oso/9780198524885.001.0001 · Cited by 553
Metadata
- Authors
- Mel, B. W., & Fiser, J.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2000-04-01
- Volume
- 12
- Issue
- 4
- Pages
- 731-762
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2148971934
- Cited by
- 97
- References
- 3
- FWCI
- 6.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Minimizing Binding Errors Using Learned Conjunctive Features. https://app.cochat.ai/papers/10.1162/089976600300015574
- The paper
- Mel, B. W., & Fiser, J. (2000). Minimizing Binding Errors Using Learned Conjunctive Features. Neural Computation. https://doi.org/10.1162/089976600300015574
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.