Tamper-evident Image using JPEG Fixed Points

Siwei Lyu; Zhaofeng Si

REVIEW 2 major objections 4 minor 16 references

Tamper-evident Image using JPEG Fixed Points

T0 review · 2 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Repeated JPEG compression converges to a stable fixed image, and that fixed image can expose any later edit on its own.

desk verdict The tamper-evident construction is a nice idea, but the proof of the central fixed-point theorem collapses because the DCT matrix as defined is not orthonormal. read the letter →

arxiv 2504.17594 v1 pith:NJD2ZKP4 submitted 2025-04-24 cs.CV

Zhaofeng Si , Siwei Lyu This is my paper · ORCID

classification cs.CV MSC 68U1094A08

keywords JPEGfixedpointstamper-evidentimagedoublecompressionforensicsdiscretecosinetransformpointconvergencequantizationtableintegrityauthentication

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to prove a long-observed phenomenon: repeating the same JPEG compression and decompression cycle on an image eventually leaves it unchanged, at a stable JPEG fixed point. It models one cycle as a transform $T_q$ on 8x8 pixel blocks and proves that every block reaches such a fixed point in finitely many iterations while the reconstruction error decreases monotonically. The authors then turn this into a tamper-evident image: compress until stable, and any later edit will make one more JPEG cycle change the edited blocks, exposing both the fact and the location of tampering without watermarks or stored fingerprints. If the theorems are right, any image distributed as JPEG can carry its own proof of authenticity and flag malicious edits after a single verification compression.

What carries the argument

The load-bearing object is the vectorized JPEG transform $T_q(x) = ([D^{\top}[Dx]_q])^{255}_{0}$, where $D = P \otimes P^{\top}$ is a 64x64 orthonormal discrete-cosine-transform matrix and $[\cdot]_q$ is coefficient-wise quantization to multiples of the quantization step. The proof exploits orthonormality: multiplying by $D$ preserves Euclidean distance, so the quantization error $\epsilon_t = \|Dx_t - [Dx_t]_q\|$ and the rounding and truncation error $\eta_{t+1} = \|x_{t+1} - D^{\top}[Dx_t]_q\|$ satisfy $\epsilon_t \ge \eta_{t+1} \ge \epsilon_{t+1} \ge 0$. Because each operation is a projection onto a finite set of integer blocks, the paper argues the chain can descend only finitely often and therefore ends at a fixed point. For the tamper-evident application, the same mechanism means the transform is idempotent at the fixed point: recompressing with the same table changes nothing unless the pixels have been edited.

What would settle it

For a fixed quality table, take a large set of random 8x8 blocks and compute $T_q$ repeatedly, recording the first $t$ with $x_{t+1}=x_t$ and the number of distinct values of the quantization error $\epsilon_t$ before that. If any block runs for ten thousand iterations without stabilizing, or the error keeps taking new distinct values after ten thousand steps, the paper's finite-step theorem is false; if all blocks stabilize within a few hundred iterations across many quality tables, the practical claim is confirmed.

Watch

Extended reading notes

Core claim

The central claim is that the JPEG transform, written in vectorized form as $T_q(x) = ([D^{\top}[Dx]_q])^{255}_{0}$, is a projection process whose error decreases monotonically: quantization followed by rounding and truncation gives a non-increasing chain that must terminate at a point $x$ with $x = T_q(x)$. Theorem 3 states that the fixed-point set is exactly the terminal layer of the nested sequence of reachable sets, and every starting block lands in it after finitely many steps; Theorem 4 adds that blocks already separated by more than the threshold $2\delta$ cannot converge to the same fixed point. The paper reports experiments on one million random 8x8 blocks showing that consecutive-image differences vanish in a few cycles and that the stable image remains visually close to an ordinary single-compressed JPEG. On that basis it constructs a tamper-evident RGB image whose altered blocks are localized by one recompression with the same quantization table.

Load-bearing premise

The load-bearing premise is that the small errors introduced at each JPEG round can take only finitely many different values, which forces the decreasing error sequence to stabilize after finitely many rounds; the frequency transform uses irrational matrix entries, so this finite-value premise is not automatic, and the RGB version also assumes chroma subsampling does not couple neighboring pixels.

Editorial extensions

If this is right

Any 8x8 block compressed repeatedly with a fixed quantization table becomes stable after finitely many cycles, so a JPEG that has already converged is invariant under one more identical compression.
Typical images reach their fixed point within a few cycles, so producing a tamper-evident image costs only a small number of JPEG recompressions.
If the fixed-point image is edited, one additional JPEG cycle with the same table produces nonzero differences exactly in the edited blocks, localizing the tampering.
The scheme needs no watermark embedding and no externally stored fingerprint; the image itself is the verifier, as long as the verification quantization table matches the one used to create it.
Blocks that are far enough apart before convergence are guaranteed to converge to different fixed points, so distinct image regions do not accidentally merge into a single stable state that hides edits.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Going beyond the paper: the same fixed-point distance could be used as a continuous tamper score rather than a binary detector, since the deviation from the fixed point should grow with the strength of the edit; the paper does not quantify this scaling.
Going beyond the paper: the full-RGB extension assumes chroma subsampling does not couple neighboring pixels, but for 4:2:0 averaging subsampling those pixels do interact, so RGB fixed points may be only approximate; a direct test would be to build the fixed point with real subsampling and measure residual drift over cycles.
Going beyond the paper: if finite-step convergence ever failed for some quantization table, the tamper-evidence construction would still work approximately, with verification based on a small tolerance instead of exact equality; the paper does not discuss this fallback.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Quick take: this paper has a good intuition and a clever application, but the main theorem as written is not proven. The DCT matrix P defined in §2.3 is not orthonormal: for k=0, P_{0,n}=1/2, so the row norm is sqrt(2), not 1. Hence P^TP = diag(2,1,...,1), not the identity. The proof of Theorem 2 relies on D being an isometry to equate ||Dx_t - [Dx_t]_q|| with ||x_t - D^T[Dx_t]_q||. Without that, the monotone chain ϵ0 ≥ η1 ≥ ϵ1 ≥ ... does not follow, and Theorem 3, which depends on Theorem 2, is unsupported. The reader's finite-valued objection is not the real problem: Ω0 is finite, so the error terms do take finitely many values. The stress-test note is correct, and it is a load-bearing flaw.

What the paper does well: it gives the first formal framing of JPEG fixed points as an explicit transform, and the tamper-evident image construction is a genuinely new use of the phenomenon, removing the need for external fingerprints or watermarks. The numerical experiments are simple but consistent, and the related work is honest about Huang et al. 2010 and Niu et al. 2021. The paper reads as a sincere attempt to formalize a known empirical fact.

The soft spots beyond the orthonormality error: Section 2.5 claims fixed points for full RGB images, but the conclusion says extending to RGB is future work, and the claim about downsampling/upsampling not interfering is dubious for 4:2:0 subsampling. Also, no code or data are provided, though the experiments are not hard to reproduce.

Who this is for: researchers in image forensics and anyone using double-JPEG artifacts for tamper detection. The tamper-evident application could be useful if the theory is fixed.

Recommendation: I would send this to peer review because the idea has real merit and the forensic community would benefit from a correct proof. But the authors need to fix the DCT normalization error, rework the proof with the correct orthonormal transform (or handle the scaling explicitly), and either prove or retract the RGB claims. As it stands, the central theorem is unproven, so the paper needs major revision before acceptance.

Referee Report

2 major / 4 minor

Summary. The paper claims to provide the first formal proof that repeated JPEG compression/decompression, modeled as a transform T_q on 8×8 pixel blocks, has fixed points and that every block converges to a fixed point in finitely many steps. It then uses this property to propose tamper-evident JPEG images, in which any modification becomes detectable after a single additional JPEG round trip. The main proofs rely on viewing DCT, quantization, rounding, and truncation as Euclidean projections and on a monotone chain of error terms. The paper also states a theorem on distinct fixed points for sufficiently separated inputs and presents empirical demonstrations on 1M image blocks and on RGB images.

Significance. If the central theorem were correctly proved, it would give a rigorous explanation of a long-observed JPEG phenomenon and could be a useful building block for image forensics and integrity verification. The paper is self-contained and does not fit parameters to data; the finite-state monotone-chain strategy is a natural and potentially sound approach to the block-level problem. However, the current manuscript has a load-bearing error in the definition and properties of the DCT matrix, and the extension to RGB images rests on a false subsampling premise. With a corrected DCT normalization and a reworked proof, the block-level result is likely salvageable; the RGB application needs additional justification.

major comments (2)

[Section 2.3, Eq. (1)] The matrix P defined by P_{kn}=1/2 cos(π/8 (n+1/2)k) is not orthonormal: for k=0, P_{0n}=1/2 for all n, so row 0 has squared Euclidean norm 2. The standard orthonormal DCT-II uses 1/√8 for the DC entry. Consequently P^T P = diag(2,1,...,1) ≠ I, and D=P⊗P^T is not an isometry. In addition, for the 2D transform X↦PXP^T, the correct vectorization is vec(PXP^T)=(P⊗P)vec(X), not (P⊗P^T)vec(X). Since Eq. (1) and the proof of Theorem 2 use D^T D=I and D^T as an exact inverse, the equalities ε_t=||x_t−D^T[Dx_t]_q|| and η_{t+1}=||x_{t+1}−D^T[Dx_t]_q|| do not follow, and the monotone chain ε_0≥η_1≥ε_1≥... is unsupported. Theorem 3's finite-step convergence is the central mathematical claim of the paper, so this defect is load-bearing.
[Section 2.5] The claim that chroma downsampling and upsampling 'do not interfere with the fixed-point computation' is incorrect for standard 4:2:0 JPEG. Downsampling combines 2×2 pixel neighborhoods, and upsampling interpolates from neighboring chroma samples, so the pixels in a given block do interact with pixels in neighboring blocks. The RGB tamper-evident demonstration in Fig. 6 therefore rests on an unproven premise. This is also inconsistent with Section 5, where extending the theory to color-space transforms, downsampling/upsampling, and boundary padding is listed as future work. The Section 2.5 statement and the RGB application should either be removed or supported by a separate argument.

minor comments (4)

[Theorem 2 proof] The projection property for quantization is stated as [Dx_{t+1}]_q = arg min_{z∈[Ω0]_q} ||Dx_{t+1}−z||, but the quantization projection defined in Section 2.2 is with respect to [Z^d]_q, the set of all integer multiples of q. Since [Ω0]_q is generally a strict subset, the displayed equality is not justified. The inequality ε_{t+1}≤η_{t+1} can be recovered using the global projection set, so this is a repairable flaw rather than a fatal one.
[Section 2.3] The paper should define the vectorization convention explicitly and use the correct Kronecker-product expression for the 2D DCT, e.g., vec(PXP^T)=(P⊗P)vec(X).
[Figure 5] The statement that the quality degradation is 'less than 25dB below the threshold of human visual perception' is ambiguous; the PSNR values should be compared with a clearly stated threshold.
[Figure 6 caption] The caption uses 'tempering' where 'tampering' is meant.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper's fixed-point theorems are derived from the definition of the JPEG transform and a finite-state / monotone-convergence argument, not from fitted parameters, self-citations, or input-equivalent constructions.

full rationale

The paper's derivation chain is self-contained with respect to the mathematical claims. Theorem 1 defines nested finite sets Ω_t; Theorem 2 constructs a monotone non-increasing error sequence and uses finiteness of the state space to argue finite-step convergence; Theorem 3 then states existence of fixed points and finite convergence. No parameter is fitted to data and then renamed as a prediction; the numerical experiments in Figs. 3–5 are validations, not fitting steps. The tamper-evident construction in Section 3 simply applies the fixed-point property already proved. No load-bearing self-citation appears; the reference to Huang et al. [3] is a historical observation, not an imported uniqueness theorem. The RGB/chroma-subsampling assertion in Section 2.5 is an unsupported premise (and is explicitly deferred to future work in the conclusion), but an assumption gap is not circular reasoning. Similarly, the proof of Theorem 2 relies on the orthonormality of D; as written, the DCT matrix P in Section 2.3 is not orthonormal, making that proof step mathematically incorrect. This is a correctness concern, not a circularity: the proof is not assuming what it sets out to prove, nor is a derived quantity identical by construction to an input. Therefore the circularity score is 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No fitted parameters or invented entities. The proofs rely on standard finite-set and projection arguments plus two unsupported assumptions (finite-valued errors and non-interacting chroma subsampling) that are load-bearing for the full-image claims.

assumptions (5)

standard math DCT matrix P is orthonormal, so the JPEG transform preserves ℓ2 norms before rounding.
Section 2.3 defines P with P^T P = I; this is used in Theorem 2 to equate errors in pixel and DCT domains.
standard math Rounding and truncation are Euclidean projections onto their target sets, with a unique minimizer.
Section 2.2 asserts arg-min properties; needed for inequalities η_{t+1} ≤ ϵ_t and ϵ_{t+1} ≤ η_{t+1}.
standard math The domain Ω0 is finite with 2^223 elements.
Finite 8-bit pixels per block; used to claim eventual convergence.
ad hoc to paper ϵ_t and η_t take only finitely many values.
Theorem 2 proof states this, but D has irrational entries so D xt is not finite-valued; this is a gap in the proof.
ad hoc to paper For RGB images, the same pixels are downsampled and upsampled without interacting with other pixels.
Section 2.5; false for 4:2:0 chroma subsampling and unproven for the tamper-evident method.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Tamper-evident Image using JPEG Fixed Points." pith.science (2026). https://pith.science/paper/NJD2ZKP4

@misc{pith2026250417594,
  author       = {Pith},
  title        = {Pith review of: Tamper-evident Image using JPEG Fixed Points},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NJD2ZKP4}},
  note         = {Machine review of arXiv:2504.17594}
}

read the original abstract

An intriguing phenomenon about JPEG compression has been observed since two decades ago- after repeating JPEG compression and decompression, it leads to a stable image that does not change anymore, which is a fixed point. In this work, we prove the existence of fixed points in the essential JPEG procedures. We analyze JPEG compression and decompression processes, revealing the existence of fixed points that can be reached within a few iterations. These fixed points are diverse and preserve the image's visual quality, ensuring minimal distortion. This result is used to develop a method to create a tamper-evident image from the original authentic image, which can expose tampering operations by showing deviations from the fixed point image.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

[1]

Tamper-evident Image using JPEG Fixed Points

INTRODUCTION Since becoming an IEEE standard in 1992, the Joint Pho- tographic Experts Group (JPEG) format [1] has become the dominant image format due to its efficient compression and broad compatibility. JPEG employs a compression method that significantly reduces file size while maintaining visual quality. This is achieved by converting the image into ...

work page Pith review arXiv 1992
[2]

Overview of JPEG The JPEG compression process The JPEG compression pro- cess described in [1] consists of the following steps, as illus- trated in Fig

FIXED POINTS FOR THE JPEG TRANSFORM 2.1. Overview of JPEG The JPEG compression process The JPEG compression pro- cess described in [1] consists of the following steps, as illus- trated in Fig. 2: • (C1) Convert the RGB image to a YUV image using RGB-YUV transform [6]. • (C2) Down-sample the chromatic channels ( i.e., U and V channels) by a factor of two. ...

work page
[3]

Digital images have been subject to edits since their inception, ranging from harmless enhancements to deliberate manipulations with malicious intent

TAMPER-EVIDENT JPEG IMAGES Digital images comprise more than 90% of the information we consume online. Digital images have been subject to edits since their inception, ranging from harmless enhancements to deliberate manipulations with malicious intent. It is vital to develop methods to verify the integrity of images to ensure our trust in them. There are...

work page
[4]

RELATED WORKS Tamper-evident images were first investigated in [4], where the authors proposed using the fixed points of a Gaussian convolution and deconvolution to create tamper-evident im- ages. However, the theoretical justification for the existence of a fixed point is probabilistic, and for the approach to be practical, the size of the Gaussian convo...

work page
[5]

Using a rigorous mathematical formulation, we prove the existence and convergence of JPEG fixed points

CONCLUSION In this work, we re-examine a long-standing and intriguing property of JPEG: the existence of fixed points that can be reached after repeatedly applying JPEG transforms. Using a rigorous mathematical formulation, we prove the existence and convergence of JPEG fixed points. Furthermore, we de- scribe a method for creating tamper-evident JPEG ima...

work page
[6]

The jpeg still picture compression stan- dard,

Gregory K. Wallace, “The jpeg still picture compression stan- dard,” in IEEE Transactions on Consumer Electronics. 1992, vol. 38, pp. 18–34, IEEE

work page 1992
[7]

Jpeg usage statistics and trends,

JPEG Committee, “Jpeg usage statistics and trends,” Interna- tional Journal of Image Processing , vol. 12, no. 4, pp. 245– 256, 2020

work page 2020
[8]

Detecting double jpeg compression with the same quantization matrix,

Fangjun Huang, Jiwu Huang, and Yun Qing Shi, “Detecting double jpeg compression with the same quantization matrix,” IEEE Transactions on Information Forensics and Security, vol. 5, no. 4, pp. 848–856, 2010

work page 2010

Show all 16 references

[9]

Image integrity authentication scheme based on fixed point theory,

Xu Li, Xingming Sun, and Quansheng Liu, “Image integrity authentication scheme based on fixed point theory,” IEEE transactions on image processing, vol. 24, no. 2, pp. 632–645, 2014

2014
[10]

C2PA Technical Specification,

Coalition for Content Provenance and Authenticity (C2PA), “C2PA Technical Specification,” https: //c2pa.org/specifications/specifications/ 2.1/specs/C2PA_Specification.html, 2023, [Accessed: 2025-01-09]

2023
[11]

Charles Poynton, Digital Video and HD: Algorithms and In- terfaces, Elsevier, 2012

2012
[12]

Statistical tools for digital forensics,

Alin C. Popescu and Hany Farid, “Statistical tools for digital forensics,” in International Workshop on Information Hiding (IH). 2004, pp. 128–147, Springer

2004
[13]

Block-level double jpeg compression detection for image forgery localiza- tion,

Vinay Verma, Deepak Singh, and Nitin Khanna, “Block-level double jpeg compression detection for image forgery localiza- tion,” Multimedia Tools and Applications, vol. 83, no. 4, pp. 9949–9971, 2024

2024
[14]

De- tection of double jpeg compression with the same quantiza- tion matrix via convergence analysis,

Yakun Niu, Xiaolong Li, Yao Zhao, and Rongrong Ni, “De- tection of double jpeg compression with the same quantiza- tion matrix via convergence analysis,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 32, no. 5, pp. 3279–3290, 2021

2021
[15]

Double jpeg detection in mixed jpeg quality fac- tors using deep convolutional neural network,

Jinseok Park, Donghyeon Cho, Wonhyuk Ahn, and Heung- Kyu Lee, “Double jpeg detection in mixed jpeg quality fac- tors using deep convolutional neural network,” in Proceedings of the European conference on computer vision (ECCV), 2018, pp. 636–652

2018
[16]

A machine learning based scheme for double jpeg compression detection,

Chunhua Chen, Yun Q Shi, and Wei Su, “A machine learning based scheme for double jpeg compression detection,” in 2008 19th international conference on pattern recognition . IEEE, 2008, pp. 1–4

2008

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.

[1] [1]

Tamper-evident Image using JPEG Fixed Points

INTRODUCTION Since becoming an IEEE standard in 1992, the Joint Pho- tographic Experts Group (JPEG) format [1] has become the dominant image format due to its efficient compression and broad compatibility. JPEG employs a compression method that significantly reduces file size while maintaining visual quality. This is achieved by converting the image into ...

work page Pith review arXiv 1992

[2] [2]

Overview of JPEG The JPEG compression process The JPEG compression pro- cess described in [1] consists of the following steps, as illus- trated in Fig

FIXED POINTS FOR THE JPEG TRANSFORM 2.1. Overview of JPEG The JPEG compression process The JPEG compression pro- cess described in [1] consists of the following steps, as illus- trated in Fig. 2: • (C1) Convert the RGB image to a YUV image using RGB-YUV transform [6]. • (C2) Down-sample the chromatic channels ( i.e., U and V channels) by a factor of two. ...

work page

[3] [3]

Digital images have been subject to edits since their inception, ranging from harmless enhancements to deliberate manipulations with malicious intent

TAMPER-EVIDENT JPEG IMAGES Digital images comprise more than 90% of the information we consume online. Digital images have been subject to edits since their inception, ranging from harmless enhancements to deliberate manipulations with malicious intent. It is vital to develop methods to verify the integrity of images to ensure our trust in them. There are...

work page

[4] [4]

RELATED WORKS Tamper-evident images were first investigated in [4], where the authors proposed using the fixed points of a Gaussian convolution and deconvolution to create tamper-evident im- ages. However, the theoretical justification for the existence of a fixed point is probabilistic, and for the approach to be practical, the size of the Gaussian convo...

work page

[5] [5]

Using a rigorous mathematical formulation, we prove the existence and convergence of JPEG fixed points

CONCLUSION In this work, we re-examine a long-standing and intriguing property of JPEG: the existence of fixed points that can be reached after repeatedly applying JPEG transforms. Using a rigorous mathematical formulation, we prove the existence and convergence of JPEG fixed points. Furthermore, we de- scribe a method for creating tamper-evident JPEG ima...

work page

[6] [6]

The jpeg still picture compression stan- dard,

Gregory K. Wallace, “The jpeg still picture compression stan- dard,” in IEEE Transactions on Consumer Electronics. 1992, vol. 38, pp. 18–34, IEEE

work page 1992

[7] [7]

Jpeg usage statistics and trends,

JPEG Committee, “Jpeg usage statistics and trends,” Interna- tional Journal of Image Processing , vol. 12, no. 4, pp. 245– 256, 2020

work page 2020

[8] [8]

Detecting double jpeg compression with the same quantization matrix,

Fangjun Huang, Jiwu Huang, and Yun Qing Shi, “Detecting double jpeg compression with the same quantization matrix,” IEEE Transactions on Information Forensics and Security, vol. 5, no. 4, pp. 848–856, 2010

work page 2010