Abstract
We propose a model for rate-constrained pattern recognition problems, and present single-letter information bounds governing the conditions under which asymptotically error-free recognition is possible. The bounds depend on the statistics of the training and testing data, the number of pattern classes, and the rates of the codes used by the recognition system to internalize the data.
| Original language | English |
|---|---|
| Pages (from-to) | 219 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |