By Topic

Edge enhancement with image algebra

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
$33 $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)
K. Hedengren ; General Electric Corp. Res. & Dev., Schenectady, NY, USA

Illustrates an implementation method for edge enhancement algorithms, or other processes based on convolutions, through the application of image algebra. Standard convolution kernels are decomposed into orthogonal components to identify a small set of basis images that are combined to perform the desired functions. With this method, algorithms can easily be modified as they are not limited by the summation of fixed constants in convolution kernels. Though results are shown on a pixel basis, there is no effort in this paper to evaluate the relative performances of various algorithms. However, the image algebra approach naturally illuminates the fundamental properties of different algorithms. The approach is effective for software implementation as algorithms typically execute faster than implementations based on conventional convolutions

Published in:

Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,

Date of Conference:

30 Aug-3 Sep 1992