Search

Advances in computer image recognition have significantly impacted many industries, including healthcare, security and autonomous systems. This paper aims to explore the potential of improving image algorithms to enhance computer image recognition. Specifically, we will focus on regression methods as a means to improve the accuracy and efficiency of identifying images. In this study, we will analyze various regression techniques and their applications in computer image recognition, as well as the resulting performance improvements through detailed examples and data analysis. This paper deals with the problems related to visual image processing in outdoor unstructured environment. Finally, the heterogeneous patterns are converted into the same pattern, and the heterogeneous patterns are extracted from the fusion features of data modes. The simulation results show that the perception ability and recognition ability of outdoor image recognition in complex environment are improved. [ABSTRACT FROM AUTHOR]

With the continuous deepening of the urbanization process and the progress of science and technology, people transform nature and develop nature on a larger and larger scale, among which the most iconic transformation is a variety of building structures built by people. And with the passage of time, the building structure in the perennial wind and sun, there will be signs of "illness", if not timely treatment, it will have a huge impact on the stability and safety of the building structure. Based on this, in this paper, according to the characteristics of crack identification on the surface of concrete structure, background subtraction algorithm is selected for image noise reduction processing. Through three steps of digital image noise reduction, crack extraction and crack parameter identification, the quantitative recognition of cracks is completed and a complete system of crack parameter identification is formed. The experimental results show that the machine learning model of building structure health monitoring and damage recognition algorithm proposed in this paper has excellent statistical performance, and the relative error accuracy of recognition can be controlled within 10%. [ABSTRACT FROM AUTHOR]

Pixel‐level labeling of regions of interest in an image is a key step in building a labeled training dataset for supervised deep learning networks of images. However, traditional manual labeling of cancerous regions in digital pathological images by doctors is time‐consuming and inefficient. To address this issue, this paper proposes an automatic labeling method for whole slide images, which combines clustering and edge detection techniques. The proposed method utilizes the multi‐level feature fusion model and the Long‐Short Term Memory network to discriminate the cancerous nature of the whole slide images, thereby improving the classification accuracy of the whole slide images. Subsequently, the automatic labeling of cancerous regions is achieved by integrating a density‐based clustering algorithm and an edge point extraction algorithm, both based on the discriminated results of the cancerous properties of whole slide images. The experimental results demonstrate the effectiveness of the proposed method, which offers an efficient and accurate solution to the challenging task of cancerous region labeling in digital pathological images. [ABSTRACT FROM AUTHOR]

In response to the low efficiency and poor quality of current seed optimization algorithms for multi-threshold image segmentation, this paper proposes the utilization of the normal distribution in the cluster distribution mathematical model, the Levy flight mechanism, and the differential evolution algorithm to address the deficiencies of the seed optimization algorithm. The main innovation lies in applying the BBO algorithm to image multi threshold segmentation, providing a new perspective and method for image segmentation tasks. The second significant progress is the combination of Levy flight dynamics and differential evolution algorithm (DEA) to improve the BBO algorithm, thereby enhancing its performance and image segmentation quality. Therefore, a multi-threshold image segmentation model based on the optimized seed optimization algorithm is developed. The experimental results showed that on the function f1, the iteration of the improved seed optimization algorithm was 53, the Generational Distance value was 0.0020, the Inverted Generational Distance value was 0.098, and the Spacing value was 0.051. Compared with the other two algorithms, the improved seed optimization algorithm has better image segmentation performance and clearer image segmentation details. In summary, compared with existing multi-threshold image segmentation methods, the proposed multi-threshold image segmentation model based on the improved seed optimization algorithm has a better image segmentation effect and higher efficiency, can significantly improve the quality of image segmentation, has positive significance for the development of image processing technology, and also provides references for the improvement and application of optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new methodology to assist geophysicists in determining the first-break event in a 3-D seismic data set using the well-known technique called dynamic time warping algorithm (DTW), which is usually used to find the optimal alignment between two time-series. We used the optimal path from the cost matrix to identify the first break in the seismogram using a few picks (seeds) made by an interpreter as a reference to perform this task. Furthermore, the data were pre-conditioned by the topographic and linear moveout to improve the method's accuracy. To demonstrate the technique's robustness, first, we applied the methodology in a synthetic seismic data. After demonstrating the efficiency of the algorithm, we applied the aforementioned methodology in the Polo-Miranga 3-D seismic cube located in the Recôncavo sedimentary basin, Bahia-Brazil, and in the seismic data acquired from the Blackfoot field in Alberta, Canada. The high-quality results showed consistency in determining the first break in all ranges of offsets, demonstrating an alternative way to accelerate this seismic processing step. Furthermore, we compared the results obtained by the proposed methodology with an algorithm based on comparing the short-time averages with long-time averages. Finally, we performed the static correction calculation to ensure that the time distortion resulting from the terrain and the low-velocity layer was mitigated in shoot gathers and in the stacked section. [ABSTRACT FROM AUTHOR]

Tunnel cracks are the main factors that cause damage and collapse of tunnel structures. How to detect tunnel cracks efficiently and avoid safety accidents caused by tunnel cracks effectively is a research hotspot at present. In order to meet the need for efficient detection of tunnel cracks, the tunnel crack detection method based on improved Retinex and deep learning is proposed in this paper. The tunnel crack images collected by optical imaging equipment are used to improve the contrast information of tunnel crack images using the image enhancement algorithm, and this image enhancement algorithm has the function of multi-scale Retinex decomposition with improved central filtering. An improved VGG19 network model is constructed to achieve efficient segmentation of tunnel crack images through deep learning methods and then form the segmented binary image. The Zhang–Suen fast parallel-thinning method is used to obtain the skeleton map of the single-layer pixel, and the length and width information of the tunnel cracks are obtained. The feasibility and effectiveness of the proposed method are verified by experiments. Compared with other methods in the literature, the maximum deviation in the length of the tunnel crack is about 5 mm, and the maximum deviation in the width of the tunnel crack is about 0.8 mm. The experimental results show that the proposed method has a shorter detection time and higher detection accuracy. The research results of this paper can provide a strong basis for the health evaluation of tunnels. [ABSTRACT FROM AUTHOR]

Oncology has emerged as a crucial field of study in the domain of medicine. Computed tomography has gained widespread adoption as a radiological modality for the identification and characterisation of pathologies, particularly in oncology, enabling precise identification of affected organs and tissues. However, achieving accurate liver segmentation in computed tomography scans remains a challenge due to the presence of artefacts and the varying densities of soft tissues and adjacent organs. This paper compares artificial intelligence algorithms and traditional medical image processing techniques to assist radiologists in liver segmentation in computed tomography scans and evaluates their accuracy and efficiency. Despite notable progress in the field, the limited availability of public datasets remains a significant barrier to broad participation in research studies and replication of methodologies. Future directions should focus on increasing the accessibility of public datasets, establishing standardised evaluation metrics, and advancing the development of three-dimensional segmentation techniques. In addition, maintaining a collaborative relationship between technological advances and medical expertise is essential to ensure that these innovations not only achieve technical accuracy, but also remain aligned with clinical needs and realities. This synergy ensures their applicability and effectiveness in real-world healthcare environments. [ABSTRACT FROM AUTHOR]

In the realm of digital image applications, image processing technology occupies a pivotal position, with image segmentation serving as a foundational component. As the digital image application domain expands across industries, the conventional segmentation techniques increasingly challenge to cater to modern demands. To address this gap, this paper introduces an MCMC-based image segmentation algorithm based on the Markov Random Field (MRF) model, marking a significant stride in the field. The novelty of this research lies in its method that capitalizes on domain information in pixel space, amplifying the local segmentation precision of image segmentation algorithms. Further innovation is manifested in the development of an adaptive segmentation image denoising algorithm based on MCMC sampling. This algorithm not only elevates image segmentation outcomes, but also proficiently denoises the image. In the experimental results, MRF-MCMC achieves better segmentation performance, with an average segmentation accuracy of 94.26% in Lena images, significantly superior to other common image segmentation algorithms. In addition, the study proposes that the denoising model outperforms other algorithms in peak signal-to-noise ratio and structural similarity in environments with noise standard deviations of 15, 25, and 50. In essence, these experimental findings affirm the efficacy of this study, opening avenues for refining digital image segmentation methodologies. [ABSTRACT FROM AUTHOR]

The overlap between edge computing and unmanned aerial systems enables Unmanned Aerial Vehicles (UAV) to quickly offload image processing tasks onto edge devices, avoiding the transmission of images over long distances. To improve the speed and efficiency of UAV image stitching in an edge computing environment, this paper proposes an adaptive UAV image parallel stitching algorithm in an edge computing environment. The algorithm incorporates both route-based parallel processing and inverted binary tree-based parallel processing, dividing the image stitching task into multiple processes and allocating them to different cores based on the CPU core count, number of flight routes, and number of images, thereby enhancing computational efficiency in edge scenarios. The experimental results indicate that, when the number of flight routes is greater than or equal to the number of CPUs, the adaptive algorithm will employ the more efficient route parallelism. Conversely, when the number of flight routes is less than the number of CPUs, the efficiency of inverted binary tree parallelism is higher. In the same experimental environment and dataset, the adaptive image stitching algorithm demonstrates an efficiency improvement of approximately 2–10 times compared to other algorithms, with no significant degradation in image quality. This demonstrates that in edge environments, the utilization of multi-threaded adaptive route and inverted binary tree-based parallel approaches can effectively harness the computing resources of edge devices, significantly improving the stitching speed of UAV images and providing technical support for rapid real-time monitoring by UAV. [ABSTRACT FROM AUTHOR]

License plate detection is an important task in Intelligent Transportation Systems (ITS) and has a wide range of applications in vehicle management, traffic control, and public safety. In order to improve the accuracy and speed of mobile recognition, an improved lightweight YOLOv5s model is proposed for license plate detection. First, an improved Stemblock network is used to replace the original Focus layer in the network, which ensures strong feature expression capability and reduces a large number of parameters to lower the computational complexity; then, an improved lightweight network, ShuffleNetv2, is used to replace the backbone network of the YOLOv5s, which makes the model lighter and ensures the detection accuracy at the same time. Then, a feature enhancement module is designed to reduce the information loss caused by the rearrangement of the backbone network channels, which facilitates the information interaction in the feature fusion process; finally, the low‐, medium‐ and high‐level features in the Shufflenetv2 network structure are fused to form the final high‐level output features. Experimental results on the CCPD dataset show that compared to other methods this paper obtains better performance and faster speed in the license plate detection task, in which the average precision mean value reaches 96.6%, and can achieve a detection speed of 43.86 frame/s, and the parameter volume is reduced to 5.07 M. [ABSTRACT FROM AUTHOR]

Clustering is an important technique for data mining and machine learning. In this paper, a novel clustering algorithm, scale division and region growing (SRG), is proposed, which is based on scale division and region growing. This method uses the division-and-merge strategy, which consists of two primary phases, namely the division phase and the merging phase. In the division phases, the data is mapped to a two-dimensional space, and the clustering problem is transformed to an image processing problem. Then the image is divided into different scales to adaptively find the appropriate scale. After finding the appropriate scale, the region growing is carried out under this scale and the multiple sub-clusters are created. In the merging phases, the sub-clusters are evaluated and merged to form the final clusters in the dataset. The proposed algorithm is tested on 15 benchmark datasets including both the synthetic datasets and the real datasets, and it is found that SRG can obtain better clustering results and has higher accuracy than other typical clustering algorithms. Moreover, the experimental results on noisy datasets show that the proposed algorithm has good robustness. [ABSTRACT FROM AUTHOR]

The Euler elastica (EE) model with surface curvature can generate artifact-free results compared with the traditional total variation regularization model in image processing. However, strong nonlinearity and singularity due to the curvature term in the EE model pose a great challenge for one to design fast and stable algorithms for the EE model. In this paper, we propose a new, fast, hybrid alternating minimization (HALM) algorithm for the EE model based on a bilinear decomposition of the gradient of the underlying image and prove the global convergence of the minimizing sequence generated by the algorithm under mild conditions. The HALM algorithm comprises three subminimization problems and each is either solved in the closed form or approximated by fast solvers, making the new algorithm highly accurate and efficient. We also discuss the extension of the HALM strategy to deal with general curvature-based variational models, especially with a Lipschitz smooth functional of the curvature. A host of numerical experiments are conducted to show that the new algorithm produces good results with much-improved efficiency compared to other state-of-the-art algorithms for the EE model. As one of the benchmarks, we show that the average running time of the HALM algorithm is at most one-quarter of that of the fast operator-splitting-based Deng--Glowinski--Tai algorithm. [ABSTRACT FROM AUTHOR]

