Sciweavers

374 search results - page 13 / 75
» Fast separable factorization and applications
Sort
View
MVA
2007
149views Computer Vision» more  MVA 2007»
13 years 9 months ago
Fast Graph Segmentation Based on Statistical Aggregation Phenomena
In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume...
Frank Nielsen, Richard Nock
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
VLDB
1998
ACM
95views Database» more  VLDB 1998»
13 years 11 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...
JMIV
2011
179views more  JMIV 2011»
13 years 2 months ago
3-D Data Denoising and Inpainting with the Low-Redundancy Fast Curvelet Transform
In this paper, we first present a new implementation of the 3-D fast curvelet transform, which is nearly 2.5 less redundant than the Curvelab (wrapping-based) implementation as o...
A. Woiselle, Jean-Luc Starck, Jalal Fadili
ICIP
2007
IEEE
14 years 1 months ago
Fast Computation of Zernike Moments For Rice Sorting System
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Take...