{"title":"Detection of comic books twin pages with a non-overlapping stitching method","authors":"C. Guérin, J. Burie, J. Ogier","doi":"10.1145/3011549.3011550","DOIUrl":null,"url":null,"abstract":"We address in this paper the issue of stitching non overlapping pairs of real digitized comic books' pages. The main objective is to be able to decide if two pages are meant to be displayed together for their content to be understood. First, the relevant content is separated from the background so the pairing is done over relevant pieces of visual information. We define the different kinds of noise that one can found on the edges of such documents and how to get rid of it. Then we propose a method to decide whether a couple of pages should be paired or not, based on the analysis of the relevant content. Our compatibility methods are evaluated against the methods from the literature, adapted from jigsaw puzzles solvers. Results are discussed over an actual commercial dataset of digitized comic books.","PeriodicalId":319382,"journal":{"name":"Proceedings of the 1st International Workshop on coMics ANalysis, Processing and Understanding","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st International Workshop on coMics ANalysis, Processing and Understanding","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3011549.3011550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We address in this paper the issue of stitching non overlapping pairs of real digitized comic books' pages. The main objective is to be able to decide if two pages are meant to be displayed together for their content to be understood. First, the relevant content is separated from the background so the pairing is done over relevant pieces of visual information. We define the different kinds of noise that one can found on the edges of such documents and how to get rid of it. Then we propose a method to decide whether a couple of pages should be paired or not, based on the analysis of the relevant content. Our compatibility methods are evaluated against the methods from the literature, adapted from jigsaw puzzles solvers. Results are discussed over an actual commercial dataset of digitized comic books.