Sciweavers

620 search results - page 25 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
CVPR
2003
IEEE
16 years 4 months ago
On Region Merging: The Statistical Soundness of Fast Sorting, with Applications
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
Frank Nielsen, Richard Nock
CCCG
1996
15 years 3 months ago
Fast Stabbing of Boxes in High Dimensions
We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)...
Frank Nielsen
CORR
2008
Springer
170views Education» more  CORR 2008»
15 years 2 months ago
Fast Wavelet-Based Visual Classification
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
Guoshen Yu, Jean-Jacques E. Slotine
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 8 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
CGI
2004
IEEE
15 years 5 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
Andrew Nealen, Marc Alexa