Over the past two centuries, intensive empirical research has been conducted on the human brain. As an electroencephalogram (EEG) records millisecond-to-millisecond changes in the electrical potentials of the brain, it has enormous potential for identifying useful information about neuronal transactions. The EEG data can be modelled as graphs by considering the electrode sites as nodes and the linear and nonlinear statistical dependencies among them as edges (with weights). The graph theoretical modelling of EEG data results in functional brain networks (FBNs), which are fully connected (complete) weighted undirected/directed networks. Since various brain regions are interconnected via sparse anatomical connections, the weak links can be filtered out from the fully connected networks using a process called thresholding. Multiple researchers in the past decades proposed many thresholding methods to gather more insights about the influential neuronal connections of FBNs. This paper reviews various thresholding methods used in the literature for FBN analysis. The analysis showed that data-driven methods are unbiased since no arbitrary user-specified threshold is required. The efficacy of four data-driven thresholding methods, namely minimum spanning tree (MST), minimum connected component (MCC), union of shortest path trees (USPT), and orthogonal minimum spanning tree (OMST), in characterizing cognitive behavior of the normal human brain is analysed using directed FBNs constructed from EEG data of different cognitive load states. The experimental results indicate that both MCC and OMST thresholding methods can detect cognitive load-induced changes in the directed functional brain networks.

Scaling relationships are key in characterizing complex systems at criticality. In the brain, they are evident in neuronal avalanches-scale-invariant cascades of neuronal activity quantified by power laws. Avalanches manifest at the cellular level as cascades of neuronal groups that fire action potentials simultaneously. Such spatiotemporal synchronization is vital to theories on brain function yet avalanche synchronization is often underestimated when only a fraction of neurons is observed. Here, we investigate biases from fractional sampling within a balanced network of excitatory and inhibitory neurons with all-to-all connectivity and critical branching process dynamics. We focus on how mean avalanche size scales with avalanche duration. For parabolic avalanches, this scaling is quadratic, quantified by the scaling exponent, χ = 2, reflecting rapid spatial expansion of simultaneous neuronal firing over short durations. However, in networks sampled fractionally, χ is significantly lower. We demonstrate that applying temporal coarse-graining and increasing a minimum threshold for coincident firing restores χ = 2, even when as few as 0.1% of neurons are sampled. This correction crucially depends on the network being critical and fails for near sub- and supercritical branching dynamics. Using cellular 2-photon imaging, our approach robustly identifies χ = 2 over a wide parameter regime in ongoing neuronal activity from frontal cortex of awake mice. In contrast, the common \'crackling noise\' approach fails to determine χ under similar sampling conditions at criticality. Our findings overcome scaling bias from fractional sampling and demonstrate rapid, spatiotemporal synchronization of neuronal assemblies consistent with scale-invariant, parabolic avalanches at criticality.

Breast cancer is a prevalent disease and the second leading cause of death in women globally. Various imaging techniques, including mammography, ultrasonography, X-ray, and magnetic resonance, are employed for detection. Thermography shows significant promise for early breast disease detection, offering advantages such as being non-ionizing, non-invasive, cost-effective, and providing real-time results. Medical image segmentation is crucial in image analysis, and this study introduces a thermographic image segmentation algorithm using the improved Black Widow Optimization Algorithm (IBWOA). While the standard BWOA is effective for complex optimization problems, it has issues with stagnation and balancing exploration and exploitation. The proposed method enhances exploration with Levy flights and improves exploitation with quasi-opposition-based learning. Comparing IBWOA with other algorithms like Harris Hawks Optimization (HHO), Linear Success-History based Adaptive Differential Evolution (LSHADE), and the whale optimization algorithm (WOA), sine cosine algorithm (SCA), and black widow optimization (BWO) using otsu and Kapur\'s entropy method. Results show IBWOA delivers superior performance in both qualitative and quantitative analyses including visual inspection and metrics such as fitness value, threshold values, peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and feature similarity index (FSIM). Experimental results demonstrate the outperformance of the proposed IBWOA, validating its effectiveness and superiority.

The landscape of survival analysis is constantly being revolutionized to answer biomedical challenges, most recently the statistical challenge of censored covariates rather than outcomes. There are many promising strategies to tackle censored covariates, including weighting, imputation, maximum likelihood, and Bayesian methods. Still, this is a relatively fresh area of research, different from the areas of censored outcomes (i.e., survival analysis) or missing covariates. In this review, we discuss the unique statistical challenges encountered when handling censored covariates and provide an in-depth review of existing methods designed to address those challenges. We emphasize each method\'s relative strengths and weaknesses, providing recommendations to help investigators pinpoint the best approach to handling censored covariates in their data.

Research into magnetic resonance imaging (MRI)-visible perivascular spaces (PVS) has recently increased, as results from studies in different diseases and populations are cementing their association with sleep, disease phenotypes, and overall health indicators. With the establishment of worldwide consortia and the availability of large databases, computational methods that allow to automatically process all this wealth of information are becoming increasingly relevant. Several computational approaches have been proposed to assess PVS from MRI, and efforts have been made to summarise and appraise the most widely applied ones. We systematically reviewed and meta-analysed all publications available up to September 2023 describing the development, improvement, or application of computational PVS quantification methods from MRI. We analysed 67 approaches and 60 applications of their implementation, from 112 publications. The two most widely applied were the use of a morphological filter to enhance PVS-like structures, with Frangi being the choice preferred by most, and the use of a U-Net configuration with or without residual connections. Older adults or population studies comprising adults from 18 years old onwards were, overall, more frequent than studies using clinical samples. PVS were mainly assessed from T2-weighted MRI acquired in 1.5T and/or 3T scanners, although combinations using it with T1-weighted and FLAIR images were also abundant. Common associations researched included age, sex, hypertension, diabetes, white matter hyperintensities, sleep and cognition, with occupation-related, ethnicity, and genetic/hereditable traits being also explored. Despite promising improvements to overcome barriers such as noise and differentiation from other confounds, a need for joined efforts for a wider testing and increasing availability of the most promising methods is now paramount.

