Sciweavers

315 search results - page 8 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
PAMI
2011
13 years 2 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
VLDB
1998
ACM
127views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
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...
ICIP
1997
IEEE
14 years 9 months ago
An Optimization Approach to Unsupervised Hierarchical Texture Segmentation
In this paper we introduce a novel optimization framework for hierarchical data clustering and apply it to the problem of unsupervised texture segmentation. The proposed objective...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 26 days ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny