Search

Bilateral filtering is an image processing technique commonly adopted as intermediate step of several computer vision tasks. Opposite to the conventional image filtering, which is based on convolving the input pixels with a static kernel, the bilateral filtering computes its weights on the fly according to the current pixel values and some tuning parameters. Such additional elaborations involve nonlinear weighted averaging operations, which make difficult the deployment of bilateral filtering within existing vision technologies based on real-time and low-energy hardware architectures. This paper presents a new approximation strategy that aims to improve the energy efficiency of circuits implementing the bilateral filtering function, while preserving their real-time performances and elaboration accuracy. In contrast to the state-of-the-art, the proposed technique allows the filtering action to be on the fly adapted to both the current pixel values and to the tuning parameters, thus avoiding any architectural modification or tables update. When hardware implemented within the Xilinx Zynq XC7Z020 FPGA device, a 5 × 5 filter based on the proposed method processes 237.6 Mega pixels per second and consumes just 0.92 nJ per pixel, thus improving the energy efficiency by up to 2.8 times over the competitors. The impact of the proposed approximation on three different imaging applications has been also evaluated. Experiments demonstrate reasonable accuracy penalties over the accurate counterparts. [ABSTRACT FROM AUTHOR]

Superpixel segmentation is a popular preprocessing tool in the field of image processing. Nevertheless, conventional planar superpixel generation algorithms are inadequately suited for segmenting symmetrical spherical images due to the distinctive geometric differences. In this paper, we present a novel superpixel algorithm termed context identity and contour intensity (CICI) that is specifically tailored for spherical scene segmentation. By defining a neighborhood range and regional context identity, we propose a symmetrical spherical seed-sampling method to optimize both the quantity and distribution of seeds, achieving evenly distributed seeds across the panoramic surface. Additionally, we integrate the contour prior to superpixel correlation measurements, which could significantly enhance boundary adherence across different scales. By implementing the two-fold optimizations on the non-iterative clustering framework, we achieve synergistic CICI to generate higher-quality superpixels. Extensive experiments on the public dataset confirm that our work outperforms the baselines and achieves comparable results with state-of-the-art superpixel algorithms in terms of several quantitative metrics. [ABSTRACT FROM AUTHOR]

The real-time tracking of moving objects has extensive applications in various domains. Existing tracking methods typically utilize video image processing, but their performance is limited due to the high information throughput and computational requirements associated with processing continuous images. Additionally, imaging in certain spectral bands can be costly. This paper proposes a non-imaging real-time three-dimensional tracking technique for distant moving targets using single-pixel LiDAR. This novel approach involves compressing scene information from three-dimensional to one-dimensional space using spatial encoding modulation and then obtaining this information through single-pixel detection. A LiDAR system is constructed based on this method, where the peak position of the detected full-path one-dimensional echo signal is used to obtain the target distance, while the peak intensity is used to obtain the azimuth and pitch information of the moving target. The entire process requires minimal data collection and a low computational load, making it feasible for the real-time three-dimensional tracking of single or multiple moving targets. Outdoor experiments confirmed the efficacy of the proposed technology, achieving a distance accuracy of 0.45 m and an azimuth and pitch angle accuracy of approximately 0.03° in localizing and tracking a flying target at a distance of 3 km. [ABSTRACT FROM AUTHOR]

Segmenting small infrared targets presents a significant challenge for traditional image processing architectures due to the inherent lack of texture, minimal shape information, and their sparse pixel representation within images. The conventional UNet architecture, while proficient in general segmentation tasks, inadequately addresses the nuances of small infrared target segmentation due to its reliance on downsampling operations, such as pooling, which often results in the loss of critical target information. This paper introduces the Channel Spatial Attention Nested UNet (CSAN-UNet), an innovative architecture designed specifically to enhance the detection and segmentation of small infrared targets. Central to CSAN-UNet's design is the Cascaded Channel and Spatial Convolutional Attention Module (CSCAM), a novel component that adaptively enhances multi-level features and mitigates the loss of target information attributable to downsampling processes. Additionally, the Channel-priority and Spatial Attention Cascade Module (CPSAM) represents another pivotal advancement within CSAN-UNet, prioritizing channel-level adjustments alongside spatial attention mechanisms to efficiently extract deep semantic information pertinent to small infrared targets. Empirical validation conducted on two public datasets confirms that CSAN-UNet surpasses existing state-of-the-art algorithms in segmentation performance, while simultaneously reducing computational overhead. [ABSTRACT FROM AUTHOR]

Few-shot segmentation (FSS) is a cutting-edge technology that can meet requirements using a small workload. With the development of China Aerospace Engineering, FSS plays a fundamental role in astronaut working scene (AWS) intelligent parsing. Although mainstream FSS methods have made considerable breakthroughs in natural data, they are not suitable for AWSs. AWSs are characterized by a similar foreground (FG) and background (BG), indistinguishable categories, and the strong influence of light, all of which place higher demands on FSS methods. We design a pixel-wise and class-wise network (PCNet) to match support and query features using pixel-wise and class-wise semantic cues. Specifically, PCNet extracts pixel-wise semantic information at each layer of the backbone using novel cross-attention. Dense prototypes are further utilized to extract class-wise semantic cues as a supplement. In addition, the deep prototype is distilled in reverse to the shallow layer to improve its quality. Furthermore, we customize a dataset for AWSs and conduct abundant experiments. The results indicate that PCNet outperforms the published best method by 4.34% and 5.15% in accuracy under one-shot and five-shot settings, respectively. Moreover, PCNet compares favorably with the traditional semantic segmentation model under the 13-shot setting. [ABSTRACT FROM AUTHOR]

In order to balance accuracy and real‐time performance in semantic segmentation, this paper proposes a real‐time semantic segmentation algorithm model based on attention mechanism and multi‐branch feature fusion using Fast convolutional neural network model (Fast‐SCNN). In this method, the spatial detail feature enhancement branch is introduced to enhance spatial detail features firstly. Then, through rational design of fusion module, the feature information of each branch is optimized to achieve better fusion of deep and shallow features. At the end of the feature fusion module, an adaptive feature enhancement focus module is introduced to capture the interdependence between remote pixels. The experimental results show that the proposed algorithm achieves 71.55% segmentation accuracy on Cityscapes dataset, the reasoning speed FPS is 97.6 frames/s, and the number of parameters is 1.39 M, which verifies the effectiveness of the network model constructed by the algorithm. Code is available at https://github.com/ccchhheeennn/model. [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]

