Sciweavers

928 search results - page 46 / 186
» Complexity of Self-assembled Shapes
Sort
View
LATIN
2010
Springer
14 years 3 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
ICIP
2006
IEEE
14 years 2 months ago
Low-Complexity Rate Control for Efficient H.263 to H.264/AVC Video Transcoding
Rate control is a complicated problem in the H.264/AVC coding standard, extra computation is usually needed for the existing rate control schemes to estimate the complexity of fra...
Chi-Wang Ho, Oscar C. Au, S.-H. Gary Chan, Shu-Kei...
CVPR
2008
IEEE
14 years 10 months ago
Efficient object shape recovery via slicing planes
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...
Po-Lun Lai, Alper Yilmaz
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
14 years 3 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
SMI
2007
IEEE
157views Image Analysis» more  SMI 2007»
14 years 3 months ago
Skeleton-based Hierarchical Shape Segmentation
We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of a critical points on the curv...
Dennie Reniers, Alexandru Telea