Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/rohitrango/automatic-watermark-detection

Project for Digital Image Processing
https://github.com/rohitrango/automatic-watermark-detection

image-matting image-processing irls numpy poisson-reconstruction python scipy-stack watermark watermark-detection

Last synced: 2 days ago
JSON representation

Project for Digital Image Processing

Host: GitHub
URL: https://github.com/rohitrango/automatic-watermark-detection
Owner: rohitrango
Created: 2017-09-19T16:43:49.000Z (over 7 years ago)
Default Branch: master
Last Pushed: 2022-05-22T16:03:19.000Z (over 2 years ago)
Last Synced: 2025-01-12T20:03:13.702Z (9 days ago)
Topics: image-matting, image-processing, irls, numpy, poisson-reconstruction, python, scipy-stack, watermark, watermark-detection
Language: Jupyter Notebook
Size: 37.6 MB
Stars: 1,198
Watchers: 56
Forks: 399
Open Issues: 6
Metadata Files:
- Readme: README.md

Awesome Lists containing this project

README

## Automatic watermark detection and removal
This was a project that was built as part of project for CS663 (Digital Image Processing).
This is a crude Python implementation of the paper "On The Effectiveness Of Visible Watermarks", Tali Dekel, Michael Rubinstein, Ce Liu and William T. Freeman,
Conference on Computer Vision and Pattern Recongnition (CVPR), 2017.

### Rough sketch of the algorithm
A watermarked image `J` is obtained by imposing a watermark `W` over an unwatermarked image `I` with a blend factor $\alpha$ . Specifically, we have the following equation:

$J(p) = \alpha(p)W(p) + (1-\alpha(p))I(p)$

Where `p = (x, y)` is the pixel location. For a set of `K` images, we have:

$J_k = \alpha W + (1-\alpha)I_k,\quad k=1,2....K$

Although we have a lot of unknown quantities ( $J_k, W, \alpha$ ), we can make use of the structural properties of the image to determine its location and estimate its structure. The coherency of $\alpha$ and W over all the images can be exploited to solve the above problem with good accuracy. The steps followed to determine these values are:
- Initial watermark estimation and detection
- Estimating the matted watermark
- Compute the median of the watermarked image gradients, independently in the `x` and `y` directions, at every pixel location `p`.

$\nabla{\hat{W_m}(p)} = median_k(\nabla{J_k(p)})$

- Crop `W_m` to remove boundary regions by computing its magnitude and taking the bounding box of the edge map. The initial estimated watermark $\hat{W}_m \approx W_m$ is estimated using Poisson reconstruction. Here is an estimated watermark using a dataset of 450+ Fotolia images.
watermark_est

- Watermark detection: Obtain a verbose edge map (using Canny edge detector) and compute
its Euclidean distance transform, which is then correlated with $\nabla{\hat{W_m}}$
to get the Chamfer distance from each pixel to the closest edge.
Lastly, the watermark position is taken to be the pixel with minimum
distance in the map.

#### Multi-image matting and reconstruction
- Estimate $I_k, W_k$ keeping $W, \alpha$ fixed.
- Watermark update - Update the value of $W$ keeping the rest fixed.
- Matte update - Update the value of $\alpha$ keeping the rest fixed.

Please refer to the paper and supplementary for a more in-depth description and derivation of the algorithm.

Results
--------
Here are some of the results for watermarked and watermark removed images:

However, this is a rough implementation and the removal of watermark leaves some "traces" in form of texture distortion or artifacts. I believe this can be corrected by appropriate parameter tuning.

More information
-------
For more information, refer to the original paper [here](http://openaccess.thecvf.com/content_cvpr_2017/papers/Dekel_On_the_Effectiveness_CVPR_2017_paper.pdf)

Disclaimer
--------
I do not encourage or endorse piracy by making this project public. The code is free for academic/research purpose. Please feel free to send pull requests for bug fixes/optimizations, etc.