A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Graph edit distance (GED) is a powerful and flexible graph matching paradigm that can be used to address different tasks in structural pattern recognition, machine learning, and data mining. In this paper, some new binary linear programming formulations for computing the exact GED between two graphs are proposed. A major strength of the formulations lies in their genericity since the GED can be computed between directed or undirected fully attributed graphs (i.e. with attributes on botharXiv:1505.05740v1 fatcat:x5hkpysdgjd2fpffb47wa7pvee
more »... and edges). Moreover, a relaxation of the domain constraints in the formulations provides efficient lower bound approximations of the GED. A complete experimental study comparing the proposed formulations with 4 state-of-the-art algorithms for exact and approximate graph edit distances is provided. By considering both the quality of the proposed solution and the efficiency of the algorithms as performance criteria, the results show that none of the compared methods dominates the others in the Pareto sense. As a consequence, faced to a given real-world problem, a trade-off between quality and efficiency has to be chosen w.r.t. the application constraints. In this context, this paper provides a guide that can be used to choose the appropriate method.
To cite this version: Julien Lerouge, Maroua Hammami, Pierre Héroux, Sébastien Adam. Minimum cost subgraph matching using a binary linear program. Pattern Recognition Letters, Elsevier, 2016, 71, pp. ...doi:10.1016/j.patrec.2015.11.026 fatcat:iuseetk3bbai7mkdgvxhy5d7vy
Lecture Notes in Computer Science
The substitution-tolerant subgraph isomorphism is a particular error-tolerant subgraph matching that allows label substitutions for both vertices and edges. Such a matching is often required in pattern recognition applications since graphs extracted from images are generally labeled with features vectors computed from raw data which are naturally subject to noise. This paper describes an extended version of a Binary Linear Program (BLP) for solving this class of graph matching problem. Thedoi:10.1007/978-3-319-18224-7_13 fatcat:fogd2zn6krbbrbfeq7eeis2a3q
more »... also presents GEM++, a software framework that implements the BLP and that we have made available for the research community. GEM++ allows the processing of different sub-problems (induced isomorphism or not, directed graphs or not) with complex labelling of vertices and edges. We also present some datasets available for evaluating future contributions in this field.
Gold nanoparticles have been the center of interest for scientists since many decades. Within the last 20 years, the research in that field has soared with the possibility to design and study nanoparticles with controlled shapes. From spheres to more complex shapes such as stars, or anisotropic architectures like rods or bipyramids, these new systems feature plasmonic properties making them the tools of choice for studies on light-matter interactions. In that context, fluorescence quenching anddoi:10.1515/nanoph-2015-0143 fatcat:jlpbij7dfjhf3mexs7xcl6e6n4
more »... enhancement by gold nanostructures is a growing field of research. In this review, we report a non-exhaustive summary of the synthetic modes for various shapes and sizes of isotropic and anisotropic nanoparticles. We then focus on fluorescent studies of these gold nano-objects, either considering "bare" particles (without modifications) or hybrid particles (surface interaction with a chromophore). In the latter case, the well-known metal-enhanced fluorescence (MEF) is more particularly developed; the mechanisms of MEF are discussed in terms of the additional radiative and non-radiative decay rates caused by several parameters such as the vicinity of the chromophore to the metal or the size and shape of the nanostructures.
The measure proposed by Lerouge et al.  meets the requirements mentioned above. ...doi:10.1109/icdar.2017.193 dblp:conf/icdar/MehriHLM17 fatcat:hfnu7vetmbcefngfbl344omlte
The work conducted in this article presents a structural signature based on texture for the characterization and categorization of digitized historical book pages. The proposed signature does not assume a priori knowledge regarding page layout and content, and hence, it is applicable to a large variety of ancient books. By integrating varying low-level features (e.g. texture) characterizing the different page components (i.e. different text fonts or graphic regions) on the one hand, anddoi:10.1109/icdar.2015.7333737 dblp:conf/icdar/MehriHLGM15 fatcat:t6hbzcgcufaixeej7degojwtb4
more »... al information describing the page layout on the other hand, the proposed signature provides a rich and holistic description of the layout and content of the analyzed book pages. More precisely, the signature-based characterization approach consists of two stages. The first stage is extracting automatically homogeneous regions. Then, the second one is proposing a graph-based page signature, which is based on the extracted homogeneous regions, reflecting its layout and content. This signature ensures the implementation of numerous applications for managing effectively a corpus or collections of books (e.g. information retrieval in digital libraries according to several criteria or page categorization). To illustrate the effectiveness of the proposed page signature, a detailed experimental evaluation has been conducted in this article for assessing two possible categorization applications, unsupervised page classification and page stream segmentation.
This article tackles some important issues relating to the analysis of a particular case of complex ancient graphic images, called "lettrines", "drop caps" or "ornamental letters". Our contribution focuses on proposing generic solutions for lettrine recognition and classification. Firstly, we propose a bottom-up segmentation method, based on texture, ensuring the separation of the letter from the elements of the background in an ornamental letter. Secondly, a structural representation isdoi:10.1109/icdar.2015.7333757 dblp:conf/icdar/MehriGHCLM15 fatcat:dxjbbtbb3rb3td2u5y3qqjz3la
more »... d for characterizing a lettrine. This structural representation is based on filtering automatically relevant information by extracting representative homogeneous regions from a lettrine to generate a graph-based signature. The proposed signature provides a rich and holistic description of the lettrine style by integrating varying low-level features (e.g. texture). Then, to categorize and classify lettrines with similar style, structure (i.e. ornamental background) and content (i.e. letter), a graphmatching paradigm has been carried out to compare and classify the resulting graph-based signatures. Finally, to demonstrate the robustness of the proposed solutions and provide additional insights into their accuracies, an experimental evaluation has been conducted using a relevant set of lettrine images. In addition, we compare the results achieved with those obtained using the stateof-the-art methods to illustrate the effectiveness of the proposed solutions.
Lerouge, 2007, p. 320 ; Rahim Shayegan, 2011, p. 335. Lerouge, 2007, p. 104 et suivantes. Par exemple, Rose, 2005, p. 23, fig. 1 ; Lerouge, 2007, p. 110. Cf. Ovide, Fastes , V, 591-594. ... Lerouge, 2007, p. 285. Pour un résumé rapide et récent de la bataille : Traina, 2011a, p. 81-94 ; Lerouge, 2007, p. 282-295. Lucain, I, 100. ...doi:10.4000/pallas.17914 fatcat:gxaet6tcfnfrvmiwkkgoovx37m
N 工 工 一 Eleotronio Julien ． ( ibid． ， p 。 ... STENDHAL の こ の 感 想 に は ，日 付 が 入 っ て い な V ・ が ，他 の 1832 年 2 月 の 書 込 み と 同 じ く鉛 筆 で 書 か れ て い る ．Rouge は も ち ろ ん ， leRouge et te Noir を 意 味 す る ． 2 ＞ STENDHAL ： Corres ♪ ondance ， II ，6ditions de la P16iade ...doi:10.20634/ellf.23.0_33 fatcat:fqa2mkflene5nmgxm3uomqlgha
Lerouge (1984), G. Lerouge et al. (1986) , C. Lorenz et J. Lorenz (1983 ) et P. Freytet et al. (1985 et 1989 . ... Velles (434 km² de bassin), le module de la Bouzanne est de 3,19 m 3 /s, les hautes eaux de février atteignent 7,18 m 3 /s et les basses eaux d'août 0,61 m 3 /s, les crues quinquennales peuvent (Cohen-Julien ...doi:10.4000/norois.1384 fatcat:vgpegigbordfbg66kyqszp5chi
National Union Catalog
Library of Congress 2; Le Roi, Julien David see Le Roy, Julien David. 1724?-1S0:;. ... Library of Congress MT345.R65 ra) Lerouge, Gaston. Théorie de la fraude en droit fiscal, par Gaston Lerouge ... Préface de Georges Ripert... ...
Il n'y a aucune espèce de quota » (Julien Pastel, Ministère, France). ... (Julien Pastel, Ministère, France) Pour l'État français, les études ne sont pas considérées comme un moyen d'immigrer. ...doi:10.7202/1020608ar fatcat:i4ty42fpxjgxpen4kflhskw3te
« Previous Showing results 1 — 15 out of 70 results