The canopy height model (CHM) derived from LiDAR point cloud data is usually used to accurately identify the position and the canopy dimension of single tree. However, local invalid values (also called data pits) are often encountered during the generation of CHM, which results in low-quality CHM and failure in the detection of treetops. For this reason, this paper proposes an innovative method, called "pixels weighted differential gradient", to filter these data pits accurately and improve the quality of CHM. First, two characteristic parameters, gradient index (GI) and Z-score value (ZV) are extracted from the weighted differential gradient between the pit pixels and their eight neighbors, and then GIs and ZVs are commonly used as criterion for initial identification of data pits. Secondly, CHMs of different resolutions are merged, using the image processing algorithm developed in this paper to distinguish either canopy gaps or data pits. Finally, potential pits were filtered and filled with a reasonable value. The experimental validation and comparative analysis were carried out in a coniferous forest located in Triangle Lake, United States. The experimental results showed that our method could accurately identify potential data pits and retain the canopy structure information in CHM. The root-mean-squared error (RMSE) and mean bias error (MBE) from our method are reduced by between 73% and 26% and 76% and 28%, respectively, when compared with six other methods, including the mean filter, Gaussian filter, median filter, pit-free, spike-free and graph-based progressive morphological filtering (GPMF). The average F1 score from our method could be improved by approximately 4% to 25% when applied in single-tree extraction. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a novel panoptic segmentation method called the Mask-Pyramid Network. Existing Mask RCNN-based methods first generate a large number of box proposals and then filter them at each feature level, which requires a lot of computational resources, while most of the box proposals are suppressed and discarded in the Non-Maximum Suppression process. Additionally, for panoptic segmentation, it is a problem to properly fuse the semantic segmentation results with the Mask RCNN-produced instance segmentation results. To address these issues, we propose a new mask pyramid mechanism to distinguish objects and generate much fewer proposals by referring to existing segmented masks, so as to reduce computing resource consumption. The Mask-Pyramid Network generates object proposals and predicts masks from larger to smaller sizes. It records the pixel area occupied by the larger object masks, and then only generates proposals on the unoccupied areas. Each object mask is represented as a H × W × 1 logit, which fits well in format with the semantic segmentation logits. By applying SoftMax to the concatenated semantic and instance segmentation logits, it is easy and natural to fuse both segmentation results. We empirically demonstrate that the proposed Mask-Pyramid Network achieves comparable accuracy performance on the Cityscapes and COCO datasets. Furthermore, we demonstrate the computational efficiency of the proposed method and obtain competitive results. [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]

Reversible data hiding (RDH) is a technique that embeds secret data into digital media while preserving the integrity of the original media and the secret data. RDH has a wide range of application scenarios in industrial image processing, such as intellectual property protection and data integrity verification. However, with the increasing prevalence of color images in industrial applications, traditional RDH methods for grayscale images are inadequate to meet the requirements of image fidelity. This paper proposes an RDH method for color images based on channel reference mapping (CRM) and adaptive pixel prediction. Initially, the CRM mode for a color image is established based on the pixel variation correlation between the RGB channels. Then, the pixel local complexity context is adaptively selected using the CRM mode. Next, each pixel value is adaptively predicted based on the features and characteristics of adjacent pixels and reference channels, and then data is embedded by expanding the prediction error. Finally, we compare seven existing RDH algorithms on the standard image dataset and the Kodak dataset to validate the advantages of our method. The experimental results demonstrate that our approach achieves average peak signal-to-noise ratio (PSNR) values of 63.61 and 60.53 dB when embedding 20,000 and 40,000 bits of data, respectively. These PSNR values surpass those of other RDH methods. These findings indicate that our method can effectively preserve the visual quality of images even under high embedding capacities. [ABSTRACT FROM AUTHOR]

Crab aquaculture is an important component of the freshwater aquaculture industry in China, encompassing an expansive farming area of over 6000 km2 nationwide. Currently, crab farmers rely on manually monitored feeding platforms to count the number and assess the distribution of crabs in the pond. However, this method is inefficient and lacks automation. To address the problem of efficient and rapid detection of crabs via automated systems based on machine vision in low-brightness underwater environments, a two-step color correction and improved dark channel prior underwater image processing approach for crab detection is proposed in this paper. Firstly, the parameters of the dark channel prior are optimized with guided filtering and quadtrees to solve the problems of blurred underwater images and artificial lighting. Then, the gray world assumption, the perfect reflection assumption, and a strong channel to compensate for the weak channel are applied to improve the pixels of red and blue channels, correct the color of the defogged image, optimize the visual effect of the image, and enrich the image information. Finally, ShuffleNetV2 is applied to optimize the target detection model to improve the model detection speed and real-time performance. The experimental results show that the proposed method has a detection rate of 90.78% and an average confidence level of 0.75. Compared with the improved YOLOv5s detection results of the original image, the detection rate of the proposed method is increased by 21.41%, and the average confidence level is increased by 47.06%, which meets a good standard. This approach could effectively build an underwater crab distribution map and provide scientific guidance for crab farming. [ABSTRACT FROM AUTHOR]

The digital image method of monitoring structural displacement is receiving more attention today, especially in non-contact structure health monitoring. Some obvious advantages of this method, such as economy and convenience, were shown while it was used to monitor the deformation of the bridge structure during the service period. The image processing technology was used to extract structural deformation feature information from surveillance video images containing structural displacement in order to realize a new non-contact online monitoring method in this paper. The influence of different imaging distances and angles on the conversion coefficient (η) that converts the pixel coordinates to the actual displacement was first studied experimentally. Then, the measuring and tracking of bridge structural displacement based on surveillance video images was investigated by laboratory-scale experiments under idealized conditions. The results showed that the video imaging accuracy can be affected by changes in the relative position of the imaging device and measured structure, which is embodied in the change in η (actual size of individual pixel) on the structured image. The increase in distance between the measured structure and the monitoring equipment will have a significant effect on the change in the η value. The value of η varies linearly with the change in shooting distance. The value of η will be affected by the changes in shooting angle. The millimeter-level online monitoring of the structure displacement can be realized using images based on surveillance video images. The feasibility of measuring and tracking structural displacement based on surveillance video images was confirmed by a laboratory-scale experiment. [ABSTRACT FROM AUTHOR]

