Speeding up the K\"ohler's method of contrast thresholding
Abstract
K{\"o}hler's method is a useful multi-thresholding technique based on boundary contrast. However, the direct algorithm has a too high complexity-O(N 2) i.e. quadratic with the pixel numbers N-to process images at a sufficient speed for practical applications. In this paper, a new algorithm to speed up K{\"o}hler's method is introduced with a complexity in O(N M), M is the number of grey levels. The proposed algorithm is designed for parallelisation and vector processing , which are available in current processors, using OpenMP (Open Multi-Processing) and SIMD instructions (Single Instruction on Multiple Data). A fast implementation allows a gain factor of 405 in an image of 18 million pixels and a video processing in real time (gain factor of 96).
Keywords
Cite
@article{arxiv.1707.05062,
title = {Speeding up the K\"ohler's method of contrast thresholding},
author = {Guillaume Noyel},
journal= {arXiv preprint arXiv:1707.05062},
year = {2019}
}
Comments
IEEE CopyrightProceedings of the IEEE International Conference on Image Processing ICIP 2017