Results 1  10
of
50,706
neighborhood graphs
"... This is a preprint of an article that has been accepted for publication in BMC Bioinformatics, 10(1):288, 2009. Please use the journal version for citation. Background: Many different cluster methods are frequently used in gene expression data analysis to find groups of co–expressed genes. However, ..."
Abstract
 Add to MetaCart
This is a preprint of an article that has been accepted for publication in BMC Bioinformatics, 10(1):288, 2009. Please use the journal version for citation. Background: Many different cluster methods are frequently used in gene expression data analysis to find groups of co–expressed genes. However, cluster algorithms with the ability to visualize the resulting clusters are usually preferred. The visualization of gene clusters gives practitioners an understanding of the cluster structure of their data and makes it easier to interpret the cluster results. Results: In this paper recent extensions of R package gcExplorer are presented. gcExplorer is an interactive visualization toolbox for the investigation of the overall cluster structure as well as single clusters. The different visualization options including arbitrary node and panel functions are described in detail. Finally the toolbox can be used to investigate the quality of a given clustering graphically as well as theoretically by testing the association between a partition and a functional group under study. Conclusions: It is shown that gcExplorer is a very helpful tool for a general exploration
Interval pNeighborhood Graphs
"... The (p)neighborhood graph of a graph G, denoted N p (G), is defined on the same vertex set as G, with [x; y] 2 E(N 2 (G)) if and only if jN(x) " N(y)j p in G, where N(v) is the open neighborhood of vertex v. The [p]neighborhood graph of G, N p [G], is defined similarly, using closed neighb ..."
Abstract
 Add to MetaCart
The (p)neighborhood graph of a graph G, denoted N p (G), is defined on the same vertex set as G, with [x; y] 2 E(N 2 (G)) if and only if jN(x) " N(y)j p in G, where N(v) is the open neighborhood of vertex v. The [p]neighborhood graph of G, N p [G], is defined similarly, using closed
Theneighborhood graph
"... This paper presents a novel twoparameter geometric graph, the neighborhood graph. This graph unifies a number of geometric graphs such as the convex hull, the Delaunay triangulation, and in 2D also the Gabriel graph, and the circlebased skeleton, into a continuous spectrum of geometric graphs th ..."
Abstract
 Add to MetaCart
This paper presents a novel twoparameter geometric graph, the neighborhood graph. This graph unifies a number of geometric graphs such as the convex hull, the Delaunay triangulation, and in 2D also the Gabriel graph, and the circlebased skeleton, into a continuous spectrum of geometric graphs
Neighborhood Graphs built with Morphological Operators
"... Abstract: A method for building neighborhood graphs using morphological operators is presented in this paper. This method has a segmented image as input, containing objects that will define the graph vertices. The edges of the graph will be determined by the neighborhood between these objects, defin ..."
Abstract
 Add to MetaCart
Abstract: A method for building neighborhood graphs using morphological operators is presented in this paper. This method has a segmented image as input, containing objects that will define the graph vertices. The edges of the graph will be determined by the neighborhood between these objects
An Improved Random Neighborhood Graph Approach
, 2002
"... As a general framework to determine a collisionfree feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an approximate representation of the free configuration. In this paper, we improve the RNG approach in several aspects. We pres ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
As a general framework to determine a collisionfree feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an approximate representation of the free configuration. In this paper, we improve the RNG approach in several aspects. We
An Improved Random Neighborhood Graph Approach
, 2002
"... As a general framework to determine a collisionfree feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an approximate representation of the free configuration. In this paper, we improve the RNG approach in several aspects. We pres ..."
Abstract
 Add to MetaCart
As a general framework to determine a collisionfree feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an approximate representation of the free configuration. In this paper, we improve the RNG approach in several aspects. We
Morphological Operators characterized by neighborhood graphs
, 1997
"... Mathematical Morphology is a theory that studies the decomposition of lattice operators in terms of some families of elementary lattice operators. When the lattices considered have a supgenerating family, the elementary operators can be characterized by structuring functions. The representation o ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
of structuring functions by neighborhood graphs is a powerful model for the construction of image operators. This model, that is a conceptual improvement of the one proposed by Vincent, permits a natural polymorphic extension of classical softwares for image processing by Mathematical Morphology
Results 1  10
of
50,706