Fast and Computationally Efficient Boundary Detection Technique for Medical Images

ORAL

Abstract

Detection of edge is a fundamental procedure of image processing. Many edge detection algorithms have been developed based on computation of the intensity gradient. In medical images, boundaries of the objects are vague for gradual change of intensities. Therefore need exists to develop a computationally efficient and accurate edge detection approach. We have presented such algorithm using modified global threshold technique. In our work, the boundaries are highlighted from the background by selecting a threshold (\textbf{T}) that separates object and background. In the image, where object to background or vice-verse transition occurs, pixel intensity either rises greater or equal to \textbf{T} (background to object transition) or falls less than \textbf{T} (object to background). We have marked these transition regions as object boundary and enhanced the corresponding intensity. The value of \textbf{T} may be specified heuristically or by following specific algorithm. Conventional global threshold algorithm computes the value of \textbf{T} automatically. But this approach is not computationally efficient and required a large memory. In this study, we have proposed a parameter for which computation of \textbf{T} is very easy and fast. We have also proved that a fixed size memory [256$\times $4Byte] is enough to compute this algorithm.

Authors

  • Arpita Das

    Calcutta University, India

  • Partha Goswami

    Calcutta University, India

  • Susanta Sen

    Calcutta University, India