Sciweavers

620 search results - page 13 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz
CVPR
2011
IEEE
14 years 9 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
VIIP
2001
15 years 1 months ago
Fast Digital Image Inpainting
We present a very simple inpainting algorithm for reconstruction of small missing and damaged portions of images that is two to three orders of magnitude faster than current metho...
Manuel M. Oliveira, Brian Bowen, Richard McKenna, ...
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 6 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
ADCM
2010
270views more  ADCM 2010»
14 years 11 months ago
A fast algorithm for the total variation model of image denoising
The total variation model of Rudin, Osher, and Fatemi for image denoising is considered to be one of the best denoising models. In the past, its solutions were based on nonlinear ...
Rong-Qing Jia, Hanqing Zhao