Geometric Shape Effects in Redundant Keys used to Encrypt Data Transformed by Finite Discrete Radon Projections

Authors:
Andrew Kingston;Imants Svalbe
Affiliations:
Monash University;Monash University
Venue:
DICTA '05 Proceedings of the Digital Image Computing on Techniques and Applications
Year:
2005

Citing 0
Cited 4

Generalised finite radon transform for N x N images

Image and Vision Computing
A high performance parallel Radon based OFDM transceiver design and simulation

Digital Signal Processing
An exact, non-iterative Mojette inversion technique utilising ghosts

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Quantised angular momentum vectors and projection angle distributions for discrete radon transformations

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Finite discrete Radon Transform (FRT) represents digital data exactly and without redundancy. Redundancy can however be injected into the FRT by reserving part of the image area to be replaced by a key that contains pixels of known, fixed values. The resulting image redundancy can be used to watermark values into the image, or as an encryption key that must be known if the image data is to be recoverable from a subset of transmitted projections. This paper looks at the affect the geometry of the selected key areas has on the interaction between the FRT projections of the key area and those of the data area. A method is proposed to measure this interaction of projected values. Results for simple key geometries are obtained. These give some insight into the design of key shapes that optimise the coupling of projected key and image values.