Capacity/storage tradeoff in high-dimensional identification systems

IEEE Transactions on Information Theory

Volumn 55, Issue 5, 2009, Pages 2097-2106

  Tuncel, Ertem ^a  

^a University of California Riverside   (United States)

Author keywords

Capacity; Databases; Identification systems; Successive refinement

Indexed keywords

CAPACITY; DATABASES; FEATURE DIMENSIONS; FEATURE VECTORS; HIGH-DIMENSIONAL; IDENTIFICATION ERRORS; IDENTIFICATION RATES; IDENTIFICATION SYSTEMS; MULTISTAGE SYSTEM; QUERY OBJECT; SEARCH COMPLEXITY; SINGLE STAGE; STORAGE SPACES; SUCCESSIVE REFINEMENT; SUFFICIENT CONDITIONS; TEST CHANNEL; TWO-STAGE SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 65749117161     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2016057     Document Type: Article

References (16)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1982.
3. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 269-275, Mar. 1991.
4. V. N. Koshelev, "Hierarchical coding of discrete sources," Probl. Pered. Inform., vol. 16, no. 3, pp. 31-49, 1980.
5. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inf. Theory, vol. 40, no. 1, pp. 253-259, Jan. 1994.
6. Y. Steinberg and N. Merhav, "On successive refinement for the Wyner-Ziv problem," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1636-1654, Aug. 2004.
7. J. A. O'Sullivan, N. Singla, and M. B. Westover, "Successive refinement for pattern recognition," in Proc. IEEE Information Theory Workshop Punta del Este, Uruguay, Mar. 2006, pp. 141-145.
8. C. Tian and J. Chen, "Successive refinement for hypothesis testing and lossless one-helper problem," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4666-4681, Oct. 2008.
9. N. Tishby, F. C. Pereira, and W. Bialeck, "The information bottleneck method," in Proc. 37th Annu. Allerton Conf. Communication, Control and Computing, Montecillo, IL, Sep. 1999, pp. 368-377.
10. E. Tuncel, P. Koulgi, and K. Rose, "Rate-distortion approach to databases: Storage and content-based retrieval," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 953-967, Jun. 2004.
11. R. Weber, H. J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proc. Int. Conf. Very Large Data Bases, New York, NY, Aug. 1998, pp. 194-205.
12. M. B. Westover and J. A. O'Sullivan, "Towards an information theoretic framework for object recognition," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 219.
13. M. B. Westover and J. A. O'Sullivan, "Achievable rates for pattern recognition," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 299-320, Jan. 2008.
14. F. Willems, T. Kalker, J. Goseling, and J.-P. Linnartz, "On the capacity of a biometrical identification system," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 82.
15. A. D. Wyner, "A theorem on the entropy of certain binary sequences and application: II," IEEE Trans. Inf. Theory, vol. IT-19, no. 6, pp. 772-777, Nov. 1973.
16. A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. IT-22, no. 1, pp. 1-11,