In image processing, problems of separation and reconstruction of missing pixels from incomplete digital images have been far more advanced in past decades. Many empirical results have produced very good results; however, providing a theoretical analysis for the success of algorithms is not an easy task, especially, for inpainting and separating multi-component signals. In this paper, we propose two main algorithms based on l 1 constrained and unconstrained minimization for separating N distinct geometric components and simultaneously filling in the missing part of the observed image. We then present a theoretical guarantee for these algorithms using compressed sensing technique, which is based on a principle that each component can be sparsely represented by a suitably chosen dictionary. Those sparsifying systems are extended to the case of general frames instead of Parseval frames which have been typically used in the past. We finally prove that the method does indeed succeed in separating point singularities from curvilinear singularities and texture as well as inpainting the missing band contained in curvilinear singularities and texture. [ABSTRACT FROM AUTHOR]

Despite the recent upsurge of self‐supervised methods in single image denoising, achieving robustness and efficiency of performance is still challenging due to some prevalent issues like identity mapping, overfitting, and increased variance of network predictions. Recent self‐supervised approaches prescribe a dropout‐based single‐pixel masking strategy in this regard. However, real camera noise is signal‐dependent, and typically poses trivial changes to the images. Hence, such a strategy still preserves contextual information about target location even after dropping them out, leading to an identity mapping and overfitting problems in practice. Here, Cut2Self, a new denoising method to address this issue, which cuts out random block‐regions instead of singleton pixels to provide the higher possibility to remove contextual information from the neighbouring pixels, thus reducing identity mapping chances while being resilient against overfitting is proposed. Cut2Self creates distinct training pairs for each training iteration by randomly cutting out square regions of input and sending them to the denoising network. Thus, iteration‐wise different network predictions are generated, which are then assembled to generate the final denoised output. Cut2Self is evaluated with synthetic and real‐world noise, visualising its consistent denoising performance compared to other supervised, unsupervised, and self‐supervised methods. [ABSTRACT FROM AUTHOR]

This study proposed enhanced U-Net with GridMask (EUGNet) image augmentation techniques focused on pixel manipulation, emphasizing GridMask augmentation. This study introduces EUGNet, which incorporates GridMask augmentation to address U-Net's limitations. EUGNet features a deep contextual encoder, residual connections, class-balancing loss, adaptive feature fusion, GridMask augmentation module, efficient implementation, and multi-modal fusion. These innovations enhance segmentation accuracy and robustness, making it well-suited for medical image analysis. The GridMask algorithm is detailed, demonstrating its distinct approach to pixel elimination, enhancing model adaptability to occlusions and local features. A comprehensive dataset of robotic surgical scenarios and instruments is used for evaluation, showcasing the framework's robustness. Specifically, there are improvements of 1.6 percentage points in balanced accuracy for the foreground, 1.7 points in intersection over union (IoU), and 1.7 points in mean Dice similarity coefficient (DSC). These improvements are highly significant and have a substantial impact on inference speed. The inference speed, which is a critical factor in real-time applications, has seen a noteworthy reduction. It decreased from 0.163 milliseconds for the U-Net without GridMask to 0.097 milliseconds for the U-Net with GridMask. [ABSTRACT FROM AUTHOR]

Superpixel segmentation can get the middle features in image processing, effectively reduce the dimensionality of the image, and is widely used in image processing fields. To get the regular and compact superpixels in real-time, a superpixel segmentation algorithm based on image density is proposed in this paper. Firstly, the image is uniformly divided according to the number of superpixels to be obtained. Secondly, to get the clustering ability of the pixels, the density image is produced. Thirdly, the seed is chosen in each sub-region block according to the density and then the superpixels are obtained by clustering. During the clustering process, the pixel around the seed should be added into the superpixel if it meets the conditions, and the small supeipixels are merged into the big superpixels around them. Finally, the result shows that the proposed algorithm has the best segmentation effect, and a good balance in accuracy, regularity, and time cost. [ABSTRACT FROM AUTHOR]

Quantum image processing is an emerging topic in the field of quantum information and technology. In this paper, we propose a new quantum image representation of RGB images with deterministic image retrieval, which is an improvement over all the similar existing representations in terms of using minimum resource. We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. Additionally, we generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems than qubits. We then describe the image encoding method using higher-order qubit-qutrit gates, and demonstrate the decomposition of these gates in terms of simpler elementary gates. We use the Google Cirq's quantum simulator to verify the image preparation in both the ideal noise-free scenario and in presence of realistic noise modelling. We show that the complexity of the image encoding process is linear in the number of pixels. Lastly, we discuss the image compression and some basic RGB image processing protocols using our representation. [ABSTRACT FROM AUTHOR]

The recovery of semantics from corrupted images is a significant challenge in image processing. Noise can obscure features, interfere with accurate analysis, and bias results. To address this issue, the Regularized Neighborhood Pixel Similarity Wavelet algorithm (PixSimWave) was developed for denoising Nifti (magnetic resonance imaging (MRI)). The PixSimWave algorithm uses regularized pixel similarity detection to improve the accuracy of noise reduction by creating patches to analyze the intensity of pixels and locate matching pixels, as well as adaptive neighborhood filtering to estimate noisy pixel values by allocating each pixel a weight based on its similarity. The wavelet transform breaks down the image into scales and orientations, allowing a sparse image representation to allocate a soft threshold on its similarity to the original pixels. The proposed method was evaluated on simulated and raw T1w MRIs, outperforming other methods in terms of an SSIM value of 0.9908 for a low Rician noise level of 3% and 0.9881 for a high noise level of 17%. The addition of Gaussian noise improved PSNR and SSIM, with the results indicating that the proposed method outperformed other models while preserving edges and textures. In summary, the PixSimWave algorithm is a viable noise-elimination approach that employs both sparse wavelet coefficients and regularized similarity with decreased computation time, improving the accuracy of noise reduction in images. [ABSTRACT FROM AUTHOR]

To address the problem of water surface detection imaging equipment being susceptible to water surface glints, this study demonstrates a method called De-Glints for suppressing glints and obtaining clear underwater images using a division of focal plane (DoFP) polarimeter. Based on the principle of polarization imaging, the best polarization angle and the image corresponding to the minimal average gray level of each pixel are calculated. To evaluate the improvement in image quality, the index E was designed. The results of indoor and outdoor experiments show that the error of the angle calculation of this method is within 10%, and the minimum error is only 3%. The E index is positively improved and can be relatively improved by 8.00 under the interference of strong outdoor glints, and the method proposed in this paper shows a good adaptive ability to the dynamic scene. [ABSTRACT FROM AUTHOR]

Homography estimation serves an important role in many computer vision tasks. Depending heavily on hand‐craft feature quality, traditional methods degenerate sharply in scenes with low texture. Existing deep homography methods can handle the low‐texture problem but are not robust for scenes with low overlap rates and/or illumination changes. This paper proposes a novel unsupervised homography estimation method that can simultaneously handle such low overlap and illumination change. Specifically, a powerful module, named global transformer contextual encoder (GTCE) is first designed, together with a correlation encoder to effectively aggregate global contextual information and reduce matching ambiguity between feature maps. Moreover, a hybrid photo‐perceptual loss for unsupervised homography estimation is proposed. The proposed loss function considers alignment information on both pixel level and perceptual level thus helping this network to be more adaptive to various scenes, including normal cases and illumination change cases. The results of extensive experiments on synthetic and real‐world datasets demonstrate the superiority of this proposed method over current state‐of‐the‐art solutions especially on challenging scenes with low overlap rates, repetitive patterns and illumination changes. [ABSTRACT FROM AUTHOR]

Visual saliency refers to the human's ability to quickly focus on important parts of their visual field, which is a crucial aspect of image processing, particularly in fields like medical imaging and robotics. Understanding and simulating this mechanism is crucial for solving complex visual problems. In this paper, we propose a salient object detection method based on boundary enhancement, which is applicable to both 2D and 3D sensors data. To address the problem of large-scale variation of salient objects, our method introduces a multi-level feature aggregation module that enhances the expressive ability of fixed-resolution features by utilizing adjacent features to complement each other. Additionally, we propose a multi-scale information extraction module to capture local contextual information at different scales for back-propagated level-by-level features, which allows for better measurement of the composition of the feature map after back-fusion. To tackle the low confidence issue of boundary pixels, we also introduce a boundary extraction module to extract the boundary information of salient regions. This information is then fused with salient target information to further refine the saliency prediction results. During the training process, our method uses a mixed loss function to constrain the model training from two levels: pixels and images. The experimental results demonstrate that our salient target detection method based on boundary enhancement shows good detection effects on targets of different scales, multi-targets, linear targets, and targets in complex scenes. We compare our method with the best method in four conventional datasets and achieve an average improvement of 6.2% on the mean absolute error (MAE) indicators. Overall, our approach shows promise for improving the accuracy and efficiency of salient object detection in a variety of settings, including those involving 2D/3D semantic analysis and reconstruction/inpainting of image/video/point cloud data. [ABSTRACT FROM AUTHOR]

Superpixel segmentation has been widely used in computer vision as a preprocessing to reduce the number of image primitives for subsequent image processing tasks. Simple Linear Iterative Clustering (SLIC) is the most popular superpixel segmentation algorithm in the literature, which is an iterative algorithm. The basic SLIC technique includes two main steps named Assignment and Update steps, and their data dependency is the main problem to speed up execution of the basic SLIC algorithm. It is also well known that this algorithm is not memory efficient, which is the main bottleneck in applying basic SLIC in low-power applications. In this paper, we have proposed a new structure for SLIC implementation. This new structure replaces the cluster-based search operation with pixel-based process in the Assignment step that gains considerable speed improvement. This new technique simply removes the data dependency in the SLIC structure. In the proposed method, the distance index, the main parameter computed in the Assignment step, no longer is needed to be stored in memory. This leads to a significant improvement in the memory efficiency of the proposed structure. The proposed structure is implemented on the Virtex-5 FPGA family, and the results show about 26 % in memory improvement compared to basic SLIC. According to the implementation results, the proposed technique process 143 frames per second for an input image of 300 × 400 pixel resolution which is far faster than real-time process requirements. [ABSTRACT FROM AUTHOR]

Anomaly detection is a crucial task for hyperspectral image processing. Most popular methods detect anomalies at the pixel level, while a few algorithms for anomaly detection only utilize subpixel level unmixing technology to extract features without fundamentally analyzing the anomalies. To better detect and separate the anomalies from the background, this paper proposes a dual-view hyperspectral anomaly detection method by taking account of the anomaly analysis at both levels mentioned. At the pixel level, the spectral angular distance is adopted to calculate the similarities between the central pixel and its neighbors in order to further mine the spatial consistency for anomaly detection. On the other hand, from the aspect of the subpixel level analysis, it is considered that the difference between the anomaly and the background usually arises from dissimilar endmembers, where the unmixing will be fully implemented. Finally, the detection results of both views are fused to obtain the anomalies. Overall, the proposed algorithm not only interprets and analyzes the anomalies from dual levels, but also fully employs the unmixing for anomaly detection. Additionally, the performance of multiple data sets also confirmed the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Background: Erythema, characterized by redness of the skin, is a common symptom in various facial skin conditions. Recent advancements in image processing and analysis techniques have led to the development of methods for analyzing and assessing skin texture. This study aimed to investigate the correlation between the parameters of "You Look Good Today" (YLGTD) and VISIA in the detection and assessment of facial redness. Materials and Methods: Thirty female subjects participated in this experiment, undergoing assessments using both YLGTD and VISIA. The subjects were evaluated for facial redness, and the feature count results within the red zone were measured by VISIA. YLGTD analyzed the number and percentage of red zone pixels. The assessments were conducted between [specific dates] in [location]. Results: The results demonstrated a significant positive correlation between the feature count results within the red zone measured by VISIA and the number of red zone pixels. Similarly, YLGTD exhibited a significant positive correlation with the number and percentage of red zone pixels. Conclusion: In conclusion, our findings suggest a correlation between YLGTD and VISIA in the measurement of facial erythema. YLGTD can serve as a portable device for primary screening assessments, offering a convenient and reliable method to evaluate facial redness. This research contributes to the development of non‐invasive techniques for assessing and monitoring facial skin conditions, providing valuable insights for dermatological diagnosis and cosmetic testing. [ABSTRACT FROM AUTHOR]

The problem that the texture details of low‐resolution (LR) digital images of ancient murals are ambiguous persists. To solve this problem, this study proposes a super‐resolution (SR) reconstruction method for fuzzy murals based on a generative adversarial network with self‐attention (SA). The network uses a blur kernel and realistic noise data to add blur and noise, respectively, to a high‐resolution (HR) image to obtain an original LR image. Then, a feature image with the same size as that of the input image is obtained through a SA module. Finally, the feature information extracted from the image is input into the high‐resolution image space by using a subpixel convolution layer to realize the image enlargement process from an LR to an HR. Experiments evaluate the proposed approach both objectively and subjectively. The objective evaluation results show that compared with other SR reconstruction algorithms, the proposed algorithm's peak signal‐to‐noise ratio (PSNR) is increased by 0.04 to 3.78 dB on average, and its structural similarity is increased by 0.002 to 0.191. A subjective perception evaluation shows that the developed algorithm can better reconstruct the texture details of murals, thus better meeting the visual perception needs of the public. The method proposed in this study can satisfactorily reconstruct the texture details of murals, which may provide technical guidance for the development of mural protection plans. Furthermore, it may be of certain practical significance for the SR reconstruction of ancient murals. [ABSTRACT FROM AUTHOR]

Relating image contours and regions and their attributes according to connectivity based on incidence or adjacency is a crucial task in numerous applications in the fields of image processing, computer vision and pattern recognition. In this paper, the crucial incidence topological information of 2-dimensional images is extracted in an efficient manner through the computation of a new structure called the HomDuRAG of an image; that is, the dual graph of the HomRAG (a topologically consistent extended version of the classical RAG). These representations are derived from the two traditional self-dual square grids (in which physical pixels play the role of 2-dimensional cells) and encapsulate the whole set of topological features and relations between the three types of objects embedded in a digital image: 2-dimensional (regions), 1-dimensional (contours) and 0-dimensional objects (crosses). Here, a first version of a fully parallel algorithm to compute this new representation is presented, whose timing complexity order (in the worst case and supposing one processing element per 0-cell) is O (l o g (M × N)) , M and N being the height and width of the image. Efficient implementations of this parallel algorithm would allow images to be processed in real time, as well as permit us to uncover fast algorithms for contour detection and segmentation, opening new perspectives within the image processing field. [ABSTRACT FROM AUTHOR]

Three dimensional (3D) echocardiogram enables cardiologists to visualize suspicious cardiac structures in detail. In recent years, this three-dimensional echocardiogram carries important clinical value in virtual surgical simulation. However, this 3D echocardiogram involves a trade-off difficulty between accuracy and efficient computation in clinical diagnosis. This paper presents a novel Flip Directional 3D Volume Reconstruction (FD-3DVR) method for the reconstruction of echocardiogram images. The proposed method consists of two main steps: multiplanar volumetric imaging and 3D volume reconstruction. In the creation of multiplanar volumetric imaging, two-dimensional (2D) image pixels are mapped into voxels of the volumetric grid. As the obtained slices are discontinuous, there are some missing voxels in the volume data. To restore the structural and textural information of 3D ultrasound volume, the proposed method creates a volume pyramid in parallel with the flip directional texture pyramid. Initially, the nearest neighbors of missing voxels in the multiplanar volumetric imaging are identified by 3D ANN (Approximate Nearest Neighbor) patch matching method. Furthermore, a flip directional texture pyramid is proposed and aggregated with distance in patch matching to find out the most similar neighbors. In the reconstruction step, structural and textural information obtained from different flip angle directions can reconstruct 3D volume well with the desired accuracy. Compared with existing 3D reconstruction methods, the proposed Flip Directional 3D Volume Reconstruction (FD-3DVR) method provides superior performance for the mean peak signal-to-noise ratio (40.538 for the proposed method I and 39.626 for the proposed method II). Experimental results performed on the cardiac datasets demonstrate the efficiency of the proposed method for the reconstruction of echocardiogram images. [ABSTRACT FROM AUTHOR]

Various techniques were combined to optimize an optical inspection system designed to automatically inspect defects in manufactured paper bowls. A self-assembled system was utilized to capture images of defects on the bowls. The system employed an image sensor with a multi-pixel array that combined a complementary metal-oxide semiconductor and a photo detector. A combined ring light served as the light source, while an infrared (IR) LED matrix panel was used to provide constant IR light to highlight the outer edges of the objects being inspected. The techniques employed in this study to enhance defect inspections on produced paper bowls included Gaussian filtering, Sobel operators, binarization, and connected components. Captured images were processed using these technologies. Once the non-contact inspection system's machine vision method was completed, defects on the produced paper bowls were inspected using the system developed in this study. Three inspection methods were used in this study: internal inspection, external inspection, and bottom inspection. All three methods were able to inspect surface features of produced paper bowls, including dirt, burrs, holes, and uneven thickness. The results of our study showed that the average time required for machine vision inspections of each paper bowl was significantly less than the time required for manual inspection. Therefore, the investigated machine vision system is an efficient method for inspecting defects in fabricated paper bowls. [ABSTRACT FROM AUTHOR]

Aiming at the problems of high cleaning intensity, low efficiency, and hidden safety hazards of high-altitude curtain walls, this study proposes that the image processing method is a kind of image processing technology in human-computer collaborative visual design. The algorithm uses generalized mapping to scramble the picture and then expands and replaces the scrambled pictures one by one through the image processing technical support system. Studies have shown that this calculation method has mixed pixel values, good diffusion performance, and strong resistance performance. The pixel distribution of the processed image is relatively random, and the features of similar loudness are not relevant. It is proved through experiments that the above calculation methods have strong safety performance. [ABSTRACT FROM AUTHOR]

In this era of rapid information exchange in public networks, there is a risk to information security. Data hiding is an important technique for privacy protection. Image interpolation is an important data-hiding technique in image processing. This study proposed a method called neighbor mean interpolation by neighboring pixels (NMINP) that calculates a cover image pixel by neighbor mean interpolation and neighboring pixels. To reduce image distortion, NMINP limits the number of bits when embedding secret data, making NMINP have a higher hiding capacity and peak signal-to-noise ratio (PSNR) than other methods. Furthermore, in some cases, the secret data are flipped, and the flipped data are treated in ones' complement format. A location map is not needed in the proposed method. Experimental results comparing NMINP with other state-of-the-art methods show that NMINP improves the hiding capacity by more than 20% and PSNR by 8%. [ABSTRACT FROM AUTHOR]

Three-dimensional film images which are recently developed are seen as three-dimensional using the angle, amount, and viewing position of incident light rays. However, if the pixel contrast of the image is low or the patterns are cloudy, it does not look three-dimensional, and it is difficult to perform a quality inspection because its detection is not easy. In addition, the inspection method has not yet been developed since it is a recently developed product. To solve this problem, we propose a method to calculate the width of pixels for a specific height from the image histogram of a 3D film image and classify it based on a threshold. The proposed algorithm uses the feature that the widths of pixels by height in the image histogram of the good 3D film image are wider than the image histogram of the bad 3D film image. In the experiment, it was confirmed that the position of the height section of the image histogram has the highest classification accuracy. Through comparison tests with conventional algorithms, we showed excellent classification accuracy for 3D film image classification. We verified that it is possible with high accuracy even if the image's contrast is low and the patterns in the image are not detected. [ABSTRACT FROM AUTHOR]

In medical science for envisaging human body's phenomenal structure a major part has been driven by image processing techniques. Major objective of this work is to detect of cerebral atherosclerosis for image segmentation application. Detection of some abnormal structures in human body has become a difficult task to complete with some simple images. For expounding and distinguishing neural architecture of human brain in an effective manner, MRI (Magnetic Resonance Imaging) is one of the most suitable and significant technique. Here we work on detection of Cerebral Atherosclerosis from MRI images of patients. Cerebral Atherosclerosis is a cerebral vascular disease causes narrowing of the arteries due to buildup of fatty plaque inside the blood vessels of the brain. It leads to Ischemic stroke if not diagnosed early. Stroke affects majorly old age people and percentage of affected women is more compared to men. Results: Preprocessing is done by using alpha trimmed mean filter which is used to remove noise and also it enhances the image. Segmentation of cerebral atherosclerosis is done by using K-means clustering, Contextual clustering, and proposed Hybrid algorithm. Various parameters like Correlation, Pixel density, energy is determined and from the analysis of parameters it is determined that proposed Hybrid algorithm is efficient. [ABSTRACT FROM AUTHOR]

The existing infrared image processing technology mainly relies on the traditional segmentation algorithm, which is not only inefficient, but also has problems such as blurred edges, poor segmentation accuracy, and insufficient extraction of key power equipment features for the infrared image defect segmentation of power equipment. A CS_DeeplabV3+ network for the accurate segmentation of the infrared image defect segmentation of power equipment is designed for the situation of leakage and false detection after segmentation by traditional algorithms. The ASPP module is improved in the encoder part to enable the network to obtain a denser pixel sampling, an improved attention mechanism is introduced to enhance the sensitivity and accuracy of the network for feature extraction, and a semantic segmentation feature enhancement module—the structured feature enhancement module (SFEM)—is introduced in the decoder part to enhance the feature processing to improve the segmentation accuracy. The CS_DeeplabV3+ network is validated using the dataset, and the experimental comparison proves that the improved model has finer contours compared with other models for segmenting infrared images of power equipment defects, and MPA is improved by 5.6% and MIOU is improved by 7.3% compared with the DeeplabV3+ network. [ABSTRACT FROM AUTHOR]

This research article is aimed at improving the efficiency of a computer vision system that uses image processing for detecting cracks. Images are prone to noise when captured using drones or under various lighting conditions. To analyze this, the images were gathered under various conditions. To address the noise issue and to classify the cracks based on the severity level, a novel technique is proposed using a pixel-intensity resemblance measurement (PIRM) rule. Using PIRM, the noisy images and noiseless images were classified. Then, the noise was filtered using a median filter. The cracks were detected using VGG-16, ResNet-50 and InceptionResNet-V2 models. Once the crack was detected, the images were then segregated using a crack risk-analysis algorithm. Based on the severity level of the crack, an alert can be given to the authorized person to take the necessary action to avoid major accidents. The proposed technique achieved a 6% improvement without PIRM and a 10% improvement with the PIRM rule for the VGG-16 model. Similarly, it showed 3 and 10% for ResNet-50, 2 and 3% for Inception ResNet and a 9 and 10% increment for the Xception model. When the images were corrupted from a single noise alone, 95.6% accuracy was achieved using the ResNet-50 model for Gaussian noise, 99.65% accuracy was achieved through Inception ResNet-v2 for Poisson noise, and 99.95% accuracy was achieved by the Xception model for speckle noise. [ABSTRACT FROM AUTHOR]

One of the most important retinal diseases is Diabetic Retinopathy (DR) which can lead to serious damage to vision if remains untreated. Red-lesions are from important demonstrations of DR helping its identification in early stages. The detection and verification of them is helpful in the evaluation of disease severity and progression. In this paper, a novel image processing method is proposed for extracting red-lesions from fundus images. The method works based on finding and extracting the unique morphological features of red-lesions. After quality improvement of images, a pixel-based verification is performed in the proposed method to find the ones which provide a significant intensity change in a curve-like neighborhood. In order to do so, a curve is considered around each pixel and the intensity changes around the curve boundary are considered. The pixels for which it is possible to find such curves in at least two directions are considered as parts of red-lesions. The simplicity of computations, the high accuracy of results, and no need to post-processing operations are the important characteristics of the proposed method endorsing its good performance. [ABSTRACT FROM AUTHOR]

Manual peeling of Poria cocos has low efficiency and large loss, and other peeling methods are not suitable for Poria cocos peeling. To solve this problem, this study designed and fabricated a set of automatic peeling equipment for Poria cocos, which combined image processing technology with the structure and function of the vertical milling machine. This paper mainly reports the image detection algorithm of Poria cocos epidermis position for automatic peeling. Firstly, the blue marks were glued to the movable and the immovable parts of clamping parts, and the initial window was determined through them. Then, the grayscale image within the initial window was obtained with the help of the chromatic aberration |2r－g－b| (red (r), green (g), blue (b) of pixels). The processing window was calculated with the aid of the distribution graph of the grayscale accumulation. Next, the grayscale image was taken into the process of the automatic binarization based on the Otsu method and the binary image was restored through dilation, erosion and denoising algorithm. Finally, pixel columns in the processing window were scanned column-by-column from the left to the right and the direction of each pixel column is from the bottom to the top. The first pixel with a value of 0 on each pixel column was set as the epidermis position of the current pixel column. The experiment results implied that, under the set light source, the average detection accuracy was 98.8%, and the average time to detect epidermis position once was 0.024 s. The detection accuracy and real-time performance of this algorithm meets the actual operation requirements of Poria cocos peeling. It lays the foundation for the automatic peeling operation of Poria cocos. [ABSTRACT FROM AUTHOR]

In ship detection by means of Polarimetric SAR imagery, a very promising feature is the characterization of the pixels of the ship based on the elementary scattering mechanisms that can be extracted using different decomposition algorithms. Elementary scattering mechanisms provide information regarding the physical, electrical and geometrical properties of the scatterers in each Polarimetric SAR pixel. In this work, the newly established algorithm of the Double Scatterer Model is applied to interpret each pixel of the Polarimetric SAR image with the contributions of two elementary scattering mechanisms, namely, primary and secondary. The main idea is to construct a binary image while preserving the rich information content in order to proceed in simple and fast image processing for target detection. The present algorithm is applied to datasets with different inherent characteristics acquired by Radarsat-2 and ALOS-PALSAR. The results presented by this new perspective on ship monitoring are remarkable. [ABSTRACT FROM AUTHOR]

