Sciweavers

433 search results - page 12 / 87
» Optimal Segmentation of Random Sequences
Sort
View
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
15 years 5 months 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
ICPR
2002
IEEE
16 years 22 days ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
110
Voted
MICCAI
2010
Springer
14 years 9 months ago
Fast Random Walker with Priors Using Precomputation for Interactive Medical Image Segmentation
Abstract. Updating segmentation results in real-time based on repeated user input is a reliable way to guarantee accuracy, paramount in medical imaging applications, while making e...
Shawn Andrews, Ghassan Hamarneh, Ahmed Saad
156
Voted
CVPR
2012
IEEE
13 years 2 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
PAMI
2010
396views more  PAMI 2010»
14 years 10 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu