Redundant structure detection in attributed adjacency graphs for character detection in comics books
نویسندگان
چکیده
Graphs are popular data structures used to model pair wise relations between elements from a given collection. In image processing, adjacency graphs are often used to represent the relations between segmented regions. Such graphs can be compared but graph matching strategies are essential to find similar patterns. In this paper, we propose to detect the recurrent characters of a comics book. In this method each panel is represented with an attributed adjacency graph. Then, an inexact graph matching strategy is applied to find redundant structures among this set of graphs. The main idea is that the same character will be represented by similar subgraphs in the different panels where it appears. The two-step matching process consists in a node matching step and an edge validation step. Experiments show that our approach is able to detect redundant structures in the graph and consequently the recurrent characters in a comics book. The originality of our approach is that no model is required, the algorithm detects all by itself all redundant structures. Keywords—Comics, character detection, attributed adjacency graph, graph comparison, graph matching, spatial relation
منابع مشابه
A Study on Frame Position Detection of Digitized Comics Images
Recently, comic is read not only through paper media, but also digital devices i.e. personal computer, cell phone, epaper reader and etc. Thus, the display environment is quite different at each device. Comic consists of many frames that have text, character and illustrations. Moreover, the reading order of comic is defined by frames. Therefore, in order to provide user centric presentation fun...
متن کاملOf Cornopleezeepi and Party Poopers: A Brief History of Physicians in Comics.
The representations of physicians and medical practice found in comic strips, comic books, and graphic novels throughout the past century reflect broader representational trends in popular visual media. Drawing on examples including Winsor McCay's Dream of the Rarebit Fiend, the superhero comics character Stephen Strange/Doctor Strange, and contemporary graphic medicine, this article outlines t...
متن کاملReal-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs
We describe a production Twitter system for generating relevant, personalized, and timely recommendations based on observing the temporally-correlated actions of each user’s followings. The system currently serves millions of recommendations daily to tens of millions of mobile users. The approach can be viewed as a specific instance of the novel problem of online motif detection in large dynami...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملNode Re-Ordering as a Means of Anomaly Detection in Time-Evolving Graphs
Anomaly detection is a vital task for maintaining and improving any dynamic system. In this paper, we address the problem of anomaly detection in time-evolving graphs, where graphs are a natural representation for data in many types of applications. A key challenge in this context is how to process large volumes of streaming graphs. We propose a pre-processing step before running any further an...
متن کامل