Learn More
This paper presents some of the most important features of a tree visualisation system called Latour, developed for the purposes of information visualisation. This system includes a numberofinteresting and unique characteristics, for example the provision for visual cues based on complexity metrics on graphs, which represent general principles that, in our(More)
We describe the classical Schützenberger methodology and two extensions: grammars with operators and q-grammars. In the 1960's, motivated by the interest in writing good compilers, theoretical work was initiated on syntactic formal aspects of languages. In 1964 [30], Randell and Russel did the first complete study of a compiler (this was ALGOL 60), dealing(More)
Information visualisation very often requires good navigation aids on large trees, which represent the underlying abstract information. Using trees for information visualisation requires novel user interface techniques, visual clues, and navigational aids. This paper describes a visual clue for trees as well as an automatic folding (clustering) technique,(More)
This paper presents a piece of software for the visualization or navigation in trees. It allows some operations as comparison between trees or finding common subtrees. It means a presentation of common things with same colors. Overall implemented tools are strongly based on intrinsic combinatorial parameters with as few references as possible to syntactical(More)
The problem of graph layout and drawing is fundamental to many aproaches to the visualization of relational information structures. As the data set grows, the visualization problem is compounded by the need to reconcile the user's need for orientation cues with the danger of information overload. Put simply: How can we limit the number of visual elements on(More)
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency graphs (RAG) of pre-segmented objects. In the context of the rough indexing paradigm , the video data are of very low resolution and segmentation is consequently inaccurate. Hence(More)
In this paper, we propose a new layout algorithm that draws the secondary structure of a Ribonucleic Acid (RNA) automatically according to some of the biologists' aesthetic criteria. Such layout insures that two equivalent structures (or sub-structures) are drawn in a same and planar way. In order to allow a visual comparison of two RNAs, we use an(More)
We show the structure of the InfoVis publications dataset using Tulip, a scalable open-source visualization system for graphs and trees. Tulip supports interactive navigation and many options for layout. Subgraphs of the full dataset can be created interactively or using a wide set of algorithms based on graph theory and combinatorics, including several(More)
We propose a method for the visualization of large graphs. Our approach is based on the calculation of a density function resulting from the application of a metric on the vertices of a graph. The density function is then filtered using a convolution, leading to a partition of the graph. The choice of an appropriate kernel for the convolution makes it(More)
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel method of visualization of video content is proposed. First of all, the content is segmented into shots, and then a spatio-temporal color signature of shots, based on color distribution(More)