Image processing algorithms are essential for clarifying the image and improving the ability to recognize distinct characteristics of the image. The field of digital image processing is widespread in several research and technology applications. In many of these applications, the existence of impulsive noise in the obtained images is one of the most frequent problems. The median filter is a strong method to remove the impulsive noise; it effectively eliminates salt and pepper noise from the image. The main target of this paper is to investigate efficient median filter units to be connected to a general-purpose processor (GPP) for FPGA-based embedded systems. The paper exposes three novel techniques, two of them specially for median filtering techniques and the third one is used to get the maximum number of any 9 elements array. The proposed algorithms are inspired by the Median Of Median (MOM) algorithm. The first two techniques are tested for filtering 3 × 3 image windows and optimized for producing the expected result in high accuracy, short time, and reduced number of comparisons. The last technique is tested for a 9 elements array for extracting the maximum number in same high efficiency manner. Furthermore, the three proposed techniques are implemented leveraging the advantage of the parallel processing and the FPGA flexible resources to satisfy the real-time processing constraints. A comparison between the first two proposed filtering units and their counterparts in the literature is included. The comparison reveals the superiority of the first technique in terms of accuracy with fewer comparators than previously published techniques. Besides, the paper illustrates how the concept beyond the proposed techniques can be used to perform the maximum pooling for convolution neural networks. [ABSTRACT FROM AUTHOR]

In recent days, the major concern for diabetic patients is foot ulcers. According to the survey, among 15 people among 100 are suffering from this foot ulcer. The wound or ulcer found which is found in diabetic patients consumes more time to heal, also required more conscious treatment. Foot ulcers may lead to deleterious danger condition and also may be the cause for loss of limb. By understanding this grim condition, this paper proposes Fractional-Order Darwinian Particle Swarm Optimization (FO-DPSO) technique for analyzing foot ulcer 2D color images. This paper deals with standard image processing, i.e. efficient segmentation using FO-DPSO algorithm and extracting textural features using Gray Level Co-occurrence Matrix (GLCM) technique. The whole effort projected results as accuracy of 91.2%, sensitivity of 100% and specificity as 96.7% for Naïve Bayes classifier and accuracy of 91.2%, sensitivity of 100% and sensitivity of 79.6% for Hoeffding tree classifier. [ABSTRACT FROM AUTHOR]

A general and adaptable method is proposed to reliably extract quantitative information from smartphone images of microfluidic sensors. By analyzing and processing the color information of selected standard substances, the influence of light conditions, device differences, and human factors could be significantly reduced. Machine learning and multivariate fitting methods were proved to be effective for chroma correction, and a key element was the training of sample size and the fitting form, respectively. A custom APP was developed and validated using a high-sensitivity chromium ion quantification paper chip. The average chroma deviations under different conditions were reduced by more than 75% in RGB color space, and the concentration test error was reduced by more than half compared with the commonly used method. The proposed approach could be a beneficial supplement to existing and potential colorimetry-based detection methods. [ABSTRACT FROM AUTHOR]

Image restoration with impulse noise is an important task in image processing. Taking into account the statistical distribution of impulse noise, the ℓ1‐norm data fidelity and total variation (ℓ1TV$\ell _1TV$) model has been widely used in this area. However, the ℓ1TV$\ell _1TV$ model usually performs worse when the noise level is high. To overcome this drawback, several nonconvex models have been proposed. In this paper, an efficient iterative algorithm is proposed to solve nonconvex models arising in impulse noise. Compared to existing algorithms, the proposed algorithm is a completely explicit algorithm in which every subproblem has a closed‐form solution. The key idea is to transform the original nonconvex models into an equivalent constrained minimization problem with two separable objective functions, where one is differentiable but nonconvex. As a consequence, the proximal linearized alternating direction method of multipliers is employed to solve it. Extensive numerical experiments are presented to demonstrate the efficiency and effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In foggy days, the color saturation and contrast of the image are reduced due to factors such as scattering and refraction of light. Aiming at the problems of fog residue and loss of detailed features after processed by the existing dehazing methods, a defogging model network APSA-DehazeNet (Adaptive Pyramid Split Attention-DehazeNet) based on split convolution is proposed in this paper. Firstly, the adaptive multi-scale feature fusion module is used to extract the features of the foggy image, capture the features of different scales, then perform weighted fusion and obtain the shallow features of the image. Secondly, the deep features of the image are further obtained by the split convolutional network (PSANet) based on attention mechanism, and a more thorough dehazing effect is obtained. Finally, to effectively solve the problem of detail loss caused by a single loss, a joint loss function of perceived loss and structural similarity loss is proposed. Compared with other algorithms, experimental results demonstrate that the PSNR and SSIM indexes on the synthetic fog map dataset are improved by an average of 4.7dB and 7.4%, respectively. [ABSTRACT FROM AUTHOR]

Printed circuit boards (PCBs) are the first stage in manufacturing any electronic product. The reliability of the electronic product depends on the PCB. The presence of manufacturing defects in PCBs might affect the performance of the PCB and thereby the reliability of the electronic products. In this paper, the various challenges faced in identifying manufacturing defects along with a review of various learning methods employed for defect detection are presented. We compare the various techniques available in the literature for further understanding of the accuracy of these techniques in defect detection. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have achieved outstanding results in domains such as image processing, computer vision, natural language processing and bioinformatics. In recent years, many methods have been proposed that can provide a visual explanation of decision made by such classifiers. Saliency maps are probably the most popular. However, it is still unclear how to properly interpret saliency maps for a given image and which techniques perform most accurately. This paper presents a methodology to practically evaluate the real effectiveness of saliency map generation methods. We used three state-of-the-art network architectures along with specially prepared benchmark datasets, and we proposed a novel metric to provide a quantitative comparison of the methods. The comparison identified the most reliable techniques and the solutions which usually failed in our tests. [ABSTRACT FROM AUTHOR]

Neural architecture search can be used to find convolutional neural architectures that are precise and robust while enjoying enough speed for industrial image processing applications. In this paper, our goal is to achieve optimal convolutional neural networks (CNNs) for multiple‐templates matching for applications such as licence plates detection (LPD). We perform an iterative local neural architecture search for the models with minimum validation error as well as low computational cost from our search space of about 32 billion models. We describe the findings of the experience and discuss the specifications of the final optimal architectures. About 20‐times error reduction and 6‐times computational complexity reduction is achieved over our engineered neural architecture after about 500 neural architecture evaluation (in about 10 h). The typical speed of our final model is comparable to classic template matching algorithms while performing more robust and multiple‐template matching with different scales. [ABSTRACT FROM AUTHOR]

