Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gregory Leibon

dblp:24/2626 · also Greg Leibon · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing
image representation
0.112009
Accurate Image Rotation Using Hermite Expansions · IEEE Trans. Image Process. 2009
Image and video processing › image warping
image rotation
0.112009
Accurate Image Rotation Using Hermite Expansions · IEEE Trans. Image Process. 2009
Computational geometry › triangulation
delaunay triangulation
0.012000
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds · SCG 2000
Computational geometry
geometric modeling and processing
0.012000
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds · SCG 2000
Computational geometry › differential geometry
riemannian manifold
0.012000
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds · SCG 2000
Computational geometry
triangulation
0.012000
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds · SCG 2000
Computational geometry
voronoi diagram
0.012000
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds · SCG 2000

Methods — techniques the papers use, named apart from their topics

hermite expansions · 0.1FFT-based shearing · 0.1voronoi diagram · 0.0delaunay triangulation · 0.0
YearPublicationVenuePosition
2011 Partition decoupling for multi-gene analysis of gene expression profiling data
abstract
BACKGROUND: Multi-gene interactions likely play an important role in the development of complex phenotypes, and relationships between interacting genes pose a challenging statistical problem in microarray analysis, since the genes involved in these interactions may not exhibit marginal differential expression. As a result, it is necessary to develop tools that can identify sets of interacting genes that discriminate phenotypes without requiring that the classification boundary between phenotypes be convex. RESULTS: We describe an extension and application of a new unsupervised statistical learning technique, known as the Partition Decoupling Method (PDM), to gene expression microarray data. This method may be used to classify samples based on multi-gene expression patterns and to identify pathways associated with phenotype, without relying upon the differential expression of individual genes. The PDM uses iterated spectral clustering and scrubbing steps, revealing at each iteration progressively finer structure in the geometry of the data. Because spectral clustering has the ability to discern clusters that are not linearly separable, it is able to articulate relationships between samples that would be missed by distance- and tree-based classifiers. After projecting the data onto the cluster centroids and computing the residuals ("scrubbing"), one can repeat the spectral clustering, revealing clusters that were not discernible in the first layer. These iterations, each of which provide a partition of the data that is decoupled from the others, are carried forward until the structure in the residuals is indistinguishable from noise, preventing over-fitting. We describe the PDM in detail and apply it to three publicly available cancer gene expression data sets. By applying the PDM on a pathway-by-pathway basis and identifying those pathways that permit unsupervised clustering of samples that match known sample characteristics, we show how the PDM may be used to find sets of mechanistically-related genes that may play a role in disease. An R package to carry out the PDM is available for download. CONCLUSIONS: We show that the PDM is a useful tool for the analysis of gene expression data from complex diseases, where phenotypes are not linearly separable and multi-gene effects are likely to play a role. Our results demonstrate that the PDM is able to distinguish cell types and treatments with higher accuracy than is obtained through other approaches, and that the Pathway-PDM application is a valuable technique for identifying disease-associated pathways.
Rosemary Braun, Gregory Leibon, Scott D. Pauls, Daniel N. Rockmore
BMC Bioinform.2
2009 Accurate Image Rotation Using Hermite Expansions
abstract
In this paper, we propose an approach for the accurate rotation of a digital image using Hermite expansions. This exploits the fact that if a 2-D continuous bandlimited Hermite expansion is rotated, the resulting function can be expressed as a Hermite expansion with the same bandlimit. Furthermore, the Hermite coefficients of the initial 2-D expansion and the rotated expansion are mapped through an invertible linear relationship. Two efficient methods to compute the mapping between Hermite coefficients during rotation are proposed. We also propose a method for connecting the Hermite expansion and a discrete image. Using this method, we can obtain the Hermite expansion from a discrete image and vice versa. Combining these techniques, we propose new methods for the rotation of discrete images. We assess the accuracy of our methods and compare them with an existing FFT-based method implementing three shears. We find that the method proposed here consistently has better accuracy than the FFT-based method.
Wooram Park, Gregory Leibon, Daniel N. Rockmore, Gregory S. Chirikjian
IEEE Trans. Image Process.2
2008 A fast Hermite transform
Gregory Leibon, Daniel N. Rockmore, Wooram Park, Robert Taintor, Gregory S. Chirikjian
Theor. Comput. Sci.1
2000 Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
abstract
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists.This triangulation has the same properties as in Euclidean space.Algorithms for constructing these triangulations will also be described.
Gregory Leibon, David Letscher
SCG1