A class of solvable consistent labeling problems

DOI10.1007/3-540-44522-6_48MaRDI QIDQ4536522zbMATH OpenFDO

Authors B. Flach, M. Schlesinger

Publication date 5 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_48

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• The Consistent Labeling Problem: Part II
• On the \(S\)-\textsc{Labeling} problem
• Algorithmic aspects of the S-labeling problem
• On a labeling problem in graphs
• Algorithmic expedients for the S-labeling problem
• Algorithmic complexity of proper labeling problems
• Consistent subset problem with two labels
• A labeling algorithm to solve the assignment problem
• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• scientific article; zbMATH DE number 2091962

Cited in

(4)

• Robust correspondence recognition for computer vision
• Computer Architecture for Solving Consistent Labelling Problems
• The Consistent Labeling Problem: Part II
• Iteration procedures of image analysis based on acyclic dynamic programming

This page was built for publication: A class of solvable consistent labeling problems

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