Sciweavers

2342 search results - page 170 / 469
» Sublinear geometric algorithms
Sort
View
FTTCS
2006
132views more  FTTCS 2006»
15 years 3 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
IJCV
2006
116views more  IJCV 2006»
15 years 3 months ago
Structure-Texture Image Decomposition - Modeling, Algorithms, and Parameter Selection
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...
Jean-François Aujol, Guy Gilboa, Tony F. Ch...
119
Voted
PAMI
1998
107views more  PAMI 1998»
15 years 3 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
144
Voted
ICIP
2003
IEEE
16 years 5 months ago
Video coding using a deformation compensation algorithm based on adaptive matching pursuit image decompositions
Today's video codecs employ motion compensated prediction in combination with block matching techniques. These techniques, although achieving some level of adaptivity in thei...
Òscar Divorra Escoda, Pierre Vandergheynst
VIS
2004
IEEE
166views Visualization» more  VIS 2004»
16 years 4 months ago
Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation
A new method for the simplification and the visualization of vector fields is presented based on the notion of Centroidal Voronoi tessellations (CVT's). A CVT is a special Vo...
Qiang Du, Xiaoqiang Wang