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

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.

[1]  Imants D. Svalbe,et al.  Mapping between Digital and Continuous Projections via the Discrete Radon Transform in Fourier Space , 2003, DICTA.

[2]  Minh N. Do,et al.  Orthonormal finite ridgelet transform for image compression , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[3]  Jean-Pierre V. Guédon,et al.  The Mojette Transform: The First Ten Years , 2005, DGCI.

[4]  Jan Flusser,et al.  Image Representation Via a Finite Radon Transform , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[6]  Richard Gordon,et al.  Questions of uniqueness and resolution in reconstruction from projection , 1978 .

[7]  David Dagan Feng,et al.  Efficient blind image restoration using discrete periodic Radon transform , 2004, IEEE Transactions on Image Processing.

[8]  Benoît Parrein,et al.  Internet distributed image information system , 2001, Integr. Comput. Aided Eng..

[9]  Imants Svalbe.  Image Operations in Discrete Radon Space , 2002 .

[10]  Imants Svalbe,et al.  Reconstruction of tomographic images using analog projections and the digital Radon transform , 2001 .

[11]  Jeanpierre V. Guedon,et al.  Mojette transform: applications for image analysis and coding , 1997, Electronic Imaging.

[12]  Imants D. Svalbe.  An image labeling mechanism using digital Radon projections , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[13]  Florent Autrusseau,et al.  Mojette cryptomarking scheme for medical images , 2003, SPIE Medical Imaging.

[14]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[15]  A. Kingston,et al.  Projective Transforms on Periodic Discrete Image Arrays , 2006 .

[16]  Imants D. Svalbe,et al.  Farey Sequences and Discrete Radon Transform Projection Angles , 2003, Electron. Notes Discret. Math..

[17]  Jérôme Idier,et al.  Conjugate gradient Mojette reconstruction , 2005, SPIE Medical Imaging.

[18]  Dominique Barba,et al.  Binkey: a system for video content analysis "on the fly" , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[19]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[20]  Xiaoming Huo,et al.  Beamlets and Multiscale Image Analysis , 2002 .