Tree-based iterated local search for Markov random fields with applications in image analysis-Reference-Cited by-同舟云学术

Tree-based iterated local search for Markov random fields with applications in image analysis

Published:2014-11-20 Issue:1 Volume:21 Page:25-45
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

Tran Truyen,Phung Dinh,Venkatesh Svetha

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10732-014-9270-1.pdf

Reference49 articles.

1. Ahuja, R.K., Ergun, Ö., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1), 75–102 (2002)

2. Besag, J.: Spatial interaction and the statistical analysis of lattice systems (with discussions). J. Royal Statist. Soc. Ser. B 36, 192–236 (1974)

3. Besag, J.: On the statistical analysis of dirty pictures. J. Royal Statist. Soc. Ser. B 48(3), 259–302 (1986)

4. Biba, M., Ferilli, S., Esposito, F.: Discriminative structure learning of Markov logic networks. In Inductive Logic Programming, pp. 59–76. Springer, Berlin (2008)

5. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222–1239 (2001)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. When Partly Missing Data Matters in Software Effort Development Prediction;Journal of Advanced Computational Intelligence and Intelligent Informatics;2017-09-20