Bisection approach for pixel labelling problem

DOI10.1016/J.PATCOG.2009.11.002MaRDI QIDQ962770zbMATH OpenOpenAlexFDO

Authors Deng-Feng Chai, Hongwei Lin, Qunsheng Peng

Publication date 7 April 2010

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2009.11.002

zbMATH Keywords

graph cutMarkov random fieldspixel labellingstereo

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Fast approximate energy minimization with label costs
• scientific article; zbMATH DE number 2062604
• Markov models for image labeling
• A spatially continuous max-flow and min-cut framework for binary labeling problems
• Image labeling by assignment

Cites work

• A new approach to the maximum-flow problem
• A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
• scientific article; zbMATH DE number 3986503 (Why is no real title available?)
• scientific article; zbMATH DE number 2062573 (Why is no real title available?)
• Learning low-level vision
• Pattern classification.
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

This page was built for publication: Bisection approach for pixel labelling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962770)