Skip to main navigation Skip to search Skip to main content

Nested state indexing in pairwise Markov networks for fast handwritten document image rule-line removal

  • BBN Technologies

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

The Markov random field (MRF) has been applied to modeling the connectivity constraints of the text in document images for tasks like binarization and rule-line removal. One challenge of applying the MRF is its high computational cost. This paper presents a method using two nested set of states trained to reduce the computational cost of patch-based MRF. The two sets of states are trained at different levels in coarse-to-fine order. We show effective reduction of run time but very little loss of quality using rule-line removal experiments.

Original languageEnglish
Title of host publication2009 IEEE International Conference on Image Processing, ICIP 2009 - Proceedings
PublisherIEEE Computer Society
Pages2009-2012
Number of pages4
ISBN (Print)9781424456543
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Image Processing, ICIP 2009 - Cairo, Egypt
Duration: Nov 7 2009 → Nov 10 2009

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2009 IEEE International Conference on Image Processing, ICIP 2009
Country/TerritoryEgypt
CityCairo
Period11/7/09 → 11/10/09

Fingerprint

Dive into the research topics of 'Nested state indexing in pairwise Markov networks for fast handwritten document image rule-line removal'. Together they form a unique fingerprint.

Cite this