Deep learning methods have achieved outstanding results in many image processing and computer vision tasks, such as image segmentation. However, they usually do not consider spatial dependencies among pixels/voxels in the image. To obtain better results, some methods have been proposed to apply classic spatial regularization, such as total variation, into deep learning models. However, for some challenging images, especially those with fine structures and low contrast, classical regularizations are not suitable. We derived a new regularization to improve the connectivity of segmentation results and make it applicable to deep learning. Our experimental results show that for both deep learning methods and unsupervised methods, the proposed method can improve performance by increasing connectivity and dealing with low contrast and, therefore, enhance segmentation results. [ABSTRACT FROM AUTHOR]

Hyperspectral Imaging (HSI) is increasingly adopted in medical applications for the usefulness of understanding the spectral signature of specific organic and non-organic elements. The acquisition of such images is a complex task, and the commercial sensors that can measure such images is scarce down to the point that some of them have limited spatial resolution in the bands of interest. This work proposes an approach to enhance the spatial resolution of hyperspectral histology samples using super-resolution. As the data volume associated to HSI has always been an inconvenience for the image processing in practical terms, this work proposes a relatively low computationally intensive algorithm. Using multiple images of the same scene taken in a controlled environment (hyperspectral microscopic system) with sub-pixel shifts between them, the proposed algorithm can effectively enhance the spatial resolution of the sensor while maintaining the spectral signature of the pixels, competing in performance with other state-of-the-art super-resolution techniques, and paving the way towards its use in real-time applications. [ABSTRACT FROM AUTHOR]

Image super-resolution (SR), as one of the classic image processing issues, has attracted increasing attention from researchers. As a highly ill-conditioned, non-convex optimization issue, it is difficult for image SR to restore a high-resolution (HR) image from a given low-resolution (LR) instance. Recent researchers have tended to regard image SR as a regression task and to design an end-to-end convolutional neural network (CNN) to predict the pixels directly, which lacks inherent theoretical analysis and limits the effectiveness of the restoration. In this paper, we analyze image SR from an optimization perspective and develop a deep successive convex approximation network (SCANet) for generating HR images. Specifically, we divide non-convex optimization into several convex LASSO sub-problems and use CNN to adaptively learn the parameters. To boost network representation, we use residual feature aggregation (RFA) blocks and devise a spatial and channel attention (SACA) mechanism to improve the restoration capacity. The experimental results show that the proposed SCANet can restore HR images more effectively than other works. Specifically, SCANet achieves higher PSNR/SSIM results and generates more satisfying textures. [ABSTRACT FROM AUTHOR]

Hyperspectral-image (HSI) restoration plays an essential role in remote sensing image processing. Recently, superpixel segmentation-based the low-rank regularized methods for HSI restoration have shown outstanding performance. However, most of them simply segment the HSI according to its first principal component, which is suboptimal. In this paper, integrating the superpixel segmentation with principal component analysis, we propose a robust superpixel segmentation strategy to better divide the HSI, which can further enhance the low-rank attribute of the HSI. To better employ the low-rank attribute, the weighted nuclear norm by three types of weighting is proposed to efficiently remove the mixed noise in degraded HSI. Experiments conducted on simulated and real HSI data verify the performance of the proposed method for HSI restoration. [ABSTRACT FROM AUTHOR]

Registration between remote sensing images has been a research focus in the field of remote sensing image processing. Most of the existing image registration algorithms applied to feature point matching are derived from image feature extraction methods, such as scale-invariant feature transform (SIFT), speed-up robust features (SURF) and Siamese neural network. Such methods encounter difficulties in achieving accurate image registration where there is a large bias in the image features or no significant feature points. Aiming to solve this problem, this paper proposes an algorithm for multi-source image registration based on geographical location information (GLI). By calculating the geographic location information that corresponds to the pixel in the image, the ideal projected pixel position of the corresponding image is obtained using spatial coordinate transformation. Additionally, the corresponding relationship between the two images is calculated by combining multiple sets of registration points. The simulation experiment illustrates that, under selected common simulation parameters, the average value of the relative registration-point error between the two images is 12.64 pixels, and the registration accuracy of the corresponding ground registration point is higher than 6.5 m. In the registration experiment involving remote sensing images from different sources, the average registration pixel error of this algorithm is 20.92 pixels, and the registration error of the image center is 21.24 pixels. In comparison, the image center registration error given by the convolutional neural network (CNN) is 142.35 pixels after the registration error is manually eliminated. For the registration of homologous and featureless remote sensing images, the SIFT algorithm can only offer one set of registration points for the correct region, and the neural network cannot achieve accurate registration results. The registration accuracy of the presented algorithm is 7.2 pixels, corresponding to a ground registration accuracy of 4.32 m and achieving more accurate registration between featureless images. [ABSTRACT FROM AUTHOR]

Small target detection under a complex background has always been a hot and difficult problem in the field of image processing. Due to the factors such as a complex background and a low signal-to-noise ratio, the existing methods cannot robustly detect targets submerged in strong clutter and noise. In this paper, a local gradient contrast method (LGCM) is proposed. Firstly, the optimal scale for each pixel is obtained by calculating a multiscale salient map. Then, a subblock-based local gradient measure is designed; it can suppress strong clutter interference and pixel-sized noise simultaneously. Thirdly, the subblock-based local gradient measure and the salient map are utilized to construct the LGCM. Finally, an adaptive threshold is employed to extract the final detection result. Experimental results on six datasets demonstrate that the proposed method can discard clutters and yield superior results compared with state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In many areas of image processing, we deal with focused images. Indeed, the most important object is focused and the background is smooth. Finding edges in such images is difficult, since state-of-the-art edge detection methods assume that edges should be sharp. In this way, smooth edges are not detected. Therefore, these methods can detect the main object edges that skip the background. However, we are often also interested in detecting the background as well. Therefore, in this paper, we propose an edge detection method that can efficiently detect the edges of both a focused object and a smooth background alike. The proposed method is based on the local use of the k-Means algorithm from Machine Learning (ML). The local use is introduced by the proposed enhanced image filtering. The k-Means algorithm is applied within a sliding window in such a way that, as a result of filtering, we obtain a given square image area instead of just a simple pixel like in classical filtering. The results of the proposed edge detection method were compared with the best represented methods of different approaches of edge detection like pointwise, geometrical, and ML-based ones. [ABSTRACT FROM AUTHOR]

