### Abstract

Original language | English |
---|---|

Title of host publication | Discrete Geometry for Computer Imagery |

Editors | Isabelle Debled-Rennesson, Eric Domenjoud, Bertrand Kerautret, Philippe Even |

Place of Publication | Germany |

Publisher | Springer |

Pages | 406 - 416 |

Number of pages | 11 |

Volume | 6607 |

ISBN (Print) | 0302-9743 |

DOIs | |

Publication status | Published - 2011 |

Event | International Conference on Discrete Geometry for Computer Imagery 2011 - Nancy, France Duration: 6 Apr 2011 → 8 Apr 2011 Conference number: 16th http://www.springer.com/gp/book/9783642198663 |

### Conference

Conference | International Conference on Discrete Geometry for Computer Imagery 2011 |
---|---|

Abbreviated title | DGCI 2011 |

Country | France |

City | Nancy |

Period | 6/04/11 → 8/04/11 |

Internet address |

### Cite this

*Discrete Geometry for Computer Imagery*(Vol. 6607, pp. 406 - 416). Germany: Springer. https://doi.org/10.1007/978-3-642-19867-0_34

}

*Discrete Geometry for Computer Imagery.*vol. 6607, Springer, Germany, pp. 406 - 416, International Conference on Discrete Geometry for Computer Imagery 2011, Nancy, France, 6/04/11. https://doi.org/10.1007/978-3-642-19867-0_34

**Growth of discrete projection ghosts created by iteration.** / Svalbe, Imants; Chandra, Shekhar.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Growth of discrete projection ghosts created by iteration

AU - Svalbe, Imants

AU - Chandra, Shekhar

PY - 2011

Y1 - 2011

N2 - Ghost images find use in synthesizing the content of missing rows of image or projection space from data that contains some deliberate level of information redundancy. Here we examine the properties of ghost images that are constructed through a process of iterated convolution. An initial ghost is propagated by cumulative displacements into other discrete directions to expand the range of angles that have zero-sum projections. The discrete projection scheme used here is the finite Radon transform (FRT). We examine these accumulating ghosts to quantify the growth of their dynamic range of their pixel values and the spread of their spatial extent. After N propagations, a pair of points with intensity A?1 can replicate to produce a maximum total intensity of 2N . For the discrete projections of the FRT, we show that column-oriented iterations better suppress the range and rate of growth of ghost image values. After N row-based iterations, the peak pixel values of FRT ghost images grow approximately as 20.8N . After N column-based iterations, the peak pixel values of FRT ghost images grow approximately as 20.7N . The slower rate of expansion of pixel values for column iteration comes at the expense of fragmenting the compactness of the set of FRT projection angles that are chosen to sum to zero.

AB - Ghost images find use in synthesizing the content of missing rows of image or projection space from data that contains some deliberate level of information redundancy. Here we examine the properties of ghost images that are constructed through a process of iterated convolution. An initial ghost is propagated by cumulative displacements into other discrete directions to expand the range of angles that have zero-sum projections. The discrete projection scheme used here is the finite Radon transform (FRT). We examine these accumulating ghosts to quantify the growth of their dynamic range of their pixel values and the spread of their spatial extent. After N propagations, a pair of points with intensity A?1 can replicate to produce a maximum total intensity of 2N . For the discrete projections of the FRT, we show that column-oriented iterations better suppress the range and rate of growth of ghost image values. After N row-based iterations, the peak pixel values of FRT ghost images grow approximately as 20.8N . After N column-based iterations, the peak pixel values of FRT ghost images grow approximately as 20.7N . The slower rate of expansion of pixel values for column iteration comes at the expense of fragmenting the compactness of the set of FRT projection angles that are chosen to sum to zero.

UR - http://www.springerlink.com.ezproxy.lib.monash.edu.au/content/w974616518m6/front-matter.pdf

U2 - 10.1007/978-3-642-19867-0_34

DO - 10.1007/978-3-642-19867-0_34

M3 - Conference Paper

SN - 0302-9743

VL - 6607

SP - 406

EP - 416

BT - Discrete Geometry for Computer Imagery

A2 - Debled-Rennesson, Isabelle

A2 - Domenjoud, Eric

A2 - Kerautret, Bertrand

A2 - Even, Philippe

PB - Springer

CY - Germany

ER -