Adaptive Watermarking via LU Decomposition and Variance-Based Block Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional color image watermarking methods distort the watermarked image significantly due to uneven embedding of watermark information across different spatial frequencies, and they lack robustness, invisibility, and efficient computational complexity.
Innovation Solution
The method employs adaptive rectangular partitioning and Lower Upper (LU) decomposition to divide a host image into Red, Green, and Blue components, selecting specific blocks for watermark embedding, which reduces computational complexity and enhances robustness and imperceptibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If watermark information is embedded uniformly across all blocks, then the embedding process is simple, but the watermarked image suffers from significant distortion and poor imperceptibility
Solution Approach 1:
The patent applies local quality by dividing the image into different regions (smooth, edge, detailed) and selecting embedding blocks based on local characteristics. Smooth regions with low variance are chosen for watermark embedding, while edge and detailed regions are avoided. This ensures that watermarking is performed only in areas where it will be imperceptible, thereby improving image quality while maintaining embedding simplicity.
2Reliability
If watermark is embedded in all image blocks, then the robustness is improved, but the computational complexity increases significantly
Solution Approach 1:
The patent segments the image into multiple regions and calculates a variance metric for each region. By segmenting the embedding process into selective blocks rather than processing the entire image uniformly, the method achieves robustness through distributed embedding while reducing computational complexity by excluding regions unsuitable for embedding (edges, detailed areas).
Solution Approach 2:
The patent applies partial action by embedding watermark information in only a subset of image blocks rather than all blocks. Specifically, it selects blocks with low variance (smooth regions) for embedding, performing the embedding action partially rather than universally. This reduces computational complexity while maintaining robustness through strategic distribution across multiple selected blocks.
3Ease of operation
If conventional watermarking methods are used, then the implementation is straightforward, but the watermarked image shows significant distortion and lacks robustness
Solution Approach 1:
The patent changes the parameter selection criterion from uniform embedding to variance-based selective embedding. By introducing variance as a selection parameter and thresholding it, the method achieves both robustness (through distributed embedding) and imperceptibility (through selective embedding in smooth regions only). The implementation remains relatively simple by using basic variance calculation and threshold comparison.
Data Source
AI summary
A method embeds a watermark image into a host image with adaptive rectangular partition and Lower Upper (LU) decomposition such that a watermarked image is generated with improved computational complexity. The method divides a host image into an Red (R) component, a Green (G) component, and a Blue (B) component, and divides each component of the R, G, and B components into a plurality of M×M size blocks, and partitions each of the plurality of M×M size blocks into a plurality of non-overlapping blocks with adaptive rectangular partition. The method selects a plurality of embedding blocks from the plurality of M×M size blocks for each component of the R, G, and B components of the host image to embed watermark information such that the watermarked image is generated.