By Topic

2011 International Conference on Document Analysis and Recognition

Date 18-21 Sept. 2011

Filter Results

Displaying Results 1 - 25 of 310
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (197 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (18 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (122 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - xxvii
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Welcome from the General Chairs

    Publication Year: 2011, Page(s): xxviii
    Request permission for commercial reuse | PDF file iconPDF (94 KB) | HTML iconHTML
    Freely Available from IEEE
  • Welcome from the Program Chairs

    Publication Year: 2011, Page(s): xxix
    Request permission for commercial reuse | PDF file iconPDF (89 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committees

    Publication Year: 2011, Page(s):xxx - xxxii
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s):xxxiii - xxxv
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2011, Page(s): xxxvi
    Request permission for commercial reuse | PDF file iconPDF (351 KB)
    Freely Available from IEEE
  • A Tool for Tuning Binarization Techniques

    Publication Year: 2011, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3628 KB) | HTML iconHTML

    In this paper a user friendly tool appropriate to get user feedback for the application of binarization algorithms is presented. The human feedback is very useful in order to apply next the algorithm to similar images. The tool supports Image Selection and Display, Selection of Binarization Algorithm and Parameter Configuration, Feedback gathering and Creation of log file for further processing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Laplacian Energy for Document Binarization

    Publication Year: 2011, Page(s):6 - 10
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB) | HTML iconHTML

    This paper describes a new algorithm for document binarization, building upon recent work in energy-based segmentation methods. It uses the Laplacian operator to assess the local likelihood of foreground and background labels, Canny edge detection to identify likely discontinuities, and a graph cut implementation to efficiently find the minimum energy solution of an objective function combining th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An MRF Model for Binarization of Natural Scene Text

    Publication Year: 2011, Page(s):11 - 16
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Inspired by the success of MRF models for solving object segmentation problems, we formulate the binarization problem in this framework. We represent the pixels in a document image as random variables in an MRF, and introduce a new energy (or cost) function on these variables. Each variable takes a foreground or background label, and the quality of the binarization (or labelling) is determined by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stroke-Like Pattern Noise Removal in Binary Document Images

    Publication Year: 2011, Page(s):17 - 21
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (989 KB) | HTML iconHTML

    This paper presents a two-phased stroke-like pattern noise (SPN) removal algorithm for binary document images. The proposed approach aims at understanding script-independent prominent text component features using supervised classification as a first step. It then uses their cohesiveness and stroke-width properties to filter and associate smaller text components with them using an unsupervised cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combination of Document Image Binarization Techniques

    Publication Year: 2011, Page(s):22 - 26
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Document image binarization has been studied for decades, and many practical binarization techniques have been proposed for different kinds of document images. However, many state-of-the-art methods are particularly suitable for the document images that suffer from certain specific type of image degradation or have certain specific type of image characteristics. In this paper, we propose a classif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining Document Skew Using Inter-line Spaces

    Publication Year: 2011, Page(s):27 - 31
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (561 KB) | HTML iconHTML

    We present a novel method of determining a global text page orientation. The method is based on Hough transform, but, unlike the existing methods, it does not use the letters themselves and relies on establishing the orientation of interline regions. The method is robust and also works even when a single line of text is present. Experimental evaluation is shown, comparing the method to other metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When is a Problem Solved?

    Publication Year: 2011, Page(s):32 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (137 KB) | HTML iconHTML

    Open problems are defined differently in document image analysis than in the physical sciences, theoretical computer science, or mathematics. Instead of a formal definition, problems in DIA are stated in terms of automation of an application area (e.g., postal address reading) or a scientific sub field (e.g., image compression). The notion of a successful solution may be based on (1) the relative ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CASIA Online and Offline Chinese Handwriting Databases

    Publication Year: 2011, Page(s):37 - 41
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    This paper introduces a pair of online and offline Chinese handwriting databases, containing samples of isolated characters and handwritten texts. The samples were produced by 1,020 writers using Anoto pen on papers for obtaining both online trajectory data and offline images. Both the online samples and offline samples are divided into six datasets, three for isolated characters (DB1.0-C1.2) and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Open Architecture for End-to-End Document Analysis Benchmarking

    Publication Year: 2011, Page(s):42 - 47
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    In this paper, we present a fully operational, scalable and open architecture allowing end-to-end document analysis benchmarking without needing to develop the whole pipeline. By decomposing the analysis process into coarse-grained tasks, and by building upon community provided state-of-the art algorithms, our architecture allows any combination of elementary document analysis algorithms, regardle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aletheia - An Advanced Document Layout and Text Ground-Truthing System for Production Environments

    Publication Year: 2011, Page(s):48 - 52
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB) | HTML iconHTML

    Large-scale digitisation has led to a number of new possibilities with regard to adaptive and learning based methods in the field of Document Image Analysis and OCR. For ground truth production of large corpora, however, there is still a gap in terms of productivity. Ground truth is not only crucial for training and evaluation at the development stage of tools but also for quality assurance in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HMM-Based Alignment of Inaccurate Transcriptions for Historical Documents

    Publication Year: 2011, Page(s):53 - 57
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    For historical documents, available transcriptions typically are inaccurate when compared with the scanned document images. Not only the position of the words and sentences are unknown, but also the correct image transcription may not be matched exactly. An error-tolerant alignment is needed to make the document images amenable to browsing and searching in digital libraries. In this paper, we prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transcript Mapping for Handwritten Text Lines Using Conditional Random Fields

    Publication Year: 2011, Page(s):58 - 62
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB) | HTML iconHTML

    This paper presents a conditional random field (CRF) model for aligning online handwritten Chinese/Japanese text lines (character strings) with the corresponding transcripts. The CRF model is defined on a lattice which contains all possible segmentation hypotheses. The feature functions characterize the shape and context dependences of characters, including the scores of character recognition and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Browsing Heterogeneous Document Collections by a Segmentation-Free Word Spotting Method

    Publication Year: 2011, Page(s):63 - 67
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (942 KB) | HTML iconHTML

    In this paper, we present a segmentation-free word spotting method that is able to deal with heterogeneous document image collections. We propose a patch-based framework where patches are represented by a bag-of-visual-words model powered by SIFT descriptors. A later refinement of the feature vectors is performed by applying the latent semantic indexing technique. The proposed method performs well... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Key-Word Searching via Embedding and Active-DTW

    Publication Year: 2011, Page(s):68 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (203 KB) | HTML iconHTML

    In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required results. First it warps multiple appearances of each word-part in the lexicon for embedding into the same euclidean space. The embedding is done based on the warping path produced by the Dynamic Time Warping (DTW) process w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keyword Spotting in Online Handwritten Documents Containing Text and Non-text Using BLSTM Neural Networks

    Publication Year: 2011, Page(s):73 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    Spotting keywords in handwritten documents without transcription is a valuable method as it allows one to search, index, and classify such documents. In this paper we show that keyword spotting based on bi-directional Long Short-Term Memory (BLSTM) recurrent neural nets can successfully be applied on online handwritten documents with non-text content. It even works without preprocessing steps such... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.