1991
DOI: 10.1016/0165-1684(91)90128-6
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive maximum-likelihood deconvolution algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1994
1994
1999
1999

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Here we use short, nonoverlapping intervals combined with a prior that encourages continuity. This is not equivalent to the smoothing obtained by using longer and overlapping intervals as in [10]. In particular, when the data (the number and size of reflectors) are unevenly distributed, the difference can be large.…”
Section: Conclusion and Discussionmentioning
confidence: 77%
See 1 more Smart Citation
“…Here we use short, nonoverlapping intervals combined with a prior that encourages continuity. This is not equivalent to the smoothing obtained by using longer and overlapping intervals as in [10]. In particular, when the data (the number and size of reflectors) are unevenly distributed, the difference can be large.…”
Section: Conclusion and Discussionmentioning
confidence: 77%
“…They may be viewed as "tuning parameters," or possibly be estimated by other means. In contrast to the recursive approach of Chi and Chen [10], our solution requires the entire trace to be available at the time of processing. However, better estimates can be expected because they are based on more data (all future as well as past samples).…”
Section: Conclusion and Discussionmentioning
confidence: 96%