Steganography has made significant advances in the S quare-pixel-based Image Processing (SIP) domain, but to our knowledge, no work has yet been done in Hexel (Hexagonal Pixel)-based Image Processing (HIP). This paper presents a HIP-domain data hiding method that exploits and improves the SIP-domain Exploiting Modification Direction (EMD) embedding scheme. The proposed method, Hexagonal EMD (HexEMD), utilizes a HIP-domain cover image's hexagonal nature and infrastructure to embed the secret message. In standard digital imaging systems, the sensor portion that converts photonic energy into an analog electrical signal and all the subunits that digitize, process, and display this signal are based on square pixel logic, so there is currently no commercial equipment available to produce HIP-domain images. Thus, the image is first transformed into the HIP domain in software using the infrastructure developed in the project. Then the HIP-domain image is partitioned into non-overlapping heptads of the standard size, each containing seven hexels. Rather than embedding segments to the independent pixel pairs as done in SIP-domain EMD, we do the embedding iteratively in each heptad. Experimental results show that the HexEMD outperforms its SIP equivalent, EMD, by improving embedding capacity and achieving low visual quality distortion. [ABSTRACT FROM AUTHOR]

Image super-resolution (ISR) technology aims to enhance resolution and improve image quality. It is widely applied to various real-world applications related to image processing, especially in medical images, while relatively little appliedto anime image production. Furthermore, contemporary ISR tools are often based on convolutional neural networks (CNNs), while few methods attempt to use transformers that perform well in other advanced vision tasks. We propose a so-called anime image super-resolution (AISR) method based on the Swin Transformer in this work. The work was carried out in several stages. First, a shallow feature extraction approach was employed to facilitate the features map of the input image's low-frequency information, which mainly approximates the distribution of detailed information in a spatial structure (shallow feature). Next, we applied deep feature extraction to extract the image semantic information (deep feature). Finally, the image reconstruction method combines shallow and deep features to upsample the feature size and performs sub-pixel convolution to obtain many feature map channels. The novelty of the proposal is the enhancement of the low-frequency information using a Gaussian filter and the introduction of different window sizes to replace the patch merging operations in the Swin Transformer. A high-quality anime dataset was constructed to curb the effects of the model robustness on the online regime. We trained our model on this dataset and tested the model quality. We implement anime image super-resolution tasks at different magnifications (2×, 4×, 8×). The results were compared numerically and graphically with those delivered by conventional convolutional neural network-based and transformer-based methods. We demonstrate the experiments numerically using standard peak signal-to-noise ratio (PSNR) and structural similarity (SSIM), respectively. The series of experiments and ablation study showcase that our proposal outperforms others. [ABSTRACT FROM AUTHOR]

To solve the problem of non-destructive crop water content of detection under outdoor conditions, we propose a method to predict lettuce canopy water content by collecting outdoor hyperspectral images of potted lettuce plants and combining spectral analysis techniques and model training methods. Firstly, background noise was removed by correlation segmentation, proposed in this paper, whereby light intensity correction is performed on the segmented lettuce canopy images. We then chose the first derivative combined with mean centering (MC) to preprocess the raw spectral data. Hereafter, feature bands were screened by a combination of Monte Carlo uninformative variable elimination (MCUVE) and competitive adaptive reweighting sampling (CARS) to eliminate redundant information. Finally, a lettuce canopy moisture prediction model was constructed by combining partial least squares (PLS). The correlation coefficient between model predicted and measured values was used as the main model performance evaluation index, and the modeling set correlation coefficient Rc was 82.71%, while the prediction set correlation coefficient RP was 84.67%. The water content of each lettuce canopy pixel was calculated by the constructed model, and the visualized lettuce water distribution map was generated by pseudo-color image processing, which finally revealed a visualization of the water content of the lettuce canopy leaves under outdoor conditions. This study extends the hyperspectral image prediction possibilities of lettuce canopy water content under outdoor conditions. [ABSTRACT FROM AUTHOR]

Semantic segmentation of cells is the entry point to other areas of cell analysis such as instance segmentation, cell detection, Mitosis detection, and cell tracking. This paper presents a new approach for cell segmentation in microscopy images using a novel deep-learning filter called MaxSigLayer. The MaxSigLayer is a learnable layer that captures fine-grained details in cell structures by providing a better representation of the cells. Our technique employs two equal-sized windows, one containing the neighboring pixels of the center pixel and the other holding learnable weights determined during training. We calculate an updated value for each pixel by comparing and merging the Sigmoid outputs of both windows using element-wise multiplication and subtraction involving the Median and Mean of the result window and the center pixel value. The MaxSigLayer represents a new smooth nonlinear features map by simultaneously using the Max and Sigmoid functions. Experiments show that incorporating the MaxSigLayer into the image processing pipeline leads to a consistent improvement in performance. To make the model applicable to diverse cell datasets, the authors designed a larger architecture called MaxSigNet combining MaxSigLayer with dilated convolutional layers and edge maps, resulting in enhanced adaptability even to other types of medical imagery, including CT, MRI, and ultrasound scans. Overall, the proposed method significantly outperforms state-of-the-art techniques, highlighting its potential as a general solution for processing various types of medical imagery and might benefit from future developments and refinements towards wider applicability in this domain. [Display omitted] [ABSTRACT FROM AUTHOR]

Today, image forgery is common due to the massification of low-cost/high-resolution digital cameras, along with the accessibility of computer programs for image processing. All media is affected by this issue, which makes the public doubt the news. Though image modification is a typical process in entertainment, when images are taken as evidence in a legal process, modification cannot be considered trivial. Digital forensics has the challenge of ensuring the accuracy and integrity of digital images to overcome this issue. This investigation introduces an algorithm to detect the main types of pixel-based alterations such as copy-move forgery, resampling, and splicing in digital images. For the evaluation of the algorithm, CVLAB, CASIA V1, Columbia, and Columbia Uncompressed datasets were used. Of 7100 images evaluated, 3666 were unaltered, 791 had resampling, 2213 had splicing, and 430 had copy-move forgeries. The algorithm detected all proposed forgery pixel methods with an accuracy of 91%. The main novelties of the proposal are the reduced number of features needed for identification and its robustness for the file format and image size. [ABSTRACT FROM AUTHOR]