Paper
1 February 1998 Fast precise preclassification method using a candidate table designed by projections of feature regions
Katsuhito Fujimoto, Hiroshi Kamada, Koji Kurokawa
Author Affiliations +
Abstract
For feasible recognition having many categories such as Japanese character recognition, fast matching algorithms are necessary because the matching process occupies most of recognition time. In addition, for improving recognition accuracy, the matching process must use more complicated discrimination functions or a higher dimensional feature space, which involves higher computational costs. Therefore, pre-classification is used, which outputs a set of candidate categories to decrease the number of computations of the complicated discrimination functions.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Katsuhito Fujimoto, Hiroshi Kamada, and Koji Kurokawa "Fast precise preclassification method using a candidate table designed by projections of feature regions", Proc. SPIE 3346, Sixth International Workshop on Digital Image Processing and Computer Graphics: Applications in Humanities and Natural Sciences, (1 February 1998); https://doi.org/10.1117/12.301378
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optical character recognition

Statistical analysis

Computer programming

Associative arrays

Feature extraction

Detection and tracking algorithms

Feature selection

Back to Top