![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
12th DRR 2005: San Jose, California, USA
- Elisa H. Barney Smith, Kazem Taghva:
Document Recognition and Retrieval XII, San Jose, California, USA, January 16-20, 2005, Proceedings. SPIE Proceedings 5676, SPIE 2005, ISBN 0-8194-5649-7
DIA I: OCR Systems I
- Xiaofan Lin:
DRR research beyond commercial off-the-shelf OCR software: a survey. 1-9 - Premkumar S. Natarajan
, Ehry MacRostie, Michael Decerbo:
The BBN Byblos Hindi OCR system. 10-16 - Clemens Oertel, Shauna O'Shea, Adam Bodnar, Dorothea Blostein:
Using the web to validate document recognition results: experiments with business cards. 17-27
DIA I: OCR Systems II
- Penny Garrison, Diane L. Davis, Timothy L. Andersen
, Elisa H. Barney Smith
:
Study of style effects on OCR errors in the MEDLINE database. 28-36 - Thomas A. Nartker, Stephen V. Rice, Steven E. Lumos:
Software tools and test data for research and testing of page-reading OCR systems. 37-47 - Jianming Jin, Hua Wang, Xiaoqing Ding, Liangrui Peng:
Printed Arabic document recognition system. 48-55
Handwriting Recognition
- Esra Vural, Hakan Erdogan, Kemal Oflazer
, Berrin A. Yanikoglu
:
An online handwriting recognition system for Turkish. 56-65 - Sargur N. Srihari, Chen Huang, Harish Srinivasan:
Search engine for handwritten documents. 66-75 - Yan Chen, Xiaoqing Ding:
Sequence-matching-based feature extraction with applications to signature verification. 76-83 - Amalia I. Rusu, Venu Govindaraju:
On the challenges that handwritten text images pose to computers and new practical applications. 84-91 - Javad Sadri, Ching Y. Suen, Tien D. Bui:
New approach for segmentation and recognition of handwritten numeral strings. 92-100
DIA II: Learning Methods
- Abderrahmane Namane, Madjid Arezki, Abderrezak Guessoum, El Houssine Soubari, Patrick Meyrueis, Michel Bruynooghe:
Sequential neural network combination for degraded machine-printed character recognition. 101-110 - Jared Hopkins, Timothy L. Andersen
:
A Fourier-descriptor-based character recognition engine implemented under the Gamera open-source document-processing framework. 111-118 - Kazem Taghva, Jeffrey S. Coombs, Ray Pereda, Thomas A. Nartker:
Address extraction using hidden Markov models. 119-126 - Hua Wang, Xiaoqing Ding, Jianming Jin, M. Halmurat:
New statistical method for machine-printed Arabic character recognition. 127-135
Image Processing
- Hirobumi Nishida:
Restoring high-resolution text images to improve legibility and OCR accuracy. 136-147 - Huanfeng Ma, David S. Doermann:
Font identification using the grating cell texture operator. 148-156 - Derek J. Walvoord, Roger L. Easton Jr., Keith T. Knox, Matthew Heimbueger:
Enhancement and character recognition of the erased colophon of a 15th-century Hebrewa prayer book. 157-166 - Zhixin Shi, Venu Govindaraju:
Historical document image segmentation using background light intensity normalization. 167-174 - Changsong Liu, Xiaoqing Ding:
Automatic style clustering of printed characters in form images. 175-182
Applications of Document Recognition
- Daniel P. Lopresti, A. Lawrence Spitz:
Information leakage through document redaction: attacks and countermeasures. 183-190 - Henry S. Baird, Jon Louis Bentley:
Implicit CAPTCHAs. 191-196 - Henry S. Baird, Terry P. Riopka:
ScatterType: a reading CAPTCHA resistant to segmentation attack. 197-207 - Daniel P. Lopresti, George Nagy
:
Chipless ID for paper documents. 208-215
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.