Sciweavers

5595 search results - page 406 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ICPR
2000
IEEE
16 years 8 months ago
A Concurrent Region Growing Algorithm Guided by Circumscribed Contours
Image segmentation of natural scenes constitutes a major problem in Machine Vision. This paper presents a new proposal for the image segmentation problem which has been based on t...
Xavier Cufí, Xavier Muñoz, Jordi Fre...
ICPR
2006
IEEE
16 years 8 months ago
Fingerprint Matching Method Using Minutiae Clustering and Warping
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
Dongjin Kwon, Duck Hoon Kim, Il Dong Yun, Sang Uk ...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky