halo minimization by local min/max smooth clamping
Posted: 2011-04-03T08:56:34-07:00
Sharpening (using most methods, including USM) and resampling with filters that have negative lobes produces halos.
I am wondering if the following would work well to minimize halos when using such operations.
I'll use image enlargement as an example.
Take your original image.
From this image, compute two versions of the original: One has, at every pixel, the min (over each channel) of the nearest nine pixels.
The other is similar except that we take the max.
Now, resize the original with whatever filter you want, negative lobes and all, and also resize the the "min" and "max" pseudo-images with an INTERPOLATORY MONOTONE method (Hermite or bilinear (triangle), say; I wish I had programmed Locally Bounded Bicubic for IM, but I haven't).
One colour channel at a time, clamp the pixel value of the enlarged image by the min/max values at the same location (possibly with some "fudge factor").
-----
Have you ever heard of such an approach? Comments/ideas? (I'm guessing this is trivial to program in IM.)
I am wondering if the following would work well to minimize halos when using such operations.
I'll use image enlargement as an example.
Take your original image.
From this image, compute two versions of the original: One has, at every pixel, the min (over each channel) of the nearest nine pixels.
The other is similar except that we take the max.
Now, resize the original with whatever filter you want, negative lobes and all, and also resize the the "min" and "max" pseudo-images with an INTERPOLATORY MONOTONE method (Hermite or bilinear (triangle), say; I wish I had programmed Locally Bounded Bicubic for IM, but I haven't).
One colour channel at a time, clamp the pixel value of the enlarged image by the min/max values at the same location (possibly with some "fudge factor").
-----
Have you ever heard of such an approach? Comments/ideas? (I'm guessing this is trivial to program in IM.)