3,918 research outputs found

    Extraction and characterisation of pectin from dragon fruit (hylocereus polyrhizus) peels

    Get PDF
    Pectins are complex carbohydrate molecules that are used in numerous food applications as a gelling agent, thickener, stabiliser, and emulsifier. Dragon fruit (Hylocereus polyrhizus) is one of the tropical fruits that belong to the cactus family, Cactaceae. Since the peels of dragon fruit are often discarded as waste, it would be an advantage to convert it into a value-added product such as pectin. The objective of this study was to investigate the extraction of pectin from dragon fruit peels under different extraction time using hot water extraction method. The dragon fruit peels were extracted using distilled water at 80 °C with different extraction time of 20, 40, 60 and 80 min. The extracted pectin was characterised by its yield, moisture and ash content, degree of esterification and antioxidant activity. Determination of moisture and ash content was conducted using AOAC standard method. The determination of the degree of esterification of pectin was performed using Fourier Transform Infrared Spectroscopy (FTIR). DPPH assay was used to determine the antioxidant activity of the pectin extract. Based on the result, the yield of pectin decreases (20.34 to 16.20 %) with the increase of extraction time, moisture contents were between 4 to 6 % while ash contents were between 7 to 10 %. Pectin from dragon fruit peels was determined as low methoxyl pectin and has high percentage of antioxidant activity with low value of inhibition concentration (IC50) (0.0063 to 0.0080 mg/mL). 60 min extraction sample exhibits the highest antioxidant activity (81.91 % at 40 μg/mL), followed by 80 min extraction (81.68 % at 40 μg/mL), 40 min extraction (81.38 % at 40 μg/mL) and 20 min extraction (81.31 % at 40 μg/mL)

    A multilevel image thresholding based on Hybrid Salp Swarm algorithm and Fuzzy Entropy

    Get PDF
    The image segmentation techniques based on multi-level threshold value received lot of attention in recent years. It is because they can be used as a pre-processing step in complex image processing applications. The main problem in identifying the suitable threshold values occurs when classical image segmentation methods are employed. The swarm intelligence (SI) technique is used to improve multi-level threshold image (MTI) segmentation performance. SI technique simulates the social behaviors of swarm ecosystem, such as the behavior exhibited by different birds, animals etc. Based on SI techniques, we developed an alternative MTI segmentation method by using a modified version of the salp swarm algorithm (SSA). The modified algorithm improves the performance of various operators of the moth-flame optimization (MFO) algorithm to address the limitations of traditional SSA algorithm. This results in improved performance of SSA algorithm. In addition, the fuzzy entropy is used as objective function to determine the quality of the solutions. To evaluate the performance of the proposed methodology, we evaluated our techniques on CEC2005 benchmark and Berkeley dataset. Our evaluation results demonstrate that SSAMFO outperforms traditional SSA and MFO algorithms, in terms of PSNR, SSIM and fitness value

    An improved jellyfish algorithm for multilevel thresholding of magnetic resonance brain image segmentations

    Get PDF
    Image segmentation is vital when analyzing medical images, especially magnetic resonance (MR) images of the brain. Recently, several image segmentation techniques based onmultilevel thresholding have been proposed for medical image segmentation; however, the algorithms become trapped in local minima and have low convergence speeds, particularly as the number of threshold levels increases. Consequently, in this paper, we develop a new multilevel thresholding image segmentation technique based on the jellyfish search algorithm (JSA) (an optimizer).We modify the JSA to prevent descents into local minima, and we accelerate convergence toward optimal solutions. The improvement is achieved by applying two novel strategies: Rankingbased updating and an adaptive method. Ranking-based updating is used to replace undesirable solutions with other solutions generated by a novel updating scheme that improves the qualities of the removed solutions. We develop a new adaptive strategy to exploit the ability of the JSA to find a best-so-far solution; we allow a small amount of exploration to avoid descents into local minima. The two strategies are integrated with the JSA to produce an improved JSA (IJSA) that optimally thresholds brain MR images. To compare the performances of the IJSA and JSA, seven brain MR images were segmented at threshold levels of 3, 4, 5, 6, 7, 8, 10, 15, 20, 25, and 30. IJSA was compared with several other recent image segmentation algorithms, including the improved and standard marine predator algorithms, the modified salp and standard salp swarm algorithms, the equilibrium optimizer, and the standard JSA in terms of fitness, the Structured Similarity Index Metric (SSIM), the peak signal-to-noise ratio (PSNR), the standard deviation (SD), and the Features Similarity IndexMetric (FSIM). The experimental outcomes and theWilcoxon rank-sum test demonstrate the superiority of the proposed algorithm in terms of the FSIM, the PSNR, the objective values, and the SD; in terms of the SSIM, IJSA was competitive with the others.</p

    A Survey on Evolutionary Computation for Computer Vision and Image Analysis: Past, Present, and Future Trends

    Get PDF
    Computer vision (CV) is a big and important field in artificial intelligence covering a wide range of applications. Image analysis is a major task in CV aiming to extract, analyse and understand the visual content of images. However, imagerelated tasks are very challenging due to many factors, e.g., high variations across images, high dimensionality, domain expertise requirement, and image distortions. Evolutionary computation (EC) approaches have been widely used for image analysis with significant achievement. However, there is no comprehensive survey of existing EC approaches to image analysis. To fill this gap, this paper provides a comprehensive survey covering all essential EC approaches to important image analysis tasks including edge detection, image segmentation, image feature analysis, image classification, object detection, and others. This survey aims to provide a better understanding of evolutionary computer vision (ECV) by discussing the contributions of different approaches and exploring how and why EC is used for CV and image analysis. The applications, challenges, issues, and trends associated to this research field are also discussed and summarised to provide further guidelines and opportunities for future research

    A Study on RGB Image Multi-Thresholding using Kapur/Tsallis Entropy and Moth-Flame Algorithm

    Get PDF
    In the literature, a considerable number of image processing and evaluation procedures are proposed and implemented in various domains due to their practical importance. Thresholding is one of the pre-processing techniques, widely implemented to enhance the information in a class of gray/RGB class pictures. The thresholding helps to enhance the image by grouping the similar pixels based on the chosen thresholds. In this research, an entropy assisted threshold is implemented for the benchmark RGB images. The aim of this work is to examine the thresholding performance of well-known entropy functions, such as Kapur’s and Tsallis for a chosen image threshold. This work employs a Moth-Flame-Optimization (MFO) algorithm to support the automatic identification of the finest threshold (Th) on the benchmark RGB image for a chosen threshold value (Th=2,3,4,5). After getting the threshold image, a comparison is performed against its original picture and the necessary Picture-Quality-Values (PQV) is computed to confirm the merit of the proposed work. The experimental investigation is demonstrated using benchmark images with various dimensions and the outcome of this study confirms that the MFO helps to get a satisfactory result compared to the other heuristic algorithms considered in this study
    corecore