The core idea behind Reversible Hidden Transform is to propose a simple integer transform that transforms an integer pair to another integer pair at a considerably lower mathematical complexity based on some secret parameters. The hidden transform starts by partitioning the image into pairs of pixels. Let [0, L] be the image gray level range (L = 255 for 8-bit gray level images).Let x = (x1, x2) be a pair of pixels and α, β be two fixed numbers.Consider y = (y1, y2) is the transformed pair of pixels, and the values are given byy1 =αx1 + βx2y2 =βx1 + αx2since both x1 and x2 lie between [0, L], there may be a situation of underflow (y1 < 0 or y2 < 0 or both) or overflow (y1 > 0 or y2 > 0 or both). In order to avoid underflow and overflow of the transformed pixels, the following conditions should be satisfied:0 ≤ y1 ≤ L; 0≤ y2 ≤ L.This is possible only when α and β satisfy the relationα + β = 1 and 0 ≤ α, β ≤ 1.After posing these constraints, the transform becomes more simple because the secret parameter reduces to one, i.e., either α or β.
homeworkimage processingno attemptreversible hidden transform
- I am not sure how i can get histogram both the fig which i looked in are the same.. Anybody help me in completing the code.
- Who know how to do this interpolation problem
- How to find the co-ordinates in an image
- How to show 8 bits of an image like this photo
- Obtaining average RGB value of an image with selected area