3 research outputs found

    Image counter-forensics based on feature injection

    Get PDF
    Starting from the concept that many image forensic tools are based on the detection of some features revealing a particular aspect of the history of an image, in this work we model the counter-forensic attack as the injection of a specific fake feature pointing to the same history of an authentic reference image. We propose a general attack strategy that does not rely on a specific detector structure. Given a source image x and a target image y, the adversary processes x in the pixel domain producing an attacked image (x) over tilde, perceptually similar to x, whose feature f((x) over tilde) is as close as possible to f (y) computed on y. Our proposed counter-forensic attack consists in the constrained minimization of the feature distance Phi(z) = vertical bar f (z) f (y) vertical bar through iterative methods based on gradient descent. To solve the intrinsic limit due to the numerical estimation of the gradient on large images, we propose the application of a feature decomposition process, that allows the problem to be reduced into many subproblems on the blocks the image is partitioned into. The proposed strategy has been tested by attacking three different features and its performance has been compared to state-of-the-art counter-forensic methods

    Image Forensics in the Wild

    Get PDF

    Image counter-forensics based on feature injection

    No full text
    6noStarting from the concept that many image forensic tools are based on the detection of some features revealing a particular aspect of the history of an image, in this work we model the counter-forensic attack as the injection of a specific fake feature pointing to the same history of an authentic reference image. We propose a general attack strategy that does not rely on a specific detector structure. Given a source image x and a target image y, the adversary processes x in the pixel domain producing an attacked image (x) over tilde, perceptually similar to x, whose feature f((x) over tilde) is as close as possible to f (y) computed on y. Our proposed counter-forensic attack consists in the constrained minimization of the feature distance Phi(z) = vertical bar f (z) f (y) vertical bar through iterative methods based on gradient descent. To solve the intrinsic limit due to the numerical estimation of the gradient on large images, we propose the application of a feature decomposition process, that allows the problem to be reduced into many subproblems on the blocks the image is partitioned into. The proposed strategy has been tested by attacking three different features and its performance has been compared to state-of-the-art counter-forensic methods.nonenoneIuliani, M; Rossetto, S; Bianchi, T; De Rosa, A; Piva, A; Barni, MauroIuliani, M; Rossetto, S; Bianchi, T; De Rosa, A; Piva, A; Barni, Maur
    corecore