An iterative graph cut optimization algorithm for a double MRF prior

Christian Wolf 1
1 imagine - Extraction de Caractéristiques et Identification
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00422548
Contributor : Christian Wolf <>
Submitted on : Wednesday, October 7, 2009 - 4:42:44 PM
Last modification on : Tuesday, February 26, 2019 - 4:35:37 PM
Long-term archiving on : Tuesday, October 16, 2012 - 11:55:50 AM

File

tr-liris-2008-doublemrf.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00422548, version 1

Citation

Christian Wolf. An iterative graph cut optimization algorithm for a double MRF prior. 2008. ⟨hal-00422548⟩

Share

Metrics

Record views

186

Files downloads

93