By Topic

Directional morphological filtering

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

2 Author(s)
Soille, P. ; EC Joint Research Centre, Space Applications Inst., Ispra, Italy ; Talbot, H.

We show that a translation invariant implementation of min/max filters along a line segment of slope in the form of an irreducible fraction dy/dx can be achieved at the cost of 2+k min/max comparisons per image pixel, where k=max(|dx|,|dy|). Therefore, for a given slope, the computation time is constant and independent of the length of the line segment. We then present the notion of periodic moving histogram algorithm. This allows for a similar performance to be achieved in the more general case of rank filters and rank-based morphological filters. Applications to the filtering of thin nets and computation of both granulometries and orientation fields are detailed. Finally, two extensions are developed. The first deals with the decomposition of discrete disks and arbitrarily oriented discrete rectangles, while the second concerns min/max filters along gray tone periodic line segments

Published in:

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