A parallel information-based complexity approach to visual surface reconstruction

作     者：Jiang, TZ 

作者机构：Univ New S Wales Sch Math Sydney NSW 2052 Australia 

出 版 物：《INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS》 (国际计算机数学杂志)

年 卷 期：1998年第70卷第2期

页      面：165-177页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Chinese National High Technology Program (863) Chinese National Key Project for Basic Researchers University of New South Wales, UNSW National Natural Science Foundation of China, NSFC 

主　　题：low level vision algebraic complexity parallel complexity information-based complexity visual surface reconstruction 

摘      要：In this paper, we give a novel insight into studying the low level vision. We attack low level problems by parallel information-based complexity techniques. Here we only study the visual surface reconstruction. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously: the number of processors, the required precision. This result seems to be new even in serial case. Our results will provide a benchmark for the intrinsic difficulty of visual surface reconstruction. With this, one can compare its computational complexity with the cost any algorithm that solves the problem to tell how well the given algorithm measures up. To the best of our knowledge, it is the first attempt to introduce parallel information-based complexity techniques into studying low level vision.