Computer graphics and computer vision deal with converse problems. In graphics the goal is to synthesize the image(s) of a scene from a given description in terms of a model or some observed data. In vision, on the ot...
详细信息
Computer graphics and computer vision deal with converse problems. In graphics the goal is to synthesize the image(s) of a scene from a given description in terms of a model or some observed data. In vision, on the other hand, the aim is to create a description of the world (the scene), given the image(s). Due to this difference of the goals the two fields have developed separately. Nevertheless, they often deal with aspects of the same physical reality. Therefore, many fundamental concepts and problems are shared by the two areas, even though the context may differ. In this paper we discuss some of the issues which unify and discriminate the fields. The purpose is not to present a self-contained presentation of the relevant notions and techniques. We refer to the existing literature for such details. Instead we try to elucidate aspects in which the two fields may benefit from each other and aspects in which this may be difficult.
We consider the general class of power series where the terms may be expressed as the Laplace transforms of known functions. The sum of the series can then be evaluated efficiently and accurately by means of quadratur...
详细信息
We consider the general class of power series where the terms may be expressed as the Laplace transforms of known functions. The sum of the series can then be evaluated efficiently and accurately by means of quadrature schemes, recently published by Frank Stenger. The method works also far outside the region of convergence as will be illustrated by numerical examples.
Estimates concerning the spectrum of a graded matrix and other information useful for a reliable and efficient handling of certain complications in the numerical treatment of some stiff ODE's, can be inexpensively...
详细信息
Estimates concerning the spectrum of a graded matrix and other information useful for a reliable and efficient handling of certain complications in the numerical treatment of some stiff ODE's, can be inexpensively obtained from the factorized Jacobian. The validity of the estimates is studied by considering them as the first step in a block LR algorithm, which may be of interest in its own right. Its convergence properties are examined.
Previous investigations of the storage capacity of associative nets have not explicitly considered quantitative aspects of the tradeoff between storage capacity and reconstructive power in these systems. Furthermore, ...
详细信息
Previous investigations of the storage capacity of associative nets have not explicitly considered quantitative aspects of the tradeoff between storage capacity and reconstructive power in these systems. Furthermore, few comparisons have been made between theoretical estimates and experimental results (simulations). In this correspondence, we describe some results recently obtained and relevant to these issues. It is shown that a high storage capacity is possible, without sacrificing reliability in the recall process. Furthermore, an efficient algorithm for retrieval of the information stored is presented, and the speed of recall employing various degrees of parallelism is discussed.","doi":"10.1109/TPAMI.1985.4767688","publicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","startPage":"490","endPage":"498","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=Reliability+and+Speed+of+Recall+in+an+Associative+Network&isbn=&publicationDate=July+1985&author=Anders+Lansner&ContentID=10.1109/TPAMI.1985.4767688&orderBeanReset=true&startPage=490&endPage=498&volumeNum=PAMI-7&issueNum=4","displayPublicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","pdfPath":"/iel5/34/4767672/***","keywords":[{"type":"IEEE Keywords","kwd":["Power system reliability","Pattern recognition","Neuroscience","Associative memory","Estimation theory","Information retrieval","Parallel processing","Telecommunication network reliability","Biological neural networks","Computer science"]},{"type":"Author Keywords ","kwd":["storage capacity","Associative network","pattern completion","pattern recognition","reliability of recall"]}],"allowComments":false,"pubLink":"/xpl/***?punumber=34","issueLink":"/xpl/***?isnumber=4767672","standardTitle":"Reliability and Speed of Recall in an Associative Network
We show that unification in the equational theory defined by the one-sided distributivity law x × (y+z)=x×y+x×z is decidable and that unification is undecidable if the laws of associativity x+(y+z)=(x+y...
详细信息
作者：
Riesel, HansRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
Progress in factorization of large integers since the introduction of computers is reported. Thanks to theoretical advances and refinements, as well as to more powerful computers, the practical limit of integers possi...
详细信息
Progress in factorization of large integers since the introduction of computers is reported. Thanks to theoretical advances and refinements, as well as to more powerful computers, the practical limit of integers possible to factor has been raised considerably during the past 20 years. The present practical limit is around 10**7**5 if supercomputers are used and if much computer time is available.
作者：
Arnborg, StefanRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
A survey is presented of recent developments in methods for solving combinatorially difficult, i. e. , NP-hard, problems defined on simple, labelled or unlabelled, graphs or hypergraphs. The author first gives graph-t...
详细信息
A survey is presented of recent developments in methods for solving combinatorially difficult, i. e. , NP-hard, problems defined on simple, labelled or unlabelled, graphs or hypergraphs. The author first gives graph-theoretic definitions and some basic properties of graphs related to elimination processes, required for a comprehensive treatment of table-based reduction algorithms. He then explains the table-based reduction method and exemplifies it with algorithms for some independent set problems. The problem of finding suitable elimination orderings, either with rewrite rule techniques or with dynamic programming methods, as well as the complexity of the optimization of elimination ordering, is treated next. The basic method gives efficient algorithms for graphs which can be decomposed by a set of small separators. Graphs without small separators can still be treated for certain problems when they are clique decomposable. Results for such graphs are reviewed, as well as a new decomposition method, applicable to graphs with bounded complement decomposability.
作者：
Sundblad, YngveRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
Limitations in resolution of bilevel display screens and processing power of processors call for special considerations in the design of computerized tools for make-up of document and newspaper pages. Here we discuss ...
详细信息
ISBN:
(纸本)0444876170
Limitations in resolution of bilevel display screens and processing power of processors call for special considerations in the design of computerized tools for make-up of document and newspaper pages. Here we discuss and illustrate various such considerations for presentation of text with typography, graphics and continuous tone images.
The problem of segmenting aerial photographs can generally not be solved in a reasonable manner by use of the information in the image alone. In this paper we present a structured approach to the problem, which in add...
详细信息
The problem of choosing tickmarks for nonlinear scales is of interest for some kindsof diagrams, e.g., nomograms and contour plots. A method for getting “nice”values at the tickmarks is discussed based on a database...
暂无评论