main

An Efficient Method for Content Reconstruction with Self-Embedding
1. Reconstruction Success Bounds
2. Reconstruction Demand
3. Reconstruction Demand for Selected Code Rates
4. Experimental Evaluation of the Rec. Bound - Gamma 1
5. Experimental Evaluation of the Rec. Bound - Gamma 2
6. Experimental Evaluation of the Rec. Bound - Gamma 3
Save the results

An Efficient Method for Content Reconstruction with Self-Embedding

Version: 2012.07.15 Contact: Paweł Korus, pkorus@agh.edu.pl

The author is with the Department of Telecommunications of AGH University of Science and Technology, Kraków, Poland.

------------------------------------------------------------------------

This file is a demonstration of a self-embedding scheme based on an erasure communication channel. It accompanies the manuscript:

P. Korus and A. Dziech, An Efficient Method for Content Reconstruction with Self-Embedding

submitted to IEEE Transactions on Image Processing on 03.01.2012.

This file recreates the most important figures from the paper. Please refer to the included README file for instructions.

------------------------------------------------------------------------

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation version 3.0.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

----------------------------------------------------------------------

The research leading to these results has received funding from the INDECT project funded by European Community's Seventh Framework Pro- -gramme (FP7 / 2007-2013) under grant agreement no.[218086].

1. Reconstruction Success Bounds

The derived bounds on the maximal tampering rate:

$\gamma_1$ - general erasure channel
$\gamma_2$ - optimistic tampering rate bound
$\gamma_3$ - estimate of the typical tampering rate bound for a random tampering pattern
$\gamma_3'$ - more accurate typical tamp. rate bound

2. Reconstruction Demand

The results of the shape parameter $\alpha$ estimation together with the derived theoretical results.

3. Reconstruction Demand for Selected Code Rates

Experimental vs. theoretical dependency between the reconstruction demand and the tampering rate for selected reference payloads $\lambda$ . The corresponding $\gamma_1$ and $\gamma_3$ are plotted using dotted lines. Success cases are marked with circles, failures are marked with crosses.

4. Experimental Evaluation of the Rec. Bound - Gamma 1

The goal of this experiment is to verify the analytical reconstruction performance bound $\gamma_1$ . A general erasure channel model is used for decoding the reference payload. Each sample in the plot represents a single reconstruction attempt. The applicable theoretical bound between the successes and failures is shown as a solid line.

5. Experimental Evaluation of the Rec. Bound - Gamma 2

The goal of this experiment is to verify the analytical reconstruction performance bound $\gamma_2$ (continuous tampering pattern). The proposed self-recovery model is used for decoding the reference payload. Each sample in the plot represents a single reconstruction attempt. The applicable theoretical bound between the successes and failures is shown as a solid line.

6. Experimental Evaluation of the Rec. Bound - Gamma 3

The goal of this experiment is to verify the analytical reconstruction performance bound $\gamma_3$ (random tampering pattern). The proposed self-recovery model is used for decoding the reference payload. Each sample in the plot represents a single reconstruction attempt. The applicable theoretical bound between the successes and failures is shown as a solid line.

Save the results

 INFO Saving results to "results/results_20111229_256_250_5000.mat"

Contents