uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Document binarization using topological clustering guided Laplacian Energy Segmentation
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Visual Information and Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction.ORCID iD: 0000-0002-4405-6888
2014 (English)In: Proceedings International Conference on Frontiers in Handwriting Recognition (ICFHR), 2014, 2014, 523-528 p.Conference paper, Published paper (Refereed)
Abstract [en]

The current approach for text binarization proposesa clustering algorithm as a preprocessing stage toan energy-based segmentation method. It uses a clusteringalgorithm to obtain a coarse estimate of the background (BG)and foreground (FG) pixels. These estimates are used as a priorfor the source and sink points of a graph cut implementation,which is used to efficiently find the minimum energy solution ofan objective function to separate the BG and FG. The binaryimage thus obtained is used to refine the edge map that guidesthe graph cut algorithm. A final binary image is obtained byonce again performing the graph cut guided by the refinededges on a Laplacian of the image.

Place, publisher, year, edition, pages
2014. 523-528 p.
Series
Frontiers in Handwriting Recognition, ISSN 2167-6445 ; 14
Keyword [en]
Image Processing; Classification; Machine Learning; Graph-theoretic methods.
National Category
Computer Systems Signal Processing
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-238316DOI: 10.1109/ICFHR.2014.94ISBN: 978-1-4799-4335-7 (print)OAI: oai:DiVA.org:uu-238316DiVA: diva2:770839
Conference
International Conference on Frontiers in Handwriting Recognition (ICFHR),September 1-4, 2014, Crete, Greece.
Funder
Swedish Research Council, 2012-5743
Available from: 2014-12-11 Created: 2014-12-11 Last updated: 2016-05-30Bibliographically approved

Open Access in DiVA

fulltext(991 kB)41 downloads
File information
File name FULLTEXT01.pdfFile size 991 kBChecksum SHA-512
e00f229e92fbb1403354c6a48c9481be9f47deae0ffdf085a15c31eaf81a9a34e731b072e71238241dc89cd8ae82499f6577148bcdc77191c0d2e39e6074ad79
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Ayyalasomayajula, Kalyan RamBrun, Anders

Search in DiVA

By author/editor
Ayyalasomayajula, Kalyan RamBrun, Anders
By organisation
Division of Visual Information and InteractionComputerized Image Analysis and Human-Computer Interaction
Computer SystemsSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 41 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 621 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf