Sciweavers

511 search results - page 45 / 103
» The intrinsic dimensionality of graphs
Sort
View
ICIP
2000
IEEE
14 years 2 months ago
Chromaticity Diffusion
—A novel approach for color image denoising is proposed in this paper. The algorithm is based on separating the color data into chromaticity and brightness, and then processing e...
Bei Tang, Guillermo Sapiro, Vicent Caselles
NIPS
2007
13 years 11 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
ICIP
2010
IEEE
13 years 7 months ago
Texture classification via patch-based sparse texton learning
Texture classification is a classical yet still active topic in computer vision and pattern recognition. Recently, several new texture classification approaches by modeling textur...
Jin Xie, Lei Zhang, Jane You, David Zhang
JMLR
2010
175views more  JMLR 2010»
13 years 4 months ago
Hierarchical Convex NMF for Clustering Massive Data
We present an extension of convex-hull non-negative matrix factorization (CH-NMF) which was recently proposed as a large scale variant of convex non-negative matrix factorization ...
Kristian Kersting, Mirwaes Wahabzada, Christian Th...
GD
2001
Springer
14 years 2 months ago
Orthogonal Drawings with Few Layers
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
Therese C. Biedl, John R. Johansen, Thomas C. Sher...