Scispace (Formerly Typeset)
  1. Home
  2. Topics
  3. Blind deconvolution
  4. 1978
  1. Home
  2. Topics
  3. Blind deconvolution
  4. 1978
Showing papers on "Blind deconvolution published in 1978"
Journal Article•10.1002/JPS.2600670524•
Mathematical Basis of Point–Area Deconvolution Method for Determining In Vivo Input Functions

[...]

D.P. Vaughan, M. Dennis
01 May 1978-Journal of Pharmaceutical Sciences
TL;DR: The point-area method for deconvolution derives a "staircase" input function which, when convolved onto the characteristic function, gives an output function coincidental with the given output data points.

131 citations

Journal Article•10.1016/0029-554X(78)90502-5•
Bayesian deconvolution I: Convergent properties

[...]

T. J. Kennett1, William V. Prestwich1, A. Robertson1•
McMaster University1
01 May 1978-Nuclear Instruments and Methods
TL;DR: In this article, an iterative procedure to achieve spectral deconvolution by application of Bayes' postulate is presented, and an analytical treatment for a Gaussian response function is used to indicate how the resolution attained depends upon the number of iterations.

117 citations

Journal Article•10.1007/BF01312265•
Numerical deconvolution by least squares: Use of polynomials to represent the input function

[...]

David J. Cutler1•
University of London1
01 Jun 1978-Journal of Pharmacokinetics and Biopharmaceutics
TL;DR: A new method for numerical deconvolution is described, based on the least-squares criterion and approximates the input rate by a polynomial function, for use in calculating drug input rates.
Abstract: A new method for numerical deconvolution is described, for use in calculating drug input rates. The method is based on the least-squares criterion and approximates the input rate by a polynomial function. Ill-conditioning of the normal equations is avoided by using orthogonal functions. The use of the method is illustrated by means of examples, using simulated data.

63 citations

Journal Article•10.1109/TGE.1978.294570•
Deconvolution of Seismic Data - An Overview

[...]

Vijay K. Arya1, H. D. Holden1•
Royal Dutch Shell1
01 Apr 1978-IEEE Transactions on Geoscience and Remote Sensing
TL;DR: In this paper, the authors describe four techniques which have been and are being used to accomplish this objective: predictive deconvolution, homomorphic filtering, Kalman filtering, and deterministic deconvolutions.
Abstract: It is common practice to model a seismic trace as a convolution of the reflectivity function of the earth and an energy waveform referred to as the seismic wavelet. The objective of deconvolution is to extract the reflectivity function from the seismic trace. We will describe four techniques which have been and are being used to accomplish this objective. These techniques are predictive deconvolution, homomorphic filtering, Kalman filtering, and deterministic deconvolution. In addition, we shall outline the physical effects governing the bandwidth of the seismic data such as shooting geometry, recording filters, and absorption.

34 citations

Journal Article•10.1109/TGE.1978.294571•
Adaptive Deconvolution of Seismic Signals

[...]

Craig S. Sims1, M. R. D'Mello•
Oklahoma State University–Stillwater1
01 Apr 1978-IEEE Transactions on Geoscience and Remote Sensing
TL;DR: In this article, the correct model is assumed to be one of a finite set of candidate models, and adaptive deconvolution is accomplished using estimation algorithms developed for this type of model uncertainty.
Abstract: Seismic signals are often modeled as the convolution of a wavelet with the earth reflectivity function. Deconvolution, for the purpose of obtaining the reflectivity function, can be done using state space estimation methods. Such methods are hampered, however, by lack of precise modeling information. The deconvolution problem then becomes an adaptive estimation problem. In this paper the correct model is assumed to be one of a finite set of candidate models, and adaptive deconvolution is accomplished using estimation algorithms developed for this type of model uncertainty.

13 citations

Journal Article•10.1016/0025-5564(78)90092-5•
A deconvolution scheme

[...]

Mones Berman1•
National Institutes of Health1
01 Aug 1978-Bellman Prize in Mathematical Biosciences
TL;DR: In this paper, a deconvolution scheme is presented for the calculation of an input function given a system and its response, by converting the integral equation into an initial value problem, which is particularly simple and advantageous when dealing with compartmental systems and solving them numerically.
Abstract: A deconvolution scheme is presented for the calculation of an input function given a system and its response—by converting the integral equation into an initial value problem. This technique is particularly simple and advantageous when dealing with compartmental systems and solving them numerically. The method also permits the imbedding of constraints and the estimation of confidence limits for the deconvoluted function.

12 citations

Journal Article•10.1109/TBME.1978.326315•
Statistical Deconvolution of Electrocardiograms

[...]

Bruce A. Eisenstein1, Louis R. Cerrato•
Drexel University1
01 Jan 1978-IEEE Transactions on Biomedical Engineering
TL;DR: By modeling the ECG as a cyclostationary signal, the deconvolution can be done without a priori knowledge of the impulse response of the distorting system.
Abstract: Distortion caused by the passage of an electrocardiogram (ECG) through a linear, time-invariant system can be removed by deconvolving the impulse response of the distorting system from the observation. By modeling the ECG as a cyclostationary signal, the deconvolution can be done without a priori knowledge of the impulse response of the distorting system.

