Abstract
We present a convex, edge-preserving prior, which we term a median prior, for regularized (or Bayesian) tomographic reconstruction. With its associated iterative algorithm, the prior can be described approximately as follows: At each iteration k, each object point fjk is attracted to the median formed from a local neighborhood surrounding fjk, while still trying to satisfy data consistency. With this intuitively appealing approach, it becomes difficult to prove convexity of the objective associated with the prior. However, in this paper, we reformulate the prior so that, while it approximately retains the above behavior, it is provably convex. Anecdotal reconstructions are shown to illustrate the behavior of the new median prior.
| Original language | English |
|---|---|
| Pages | 1779-1782 |
| Number of pages | 4 |
| State | Published - 2001 |
| Event | 2001 IEEE Nuclear Science Symposium Conference Record - San Diego, CA, United States Duration: 04 11 2001 → 10 11 2001 |
Conference
| Conference | 2001 IEEE Nuclear Science Symposium Conference Record |
|---|---|
| Country/Territory | United States |
| City | San Diego, CA |
| Period | 04/11/01 → 10/11/01 |
Keywords
- Bayesian reconstruction
- Edge-preserving
- Median prior
Fingerprint
Dive into the research topics of 'A median prior for tomographic reconstruction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver