In order to improve the computation efficiency of image parallel thinning algorithms implemented on serial computers

this paper proposes a coding scheme for each 44 binary pixels

representing the 44 pixels with a double-byte integer

based on which an effective parallel thinning algorithm for serial computers is presented that transforms the 16-pixel based thinning processing into reading

writing and comparison operations of a double-byte integer. By use of this algorithm

the 16 pixels can be processed simultaneously in the thinning operations with serial computers. Computation complexity analysis of the new algorithm is made in the paper that shows about 70% saving in computations compared with the existing parallel template thinning algorithms (e.g.

the OPTA algorithm). The algorithm is suitable for all kinds of parallel template thinning algorithms operated on commonly used personal computers

and can significantly improve the computation efficiency of the algorithm with the same thinning results. The potential advantage of the algorithm is also discussed in the paper for using the MMX (or SSE) technology integrated in PCs to further increase the parallel granularity and speed up the thinning processing.