5 citations

Journal Article•10.1049/EL:19780026•
Envelope-constrained time-domain deconvolution for transversal-filter equalisers

[...]

D. Preis1•
Harvard University1
19 Jan 1978-Electronics Letters
TL;DR: In this paper, a deconvolution algorithm is presented for calculating the N tap weights of a transversal-filter equaliser, which attempts to control the size of individual, time-domain response errors rather than simply minimise total mean-square error of the response.
Abstract: A deconvolution algorithm is presented for calculating the N tap weights of a transversal-filter equaliser. The procedure attempts to control the size of individual, time-domain response errors rather than simply minimise total mean-square error of the response. A least-square error solution for the tap weights is iteratively modified, using only elementary algebraic matrix operations, in an effort to satisfy tolerance constraints on the envelope of the equalised impulse response. The algorithm is suitable for digital computation.

4 citations

Journal Article•10.1366/000370278774331044•
Noise Amplification and Resolution Improvement in Deconvolution of Experimental Spectra

[...]

I. Balslev1, J. E. Larsen1, S. Larsen1•
Odense University1
01 Sep 1978-Applied Spectroscopy
TL;DR: In this article, the authors studied the relation between noise amplification and instrumentally broadened spectra in deconvolution and showed that the relation is not as strong as one would expect when the decoder is bounded by regions with negligible influence of instrumental broadening.
Abstract: Digital deconvolution of instrumentally broadened spectra is characterized by an improvement of resolution and an amplification of noise. By noise simulation we have studied the relation between these properties when the deconvolution interval is bounded by regions with negligible influence of instrumental broadening. These boundary conditions lead to a relevant reduction of noise amplification for rectangular and triangular convolution functions, but have less practical interest for bell-shaped convolution functions.

3 citations

Journal Article•10.1109/TIT.1978.1055835•
The problem of transmission zeros in deconvolution (Corresp.)

[...]

A. Papoulis
01 Jan 1978-IEEE Transactions on Information Theory
TL;DR: In the deconvolution problem, the presence of noise introduces large errors in the vicinity of the zero-crossings \omega_{i} of the system function.
Abstract: In the deconvolution problem, the presence of noise introduces large errors in the vicinity of the zero-crossings \omega_{i} of the system function. A simple method is presented for reducing

2 citations

Proceedings Article•10.1109/ICASSP.1978.1170394•
Comparative study of iterative deconvolution algorithms

[...]

Russell M. Mersereau1, R. Schafer•
Georgia Institute of Technology1
1 Apr 1978
TL;DR: It is shown that a number of well known iterative deconvolution algorithms are closely related members of a general class and this point of view leads to new understanding of previous approaches and to a new algorithm that incorporates both a finite interval constraint and a positivity constraint on the output of the deconVolution process.
Abstract: It is shown that a number of well known iterative deconvolution algorithms are closely related members of a general class. This point of view leads to new understanding of previous approaches and to a new algorithm that incorporates both a finite interval constraint and a positivity constraint on the output of the deconvolution process. Examples are given to illustrate performance on gamma-ray spectra.
Journal Article•10.1007/BF01312264•
Numerical Deconvolution by Least Squares: Use of Prescribed Input Functions

[...]

David J. Cutler1•
University of London1
01 Jun 1978-Journal of Pharmacokinetics and Biopharmaceutics
TL;DR: A new method for numerical deconvolution is described, for use in calculating drug input rates, based on the least-squares criterion, and is applicable when the input function can be assumed to take a prescribed form.
Abstract: A new method for numerical deconvolution is described, for use in calculating drug input rates. The method is based on the least-squares criterion and is applicable when the input function can be assumed to take a prescribed form. In particular, an exponential input function and an input function derived from the cube-root dissolution law are considered. The stability of the method to data noise is shown by means of examples, using simulated data.
Journal Article•10.1016/0029-554X(78)90628-6•
Bayesian deconvolution III: Applications and algorithm implementation

[...]

T. J. Kennett1, P.M. Brewster1, William V. Prestwich1, A. Robertson1•
McMaster University1
01 Jul 1978-Nuclear Instruments and Methods
TL;DR: A Bayesian based deconvolution procedure for which previous basic studies have been reported is used to process experimental data, the main thrust being the application of the technique to spectral information characteristic of several fields.

Tools

SciSpace AgentBiomedical AgentSciSpace RecruitSciSpace for EnterpriseAgent GalleryChat with PDFLiterature ReviewAI WriterFind TopicsParaphraserCitation GeneratorExtract DataAI DetectorCitation Booster

Learn

ResourcesLive Workshops

SciSpace

CareersSupportBrowse PapersPricingSciSpace Affiliate ProgramCancellation & Refund PolicyTermsPrivacyData Sources

Directories

PapersTopicsJournalsAuthorsConferencesInstitutionsCitation StylesWriting templates

Extension & Apps

SciSpace Chrome ExtensionSciSpace Mobile App

Contact

support@scispace.com
SciSpace

© 2026 | PubGenius Inc. | Suite # 217 691 S Milpitas Blvd Milpitas CA 95035, USA

soc2
Secured by Delve