2017
DOI: 10.1007/978-3-319-66272-5_12
|View full text |Cite
|
Sign up to set email alerts
|

Maximal N-Ghosts and Minimal Information Recovery from N Projected Views of an Array

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…In this case no multiple point belongs to G = (G + , G − ), which is called bad configuration. See also [6,32,33,34] for recent results concerning ghosts in discrete tomography. Remark 1.…”
Section: Preliminariesmentioning
confidence: 99%
“…In this case no multiple point belongs to G = (G + , G − ), which is called bad configuration. See also [6,32,33,34] for recent results concerning ghosts in discrete tomography. Remark 1.…”
Section: Preliminariesmentioning
confidence: 99%
“…Computational investigations related to the explicit construction of switching components can be found in [80]. Switching components for other projection models are considered in [127,128,129,130,136]. Special types of switching components in the context of superresolution imaging, hv-convex polynomioes, and, in a more algebraic setting, are studied in [65], [71], and [115], respectively.…”
Section: Theorem 4 ([120]mentioning
confidence: 99%