logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A computationally efficient algorithm for enhancing linear features in images

delete1996-12-01
delete3
PRE
AI
B
Brown, SF
W
William Moran
DOI：10.1016/0031-3203(95)00168-9delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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. Copyright (C) 1996 Pattern Recognition Society.
Keywords:
digital image processing
line detection
SAR images
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available