| 摘要 |
PROBLEM TO BE SOLVED: To exactly detect a color pixel with a little memory capacity without being affected by the deviation of a read position or pattern erroneously decided as color pixel. SOLUTION: The number of '1' in the respective data of (c), (m) and (y) in the matrix of M×N pixels is counted for each of planes of (c), (m) and (y) by a count part 333-1. In the case of no coincidence in matching with the pattern erroneously decided as color pixel in the matrix of M×N pixels for each of planes of (c), (m) and (y), a pattern matching part 332 decides a concerned pixel in the matrix as second color pixel candidate and when a difference between the maximum and minimum values of respective count values of (c), (m) and (y) is larger than a threshold and the minimum value is less than a threshold, a color pixel deciding part 333-1 decides a concerned pixel in that matrix as first color pixel candidate and decides the concerned pixels, which are decided as first and second color pixel candidates, as color pixel.
|
