Properties of Minimal Ghosts

  • Imants Svalbe
  • Nicolas Normand
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)

Abstract

A ghost image is an array of signed pixel values so positioned as to create zero-sums in all discrete projections taken across that image for a pre-defined set of angles. The discrete projection scheme used here is the finite Radon transform. Minimal ghosts employ just 2N pixels to generate zero-sum projections at N projection angles. We describe efficient methods to construct \(N^\text{th}\) order minimal ghost images on prime-sized 2D arrays. Ghost images or switching components are important in discrete image reconstruction. Ghosts usually grow larger as they are constrained by more projection angles. When ghosts become too large to be added to an image, image reconstruction from projections becomes unique and exact. Ghosts can be used to synthesize image/anti-image data that will also exhibit zero-sum projections at N pre-defined angles. We examine the remarkable symmetry, cross- and auto-correlation properties of minimal ghosts. The geometric properties of minimal ghost images may make them suitable to embed in data as watermarks.

Keywords

Image Space Projection Angle Ghost Image Discrete Image Projected View 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Arnold, V.I., Avez, A.: Problèmes ergodiques de la mécanique classique. Gauthier-Villars, Paris (1967); English translation: Benjamin, New York (1968)MATHGoogle Scholar
  2. 2.
    Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: X-rays characterizing some classes of discrete sets. Linear Algebra and its Appl. 339(1-3), 3–21 (2001)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Chandra, S., Svalbe, I.D.: A fast number theoretic finite Radon transform. In: DICTA 2009, pp. 361–368. IEEE, Melbourne (2009)Google Scholar
  4. 4.
    Chandra, S., Svalbe, I.D., Guédon, J.-P.: An exact, non-iterative mojette inversion technique utilising ghosts. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 401–412. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  5. 5.
    Gardner, R.J., Gritzmann, P.: Discrete tomography: determination of finite sets by X-rays. Trans. AMS 349(6), 2271–2295 (1997)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Grigoryan, A.M.: New algorithms for calculating discrete Fourier transforms. Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki 26(5), 1407–1412 (1986)MATHGoogle Scholar
  7. 7.
    Guédon, J.P. (ed.): The Mojette Transform: Theory and Applications. Wiley-ISTE, Chichester (2009)Google Scholar
  8. 8.
    Hariharan, R.: Near perfect sequences of odd length. In: Int. Workshop on Signal Design and its Appl. in Comm., pp. 4–7. IEEE, Fukuoka (2009)Google Scholar
  9. 9.
    Hayashi, T.: Zero-correlation zone sequence set construction using an even-perfect sequence and an odd-perfect sequence. IEICE Trans. on Fundamentals of Electronics, Comm. and Computer Sciences 90-A(9), 1871–1875 (2007)CrossRefGoogle Scholar
  10. 10.
    Herman, G.T., Davidi, R.: Image reconstruction from a small number of projections. Inverse Problems 24(4) (2008)Google Scholar
  11. 11.
    Katz, M.B.: Questions of uniqueness and resolution in reconstruction from projections. Lecture Notes in Biomath., vol. 26. Springer, Berlin (1978)MATHGoogle Scholar
  12. 12.
    Kingston, A.M., Svalbe, I.D.: Projective transforms on periodic discrete image arrays. In: Adv. in Imaging and Electron Physics, vol. 139, pp. 75–177. Elsevier, Amsterdam (2006)Google Scholar
  13. 13.
    Kuznetsov, O.: Perfect sequences over the real quaternions. In: Int. Workshop on Signal Design and its Appl. in Comm., pp. 8–11. IEEE, Fukuoka (2009)Google Scholar
  14. 14.
    Louis, A.K.: Picture reconstruction from projections in restricted range. Mathematical Methods in the Applied Sciences 2, 209–220 (1980)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Maragos, P., Schafer, R.W.: Morphological filters–parts I & II. In: Proceedings of IEEE Int. Conf. on Acoustics, Speech, and Signal Processing (ICASSP 2002), vol. 35, pp. 1153–1184. IEEE, Los Alamitos (1987)Google Scholar
  16. 16.
    Matheron, G.: Random Sets and Integral Geometry. Wiley, New York (1975)MATHGoogle Scholar
  17. 17.
    Matúš, F., Flusser, J.: Image representation via a finite Radon transform. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(10), 996–1006 (1993)CrossRefGoogle Scholar
  18. 18.
    Normand, N., Svalbe, I.D., Parrein, B., Kingston, A.M.: Erasure coding with the finite Radon transform. In: IEEE Wireless Comm. & Networking Conf., Sydney, pp. 1–6 (April 2010)Google Scholar
  19. 19.
    Serra, J.: Image analysis and mathematical morphology. In: Theoretical Adv., vol. 2. Academic Press, London (1982)Google Scholar
  20. 20.
    Svalbe, I.D.: Exact, scaled image rotations in finite Radon transform space. Pattern Recognition Letters (2010) (in press)Google Scholar
  21. 21.
    Svalbe, I.D., Chandra, S.: Growth of discrete projection ghosts created by iterated dilations. In: DGCI 2011. LNCS, Springer, Nancy (2011)Google Scholar
  22. 22.
    Svalbe, I.D., Normand, N., Nazareth, N., Chandra, S.: On constructing minimal ghosts. In: DICTA 2010, Sydney, Australia (December 2010)Google Scholar
  23. 23.
    Zopf, S.: Construction of switching components. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds.) DGCI 2003. LNCS, vol. 2886. Springer, Heidelberg (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Imants Svalbe
    • 1
  • Nicolas Normand
    • 1
    • 2
  1. 1.School of PhysicsMonash UniversityMelbourneAustralia
  2. 2.IRCCyNUniversity of NantesNantesFrance

Personalised recommendations