Image restoration is an interesting ill-posed problem. It plays a critical role in the concept of image processing. We are looking for an image that is as near to the original as possible among images that have been skewed by Gaussian and additive noise. Image deconstruction is a technique for restoring a noisy image after it has been captured. The numerical results achieved by the prox-penalty method and the split Bregman algorithm for anisotropic and isotropic TV denoising problems in terms of image quality, convergence, and signal noise rate (SNR) are compared in this paper. It should be mentioned that isotropic TV denoising is faster than anisotropic. Experimental results indicate that the prox algorithm produces the best high-quality output (clean, not smooth, and textures are preserved). In particular, we obtained (21.4, 21) the SNR of the denoising image by the prox for sigma 0.08 and 0.501, such as we obtained (10.0884, 10.1155) the SNR of the denoising image by the anisotropic TV and the isotropic TV for sigma 0.08 and (-1.4635, -1.4733) for sigma 0.501. [ABSTRACT FROM AUTHOR]

Deep neural networks (DNNs) have achieved outstanding results in domains such as image processing, computer vision, natural language processing and bioinformatics. In recent years, many methods have been proposed that can provide a visual explanation of decision made by such classifiers. Saliency maps are probably the most popular. However, it is still unclear how to properly interpret saliency maps for a given image and which techniques perform most accurately. This paper presents a methodology to practically evaluate the real effectiveness of saliency map generation methods. We used three state-of-the-art network architectures along with specially prepared benchmark datasets, and we proposed a novel metric to provide a quantitative comparison of the methods. The comparison identified the most reliable techniques and the solutions which usually failed in our tests. [ABSTRACT FROM AUTHOR]

X‐ray flaw detection is widely used in non‐destructive area. The intuitive defect information can be obtained through the X‐ray film, which is usually digitized into high greyscale image by a 12‐bit or 16‐bit, called super 8‐bit, industrial scanner. When an ordinary 8‐bit monitor displays a super 8‐bit greyscale image, it appears loss of detail information, blurring of the image appears and other problems. Therefore, in this paper, a pseudo‐colour enhancement algorithm for displaying high‐bit RAW images on low‐bit monitor was proposed according to the chromatographic mapping relationship based on the visual characteristics of human eye. First, a high grey‐scale pseudo‐colour enhancement algorithm, called HOTM‐HGL, based on hot metal coding was proposed based on the standard film, whose enhancement effect is better than current mainstream algorithms. Second, aiming at the non‐standard film, a new stretching function called RAW‐Optical‐Stretching was reconstructed to improve HOTM‐HGL algorithm, called HOTM‐HGLS algorithm, whose display effect on ordinary monitors was improved in further. Finally, HOTM‐HGLS algorithm was applied in the detection of X‐ray film defect, which was convenient for the capture of defect information in the weld. Compared with the existing algorithms, various indicators have been greatly improved, enriching the amount of information and strengthening the image recognition effects. [ABSTRACT FROM AUTHOR]

Transportation has always been an indispensable part of people's lives. With the growth of the total population, the number of trips continues to increase, traffic pressure continues to increase, and road traffic accidents are increasing every year. With the continuous development of artificial intelligence technology, the emergence of intelligent transportation systems has greatly promoted the development and commercialization of irreversible intelligent transportation systems. This paper aims to study the road vehicle recognition algorithm in safety-assisted driving based on artificial intelligence. The research topic of this paper is the research of road vehicle recognition algorithm in safety-assisted driving. The research focus is on lane detection algorithm and vehicle detection algorithm. The concept of lane line detection is proposed, and the image preprocessing method is introduced. The experimental results in this paper show that when the road environment is complex, the vehicle itself will cause misjudgments, but the overall correct rate is over 92.5%. [ABSTRACT FROM AUTHOR]

Multi-level thresholding image segmentation divides an image into multiple regions of interest and is a key step in image processing and image analysis. Aiming toward the problems of the low segmentation accuracy and slow convergence speed of traditional multi-level threshold image segmentation methods, in this paper, we present multi-level thresholding image segmentation based on an improved slime mould algorithm (ISMA) and symmetric cross-entropy for global optimization and image segmentation tasks. First, elite opposition-based learning (EOBL) was used to improve the quality and diversity of the initial population and accelerate the convergence speed. The adaptive probability threshold was used to adjust the selection probability of the slime mould to enhance the ability of the algorithm to jump out of the local optimum. The historical leader strategy, which selects the optimal historical information as the leader for the position update, was found to improve the convergence accuracy. Subsequently, 14 benchmark functions were used to evaluate the performance of ISMA, comparing it with other well-known algorithms in terms of the optimization accuracy, convergence speed, and significant differences. Subsequently, we tested the segmentation quality of the method proposed in this paper on eight grayscale images and compared it with other image segmentation criteria and well-known algorithms. The experimental metrics include the average fitness (mean), standard deviation (std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), and feature similarity index (FSIM), which we utilized to evaluate the quality of the segmentation. The experimental results demonstrated that the improved slime mould algorithm is superior to the other compared algorithms, and multi-level thresholding image segmentation based on the improved slime mould algorithm and symmetric cross-entropy can be effectively applied to the task of multi-level threshold image segmentation. [ABSTRACT FROM AUTHOR]

Image dehazing is a revolutionary technique for restoring images with hazy or foggy landscapes, that has gotten a lot of focus in recent years since it gained importance in a surveillance system. However, the image processing by the traditional defogging algorithm has difficulties in integrating the depth of image detail and the color of the image. Therefore, in this paper, a novel framework based on wavelet decomposition and optimized gamma correction is proposed for efficaciously retrieving the fog-free image. The foggy image is first divided into low and high frequency sub-images using SWT (Stationary Wavelet Transform), which has the advantages of preserving temporal features so that information loss can be stopped. Then the low frequency and high frequency images are processed with defogging and denoising modules to remove fog and noise respectively. The DOGC (Dragonfly optimal Gamma Correction) algorithm in dehazing module dynamically enhanced the color detail information without human intervention so that observed scene contrast and visibility are well preserved. Lastly, fog-free image is reconstructed from sub-enhanced images. The experimental findings show that the proposed framework outperforms state-of-the-art methods in terms of both quantitative and qualitative assessment criteria using the established dataset. Furthermore, the proposed method efficiently removes fog while preserving the naturalness of fog images. [ABSTRACT FROM AUTHOR]

As an infrastructure of biochemical laboratories, EP tube label plays a significant role in information extraction to meet the limitations of computing power in offline devices and solve the problem that the EP tube label cannot be accurately identified before identification because the label belongs to multi-angle random placement. This paper proposes a light-weight neural network YOLOv4-tiny-ECA to position tubes and a tilt correction method based on Hough transform. First, the EP tube rack is roughly positioned based on the diffuse filling algorithm combined with digital morphological corrosion, and then the EP tubes in the rack are precisely positioned using the light-weight YOLO target detection algorithm combined with the attention mechanism. Next, the baseline is added to the label as the basis for determining the tilt angle. For the valid target, the baseline is extracted using the Hough transform and the tilt angle is calculated by vector fork multiplication. Finally, baseline is removed using image processing algorithm for better recognition results. Our results show that the light-weight YOLO algorithm reduces the network parameters by 56% and computation by 55% while keeping the accuracy rate largely unchanged, the offline positioning tilt correction method can achieve 98.8% accuracy and 0.076 s processing speed for a single test tube on average, which meets the real-time requirement. [ABSTRACT FROM AUTHOR]

The expansive growth of information on the Internet has led to new developments in computer vision technology and image processing techniques. Since stone inscriptions are subject to erosion and polishing by the external environment for years, it is difficult to extract image and text information. In this study, the fuzzy control theory is combined with edge detection technology for image edge detection. Firstly, a suitable fuzzy rule and affiliation function are set, then a fuzzy control system is used to extract and detect the image edge information, and then a fuzzy logic rule-based edge detection algorithm is proposed to detect the inscription images. To test the performance of the algorithm, the detection effect of the image is first analyzed from a subjective perspective. The experimental results show that the proposed algorithm has better edge detection for both inscription and lena images, with better noise suppression without excessive distortion, and clearer inscription images. The proposed algorithm has the lowest MSE value of 41.26 when the detection object is the lena image b, and the highest PSNR value of 33.84 when the detection object is the lena image a. The proposed algorithm has the lowest MSE value of 41.26 when the detection object is the lena image b, and the highest PSNR value of 41.26 when the detection object is the lena image b. The proposed algorithm has the highest PSNR value of 33.84 when the detection object is the lena image b. In summary, the analysis of both subjective and objective indicators shows that the inscription image processing algorithm used in this paper has better processing effect, and the processed images become clearer with less distortion, which is helpful for both inscription image and text extraction. [ABSTRACT FROM AUTHOR]

In this paper, we take advantage of the reconstruction properties of the sampling Kantorovich (SK) algorithm to estimate the volume of the human brain for the quantification of Alzheimer's biomarkers. At first, the goodness of the reconstructions is evaluated, comparing it to different interpolation methods by means of the Peak Signal to Noise Ratio (PSNR) index; then the stereological Cavalieri/Point‐counting technique is used to infer volumetric data starting from the knowledge of the planar sections. The comparison of the achieved results with synthetic references confirms the good performances of the new methodology. [ABSTRACT FROM AUTHOR]

The intrinsic high parallelism and entanglement characteristics of quantum computing have made quantum image processing techniques a focus of great interest. One of the most widely used techniques in image processing is segmentation, which in one of their most basic forms can be carried out using thresholding algorithms. In this paper, a fault-tolerant quantum dual-threshold algorithm has been proposed. This algorithm has been built using only Clifford+T gates for compatibility with error detection and correction codes. Because fault-tolerant implementation of T gates has a much higher cost than other quantum gates, our focus has been on reducing the number of these gates. This has allowed adding noise tolerance, computational cost reduction, and fault tolerance to the state-of-the-art dual-threshold segmentation circuits. Since the dual-threshold image segmentation involves the comparison operation, as part of this work we have implemented two full comparator circuits. These circuits optimize the metrics T-count and T-depth with respect to the best circuit comparators currently available in the literature. [ABSTRACT FROM AUTHOR]

Interactive image segmentation refers to bringing in a small number of user guidelines to segment the target object during the segmentation process and is one of the most fundamental tasks in image processing. Existing methods usually require the construction of non-quadratic energy functions and generally suffer from the lack of unique solutions and low segmentation accuracy. To further improve the segmentation quality, this paper proposed an interactive image segmentation algorithm combining local linear embedding and seed information（SILLE). The algorithm toke into account the local and a priori information of the pixel points and incorporated the information of the labeled seed points into the newly constructed energy function to obtain a unique and optimal solution of the energy function with an efficient and fast minimization scheme, thus obtaining more accurate segmentation results. Finally, comparison of different methods on different datasets verifies the effectiveness and feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

The aim of this systematic review is to synthesize and analyze interconnected monitoring devices, interoperable digital avatars, and employee monitoring software. In this research, prior findings were cumulated indicating that generative artificial intelligence and virtual connectivity tools further talent acquisition and management, employee effectiveness and productivity, and virtual team performance and processes. We carried out a quantitative literature review of ProQuest, Scopus, and the Web of Science throughout May 2023, with search terms including "immersive interconnected 3D worlds" + "image processing computational algorithms," "multimodal behavioral analytics," and "generative artificial intelligence and ambient scene detection tools." As we analyzed research published in 2023, only 168 papers met the eligibility criteria, and 53 mainly empirical sources were selected. Data visualization tools: Dimensions (bibliometric mapping) and VOSviewer (layout algorithms). Reporting quality assessment tool: PRISMA. Methodological quality assessment tools include: AXIS, Distiller SR, ROBIS, and SRDR. [ABSTRACT FROM AUTHOR]

One of the most important issues in image processing is the approximation of the image that has been lost due to the blurring process. These types of matters are divided into non-blind and blind problems. The second type of problem is more complex in terms of calculations than the first problem due to the unknown of original image and point spread function estimation. In the present paper, an algorithm based on coarse-to-fine iterative by l 0 - α l 1 regularization and framelet transform is introduced to approximate the spread function estimation. Framelet transfer improves the restored kernel due to the decomposition of the kernel to different frequencies. Also, in the proposed model, a fraction gradient operator is used instead of the ordinary gradient operator. The proposed method is investigated on different kinds of images such as text, face and natural. The output of the proposed method reflects the effectiveness of the proposed algorithm in restoring images from blind problems. [ABSTRACT FROM AUTHOR]

Bamboo chip defect detection is an important process to improve product quality. Using images to automatically detect bamboo chip defects can greatly improve production efficiency. In this paper, an image detection method of bamboo chip defects based on OTSU and CANNY algorithm was proposed, which was suitable for seven bamboo chips such as brushed bamboo chips, cracked bamboo chips, borehole bamboo chips, moldy bamboo chips, bamboo green chips, black knot bamboo chips, and triangular bamboo chips. Firstly, the OTSU algorithm was used to binarize the bamboo pieces, the CANNY algorithm was used for edge detection, and the Hough transform was used for tilt correction to realize the extraction of bamboo pieces. Then, OTSU algorithm was used to detect color defects and CANNY algorithm was used to detect shape defects, and all defective bamboo slices were detected. The research results showed that: this paper detected 350 bamboo defects of seven types, and the average accuracy rate was 95. 14%, which can effectively detect bamboo defects. [ABSTRACT FROM AUTHOR]

As we know, image colorization is widely used in computer graphics and has become a research hotspot in the field of image processing. Current image colorization technology has the phenomenon of single coloring effect and unreal color, which is too complicated to be implemented and struggled to gain popularity. In this paper, a new method based on a convolution neural network is proposed to study the reasonable coloring of human images and ensures the realism of the coloring effect and the diversity of coloring at the same time. First, this paper selects about 5000 pictures of people and plants from the Imagenet dataset and makes a small dataset containing only people and backgrounds. Secondly, in order to obtain the image segmentation results, this paper improves the U-net network and carries out three times of down sampling and three times of up-sampling. Finally, we add the expanded convolution, and use the sigmoid activation function to replace the ReLU (The Rectified Linear Unit) activation function and put the BN (Batch Normalization) before the activation function. Experimental results show that our proposed image colorization algorithm based on the deep learning scheme can reduce the training time of the network and achieve higher quality segmentation results. [ABSTRACT FROM AUTHOR]

Among the congenital coronary heart diseases, atrial septal defect constitutes the 1/3 most common type. In many cases, the affected person stays asymptomatic for the duration of the youth even having big shunts. Methodologies that may be hired for figuring out the defects are: echocardiogram, chest X-ray, electrocardiogram, cardiac catheterization, MRI, CT scan, phonocardiogram. Deep learning may be correctly utilised for the automatic estimation of the illness from the test result. The purpose of this review paper is to offer an perception into ASD, the strategies for figuring out it and the application of deep learning models for distinguishing the illness. The paper opinions diverse algorithms used for identity of defects also points out the restrictions of every algorithm. [ABSTRACT FROM AUTHOR]

A recent trend in the signal/image processing literature is the optimization of Fourier sampling schemes for specific datasets of signals. In this paper, we explain why choosing optimal non Cartesian Fourier sampling patterns is a difficult nonconvex problem by bringing to light two optimization issues. The first one is the existence of a combinatorial number of spurious minimizers for a generic class of signals. The second one is a vanishing gradient effect for the high frequencies. We conclude the paper by showing how using large datasets can mitigate the first effect and illustrate experimentally the benefits of using stochastic gradient algorithms with a variable metric. [ABSTRACT FROM AUTHOR]

The thermal imaging image of the Sustainable Development Science Satellite (SDGSAT-1) is mainly used for high-resolution observations of the ground width, due to the influence of blind elements and non-uniformity of the detector, and the system is a pendulum sweep imaging mode, resulting in fringed noise in the image. In this paper, a Fringing algorithm based on LRSID (low-rank-based single-image decomposition) algorithm is proposed, which can effectively remove the lateral and vertical fringe noise of the thermal imager and maintain the detail and clarity of the image. First, pretreatment of the obvious light and dark stripes then, based on LLSID algorithm, the vertical direction pinstripes and horizontal stripes are processed; finally, the fringed frequency band of the original image is replaced in the frequency domain with the image frequency domain processed by the LRSID algorithm, and then the Fourier inverse transformation is performed to obtain the final image. Using the method proposed in this paper, the simulated and actual SDGSAT-1 thermal imaging camera remote sensing stripes images are removed, and the visual and quantitative indicators are compared with the processing results of other algorithms, and the results show that the proposed algorithm has the best performance to remove the stripes, which can effectively remove horizontal and vertical fringes at the same time, and retain the detail and clarity of the image. [ABSTRACT FROM AUTHOR]

In recent years, the incidence of diabetes has been increasing year by year. Since most of the fundus lesions are located near blood vessels, the image information is complex, and the end vessels are difficult to identify. So, a new segmentation method of diabetic retinal vessel images based on particle swarm optimization and salp swarm algorithm is proposed. This paper uses a Gaussian filter to enhance the main blood vessels, and a top-bot hat transform is used to strengthen the end vessels. The preprocessing process is completed by combining and reconstructing the two images through a normalization operation. The improved particle swarm optimization and salp swarm algorithms perform multi-threshold segmentation on the preprocessed vessel images. The best fit value, Structural Similarity Index Measure, Peak Signal to Noise Rati, feature similarity index measure, sensitivity, accuracy, regional consistency, Dice coefficient, Jaccard similarity, and Shannon entropy are selected for comprehensive evaluation and analysis. The results showed that this paper's improved particle swarm-salp swarm algorithm for segmenting diabetic retinal blood vessel images is more efficient, and the threshold is better. The vascular segmentation method in this paper is applied in medical image processing, which improves the accuracy of medical image processing and reduces the computational effort. [ABSTRACT FROM AUTHOR]

