scispace - formally typeset
Search or ask a question

Showing papers on "Kernel (image processing) published in 1976"


Journal ArticleDOI
TL;DR: An analysis of image reconstruction with one- and two-dimensional convolution methods is presented in an outline of the relationship among the correction functions, the point spread function and the statistical noise.

28 citations


Book ChapterDOI
W. Sandhas1
TL;DR: In this paper, the authors discuss the dynamical equations and approximation method for the three-body problem, and show that after a sufficient number of iterations, the kernel becomes even completely continuous.
Abstract: Publisher Summary This chapter discusses the dynamical equations and approximation method. The integral equations approach to the three-body problem, decisively stimulated by Faddeev's formulation, provides the most powerful tool for studying the internal structure of this system. An essential step toward a detailed understanding of composite particle dynamics has been done in this way. The search for adequate extensions to the general N-body situation represents a natural challenge. Emphasizing different aspects of the three-body theory, different generalizations have been found. It was the concept of connectedness of the integral kernel that represented the guiding idea of almost all proposals. The four-body problem shows already the typical difficulties of the general case. In the Faddeev case, it can be shown that after a sufficient number of iterations, the kernel becomes even completely continuous. The advantage of such a procedure is that the completeness does not have to be assumed but is directly proved.

14 citations


Journal ArticleDOI
01 Jun 1976-Infor
TL;DR: A case study in the design of an experimental operating system for the PDP-11/45 is presented with a design based heavily on the concepts of a kernel and a domain of protection.
Abstract: A case study in the design of an experimental operating system for the PDP-11/45 is presented. The objectives of the work, namely pedagogical use, protection, extendibility, reliability, understandability, and instrumentation, are met with a design based heavily on the concepts of a kernel and a domain of protection. The kernel, a small software extension to the hardware, implements five types of protected objects, domains, processes, activations, devices, and types, access to which is controlled via a capability mechanism. A domain is viewed as a protected procedure that performs access control and representation management for user defined objects. Domains can be instrumented via operations controlled by the protection mechanism.

2 citations


Book ChapterDOI
TL;DR: In this article, the authors present a model study of the optical potential in the channel coupling array method and present an approach to collision problems that leads to new sets of coupled equations for the transition operators associated with a three-body system.
Abstract: Publisher Summary This chapter presents a model study of the optical potential in the channel coupling array method. It reviews an approach to collision problems that leads to new sets of coupled equations for the transition operators associated with a three-body system. A key feature of the method is the introduction of an array whose purpose is to permit one to couple different arrangements in a general fashion. Once the general coupled equations for the transition operator whose matrix elements give the scattering amplitude for going from arrangements is obtained, the channel coupling array may be used to ensure that the kernel of the equations, when iterated a sufficient finite number of times, contains no disconnected diagrams. When iterated a sufficient finite number of times, contains no disconnected diagrams. For sufficiently well-behaved potentials, this leads to a continuous kernel. This then ensures that finite rank approximations to the kernel are elements in a convergent sequence. The chapter focuses on a specific choice of the channel coupling array, called the channel permutting array, which leads to equations whose iterated kernel is connected. The three arrangement analogue of equation for three particles involves a kernel, which is completely connected.