Search results for " graph"
showing 10 items of 1277 documents
Qualifying semantic graphs using model checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns t…
A new approach based on NμSMV Model to query semantic graph
2011
International audience; The language most frequently used to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. Processing of large semantic graphs can be a limit to use semantics in modern information systems. The work presented in this paper is part of a new research at the border between two areas: the semantic web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. The data integration and shar…
A Constrained Band Selection Method Based on Information Measures for Spectral Image Color Visualization
2011
International audience; We present a new method for the visualization of spectral images, based on a selection of three relevant spectral channels to build a Red-Green-Blue composite. Band selection is achieved by means of information measures at the first, second and third orders. Irrelevant channels are preliminarily removed by means of a center-surround entropy comparison. A visualization-oriented spectrum segmentation based on the use of color matching functions allows for computational ease and adjustment of the natural rendering. Results from the proposed method are presented and objectively compared to four other dimensionality reduction techniques in terms of naturalness and informa…
Manufactured object sub-segmentation based on reflection motion estimation
2015
International audience; In computer vision, reflection is a long-standing problem, it covers image textures, makes original color difficult to recognize, complicates the understanding of the scene. Most of the time, it is considered as “noise”. Many methods are proposed in order to reduce or delete the reflection effects in the image, but generally, the performances are not quite satisfactory. While instead of working on “de-noising”, we propose a method to take advantage of moving reflections that can be used for different computer vision applications. For instance, the segmentation of reflective manufactured objects is presented in this paper. We focus on tracking reflection components an…
Reconstruction of hyperspectral cutaneous data from an artificial neural network-based multispectral imaging system.
2011
International audience; The development of an integrated MultiSpectral Imaging (MSI) system yielding hyperspectral cubes by means of artificial neural networks is described. The MSI system is based on a CCD camera, a rotating wheel bearing a set of seven interference filters, a light source and a computer. The resulting device has been elaborated for in vivo imaging of skin lesions. It provides multispectral images and is coupled with a software reconstructing hyperspectral cubes from multispectral images. Reconstruction is performed by a neural network-based algorithm using heteroassociative memories. The resulting hyperspectral cube provides skin optical reflectance spectral data combined…
Noise estimation from digital step-model signal
2013
International audience; This paper addresses the noise estimation in the digital domain and proposes a noise estimator based on the step signal model. It is efficient for any distribution of noise because it does not rely only on the smallest amplitudes in the signal or image. The proposed approach uses polarized/directional derivatives and a nonlinear combination of these derivatives to estimate the noise distribution (e.g., Gaussian, Poisson, speckle, etc.). The moments of this measured distribution can be computed and are also calculated theoretically on the basis of noise distribution models. The 1D performances are detailed, and as our work is mostly dedicated to image processing, a 2D…
Annealed Invariance Principle for Random Walks on Random Graphs Generated by Point Processes in R-d
2016
International audience; We consider simple random walks on random graphs embedded in R-d and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we show an annealed invariance principle for these random walks. These results hold for a large variety of point processes including Poisson point processes, Matern cluster and Matern hardcore processes which have respectively clustering and repulsiveness properties. The proof relies on the use the process of the environment seen from the particle. It allows to reconstruct the original process as an additive functional of a Markovian process und…
THE HOMOLOGY OF DIGRAPHS AS A GENERALIZATION OF HOCHSCHILD HOMOLOGY
2010
J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a new homology theory for directed graphs which takes coefficients in an arbitrary $A-A$ bimodule, for $A$ possibly non-commutative, which on polygons agrees with Hochschild homology through a range of dimensions.
Quasi-isometrically embedded subgroups of braid and diffeomorphism groups
2005
We show that a large class of right-angled Artin groups (in particular, those with planar complementary defining graph) can be embedded quasi-isometrically in pure braid groups and in the group of area preserving diffeomorphisms of the disk fixing the boundary (with respect to the $L^2$-norm metric); this extends results of Benaim and Gambaudo who gave quasi-isometric embeddings of $F\_n$ and $\Z^n$ for all $n>0$. As a consequence we are also able to embed a variety of Gromov hyperbolic groups quasi-isometrically in pure braid groups and in the diffeomorphism group of the disk. Examples include hyperbolic surface groups, some HNN-extensions of these along cyclic subgroups and the fundame…
Graphab. 14 réalisations à découvrir. Actes de la journée "Retour d’expérience sur Graphab" du 27 juin 2017
2018
International audience