By Topic

Thresholding implemented in the frequency domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zhenghong Lee ; Dept. of Biomed. Eng., Case Western Reserve Univ., Cleveland, OH, USA

Image processing procedures are usually carried out in the spatial domain where the images are acquired and presented/utilized. The linear nature of the Fourier transform allows only those operations that are linear to be mapped into the frequency domain. In contrast, nonlinear operations and manipulations cannot be realized directly in the frequency domain. One of these nonlinear operations is thresholding. When operating in the spatial domain to segment image contents into object and background, thresholding is simple and efficient. However, it has no obvious representation in the frequency domain and cannot be carried out there in a straightforward fashion. In this paper, a means to relax the rigid linear limitation of the Fourier transform was investigated. A novel approach was established to achieve spatial thresholding using only frequency domain operations. The spatial grayscale or scalar data set (two-dimensional (2-D) image or three-dimensional (3-D) volume) was expanded into a binary volume in hyperspace having one more dimension than the original data set. The extended dimension is the gray level of the original data. Manipulating only on that dimension produces the effect of thresholding

Published in:

Image Processing, IEEE Transactions on  (Volume:10 ,  Issue: 5 )