1996
DOI: 10.1117/12.233180
|View full text |Cite
|
Sign up to set email alerts
|

<title>Controlled redundancy for image coding and high-speed transmission</title>

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 18 publications
(28 citation statements)
references
References 0 publications
0
28
0
Order By: Relevance
“…This result has been extended in an independent manner by Normand and Guédon [14] to apply to data with compact support of any shape.…”
Section: Conditions For Reconstructabilitymentioning
confidence: 79%
See 2 more Smart Citations
“…This result has been extended in an independent manner by Normand and Guédon [14] to apply to data with compact support of any shape.…”
Section: Conditions For Reconstructabilitymentioning
confidence: 79%
“…The inverse Mojette transform is a fast and simple algorithm [14]. Searching for and updating 1-1 pixel-bin correspondence enables a simple iterative procedure to recover the image.…”
Section: Reconstruction From Mojette Projectionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Some degree of information redundancy arises in this more general Mojette projection representation. However this redundancy may be exploited usefully in the design of very efficient data transmission, storage and encryption schemes [16,17]. The algorithms to reconstruct images from Mojette projections [6] are more complex than for the FRT, largely because of the increased level of redundancy.…”
Section: Existing Digital Angle Schemesmentioning
confidence: 99%
“…Note that one can easily over-specify the projection set (i.e., μ > μ min ) [10]. When the Katz criterion is not satisfied, ghosts or phantoms arise in the reconstructed image [11,5].…”
Section: The Mojette Transform (Mt)mentioning
confidence: 99%