Results 1 - 10
of
73
Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA
, 2003
"... In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Automated Public Turing test to Tell Computers and Humans Apart") is a program that can generate and grade tests that ..."
Abstract
-
Cited by 202 (4 self)
- Add to MetaCart
(Show Context)
In this paper we explore object recognition in clutter. We test our object recognition techniques on Gimpy and EZGimpy, examples of visual CAPTCHAs. A CAPTCHA ("Completely Automated Public Turing test to Tell Computers and Humans Apart") is a program that can generate and grade tests that most humans can pass, yet current computer programs can't pass. EZ-Gimpy (see Fig. 1, 5), currently used by Yahoo, and Gimpy (Fig. 2,9) are CAPTCHAs based on word recognition in the presence of clutter. These CAPTCHAs provide excellent test sets since the clutter they contain is adversarial; it is designed to confuse computer programs. We have developed efficient methods based on shape context matching that can identify the word in an EZGimpy image with a success rate of 92%, and the requisite 3 words in a Gimpy image 33% of the time. The problem of identifying words in such severe clutter provides valuable insight into the more general problem of object recognition in scenes. The methods that we present are instances of a framework designed to tackle this general problem.
Distortion estimation techniques in solving visual captchas
- In CVPR 2004
, 2004
"... Abstract — This paper describes two distortion estimation techniques for object recognition that solve EZ-Gimpy and Gimpy-r, two of the visual CAPTCHAs (“Completely Automated Public Turing test to tell Computers and Humans Apart”) with high degrees of success. A CAPTCHA is a program that generates a ..."
Abstract
-
Cited by 47 (0 self)
- Add to MetaCart
(Show Context)
Abstract — This paper describes two distortion estimation techniques for object recognition that solve EZ-Gimpy and Gimpy-r, two of the visual CAPTCHAs (“Completely Automated Public Turing test to tell Computers and Humans Apart”) with high degrees of success. A CAPTCHA is a program that generates and grades tests that most humans can pass but current computer programs cannot pass. We have developed a correlation algorithm that correctly identifies the word in an EZ-Gimpy challenge image 99 % of the time and a direct distortion estimation algorithm that correctly identifies the four letters in a Gimpy-r challenge image 78 % of the time. I.
Local gradient histogram features for word spotting in unconstrained handwritten documents
"... ..."
G.: Font adaptive word indexing of modern printed documents
- IEEE Transactions on PAMI
, 2006
"... Abstract—We propose an approach for the word-level indexing of modern printed documents which are difficult to recognize using current OCR engines. By means of word-level indexing, it is possible to retrieve the position of words in a document, enabling queries involving proximity of terms. Web sear ..."
Abstract
-
Cited by 17 (6 self)
- Add to MetaCart
(Show Context)
Abstract—We propose an approach for the word-level indexing of modern printed documents which are difficult to recognize using current OCR engines. By means of word-level indexing, it is possible to retrieve the position of words in a document, enabling queries involving proximity of terms. Web search engines implement this kind of indexing, allowing users to retrieve Web pages on the basis of their textual content. Nowadays, digital libraries hold collections of digitized documents that can be retrieved either by browsing the document images or relying on appropriate metadata assembled by domain experts. Word indexing tools would therefore increase the access to these collections. The proposed system is designed to index homogeneous document collections by automatically adapting to different languages and font styles without relying on OCR engines for character recognition. The approach is based on three main ideas: the use of Self Organizing Maps (SOM) to perform unsupervised character clustering, the definition of one suitable vector-based word representation whose size depends on the word aspect-ratio, and the run-time alignment of the query word with indexed words to deal with broken and touching characters. The most appropriate applications are for processing modern printed documents (17th to 19th centuries) where current OCR engines are less accurate. Our experimental analysis addresses six data sets containing documents ranging from books of the 17th century to contemporary journals. Index Terms—Clustering, digital libraries, document image retrieval, heuristic oversegmentation, holistic word representation, modern documents, self organizing map. æ 1
Exploring the Use of Conditional Random Field Models and HMMs for Historical Handwritten Document Recognition
- the Proceedings of the 2nd IEEE International Conference on Document Image Analysis for Libraries (DIAL
"... In this paper we explore different approaches for improving the performance of dependency models on discrete features for handwriting recognition. Hidden Markov Models have often been used for handwriting recognition. Conditional random fields (CRF’s) allow for more general dependencies and we inves ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
(Show Context)
In this paper we explore different approaches for improving the performance of dependency models on discrete features for handwriting recognition. Hidden Markov Models have often been used for handwriting recognition. Conditional random fields (CRF’s) allow for more general dependencies and we investigate their use. We believe that this is the first attempt at apply CRF’s for handwriting recognition. We show that on the whole word recognition task, the CRF performs better than a HMM on a publicly available standard dataset of 20 pages of George Washington’s manuscripts. The scale space for the whole word recognition task is large- almost 1200 states. To make CRF computation tractable we use beam search to make inference more efficient using three different approaches. Better improvement can be obtained using the HMM by directly smoothing the discrete features using the collection frequencies. This shows the importance of smoothing and also indicates the difficulty of training CRF’s when large state spaces are involved. 1
Offline general handwritten word recognition using an approximate BEAM matching algorithm
- IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI
, 2001
"... AbstractÐA recognition system for general isolated offline handwritten words using an approximate segment-string matching algorithm is described. The fundamental paradigm employed is a character-based segment-then-recognize/match strategy. Additional user supplied contextual information in the form ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
AbstractÐA recognition system for general isolated offline handwritten words using an approximate segment-string matching algorithm is described. The fundamental paradigm employed is a character-based segment-then-recognize/match strategy. Additional user supplied contextual information in the form of a lexicon guides a graph search to estimate the most likely word image identity. This system is designed to operate robustly in the presence of document noise, poor handwriting, and lexicon errors, so this basic strategy is significantly extended and enhanced. A preprocessing step is initially applied to the image to remove noise artifacts and normalize the handwriting. An oversegmentation approach is taken to improve the likelihood of capturing the individual characters embedded in the word. The goal is to produce a segmentation point set that contains one subset which is the correct segmentation of the word image. This is accomplished by a segmentation module, employing several independent detection rules based on certain key features, which finds the most likely segmentation points of the word. Next, a sliding window algorithm, using a character recognition algorithm with a very good noncharacter rejection response, is used to find the most likely character boundaries and identities. A directed graph is then constructed that contains many possible interpretations of the word image, many implausible. Contextual information is used at this point and the lexicon is matched to the graph in a breath-first manner, under an appropriate metric. The matching algorithm employs a BEAM search algorithm with several heuristics to compensate for the most likely errors contained in the interpretation graph, including missing segments from segmentation failures, misrecognition of the segments, and lexicon errors. The most likely graph path and associated confidence is computed for each lexicon word to produce a final lexicon ranking. These confidences are
Holistic verification of handwritten phrases
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1999
"... AbstractÐIn this paper, we describe a system for rapid verification of unconstrained off-line handwritten phrases using perceptual holistic features of the handwritten phrase image. The system is used to verify handwritten street names automatically extracted from live U.S. mail against recognition ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
(Show Context)
AbstractÐIn this paper, we describe a system for rapid verification of unconstrained off-line handwritten phrases using perceptual holistic features of the handwritten phrase image. The system is used to verify handwritten street names automatically extracted from live U.S. mail against recognition results of analytical classifiers. Presented with a binary image of a street name and an ASCII street name, holistic features (reference lines, large gaps and local contour extrema) of the street name hypothesis are ªpredictedº from the expected features of the constituent characters using heuristic rules. A dynamic programming algorithm is used to match the predicted features with the extracted image features. Classes of holistic features are matched sequentially in increasing order of cost, allowing an ACCEPT/REJECT decision to be arrived at in a time-efficient manner. The system rejects errors with 98 percent accuracy at the 30 percent accept level, while consuming approximately 20/msec per image on the average on a 150 MHz SPARC 10. Index TermsÐWord verification, holistic approaches, word shape matching, handwritten word recognition, address interpretation. æ
Support Vector Machines versus Multi-Layer Perceptrons for Efficient Off-Line Signature Recognition
"... Abstract. – The problem of automatic signature recognition has received little attention in comparison with the problem of signature verification despite its potential applications for accessing security-sensitive facilities and for processing certain legal and historical documents. This paper prese ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
(Show Context)
Abstract. – The problem of automatic signature recognition has received little attention in comparison with the problem of signature verification despite its potential applications for accessing security-sensitive facilities and for processing certain legal and historical documents. This paper presents an efficient off-line human signature recognition system based on Support Vector Machines (SVM) and compares its performance with a traditional classification technique, Multi-Layer Perceptrons (MLP). In both cases we propose two approaches to the problem: (1) construct each feature vector using a set of global geometric and moment-based characteristics from each signature and (2) construct the feature vector using the bitmap of the corresponding signature. We also present a mechanism to capture the intrapersonal variability of each user using just one original signature. Our results empirically show that SVM, which achieves up to 71 % correct recognition rate, outperforms MLP.
Handwritten Brazilian Month Recognition: An Analysis of Two NN Architectures and a Rejection Mechanism,
- In Proceedings of 9th International Workshop on Frontiers in Handwriting Recognition (IWFHR-9),
, 2004
"... ..."