Word Spotting in Bitmapped Fax Documents

  • Authors:

  • William J. Williams;Eugene J. Zalubas;Alfred O. Hero, III

  • Affiliations:

  • Electrical Engineering and Computer Science Dept., University of Michigan, Ann Arbor MI 48109, USA;Electrical Engineering and Computer Science Dept., University of Michigan, Ann Arbor MI 48109, USA;Electrical Engineering and Computer Science Dept., University of Michigan, Ann Arbor MI 48109, USA

  • Venue:
  • Information Retrieval
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Images and signals may be represented by forms invariant to time shifts, spatial shifts, frequency shifts, and scale changes. Advances in time-frequency analysis and scale transform techniques have made this possible. However, factors such as noise contamination and “style” differences complicate this. An example is found in text, where letters and words may vary in size and position. Examples of complicating variations include the font used, corruption during facsimile (fax) transmission, and printer characteristics. The solution advanced in this paper is to cast the desired invariants into separate subspaces for each extraneous factor or group of factors. The first goal is to have minimal overlap between these subspaces and the second goal is to be able to identify each subspace accurately. Concepts borrowed from high-resolution spectral analysis, but adapted uniquely to this problem have been found to be useful in this context. Once the pertinent subspace is identified, the recognition of a particular invariant form within this subspace is relatively simple using well-known singular value decomposition (SVD) techniques. The basic elements of the approach can be applied to a variety of pattern recognition problems. The specific application covered in this paper is word spotting in bitmapped fax documents.