• A novel water transparency calculation algorithm is introduced, employing deep neural network and image processing technology. This algorithm obviates the need for a water gauge, allowing the calculation of water transparency solely through the analysisof Secchi disk videos. Notably, it demonstrates heightened detection efficiency and success rates. • An enhanced Siamese tracker, termed SiamDCFF (Siamese tracker based on dual correlation feature fusion), is proposed for Secchi disk recognition. Distinguishing features of SiamDCFF include a dual correlation module and a feature fusion module. On the Secchi disk dataset, SiamDCFF achieves the highest success rate, outperforming other methods detailed in this paper. • The simplified 3D-ResNet [41] is leveraged to assess the state of the Secchi disk, transforming the critical position determination problem into an optimization challenge. The objective function involves maximizing the number of visible and invisible Secchi disk images on both sides of the critical position. This method facilitates adaptive critical position determination. • A novel Gated Recurrent Unit based on auto-regression (ARGRU) is proposed, taking into account the motion characteristics of the Secchi disk. ARGRU achieves a higher success detection rate for water transparency compared to the water gauge recognition method. Notably, ARGRU outperforms RNN [42], GRU, and LSTM [43] on the dataset presented in this paper. Water transparency is traditionally assessed through visual inspection using a lowered Secchi disk (SD) into the water, with the disappearance depth of the SD recorded as the measure of transparency. However, manual and visually-dependent frequency measurements of the SD render this process labor-intensive and time-consuming. This paper presents a comprehensive machine-vision-based algorithm designed for the automatic computation of water transparency using Secchi disk videos. The algorithm leverages multiple deep neural networks, including an enhanced Siamese tracking model, a 3D-ResNet, and an improved GRU network. Trained models directly identify the SD in the video, calculating water transparency by processing pixel information. Experimental results demonstrate the algorithm's efficacy in estimating water transparency across diverse natural environments, achieving commendable accuracy (MAE = 3.6 cm MSE = 21.5 cm RMSE = 4.6 cm), rapid processing speed (average 6.87 s), and robust stability. In comparison with the former water-gauge-based algorithm, our proposed algorithm exhibits heightened efficiency and a superior detection success rate. [ABSTRACT FROM AUTHOR]

Since light propagation in water bodies is subject to absorption and scattering effects, underwater images using only conventional intensity cameras will suffer from low brightness, blurred images, and loss of details. In this paper, a deep fusion network is applied to underwater polarization images; that is, the underwater polarization images are fused with intensity images using the deep learning method. To construct a training dataset, we establish an experimental setup to obtain underwater polarization images and perform appropriate transformations to expand the dataset. Next, an end-to-end learning framework based on unsupervised learning and guided by an attention mechanism is constructed for fusing polarization and light intensity images. The loss function and weight parameters are elaborated. The produced dataset is used to train the network under different loss weight parameters, and the fused images are evaluated based on different image evaluation metrics. The results show that the fused underwater images are more detailed. Compared with light intensity images, the information entropy and standard deviation of the proposed method increase by 24.48% and 139%. The image processing results are better than other fusion-based methods. In addition, the improved U-net network structure is used to extract features for image segmentation. The results show that the target segmentation based on the proposed method is feasible under turbid water. The proposed method does not require manual adjustment of weight parameters, has faster operation speed, and has strong robustness and self-adaptability, which is important for research in vision fields, such as ocean detection and underwater target recognition. [ABSTRACT FROM AUTHOR]

The traditional fuzzy C-means clustering technology only considers one performance Angle of image segmentation process when processing data, resulting in low accuracy of image segmentation. In this paper, the traditional FCM algorithm is analyzed, and the low clustering accuracy, noise interference and lack of flexibility and other problems are fully considered from the relationship between parameter components, non-local spatial information elements and noise sensitivity. Firstly, a distance calculation method based on robust statistics theory is proposed, which can deal with abnormal noise stably. Secondly, based on the extreme learning machine theory, the non-local spatial information coefficient is introduced to improve the identification ability of the influence factors. This method not only guarantees the anti-noise performance of the algorithm, but also preserves the image data, improving the iteration efficiency and segmentation accuracy of the algorithm. The test results show that the accuracy of the improved C-means clustering algorithm for image segmentation is 95.5%, which is compared with the traditional C-means clustering technique and other optimization algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we discuss a practice of potential cosmic ray detection using off-the-shelves CMOS cameras. We discuss and presents the limitations of up-to-date hardware and software approaches to this task. We also present a hardware solution that we made for long-term testing of algorithms for potential cosmic ray detection. We have also proposed, implemented and tested a novel algorithm that enables real-time processing of image frames acquired by CMOS cameras in order to detect tracks of potential particles. We have compared our results with already published results and obtained acceptable results overcoming some limitation of already existing algorithms. Both source codes and data are available to download. [ABSTRACT FROM AUTHOR]

Many researchers have devoted themselves to studying image encryption based on chaotic system and have made significant strides in research in recent decades. This paper first combs and summarizes the development of the current image encryption algorithm. Then, the classification of chaotic system is described, and representative work and the latest achievements regarding image encryption algorithms based on chaotic system are analysed, expounding their advantages and disadvantages. Finally, we discuss future research directions and development trends in image encryption algorithms based on chaotic system. [ABSTRACT FROM AUTHOR]

Digitizing image-format piping and instrumentation diagrams (P&IDs) consists of a step for detecting the information objects that constitute P&IDs, which identifies connection relationships between the detected objects, and a step for creating digital P&IDs. This paper presents a P&ID line object extraction method that uses an improved continuous line detection algorithm to extract the information objects that constitute P&IDs. The improved continuous line detection algorithm reduces the time spent performing line extraction by edge detection that employs a differential filter. It is also used to detect continuous lines in the vertical, horizontal, and diagonal directions. Additionally, it processes diagonal continuous lines after performing image differentiation to handle short continuous lines, which are a major cause of misdetection when detecting diagonal continuous lines. The P&ID line object extraction method that incorporates this algorithm consists of three steps. The preprocessing step removes the diagram's outline borders and heading areas. Second, the detection step detects continuous lines and then detects the special signs that are needed to distinguish different types of lines. Third, the postprocessing step uses the detected line signs to identify detected continuous lines, which must be converted to other types of lines, and their types are changed. Finally, the lines and the flow arrow detection information are merged. To verify the proposed method, an image-format P&ID line extraction system prototype was implemented, and line extraction tests were conducted. In nine test P&IDs, the overall average precision and recall were 95.26 % and 91.25 %, respectively, demonstrating good line extraction performance. [ABSTRACT FROM AUTHOR]

