Sciweavers

4047 search results - page 553 / 810
» The Discrete Basis Problem
Sort
View
ICASSP
2008
IEEE
15 years 11 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
ICIP
2008
IEEE
15 years 11 months ago
Compressed sensing for multi-view tracking and 3-D voxel reconstruction
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
Dikpal Reddy, Aswin C. Sankaranarayanan, Volkan Ce...
ICPR
2008
IEEE
15 years 11 months ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...
ICPR
2008
IEEE
15 years 11 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICRA
2008
IEEE
204views Robotics» more  ICRA 2008»
15 years 11 months ago
Active exploration and keypoint clustering for object recognition
— Object recognition is a challenging problem for artificial systems. This is especially true for objects that are placed in cluttered and uncontrolled environments. To challenge...
Gert Kootstra, Jelmer Ypma, Bart de Boer