Histogram equalisation (HE) is a simple and effective image enhancement technique. However, it suffers from excessive brightness change and provides degradation in the visual aspect of the image. To overcome the short...
详细信息
Histogram equalisation (HE) is a simple and effective image enhancement technique. However, it suffers from excessive brightness change and provides degradation in the visual aspect of the image. To overcome the shortcomings in the HE, a novel histogram framework is proposed in this study. The image histogram is first segmented into two parts using the Otsu's thresholding method. Then, both of the upper and lower histograms are constrained to control the level of enhancement. These constraint parameters are computed through moth-flame optimisation algorithm. After constraining the histograms, mean shift correction is performed to ensure there is a minimum level of mean shifting from input to output image. Traditional HE is then applied with a modified histogram to obtain mapping function for lower and upper grey level individually. This enhanced image provides a balance between the level of enhancement and preservation of the important features of the image for high-level processing. The effectiveness of the proposed method is highlighted with a detailed comparison with other closely related schemes. Through the proposed routine, the enhanced images achieve a good trade-off between features enhancement, low contrast boosting, and brightness preservation in addition to the natural feel of the original image.
This work investigates the use of the moth-flameoptimisation (MFO) algorithm in solving the Permutation Flow Shop Scheduling Problem and proposes further optimisations. MFO is a population-based approach that simulat...
详细信息
This work investigates the use of the moth-flameoptimisation (MFO) algorithm in solving the Permutation Flow Shop Scheduling Problem and proposes further optimisations. MFO is a population-based approach that simulates the behaviour of real moths by exploiting the search space randomly without employing any local searches that may stick in local optima. Therefore, we propose a Hybrid mothoptimisationalgorithm (HMOA) that is embedded within a local search to better exploit the search space. HMOA entails employing three search procedures to intensify and diversify the search space in order to prevent the algorithm's becoming trapped in local optima. Furthermore, HMOA adaptively selects the search procedure based on improvement ranks. In order to evaluate the performances of MFO and HMOA, we perform a comparison against other approaches drawn from the literature. Experimental results demonstrate that HMOA is able to produce better-quality solutions and outperforms many other approaches on the Taillard benchmark.
暂无评论