3 ms·
Had a lot of fun implementing the Huang histogram approach and the constant time approach by hand in a prior role. Never saw the binary tree approach. And this
by foooorsyth 2y ago
Had a lot of fun implementing the Huang histogram approach and the constant time approach by hand in a prior role.
Never saw the binary tree approach. And this article, being written in summer of 22, missed out on the 2D wavelet approach published later on that year.
https://cgenglab.github.io/en/publication/sigga22_wmatrix_median/#:~:text=The%20median%20filter%20is%20typically,has%20a%20light%20constant%20factor https://cgenglab.github.io/en/publication/sigga22_wmatrix_me....
- tomrod 2y agoI'm interested to learn more about these algorithms. Are there any sources you'd recommend?
- teruakohatu 2y agoNot the OP but have a look at the scikit-images and other scikit packages. Lots of different algorithms implemented. Also of course the OpenCV library.
- foooorsyth 2y agoI honestly recommend just writing them by hand in a simple language (C or Python), without relying on third party dependencies (just load an uncompressed grayscale image to use as your input). OpenCV implementations of this stuff will be complex with lots of architecture specific optimizations. They will also have tons of branches for different image formats — you can keep things very simple by just using single channel uncompressed grayscale. The Huang histogram and Perrault/Hebert constant time papers are very approachable. They have pseudocode and visualizations. They’re not that tricky. You can sit down in a day and implement them without much headache.