Sciweavers

675 search results - page 92 / 135
» Agglomerative clustering of feature data for image segmentat...
Sort
View
ECCV
2008
Springer
15 years 12 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
PR
2008
170views more  PR 2008»
14 years 9 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
TCSV
2010
14 years 4 months ago
Compressed Domain Video Object Segmentation
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
Fatih Murat Porikli, Faisal I. Bashir, Huifang Sun
MEMICS
2010
14 years 4 months ago
Efficient Computation of Morphological Greyscale Reconstruction
Morphological reconstruction is an important image operator from mathematical morphology. It is very often used for filtering, segmentation, and feature extraction. However, its c...
Pavel Karas
IH
2007
Springer
15 years 4 months ago
Soft Feature-Based Watermark Decoding with Insertion/Deletion Correction
Abstract. Hard decisions constitute the major problem in digital watermarking applications, especially when content adaptive embedding methods are used. Soft-decision decoding, on ...
Mathias Schlauweg, Dima Pröfrock, Erika M&uum...