A maximum algorithm for thinning digital patterns

Abstract

An approach to thinning is presented that deletes pixels without using iterative transformations. It consists of four steps: computing an addition matrix, which assigns maximal values to the pixels on the medial axis; computing a comparative matrix; deleting the nonmaximum pixels; and deleting the endpoints. Experimental results show that this algorithm makes the skeleton closer to the medial axis and makes it more convenient to reconstruct the original pattern.<>