Sciweavers

1802 search results - page 201 / 361
» Sparse Computations with PEI
Sort
View
173
Voted
CVPR
2009
IEEE
16 years 11 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
ICPR
2004
IEEE
16 years 5 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
DAC
2000
ACM
16 years 5 months ago
Fast methods for extraction and sparsification of substrate coupling
The sudden increase in systems-on-a-chip designs has renewed interest in techniques for analyzing and eliminating substrate coupling problems. Previous work on the substrate coupl...
Joe Kanapka, Joel R. Phillips, Jacob White
CVPR
2010
IEEE
16 years 19 days ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
ISVC
2009
Springer
15 years 11 months ago
Edge-Preserving Laplacian Pyramid
5th International Symposium on Visual Computing, Las Vegas, Nevada, USA, Nov 30 - Dec 2, 2009 The Laplacian pyramid recursively splits an image into local averages and local diff...
Stella X. Yu