An Improved Parallel Thinning Algorithm

One recent parallel thinning algorithm is analyzed on detail in this paper.The analytical emphasis is put on its pixel deletion conditions.It is shown that owing to the inherent faults in these conditions,not only all four elements of an isolated 2x2 square are removed but also there exist "worm eaten" response and "thin hair" phenomina in its result skeleton.Subsequently,an improved one is proposed which is also strictly 8 connected.Experiments indicate that the modification effectively overcomes the original's shortages and has a little better time efficiency.