A computationally efficient algorithm for enhancing linear features in images

摘要

We present a computationally efficient algorithm for highlighting long linear features in images. The algorithm is based on the recursive binary decomposition of the image into subimages that have been line enhanced along different directions. After a number of successive decompositions, the subimages are recombined to yield a line enhanced image. The performance of the algorithm is similar to that of rotating-kernel-type enhancement routines. However, the new algorithm can be executed much faster, making it ideal for use on large noisy images such as those provided by synthetic aperature radar.