Versatile document image content extraction

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 6067, Issue , 2006, Pages

  Baird, Henry S ^a   Moll, Michael A ^a   Nonnemaker, Jean ^a   Casey, Matthew R ^a   Delorenzo, Don L ^a  

^a Lehigh University   (United States)

Author keywords

Bayes decision theory; CART; Classification; Computational geometry; Hashing; k Nearest Neighbors; k d trees; Spatial data structures

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; DECISION THEORY; INFORMATION RETRIEVAL SYSTEMS; TREES (MATHEMATICS);

BAYES DECISION THEORY; CART; CLASSIFICATION; HASHING; K NEAREST NEIGHBORS; K-D TREES; SPATIAL DATA STRUCTURES;

CONTENT BASED RETRIEVAL;

EID: 33645687707     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.650359     Document Type: Conference Paper

References (14)

1. T. K. Ho and H. S. Baird, "Large-scale simulation studies in image pattern recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence 19, pp. 1067-1079, October 1997.
2. T. M. Cover and P. E. Hart, "Nearest neighbor pattern classification," IEEE Trans. on Information Theory 13, pp. 21-27, 1967.
3. R. Weber, H. J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proc., 24th Int'l Conf., on Very Large Data Bases, August 1998.
4. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, 2nd Edition, Wiley, New York, 2001.
5. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc., 25th Int'l Conf., on Very Large Data Bases, September 1999.
6. M. Datar, P. Indyk, N. Immorlica, and V. Mirrokni. "Locality-sensitive hashing scheme based on p-stable distributions," in Proc., Symposium on Computational Geometry, 2004.
7. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, Massachusetts, 1990.
8. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM 18(9), pp. 509-517, 1975.
9. A. Farag, T. Linder, and G. Lugosi, "Fast nearest-neighbor search in dissimilarity spaces," IEEE Trans. Pattern Anal. Mach. Intell. 15(9), pp. 957-962, 1993.
10. G. Yuval, "Finding nearest neighbors.," Inf. Process. Lett. 5(3), pp. 63-65, 1976.
11. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Commun. ACM 18(9), pp. 509-517, 1975.
12. J. H. Freidman, J. L. Bentley, and R. A. Finkel, "An algorithm for finding best matches in logarithmic expected time," ACM Trans. Math. Softw. 3(3), pp. 209-226, 1977.
13. D. T. Lee and C. K. Wong, "Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees.," Acta Inf. 9, pp. 23-29, 1977.
14. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees, Wadsworth & Brooks/Cole, Pacific Grove, CA, 1984.