Abstract
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of the optimal labeling in some pixels, as a result of applying the proposed algorithm, allows to decrease the complexity of the original problem essentially.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. on PAMI 6(6), 721–741 (1984)
Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Royal Statistical Soc., Series B 51(2), 271–279 (1989)
Ishikawa, H., Geiger, D.: Segmentation by grouping junctions. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (1998)
Kirkpatrick, S., Gellatt Jr., C.D., Vecch, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 65–81. Springer, Heidelberg (2002)
Li, S.Z.: Markov Random Field Modeling in Image Analysis. Computer Science, Workbench, Springer (2001)
Schlesinger, M.I.: Syntax analysis of two dimensional visual signals with noise. Cybernetics, Kiev 4, 113–130 (1976) (in russian)
Schlesinger, M.I., Flach, B.: Some solvable subclass of structural recognition problems. In: Svoboda, T. (ed.), Czech Pattern Recognition Workshop 2000, pp. 55–61, Praha (February 2000), Czech Pattern Recognition Society
Schlesinger, M.I., Flach, B.: Analysis of optimal labelling problems and their applications to image segmentation and binocular stereovision. In: Leberl, F., Ferko, A. (eds.) Proceedings East-West-Vision 2002 (EWV 2002), International Workshop and Project Festival on Computer Vision, Computer Graphics, New Media, pp. 55–60 (2002)
Schlesinger, M.I., Koval, V.K.: Two dimensional programming in image analysis problems. Automatics and Telemechanics 2, 149–168 (1976) (in russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovtun, I. (2003). Partial Optimal Labeling Search for a NP-Hard Subclass of (max,+) Problems. In: Michaelis, B., Krell, G. (eds) Pattern Recognition. DAGM 2003. Lecture Notes in Computer Science, vol 2781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45243-0_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-45243-0_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40861-1
Online ISBN: 978-3-540-45243-0
eBook Packages: Springer Book Archive