Sciweavers

2064 search results - page 6 / 413
» Segmentation Problems
Sort
View
GIS
2010
ACM
14 years 8 months ago
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
Maike Buchin, Anne Driemel, Marc J. van Kreveld, V...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 3 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
ICPR
2000
IEEE
15 years 10 months ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura
ICASSP
2007
IEEE
15 years 4 months ago
Multiple View Region Matching as a Lagrangian Optimization Problem
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
Felipe Calderero, Ferran Marqués, Antonio O...
CCCG
2006
14 years 11 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale