The heart of the new method is an exotic mathematical setting known as the Discrete Quaternionic Quadratic Phase Fourier Transform, abbreviated DQQPFT. To understand why the authors reached for such a formidable-sounding tool, it helps to consider how color images are usually handled. Most watermarking schemes treat the red, green, and blue channels of an image as three separate grayscale images, processing each one independently with a fixed transform kernel. That approach is computationally convenient, but it throws away something valuable: the natural correlation between the color channels. A color image is not simply three monochrome images stacked together; the channels are deeply intertwined, and any method that severs those ties loses information that could be used to make a watermark stronger and more secure.

Quaternions offer a way out. Invented by William Rowan Hamilton in 1843, quaternions extend complex numbers to a four-dimensional number system with one real part and three imaginary parts. That structure turns out to be a remarkably natural fit for color images: the three imaginary components can encode the three color channels simultaneously, while the real part can carry additional information. When a color image is represented as a matrix of quaternions, transforms built on quaternion algebra can operate on all three channels at once, preserving the inter-channel relationships that separable schemes discard. The DQQPFT goes a step further than earlier quaternion transforms by introducing a quadratic phase function with controllable parameters, giving the transform a flexible, non-rigid kernel that can be tuned rather than fixed.

That tunability is not just a mathematical curiosity — it is the security backbone of the scheme. The parameters that shape the DQQPFT kernel are incorporated directly into the system as cryptographic keys. An attacker who somehow extracts a suspicious signal from a watermarked image still cannot recover the hidden watermark without knowing the exact kernel parameters, and because those parameters are continuous values with high sensitivity, the space of possible keys is far too large to search by brute force. In effect, the transform itself becomes part of the lock: even someone with full knowledge of the embedding algorithm would face a key space that renders guessing computationally infeasible.

Of course, elegance in theory must survive the realities of computation. Quaternion arithmetic is inherently more expensive than real-number arithmetic, and naive implementations of quaternion transforms can impose a heavy computational burden. The authors sidestepped this obstacle with a clever algebraic trick: they implemented the DQQPFT through an equivalent real-matrix representation of quaternions. By mapping quaternion operations onto ordinary real matrices, the transform can be computed with standard, highly optimized numerical routines while remaining mathematically consistent with the original quaternion formulation. The result is a scheme that keeps the theoretical advantages of the quaternion domain without paying the full performance penalty that quaternion arithmetic would otherwise demand.

With the transform in place, the next challenge is deciding exactly how and where to embed the watermark. The team turned to Quaternion Singular Value Decomposition, or QSVD, a technique that breaks the transformed image into components whose stability under common image-processing operations makes them ideal hiding places. But within QSVD there is a fundamental tension that every watermarking designer must confront. Embed the watermark too strongly, and it will resist attacks — compression, noise, filtering, geometric distortions — but the host image will visibly degrade. Embed it too gently, and the image looks perfect while the watermark washes away at the first sign of trouble. Imperceptibility and robustness pull in opposite directions, and there is no single setting that maximizes both.

The researchers framed this tension as a formal bi-objective optimization problem and solved it with an Enhanced Multi-Objective Ant Colony Optimization algorithm, which they call E-MOACO. Ant colony optimization is a swarm intelligence technique modeled on the way real ants find efficient paths to food by laying and following pheromone trails: solutions that perform well reinforce the trails that led to them, gradually steering the colony toward the best regions of the search space. The enhanced version introduced by the team adds two key innovations. Dynamic weight scheduling continuously rebalances how much each objective — visual quality versus attack resistance — influences the search as it progresses, while adaptive Gaussian perturbation injects controlled randomness that helps the colony escape local optima where it might otherwise stagnate. A knee-point selection strategy then picks, from the family of balanced trade-off solutions the algorithm produces, the single solution that offers the best overall compromise between the competing goals.

The experimental results are striking. Across extensive tests on standard image databases, the watermarked images achieved an average peak signal-to-noise ratio, or PSNR, exceeding 39 decibels without any attacks applied — a level of fidelity at which the embedded mark is genuinely invisible to human observers. More importantly, the watermark remained reliably detectable under duress. The average normalized correlation, a measure of how faithfully the extracted watermark matches the original, stayed above 0.99 under common single attacks such as noise addition, filtering, and compression. Even under mixed attacks, where multiple distortions are combined, the correlation remained above 0.90, indicating that the watermark survives the kind of compound abuse that real-world images frequently endure.

Those numbers matter because they address the central weakness of many existing watermarking schemes. Fixed-kernel transforms offer an attacker a predictable target, and separable channel-by-channel processing leaves color correlations unexploited. By combining a parameterized quaternion transform with adaptive, optimization-driven embedding, the new method raises the bar on both fronts simultaneously: the key-dependent kernel complicates unauthorized extraction, while the bi-objective optimization ensures the embedding strength is tailored to each image rather than dictated by a one-size-fits-all rule. The work also reflects a broader trend in the field, as researchers increasingly deploy evolutionary and swarm-based optimizers — genetic algorithms, particle swarms, and now enhanced ant colonies — to navigate the trade-offs that classical watermarking designs handled with hand-tuned heuristics.

The implications extend well beyond academic curiosity. As generative artificial intelligence floods the internet with synthetic imagery and copyright disputes grow more contentious, techniques that can embed verifiable, attack-resistant ownership marks into color images are becoming critical infrastructure for the digital economy. The Fujian Normal University team’s framework, supported by the Natural Science Foundation of Fujian Province, points toward watermarking systems that are simultaneously invisible, resilient, and cryptographically protected — a combination that could prove decisive for medical imaging, remote sensing, digital forensics, and content authentication alike. The research was published in Cluster Computing, volume 29, article 723, on 5 September 2026, with the DOI 10.1007/s10586-026-06491-1.

Subject of Research: Robust color image watermarking in the DQQPFT domain using enhanced multi-objective ant colony optimization

Article Title: A novel color image watermarking method in DQQPFT domain via enhanced multi-objective ant colony optimization

Article References: Tang, S., Xia, H., & Ke, Y. (2026). A novel color image watermarking method in DQQPFT domain via enhanced multi-objective ant colony optimization. Cluster Computing, 29(12), Article 723. https://doi.org/10.1007/s10586-026-06491-1

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06491-1

Keywords: color image watermarking, DQQPFT, quaternion transforms, QSVD, ant colony optimization, multi-objective optimization, digital watermarking, image security, swarm intelligence, PSNR, normalized correlation, cryptographic keys

The core problem the researchers tackle is a familiar one in multimedia security: fragile watermarking. In a fragile watermarking scheme, a small amount of auxiliary data is embedded into the pixels of an image before it is distributed. If someone later modifies the image, the embedded data no longer matches the modified content, and the mismatch reveals the tampering. The difficulty is that conventional schemes often localize tampering only approximately, and they frequently fail to recover the altered content, particularly when the attacker tampers with large regions or when the embedding strategy itself creates ambiguities about which blocks are authentic and which are not.

The new framework begins with tamper detection, and this is where perfect hashing enters the picture. Hash functions compress data into short index values that act like fingerprints; a cryptographic hash is designed so that two different inputs almost never produce the same output. In image authentication, however, the fingerprints must be embedded inside the image itself, which forces them to be very short, and short fingerprints are prone to collisions, situations in which two different image blocks produce identical authentication codes. A collision is dangerous because an attacker can swap the contents of two blocks that share the same code, and the tampering would go undetected. To close this loophole, the team introduces a rehashing-based perfect hashing mechanism built on Schur decomposition. In linear algebra, the Schur decomposition factors a matrix into a unitary transformation and an upper triangular matrix, and the researchers exploit this structure to generate collision-resistant indices for encoding authentication information. Under the random mapping conditions that arise during block-based embedding, the rehashing process ensures that each block receives a unique, verifiable index, dramatically improving the reliability of tamper localization.

Detecting tampering, however, is only half of the task. The second half is recovery, and for that the embedded watermark must carry enough information to reconstruct the original content of any region that comes under attack. Encoding a full image inside itself is impossible, so the team relies on compression. They use the Set Partitioning in Hierarchical Trees algorithm, or SPIHT, a well-established embedded wavelet coding technique that exploits the tree structure of wavelet coefficients to represent image content efficiently. SPIHT produces a compact, progressively refinable bitstream, which means the most visually important information about an image is encoded first and can be represented in very few bits. By embedding SPIHT-encoded recovery data alongside the authentication bits, the scheme ensures that every tampered block carries within its neighbors, or in blocks elsewhere in the image, a compact description of what the original content looked like.

The clever architectural move is that both the authentication data and the recovery data travel together inside a single watermark payload. The two streams are jointly embedded into the host image through an adaptive matrix-guided watermarking strategy. The matrix coding mechanism organizes the image into a structured array of blocks and determines, adaptively, where and how to place the payload so that the embedding capacity is maximized while the visual distortion of the watermarked image remains imperceptible. The word adaptive matters here: rather than applying a uniform embedding rule everywhere, the scheme balances the competing demands of payload size and image quality, deciding how many bits can be hidden in each region without degrading the picture in ways a human viewer or statistical analysis could detect.

When a suspicious image arrives at the verification stage, the process runs in reverse. The receiver recomputes the perfect-hashing indices for each block, compares them with the embedded authentication codes, and flags the blocks where the two disagree as tampered. Because the indices are collision-resistant, the localization is precise, and false alarms caused by index duplication are largely eliminated. The receiver then extracts the SPIHT-encoded recovery bitstream from the intact portions of the image and uses it to reconstruct the content of the flagged regions. The term successive recovery refers to the ability of the scheme to keep refining and restoring tampered areas even when the tampering is extensive, working progressively through the image rather than giving up once a critical fraction of blocks has been corrupted.

Extensive experiments reported in the paper demonstrate that the proposed scheme outperforms representative fragile watermarking-based image authentication methods on both localization accuracy and recovery quality, while maintaining satisfactory perceptual fidelity of the watermarked image. In practice, this means fewer tampered blocks escape detection, fewer authentic blocks are wrongly accused, and the reconstructed regions retain more of their original visual content than with competing approaches. The experiments were conducted on standard grayscale test images drawn from the publicly available USC-SIPI Image Database, providing a common benchmark that allows fair comparison with earlier schemes in the literature.

The significance of this work extends beyond an incremental improvement in watermarking metrics. Images now serve as evidence in courts, as inputs to artificial intelligence systems, as medical records, and as news documents consumed by billions of people. As generative tools make manipulation easier and harder to spot by eye, self-authenticating images that can diagnose and repair their own damage offer a form of defense that does not depend on external databases, trusted third parties, or the availability of the original file. The image carries its own certificate of integrity and its own repair kit, and both travel with it wherever it goes.

The research was carried out by Xuejing Li, Jingmin Pan, Tingting Wang, and Fei Cheng of the Anhui Institute of Information Technology in Wuhu, China, with Fei Cheng also affiliated with Hangzhou Dianzi University and Qimin Zhou of Anhui University contributing to experimental verification. Cheng serves as the corresponding author. The work was supported by the Planned Self-financed Project of Wuhu, the Key Project of Higher Education Research of the Anhui Provincial Department of Education, the Anhui Provincial Department of Education College Talent Project, and the Software and System Engineering Research Center of Smart Car at AIIT. The article was received in May 2026, revised in July, accepted in August, and published on 11 September 2026 in volume 85 of Multimedia Tools and Applications as article number 752. As digital forensics races to keep pace with increasingly sophisticated manipulation tools, schemes like this one, which fuse ideas from data structures, matrix analysis, and wavelet compression into a single self-protecting image format, point toward a future in which the question is no longer simply whether a photograph can be trusted, but whether it can heal itself when that trust is broken.

Subject of Research: Image authentication framework using perfect hashing and matrix coding for tamper detection and successive self-recovery of digital images

Article Title: Successive recovery of tampered regions based on perfect hashing and matrix coding mechanism

Article References: Li, X., Pan, J., Wang, T., Cheng, F., & Zhou, Q. (2026). Successive recovery of tampered regions based on perfect hashing and matrix coding mechanism. Multimedia Tools and Applications, 85(9), Article 752. https://doi.org/10.1007/s11042-026-21881-8

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21881-8

Keywords: image authentication, digital watermarking, tamper detection, image self-recovery, perfect hashing, SPIHT, fragile watermarking, matrix coding, Schur decomposition, multimedia security, image forensics, data hiding