Sciweavers

59 search results - page 5 / 12
» Adaptive Regularization Parameter for Graph Cut Segmentation
Sort
View
JMLR
2012
11 years 9 months ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
ICCV
2007
IEEE
14 years 8 months ago
Multi-Object Tracking Through Clutter Using Graph Cuts
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
ICPR
2008
IEEE
14 years 1 months ago
Monocular video foreground segmentation system
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
Xiaoyu Wu, Yangsheng Wang, Xiaolong Zheng
CVPR
2010
IEEE
13 years 11 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
14 years 21 days ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...