Near-perfect correlation functions based on zero-sum digital projections

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    3 Citations (Scopus)

    Abstract

    Minimal projective ghost functions make good watermark labels for embedding into images. Although fragile to hacking attacks, they are near-to-invisible because of their distributed, random appearance and their binary, zero-mean statistics. They have the strong correlation properties needed to extract a low-intensity watermark from bright image data. We present a method to embed, concurrently, up to (p-1)/2 independent minimal ghosts within the same pxp image space, where p is prime. Compounding ghosts inside the same pxp space increases, by (p-1)/2, the robustness with which these watermarks can be recovered. This result then approaches the optimal peak correlation result obtainable using 2D perfect or near-perfect sequences. However, unlike perfect sequences, minimal ghosts are simple to construct and compound. A large number of independent compounded minimal ghosts can be generated for each prime p, thus each watermark is sufficiently individual to prevent confusion when multiple labels are present.
    Original languageEnglish
    Title of host publication2011 International Conference on Digital Image Computing: Techniques and Applications
    EditorsAndrew Bradley, Paul Jackway, Yaniv Gal, Olivier Salvado
    Place of PublicationUSA
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages627-632
    Number of pages6
    Volume1
    ISBN (Print)9781457720062
    DOIs
    Publication statusPublished - 2011
    EventDigital Image Computing Techniques and Applications 2011 - Sheraton Noosa Resort & Spa, Noosa Sunshine Coast, Australia
    Duration: 6 Dec 20118 Dec 2011
    Conference number: 13
    http://dicta2011.aprs.org.au/

    Conference

    ConferenceDigital Image Computing Techniques and Applications 2011
    Abbreviated titleDICTA 2011
    CountryAustralia
    CityNoosa Sunshine Coast
    Period6/12/118/12/11
    OtherThe International Conference on Digital Image Computing: Techniques and Applications (DICTA) is the main Australian Conference on computer vision, image processing, pattern recognition, and related areas. DICTA was established as a biannual conference in 1991 and became an annual event in 2007. It is the premiere conference of the Australian Pattern Recognition Society (APRS).
    Internet address

    Keywords

    • discrete projection
    • discrete Radon transforms
    • image correlations
    • Image labelling

    Cite this

    Svalbe, I. (2011). Near-perfect correlation functions based on zero-sum digital projections. In A. Bradley, P. Jackway, Y. Gal, & O. Salvado (Eds.), 2011 International Conference on Digital Image Computing: Techniques and Applications (Vol. 1, pp. 627-632). [6128731] USA: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/DICA.2011.111
    Svalbe, Imants. / Near-perfect correlation functions based on zero-sum digital projections. 2011 International Conference on Digital Image Computing: Techniques and Applications. editor / Andrew Bradley ; Paul Jackway ; Yaniv Gal ; Olivier Salvado. Vol. 1 USA : IEEE, Institute of Electrical and Electronics Engineers, 2011. pp. 627-632
    @inproceedings{444298417d6f40738351faec7fefe7f8,
    title = "Near-perfect correlation functions based on zero-sum digital projections",
    abstract = "Minimal projective ghost functions make good watermark labels for embedding into images. Although fragile to hacking attacks, they are near-to-invisible because of their distributed, random appearance and their binary, zero-mean statistics. They have the strong correlation properties needed to extract a low-intensity watermark from bright image data. We present a method to embed, concurrently, up to (p-1)/2 independent minimal ghosts within the same pxp image space, where p is prime. Compounding ghosts inside the same pxp space increases, by (p-1)/2, the robustness with which these watermarks can be recovered. This result then approaches the optimal peak correlation result obtainable using 2D perfect or near-perfect sequences. However, unlike perfect sequences, minimal ghosts are simple to construct and compound. A large number of independent compounded minimal ghosts can be generated for each prime p, thus each watermark is sufficiently individual to prevent confusion when multiple labels are present.",
    keywords = "discrete projection, discrete Radon transforms, image correlations, Image labelling",
    author = "Imants Svalbe",
    year = "2011",
    doi = "10.1109/DICA.2011.111",
    language = "English",
    isbn = "9781457720062",
    volume = "1",
    pages = "627--632",
    editor = "Andrew Bradley and Paul Jackway and Yaniv Gal and Olivier Salvado",
    booktitle = "2011 International Conference on Digital Image Computing: Techniques and Applications",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    address = "United States of America",

    }

    Svalbe, I 2011, Near-perfect correlation functions based on zero-sum digital projections. in A Bradley, P Jackway, Y Gal & O Salvado (eds), 2011 International Conference on Digital Image Computing: Techniques and Applications. vol. 1, 6128731, IEEE, Institute of Electrical and Electronics Engineers, USA, pp. 627-632, Digital Image Computing Techniques and Applications 2011, Noosa Sunshine Coast, Australia, 6/12/11. https://doi.org/10.1109/DICA.2011.111

    Near-perfect correlation functions based on zero-sum digital projections. / Svalbe, Imants.

    2011 International Conference on Digital Image Computing: Techniques and Applications. ed. / Andrew Bradley; Paul Jackway; Yaniv Gal; Olivier Salvado. Vol. 1 USA : IEEE, Institute of Electrical and Electronics Engineers, 2011. p. 627-632 6128731.

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    TY - GEN

    T1 - Near-perfect correlation functions based on zero-sum digital projections

    AU - Svalbe, Imants

    PY - 2011

    Y1 - 2011

    N2 - Minimal projective ghost functions make good watermark labels for embedding into images. Although fragile to hacking attacks, they are near-to-invisible because of their distributed, random appearance and their binary, zero-mean statistics. They have the strong correlation properties needed to extract a low-intensity watermark from bright image data. We present a method to embed, concurrently, up to (p-1)/2 independent minimal ghosts within the same pxp image space, where p is prime. Compounding ghosts inside the same pxp space increases, by (p-1)/2, the robustness with which these watermarks can be recovered. This result then approaches the optimal peak correlation result obtainable using 2D perfect or near-perfect sequences. However, unlike perfect sequences, minimal ghosts are simple to construct and compound. A large number of independent compounded minimal ghosts can be generated for each prime p, thus each watermark is sufficiently individual to prevent confusion when multiple labels are present.

    AB - Minimal projective ghost functions make good watermark labels for embedding into images. Although fragile to hacking attacks, they are near-to-invisible because of their distributed, random appearance and their binary, zero-mean statistics. They have the strong correlation properties needed to extract a low-intensity watermark from bright image data. We present a method to embed, concurrently, up to (p-1)/2 independent minimal ghosts within the same pxp image space, where p is prime. Compounding ghosts inside the same pxp space increases, by (p-1)/2, the robustness with which these watermarks can be recovered. This result then approaches the optimal peak correlation result obtainable using 2D perfect or near-perfect sequences. However, unlike perfect sequences, minimal ghosts are simple to construct and compound. A large number of independent compounded minimal ghosts can be generated for each prime p, thus each watermark is sufficiently individual to prevent confusion when multiple labels are present.

    KW - discrete projection

    KW - discrete Radon transforms

    KW - image correlations

    KW - Image labelling

    UR - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6128731

    U2 - 10.1109/DICA.2011.111

    DO - 10.1109/DICA.2011.111

    M3 - Conference Paper

    SN - 9781457720062

    VL - 1

    SP - 627

    EP - 632

    BT - 2011 International Conference on Digital Image Computing: Techniques and Applications

    A2 - Bradley, Andrew

    A2 - Jackway, Paul

    A2 - Gal, Yaniv

    A2 - Salvado, Olivier

    PB - IEEE, Institute of Electrical and Electronics Engineers

    CY - USA

    ER -

    Svalbe I. Near-perfect correlation functions based on zero-sum digital projections. In Bradley A, Jackway P, Gal Y, Salvado O, editors, 2011 International Conference on Digital Image Computing: Techniques and Applications. Vol. 1. USA: IEEE, Institute of Electrical and Electronics Engineers. 2011. p. 627-632. 6128731 https://doi.org/10.1109/DICA.2011.111