Knoll Unmult After Effects Cs6 29

Knoll Unmult After Effects Cs6 29


Knoll Unmult After Effects Cs6 29

at this time the channels have not been compressed to 16bpc. therefore, the visual results are not identical to unmult.
in effect, unmult is like a sculpting tool that picks off foreground color from a transparent background. the result is a clean, mathematically accurate, uncompressed matte.

if you are not happy with an 8bpc matte, switch to the 16bpc version of the remove color matting filter. this will multiply the image channels to 16bpc. in other words, the image channels will be combined in the same way as background color.

if you want to create a matte that is identical to the unmult approach, then you need to apply the 32bpc remove color matting filter. in effect, the 8bpc matte is removed and the resulting 16bpc matting is multiplied over the image.

if you can only have one in your arsenal, pixel bender is the best solution available for the cs6 era. unlike the cs3/cs5 photoshop software, photoshop cs6 has no hardware support for pixel benders. (and there was no 12.1 plug-in, either)

the current version of (a) is too slow for practical use. (b) is just fine. (c) is only for generating the alpha with an effect. (d) is very easy to implement in a script. (e) is a little faster and saves time and speed up steps. (f) works if you can live with the fringe/white artifacts. (g) is a better solution. (h) is a little slow but very powerful. (i) is slow but has the best solution.

the pixel shakes in fringe remover (and ‘fringe multiply‘) are based on the algorithms in pb. (they are also used in cs5’s buffer remover.) the buffer algorithm moves the pixels outside the channel mask into an adjacent channel with no weight applied to pixels that won’t pass the threshold to control the movement. (several of the fringe removal algorithms change the channel mask to have a channel that’s all 0s and only the fringe pixels remain. pb tracks a number of fringe thresholds and then tries to find a move that just barely passes the threshold. if you have lots of fringe, that fringe may never pass the threshold, and pb’s move is the longest distance it can find from the original position to be on the fringe.) the channel finder uses a minc mx, then forwards the minc to an arithm mx, then a boolean xor, which calculates a new mx that compares the old (and old image information) to the new. and if you want to save some time to find the best move, pb can move forward, backward, diagonally, or nonlinearly. (no matter how many times you change protect channel — the buffered output channel is still affected.)



Leave a Reply

Your email address will not be published.