MuralCut: Automatic character segmentation from mural images

T. Intharah, N. Khiripet
{"title":"MuralCut: Automatic character segmentation from mural images","authors":"T. Intharah, N. Khiripet","doi":"10.1109/ECTICON.2012.6254135","DOIUrl":null,"url":null,"abstract":"Segmenting characters from mural images is a crucial basic operation for other tasks whose common goal is to preserve the mural art, one of the important Thai cultural heritage. The problem is effective segmentation algorithms, which are used at present, are semi-automatic and general purpose; so users have to put heavy effort to get the satisfied result. Hence this paper proposes the automatic segmentation algorithm to segment characters from mural images automatically. The algorithm is divided into two main parts: automatic selection part and segmentation part. In automatic selection, we applied spectral residual to play a key role in selecting regions of interest, i.e., an object region and a background region to be inputs of the segmentation part. In segmentation part, an iterated graph-cut is used as the main mechanism of the segmentation in this work. Besides, In order to improve performance of the iterated graph-cuts, a superpixels algorithm is applied. Result of the algorithm from ordinary background images is 7.49% misclassified pixels with precision 73.02% and recall 94.64%.","PeriodicalId":6319,"journal":{"name":"2012 9th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology","volume":"49 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 9th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECTICON.2012.6254135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Segmenting characters from mural images is a crucial basic operation for other tasks whose common goal is to preserve the mural art, one of the important Thai cultural heritage. The problem is effective segmentation algorithms, which are used at present, are semi-automatic and general purpose; so users have to put heavy effort to get the satisfied result. Hence this paper proposes the automatic segmentation algorithm to segment characters from mural images automatically. The algorithm is divided into two main parts: automatic selection part and segmentation part. In automatic selection, we applied spectral residual to play a key role in selecting regions of interest, i.e., an object region and a background region to be inputs of the segmentation part. In segmentation part, an iterated graph-cut is used as the main mechanism of the segmentation in this work. Besides, In order to improve performance of the iterated graph-cuts, a superpixels algorithm is applied. Result of the algorithm from ordinary background images is 7.49% misclassified pixels with precision 73.02% and recall 94.64%.
MuralCut:从壁画图像自动字符分割
从壁画中提取文字是保护壁画艺术这一泰国重要文化遗产的重要基础工作。问题是目前使用的有效分割算法都是半自动的、通用的;所以用户必须付出很大的努力才能得到满意的结果。为此,本文提出了一种壁画图像字符自动分割算法。该算法主要分为自动选择部分和分割部分。在自动选择中,我们利用谱残差来选择感兴趣的区域,即目标区域和背景区域作为分割部分的输入。在分割部分,本文采用迭代图切作为分割的主要机制。此外,为了提高迭代图切割的性能,采用了超像素算法。在普通背景图像中,该算法的误分率为7.49%,准确率为73.02%,召回率为94.64%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信