StegaStamp: Invisible Hyperlinks in Physical Photographs

Matthew Tancik, Ben Mildenhall, Ren Ng
4/10/2019
cs.CV

Official code: tancik/StegaStamp (884 stars, MIT, TensorFlow, last commit 2023-12-08).

Abstract

Printed and digitally displayed photos have the ability to hide imperceptible digital data that can be accessed through internet-connected imaging systems. Another way to think about this is physical photographs that have unique QR codes invisibly embedded within them. This paper presents an architecture, algorithms, and a prototype implementation addressing this vision. Our key technical contribution is StegaStamp, a learned steganographic algorithm to enable robust encoding and decoding of arbitrary hyperlink bitstrings into photos in a manner that approaches perceptual invisibility. StegaStamp comprises a deep neural network that learns an encoding/decoding algorithm robust to image perturbations approximating the space of distortions resulting from real printing and photography. We demonstrates real-time decoding of hyperlinks in photos from in-the-wild videos that contain variation in lighting, shadows, perspective, occlusion and viewing distance. Our prototype system robustly retrieves 56 bit hyperlinks after error correction - sufficient to embed a unique code within every photo on the internet.

View on arXivView PDF

Code Implementations(1)

tancik/StegaStampOfficial100%
TensorFlowMIT

Invisible Hyperlinks in Physical Photographs

884224Shell, PythonApr 8, 20192 years agoMIT
barcodeqrcodesteganographytensorflowwatermark

Similar Papers

Cite this paper

@article{tancik2019stegastamp,
  title  = {StegaStamp: Invisible Hyperlinks in Physical Photographs},
  author = {Matthew Tancik and Ben Mildenhall and Ren Ng},
  year   = {2019},
  eprint = {1904.05343},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1904.05343}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1904.05343.svg)](https://codeofpaper.com/paper/1904.05343)

Discussion