Parallel lowering of digital pictures by topology preserving operations

Lowering operations play a key role when skeletonizing a gray-tone picture. We define ridge points in a 3/spl times/3 neighborhood, and discuss the computational advantage obtained when lowering is accomplished by parallel operations based on a non-ridge point condition rather than on a simple point condition. Two parallel algorithms are given, respectively characterized by four subiterations and two subiterations.