COMPARISON OF THE EFFICIENCY OF DETERMINISTIC AND STOCHASTIC ALGORITHMS FOR VISUAL RECONSTRUCTION

被引：97

作者：

BLAKE, A

机构：

来源：

关键词：

D O I：

10.1109/34.23109

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：2 / 12

页数：11

共 30 条

[1]

Bellman R. E., 1962, APPL DYNAMIC PROGRAM

[2]

BESAG J, 1986, J R STAT SOC B, V48, P259

[3]

Blake A., 1986, Proceedings CVPR '86: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.86CH2290-5), P656

[4]

Blake A., 1986, Proceedings CVPR '86: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.86CH2290-5), P62

[5] BOUNDARY-CONDITIONS FOR LIGHTNESS COMPUTATION IN MONDRIAN WORLD [J].

BLAKE, A .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 32 (03) :314-327

[6]

BLAKE A, 1986, P ECAI BRIGHTON, P518

[7]

Blake A., 1987, VISUAL RECONSTRUCTIO, V373, P131

[8] The least-disturbance principle and weak constraints [J].

Blake, Andrew .

DERIN, H ;

ELLIOTT, H .

GEMAN, S ;

GEMAN, D .