PPT Slide
The Color Set Iteration Procedure
- Single Color - Color sets
Given the image histogram H[m] such that H[m] > r1.
For each m construct unit length c where c[k] = 1 for
k = m and c[k] = 0 otherwise.
Back project each c onto image R[m,n] and extract
For each region compute the local histogram L.
Compute residue histogram H[m] = H[m] - ? L.
This algorithm can also be applied to two color and three color - color sets.