By Topic

Comments, with reply, on "Fast convolution with Laplacian-of-Gaussian masks" by J.S. Chen et al

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

5 Author(s)
G. E. Sotak ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; K. L. Boyer ; J. S. Chen ; A. Huertas
more authors

In a recent paper by J.S. Chen et al. (ibid., vol.PAMI-9, p.584-90, July 1987) the authors presented a means of decomposing the Laplacian-of-Gaussian (LoG) kernel into the product of a Gaussian and a (smaller) LoG mask. They then proceeded to develop a fast algorithm for convolution which exploits the spatial frequency properties of these operators to allow the image to be decimated (subsampled). Although this approach is both novel and interesting, it is contended that the exposition suffers from some inconsistencies and minor errors. The commenters clarify matters for those who wish to implement this technique. The original authors acknowledge two of the three points raised, and provide further clarification of the other one namely, the claim that the masks (Gaussian and LoG) are too small.<>

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:11 ,  Issue: 12 )