Sciweavers

1439 search results - page 78 / 288
» Fast approximation of centrality
Sort
View
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...
CVPR
2003
IEEE
15 years 12 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
ICASSP
2010
IEEE
14 years 10 months ago
Fast total variation image restoration with parameter estimation using bayesian inference
In this paper we propose two fast Total Variation (TV) based algorithms for image restoration by utilizing variational posterior distribution approximation. The unknown image and ...
Bruno Amizic, S. Derin Babacan, K. Michael Ng, Raf...
MOC
2002
135views more  MOC 2002»
14 years 9 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
ICIP
2007
IEEE
15 years 11 months ago
Unsupervised Modeling of Object Tracks for Fast Anomaly Detection
A key goal of far-field activity analysis is to learn the usual pattern of activity in a scene and to detect statistically anomalous behavior. We propose a method for unsupervised...
Tomas Izo, W. Eric L. Grimson