Sciweavers

340 search results - page 13 / 68
» Efficient algorithms for bichromatic separability
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
14 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
MEMICS
2010
14 years 4 months ago
Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm
A topological flexibility of implicit active contours is of great benefit, since it allows simultaneous detection of several objects without any a priori knowledge about their num...
Martin Maska, Pavel Matula, Michal Kozubek
JUCS
2008
148views more  JUCS 2008»
14 years 9 months ago
An Optimization of CDN Using Efficient Load Distribution and RADS Caching Algorithm
: Nowadays, while large-sized multimedia objects are becoming very popular throughout the Internet, one of the important issues appears to be the acceleration of content delivery n...
Yun Ji Na, Sarvar R. Abdullaev, Franz I. S. Ko
81
Voted
ICIP
2007
IEEE
15 years 1 months ago
Efficient Demosaicing Through Recursive Filtering
We present a computationally efficient demosaicing algorithm based on a luminance-chrominance model of the Color Filter Array (CFA) image. We show that the chrominance information ...
Brice Chaix de Lavarène, David Alleysson, B...
PAMI
2010
207views more  PAMI 2010»
14 years 4 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf