People | Locations | Statistics |
---|---|---|
Naji, M. |
| |
Motta, Antonella |
| |
Aletan, Dirar |
| |
Mohamed, Tarek |
| |
Ertürk, Emre |
| |
Taccardi, Nicola |
| |
Kononenko, Denys |
| |
Petrov, R. H. | Madrid |
|
Alshaaer, Mazen | Brussels |
|
Bih, L. |
| |
Casati, R. |
| |
Muller, Hermance |
| |
Kočí, Jan | Prague |
|
Šuljagić, Marija |
| |
Kalteremidou, Kalliopi-Artemi | Brussels |
|
Azam, Siraj |
| |
Ospanova, Alyiya |
| |
Blanpain, Bart |
| |
Ali, M. A. |
| |
Popa, V. |
| |
Rančić, M. |
| |
Ollier, Nadège |
| |
Azevedo, Nuno Monteiro |
| |
Landes, Michael |
| |
Rignanese, Gian-Marco |
|
Murray, Paul
in Cooperation with on an Cooperation-Score of 37%
Topics
Publications (11/11 displayed)
- 2024CNN-based automated approach to crack-feature detection in steam cycle componentscitations
- 2023Deep learning enhanced Watershed for microstructural analysis using a boundary class semantic segmentationcitations
- 2023Passive gamma-ray analysis of UO2 fuel rods using SrI2(Eu) scintillators in multi-detector arrangements
- 2022X-ray classification of Special Nuclear Materials using image segmentation and feature descriptors
- 2020Design of 2D sparse array transducers for anomaly detection in medical phantomscitations
- 2017Automated microstructural analysis of titanium alloys using digital image processingcitations
- 2016Use of hyperspectral imaging for artwork authentication
- 2015Automated image stitching for fuel channel inspection of AGR cores
- 2013Automated image stitching for enhanced visual inspections of nuclear power stations
- 2012A review of recent advances in the hit-or-miss transformcitations
- 2011A fast method for computing the output of rank order filters within arbitrarily shaped windows
Places of action
Organizations | Location | People |
---|
document
A fast method for computing the output of rank order filters within arbitrarily shaped windows
Abstract
Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1].For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature.