An iterative graph cut optimization algorithm for a double MRF prior - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

An iterative graph cut optimization algorithm for a double MRF prior

Résumé

In a previous publication we presented a double MRF model capable of separatly regularizing the recto and verso side of a document suffering from ink bleed through. In this paper we show that this model naturally leads to an efficient optimization method based on the minimum cut/maximum flow in a graph. The proposed method is evaluated on scanned document images from the 18th century, showing an improvement of character recognition results compared to other restoration methods.
Fichier principal
Vignette du fichier
tr-liris-2008-doublemrf.pdf (649.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00422548 , version 1 (07-10-2009)

Identifiants

  • HAL Id : hal-00422548 , version 1

Citer

Christian Wolf. An iterative graph cut optimization algorithm for a double MRF prior. 2008. ⟨hal-00422548⟩
110 Consultations
85 Téléchargements

Partager

Gmail Facebook X LinkedIn More