Sciweavers

433 search results - page 47 / 87
» Optimal Segmentation of Random Sequences
Sort
View
TJS
2002
160views more  TJS 2002»
14 years 11 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
MICCAI
2007
Springer
16 years 22 days ago
Effects of Registration Regularization and Atlas Sharpness on Segmentation Accuracy
In this paper, we propose a unified framework for computing atlases from manually labeled data at various degrees of "sharpness" and the joint registration-segmentation o...
B. T. Thomas Yeo, Mert R. Sabuncu, Rahul Desikan, ...
CVPR
2010
IEEE
1373views Computer Vision» more  CVPR 2010»
15 years 8 months ago
Harmony Potentials for Joint Classification and Segmentation
Hierarchical conditional random fields have been successfully applied to object segmentation. One reason is their ability to incorporate contextual information at different scales....
Xavier Boix, Josep M. Gonfaus, Joost van de Weijer...
ECCV
2006
Springer
16 years 1 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PAMI
2008
198views more  PAMI 2008»
14 years 11 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...