The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore collection task. The express or ore samples come in heterogeneous shapes so they cannot all be treated as rectangular pieces. In this paper, we propose a three-stage method called covering, corner-searching and occupying (C,S&O) to solve the two-dimensional multishape part packing problem. The objective of the packing problem variant is to ensure maximum use of the raw material and minimize the trim loss. The algorithm cannot make use of information about the sequence of future objects that are going to arrive, only knowing the shape and size of the coming one, and the coming part must be packed into the bin immediately after its arrival without buffering or readjusting. The method of C,S&O hybridizes the idea of "gold corners, silver edges and grass belly" in the Chinese game Go and the method of finding picture corners in machine vision. In the first stage, the rectangular bin and the coming part are transformed into matrix representation, and generating the position matrix that indicates possible ways of packing the part into the bin. In the second stage, the suitable layout position of the coming part is obtained using machine vision image processing technology for reference. The third stage is calculating the environment matching degree to determine the current optimal placement orientation. In order to facilitate the display of the simulation results, only three shapes of parts are considered in the simulation, rectangle, circle and triangle. The experimental results show the effectiveness of this method. Consulting the literature, it is found that this paper is the first to propose a layout method for multishape manufacturing parts. [ABSTRACT FROM AUTHOR]

With the raising popularity of digital devices in the current society, the present image detection system is becoming a great threaten. Especially the appearance of the recaptured images. It can be used in traditional invalid digital image detection algorithm. There is a new algorithm in this paper is presented to detect the recaptured and real image. The algorithm obtains low-frequency images, directional filtering images and high-frequency images by multiple application frequency domain filtering. Then the proposed algorithm analyzes the directional filtering images and high-frequency images by means of LBP algorithm to extract features. At last, the recaptured images were classified by the SVM. The experimental results demonstrated the algorithm in this paper could be effectively identify in the recaptured images. [ABSTRACT FROM AUTHOR]

While network technology is convenient for our daily life, the problems that are exposed are also endless. The most important thing for everyone is information security. In order to improve the security level of network information and identify and detect faces, the method used in this paper has improved compared with the traditional AdaBoost method and skin color method. AdaBoost detection is performed on the image, which reduces the probability of false detection. The experiment compares the experimental results of the AdaBoost method, the skin color method and the skin color + AdaBoost method. All operations in the KPCA and KFDA algorithms are performed by the inner product kernel function defined in the original space, and no specific non-linear mapping function is involved.The full name of KPCA is kernel principal component analysis. The full name of KFDA is kernel Fisher discriminant analysis. Combining the zero-space method kernel discriminant analysis method improves the ability of discriminant analysis to extract non-linear features. Through the secondary extraction of PCA features, a better recognition result than the PCA method is obtained. This paper also proposes a zero-space based Fisher discriminant analysis method. Experiments show that the zero-space-based method makes full use of the useful discriminant information in the zero space of the intraclass dispersion matrix, which improves the accuracy of face recognition to some extent.If you choose the polynomial kernel function, when d = 0.8, KPCA has a higher recognition ability. When d = 2, the recognition rate of KFDA and zero space-based KFDA is the largest. For polynomial functions, in general, d = 2. [ABSTRACT FROM AUTHOR]

In this paper, the Gram matrix is used to calculate the correlation of the filter response sets under different scale kernels learned by each layer of the network in the deconvolution, and the loss between the corresponding feature response correlations in the multilayer network is calculated. Linear summation is used to obtain a stable, multiscale image model representation. This paper extracts the contours of the salient areas of the image and adjusts the parameters of the deconvolution network to learn the salient area patterns of the image. At the same time, for the image to be generated, a shape template is used to limit the range of the area to be generated in order to obtain a shape image with similar patterns. When the spatial relative relationship characteristics of the image constituent objects are obvious, we appropriately add high-level semantic feature activation values for reinforcement. This paper solves the estimation of the unknown blur kernel by using image prior knowledge, filtering and gradient domain algorithms and other different technologies to obtain image jitter or scene movement information and estimate the size, location, and density of the blur kernel. This paper studies a relatively robust deconvolution model, which is insensitive to random noise, has stable effects, and can overcome the water ripple effect caused by the usual convolution process. This paper attempts to study the fuzzy model with variable space. The usual blur is a spatial invariant model; that is, a single kernel is used to describe the motion of all pixels on the image. By selecting different characteristic parameters, this paper conducts experimental research on some existing hydrophobic indicator function methods and calculates the relationship between characteristic parameters and hydrophobicity when different hydrophobic indicator functions are adopted. One characteristic of the hydrophobic image of composite insulators is low contrast. The traditional method of converting color images to grayscale images cannot improve the image contrast. This paper analyzes the hydrophobic image of the composite insulator, and the extracted B channel component image of the hydrophobic image improves the contrast of the image and facilitates the subsequent segmentation of water traces and background. In this paper, the water repellent image's watermark area is counted, and connected-domain wave processing is used to limit the area of water droplets retained, thereby improving the efficiency of filtering water droplets without having a big impact on the image as a whole. The problem of uneven illumination is an unavoidable problem in the field of image processing, and the resulting reflection problem brings difficulties to image processing. This article regards the reflective area of the watermark as a "hole" and uses the idea of "hole filling" to eliminate the reflective point, which weakens the reflection problem to a certain extent. [ABSTRACT FROM AUTHOR]

Development of energy-efficient and high-performance bioreactors requires progress in methods for assessing the key parameters of the biosynthesis process. With a wide variety of approaches and methods for determining the phase contact area in gas–liquid flows, the question of obtaining its accurate quantitative estimation remains open. Particularly challenging are the issues of getting information about the mass transfer coefficients instantly, as well as the development of predictive capabilities for the implementation of effective flow control in continuous fermentation both on the laboratory and industrial scales. Motivated by the opportunity to explore the possibility of applying classical and non-classical computer vision methods to the results of high-precision video records of bubble flows obtained during the experiment in the bioreactor vessel, we obtained a number of results presented in the paper. Characteristics of the bioreactor's bubble flow were estimated first by classical computer vision (CCV) methods including an elliptic regression approach for single bubble boundaries selection and clustering, image transformation through a set of filters and developing an algorithm for separation of the overlapping bubbles. The application of the developed method for the entire video filming makes it possible to obtain parameter distributions and set dropout thresholds in order to obtain better estimates due to averaging. The developed CCV methodology was also tested and verified on a collected and labeled manual dataset. An onwards deep neural network (NN) approach was also applied, for instance the segmentation task, and has demonstrated certain advantages in terms of high segmentation resolution, while the classical one tends to be more speedy. Thus, in the current manuscript both advantages and disadvantages of the classical computer vision method (CCV) and neural network approach (NN) are discussed based on evaluation of bubbles' number and their area defined. An approach to mass transfer coefficient estimation methodology in virtue of obtained results is also represented. [ABSTRACT FROM AUTHOR]