Sciweavers

340 search results - page 46 / 68
» Efficient algorithms for bichromatic separability
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
Bilayer Segmentation of Live Video
This paper presents an algorithm capable of real-time separation of foreground from background in monocular video sequences. Automatic segmentation of layers from colour/contrast ...
Antonio Criminisi, Geoffrey Cross, Andrew Blake, V...
88
Voted
ICCV
2005
IEEE
15 years 11 months ago
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
Tamir Hazan, Simon Polak, Amnon Shashua
POPL
2002
ACM
15 years 10 months ago
CCured: type-safe retrofitting of legacy code
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...
George C. Necula, Scott McPeak, Westley Weimer
ICPR
2008
IEEE
15 years 4 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
GD
1998
Springer
15 years 1 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....