Vehicle identification systems are vital components that enable many aspects of contemporary life, such as safety, trade, transit, and law enforcement. They improve community and individual well-being by increasing vehicle management, security, and transparency. These tasks entail locating and extracting license plates from images or video frames using computer vision and machine learning techniques, followed by recognizing the letters or digits on the plates. This paper proposes a new license plate detection and recognition method based on the deep learning YOLO v8 method, image processing techniques, and the OCR technique for text recognition. For this, the first step was the dataset creation, when gathering 270 images from the internet. Afterward, CVAT (Computer Vision Annotation Tool) was used to annotate the dataset, which is an open-source software platform made to make computer vision tasks easier to annotate and label images and videos. Subsequently, the newly released Yolo version, the Yolo v8, has been employed to detect the number plate area in the input image. Subsequently, after extracting the plate the k-means clustering algorithm, the thresholding techniques, and the opening morphological operation were used to enhance the image and make the characters in the license plate clearer before using OCR. The next step in this process is using the OCR technique to extract the characters. Eventually, a text file containing only the character reflecting the vehicle\'s country is generated. To ameliorate the efficiency of the proposed approach, several metrics were employed, namely precision, recall, F1-Score, and CLA. In addition, a comparison of the proposed method with existing techniques in the literature has been given. The suggested method obtained convincing results in both detection as well as recognition by obtaining an accuracy of 99% in detection and 98% in character recognition.

This research paper presents a comprehensive investigation into the utilization of color image processing technologies and deep learning algorithms in the development of a robot vision system specifically designed for 8-ball billiards. The sport of billiards, with its various games and ball arrangements, presents unique challenges for robotic vision systems. The proposed methodology addresses these challenges through two main components: object detection and ball pattern recognition. Initially, a robust algorithm is employed to detect the billiard balls using color space transformation and thresholding techniques. This is followed by determining the position of the billiard table through strategic cropping and isolation of the primary table area. The crucial phase involves the intricate task of recognizing ball patterns to differentiate between solid and striped balls. To achieve this, a modified convolutional neural network is utilized, leveraging the Xception network optimized by an innovative algorithm known as the Improved Chaos African Vulture Optimization (ICAVO) algorithm. The ICAVO algorithm enhances the Xception network\'s performance by efficiently exploring the solution space and avoiding local optima. The results of this study demonstrate a significant enhancement in recognition accuracy, with the Xception/ICAVO model achieving remarkable recognition rates for both solid and striped balls. This paves the way for the development of more sophisticated and efficient billiards robots. The implications of this research extend beyond 8-ball billiards, highlighting the potential for advanced robotic vision systems in various applications. The successful integration of color image processing, deep learning, and optimization algorithms shows the effectiveness of the proposed methodology. This research has far-reaching implications that go beyond just billiards. The cutting-edge robotic vision technology can be utilized for detecting and tracking objects in different sectors, transforming industrial automation and surveillance setups. By combining color image processing, deep learning, and optimization algorithms, the system proves its effectiveness and flexibility. The innovative approach sets the stage for creating advanced and productive robotic vision systems in various industries.

The question of association between outcome and feature is generally framed in the context of a model based on functional and distributional forms. Our motivating application is that of identifying serum biomarkers of angiogenesis, energy metabolism, apoptosis, and inflammation, predictive of recurrence after lung resection in node-negative non-small cell lung cancer patients with tumor stage T2a or less. We propose an omnibus approach for testing association that is free of assumptions on functional forms and distributions and can be used as a general method. This proposed maximal permutation test is based on the idea of thresholding, is readily implementable and is computationally efficient. We demonstrate that the proposed omnibus tests maintain their levels and have strong power for detecting linear, nonlinear and quantile-based associations, even with outlier-prone and heavy-tailed error distributions and under nonparametric setting. We additionally illustrate the use of this approach in model-free feature screening and further examine the level and power of these tests for binary outcome. We compare the performance of the proposed omnibus tests with comparator methods in our motivating application to identify preoperative serum biomarkers associated with non-small cell lung cancer recurrence in early stage patients.

The thresholding problem is studied in the context of graph theoretical analysis of gene co-expression data. A number of thresholding methodologies are described, implemented, and tested over a large collection of graphs derived from real high-throughput biological data. Comparative results are presented and discussed.

This paper proposes an innovative approach for detecting and quantifying concrete cracks using an adaptive threshold method based on Median Absolute Deviation (MAD) in images. The technique applies limited pre-processing steps and then dynamically determines a threshold adapted for each sub-image depending on the greyscale distribution of the pixels, resulting in tailored crack segmentation. The edges of the crack are obtained using the Laplace edge detection method, and the width of the crack is obtained for each centreline point. The method\'s performance is measured using the Probability of Detection (POD) curves as a function of the actual crack size, revealing remarkable capabilities. It was found that the proposed method could detect cracks as narrow as 0.1 mm, with a probability of 94% and 100% for cracks with larger widths. It was also found that the method has higher accuracy, precision, and F2 score values than the Otsu and Niblack methods.