Sciweavers

2064 search results - page 13 / 413
» Segmentation Problems
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Fast motion estimation and motion segmentation using multi-scale approach
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
Cédric Demonceaux, Djemâa Kachi-Akkou...
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Improved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...
ICCV
2011
IEEE
12 years 7 months ago
Segmentation Fusion for Connectomics
We address the problem of automatic 3D segmentation of a stack of electron microscopy sections of brain tissue. Unlike previous efforts, where the reconstruction is usually done o...
Amelio Vazquez-Reina, Michael Gelbart, Daniel Huan...
ICCV
2009
IEEE
15 years 13 days ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
CCCG
2009
13 years 8 months ago
New Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Lin
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The runn...
Wenqi Ju, Jun Luo