Nearest-neighbor Interpolation Research Articles

Information Density Enhancement Using Lossy Compression in DNA Data Storage.

This study develops two DNA lossy compression models, Models A and B, to encode grayscale images into DNA sequences, enhance information density, and enable high-fidelity image recovery. These models, distinguished by their handling of pixel domains and interpolation methods, offer a novel approach to data storage for DNA. Model A processes pixels in overlapped domains using linear interpolation, whereas Model B uses non-overlapped domains with nearest-neighbor interpolation. Through a comparative analysis with JPEG compression, the DNA lossy compression models demonstrated competitive advantages in terms of information density and image quality restoration. The application of these models to the MNIST dataset reveals their efficiency and the recognizability of decompressed images, which is validated by convolutional neural network performance. In particular, Model B2, a version of Model B, emerges as an effective method for balancing high information density (surpassing over 20 times the typical densities of 2 bits per nucleotide) with reasonably good image quality. These findings highlight the potential of DNA-based data storage systems for high-density and efficient compression, indicating a promising future for biological data storage solutions. This article is protected by copyright. All rights reserved.

A large-scale point cloud semantic segmentation neural network based on long-range contextual dependencies enhancement

ABSTRACT This letter presents a long-range contextual dependency enhanced network (LCDE-Net) for semantic segmentation of large-scale point cloud, which employs a U-shaped framework. Firstly, point clouds are subsampled with grid sampling and fed into convolutional layers to learn more representative local features of points. Then global and local encoders (GLE) are designed to exploit long-range contextual dependencies and local features simultaneously. The core of GLE consists of two parts: global feature enhancement (GFE) module and feature channel modulation (FCM) module. Secondly, through decoder layers, the encoded features are upsampled through the nearest-neighbour interpolation and aggregated with the intermediate encoded features by skip connections to capture multi-scale discriminative features for semantic segmentation of point cloud. Finally, via Fully Connection layer and Softmax classifier, each point’s label is assigned. Two different benchmark datasets are conducted to evaluate the performance of the proposed method, Experimental results report that the proposed LCDE-Net achieves 78.6% in terms of mean intersection over union (mIoU) on Semantic3D, and 68.2% on S3DIS, which is the highest among the comparison methods. The code of LCDE-Net is available at https://github.com/xrzmyz/LCDE-Net.

Determining dense velocity fields for fluid images based on affine motion.

In this article, we address the problem of estimating fluid flows between two adjacent images containing fluid and non-fluid objects. Typically, traditional optical flow estimation methods lack accuracy, because of the highly deformable nature of fluid, the lack of definitive features, and the motion differences between fluid and non-fluid objects. Our approach captures fluid motions using an affine motion model for each small patch of an image. To obtain robust patch matches, we propose a best-buddies similarity-based method to address the lack of definitive features but many similar features in fluid phenomena. A dense set of affine motion models was then obtained by performing nearest-neighbor interpolation. Finally, dense fluid flow was recovered by applying the affine transformation to each patch and was improved by minimizing a variational energy function. Our method was validated using different types of fluid images. Experimental results show that the proposed method achieves the best performance.

Integer multiple quantum image scaling based on NEQR and bicubic interpolation

As a branch of quantum image processing, quantum image scaling has been widely studied. However, most of the existing quantum image scaling algorithms are based on nearest-neighbor interpolation and bilinear interpolation, the quantum version of bicubic interpolation has not yet been studied. In this work, we present the first quantum image scaling scheme for bicubic interpolation based on the novel enhanced quantum representation (NEQR). Our scheme can realize synchronous enlargement and reduction of the image with the size of 2 n × 2 n by integral multiple. Firstly, the image is represented by NEQR and the original image coordinates are obtained through multiple CNOT modules. Then, 16 neighborhood pixels are obtained by quantum operation circuits, and the corresponding weights of these pixels are calculated by quantum arithmetic modules. Finally, a quantum matrix operation, instead of a classical convolution operation, is used to realize the sum of convolution of these pixels. Through simulation experiments and complexity analysis, we demonstrate that our scheme achieves exponential speedup over the classical bicubic interpolation algorithm, and has better effect than the quantum version of bilinear interpolation.

Scalable stellar evolution forecasting

Many astrophysical applications require efficient yet reliable forecasts of stellar evolution tracks. One example is population synthesis, which generates forward predictions of models for comparison with observations. The majority of state-of-the-art rapid population synthesis methods are based on analytic fitting formulae to stellar evolution tracks that are computationally cheap to sample statistically over a continuous parameter range. The computational costs of running detailed stellar evolution codes, such as MESA, over wide and densely sampled parameter grids are prohibitive, while stellar-age based interpolation in-between sparsely sampled grid points leads to intolerably large systematic prediction errors. In this work, we provide two solutions for automated interpolation methods that offer satisfactory trade-off points between cost-efficiency and accuracy. We construct a timescale-adapted evolutionary coordinate and use it in a two-step interpolation scheme that traces the evolution of stars from zero age main sequence all the way to the end of core helium burning while covering a mass range from 0.65 to 300 M⊙. The feedforward neural network regression model (first solution) that we train to predict stellar surface variables can make millions of predictions, sufficiently accurate over the entire parameter space, within tens of seconds on a 4-core CPU. The hierarchical nearest-neighbor interpolation algorithm (second solution) that we hard-code to the same end achieves even higher predictive accuracy, the same algorithm remains applicable to all stellar variables evolved over time, but it is two orders of magnitude slower. Our methodological framework is demonstrated to work on the MESA ISOCHRONES AND STELLAR TRACKS (Choi et al. 2016) data set, but is independent of the input stellar catalog. Finally, we discuss the prospective applications of these methods and provide guidelines for generalizing them to higher dimensional parameter spaces.

Registration and inpainting of biological slice images based on Bendlet transform and interval Shannon–Cosine wavelet

The fold that appeared in the micro-slice images needs to be inpainted exactly so that it can meet the requirements of the scientific experiments. The biological slice image usually consists of piecewise smooth regions with the closed loop contour which can be represented by the Bendlet function proposed in recent years. Therefore, a novel image inpainting method based on Bendlet and interval Shannon–Cosine wavelet is proposed. Since the deformation of the locust slice image is flexible, it is necessary to obtain as many feature points as possible to ensure the accuracy of the inpainting, so we introduce the curvature as a new registration element for registration. First, the homography matrix is obtained by calculating the correct feature points by our proposed registration method. Second, the fold position is located by homography matrix and inpainted by Shannon–Cosine interval wavelet interpolation. Finally, the pixel difference is eliminated through adaptive fusion. The results indicate that, in comparison to the SURF and ORB algorithms, our registration method significantly enhances the extraction of feature points, achieving a more even distribution. Furthermore, when compared to four other methods (K-SVD, BSCB, TV and Criminisi), as well as various interpolation methods such as cubic polynomial interpolation, cubic spline interpolation, and nearest neighbor interpolation, our approach consistently achieves the highest PSNR and SSIM values.

RobustMQ: benchmarking robustness of quantized models

Quantization has emerged as an essential technique for deploying deep neural networks (DNNs) on devices with limited resources. However, quantized models exhibit vulnerabilities when exposed to various types of noise in real-world applications. Despite the importance of evaluating the impact of quantization on robustness, existing research on this topic is limited and often disregards established principles of robustness evaluation, resulting in incomplete and inconclusive findings. To address this gap, we thoroughly evaluated the robustness of quantized models against various types of noise (adversarial attacks, natural corruption, and systematic noise) on ImageNet. The comprehensive evaluation results empirically provide valuable insights into the robustness of quantized models in various scenarios. For example: 1) quantized models exhibit higher adversarial robustness than their floating-point counterparts, but are more vulnerable to natural corruption and systematic noise; 2) in general, increasing the quantization bit-width results in a decrease in adversarial robustness, an increase in natural robustness, and an increase in systematic robustness; 3) among corruption methods, impulse noise and glass blur are the most harmful to quantized models, while brightness has the least impact; 4) among different types of systematic noise, the nearest neighbor interpolation has the highest impact, while bilinear interpolation, cubic interpolation, and area interpolation are the three least harmful. Our research contributes to advancing the robust quantization of models and their deployment in real-world scenarios.

RepECN: Making ConvNets Better Again for Efficient Image Super-Resolution

RepECN: Making ConvNets Better Again for Efficient Image Super-Resolution

Design-based mapping of land use/land cover classes with bootstrap estimation of precision by nearest-neighbour interpolation

Design-based mapping of land use/land cover classes with bootstrap estimation of precision by nearest-neighbour interpolation

Research on parking space detection algorithm in complex environments based on improved YOLOv7

In the context of complex parking environments, vehicle parking space detection faces challenges such as multi-scale, multi-angle, and occlusion issues, leading to low detection efficiency and problems with false positives and false negatives. In this study, we propose an improved vehicle parking space detection algorithm based on YOLOv7. Firstly, we enhance the convolutional layers by introducing the Mish activation function, thereby improving the model’s feature extraction capabilities and its ability to represent objects effectively. Secondly, we combine the parameter-free attention mechanism SimAM with feature pyramid modules and feature extraction modules to replace certain convolutional layers, thereby enhancing the reinforcement of critical parking space information and adaptability to variations in target scale. Finally, we replace the nearest-neighbor interpolation in the upsampling section with the lightweight operator CARAFE, effectively extracting parking space feature information and enhancing the algorithm’s feature fusion capabilities. Through ablation experiments and comparative trials on publicly available parking space datasets, our improved YOLOv7 algorithm achieves an mAP of 78.7%. Compared to the original algorithm, it demonstrates a 1.5% improvement in detection performance and a 5.6% increase in recall rate. These enhancements significantly improve parking space detection in complex environments, addressing issues such as false positives and false negatives, thereby meeting the performance requirements of parking space detection in parking lots.

Establishing a link between complex courtyard spaces and thermal comfort: A major advancement in evidence-based design

Amidst climate change, the importance of climate-adaptive design in architecture and landscape design has surged, particularly in residential courtyards, where optimizing the microclimate is paramount to residents' well-being. Traditional spatial indices, however, fall short in accurately characterizing complex courtyards and local spatial features. To overcome these limitations, this study introduces pixel-level spatial indicators that effectively overcome these constraints. These indicators are implemented using computational geometry algorithms such as Ray Tracing, Flood Fill, and A*, enabling simulation of various courtyard spatial indicator maps. We also utilize Graphics Processing Unit (GPU)-based rapid thermal comfort simulation technology to generate thermal comfort maps. By applying data mining methods such as Partial Least Squares Regression (PLSR), Pearson correlation, and Nearest-neighbor interpolation, we explore the relationships between spatial indicators and thermal comfort, ultimately identifying key indicators and determining the guiding thresholds and influencing trends corresponding to heat discomfort frequency. Six key indicators and th emerge: Building View Factor (BVF), indicating building coverage visibility (prefer above 0.11); Solar Beam Fraction (BEAM), illustrating Summer solstice sun shading condition (prefer below 0.78); Averaged View Factor (AVF), showing overall visibility (prefer below 0.40); Directional Sky View Factor (DSVF(W)), reflecting sky visibility in a specific orientation (prefer below 0.73); Tree View Factor (TVF), denoting tree coverage visibility (prefer above 0.18); and Plan Water Ratio (PWR), signifying water surface proportion (aim for below 0.44). These insights, integrated into design tools, contribute to evidence-based microclimate regulation strategies, thereby enhancing urban residents' thermal comfort and overall well-being.

Decoding motor imagery based on dipole feature imaging and a hybrid CNN with embedded squeeze-and-excitation block

Motor imagery (MI) decoding is the core of an intelligent rehabilitation system in brain computer interface, and it has a potential advantage by using source signals, which have higher spatial resolution and the same time resolution compared to scalp electroencephalography (EEG). However, how to delve and utilize the personalized frequency characteristic of dipoles for improving decoding performance has not been paid sufficient attention. In this paper, a novel dipole feature imaging (DFI) and a hybrid convolutional neural network (HCNN) with an embedded squeeze-and-excitation block (SEB), denoted as DFI-HCNN, are proposed for decoding MI tasks. EEG source imaging technique is used for brain source estimation, and each sub-band spectrum powers of all dipoles are calculated through frequency analysis and band division. Then, the 3D space information of dipoles is retrieved, and by using azimuthal equidistant projection algorithm it is transformed to a 2D plane, which is combined with nearest neighbor interpolation to generate multi sub-band dipole feature images. Furthermore, a HCNN is designed and applied to the ensemble of sub-band dipole feature images, from which the importance of sub-bands is acquired to adjust the corresponding attentions adaptively by SEB. Ten-fold cross-validation experiments on two public datasets achieve the comparatively higher decoding accuracies of 84.23% and 92.62%, respectively. The experiment results show that DFI is an effective feature representation, and HCNN with an embedded SEB can enhance the useful frequency information of dipoles for improving MI decoding.

YOLO-DRS: A Bioinspired Object Detection Algorithm for Remote Sensing Images Incorporating a Multi-Scale Efficient Lightweight Attention Mechanism.

Bioinspired object detection in remotely sensed images plays an important role in a variety of fields. Due to the small size of the target, complex background information, and multi-scale remote sensing images, the generalized YOLOv5 detection framework is unable to obtain good detection results. In order to deal with this issue, we proposed YOLO-DRS, a bioinspired object detection algorithm for remote sensing images incorporating a multi-scale efficient lightweight attention mechanism. First, we proposed LEC, a lightweight multi-scale module for efficient attention mechanisms. The fusion of multi-scale feature information allows the LEC module to completely improve the model's ability to extract multi-scale targets and recognize more targets. Then, we propose a transposed convolutional upsampling alternative to the original nearest-neighbor interpolation algorithm. Transposed convolutional upsampling has the potential to greatly reduce the loss of feature information by learning the feature information dynamically, thereby reducing problems such as missed detections and false detections of small targets by the model. Our proposed YOLO-DRS algorithm exhibits significant improvements over the original YOLOv5s. Specifically, it achieves a 2.3% increase in precision (P), a 3.2% increase in recall (R), and a 2.5% increase in mAP@0.5. Notably, the introduction of the LEC module and transposed convolutional results in a respective improvement of 2.2% and 2.1% in mAP@0.5. In addition, YOLO-DRS only increased the GFLOPs by 0.2. In comparison to the state-of-the-art algorithms, namely YOLOv8s and YOLOv7-tiny, YOLO-DRS demonstrates significant improvements in the mAP@0.5 metrics, with enhancements ranging from 1.8% to 7.3%. It is fully proved that our YOLO-DRS can reduce the missed and false detection problems of remote sensing target detection.

A Study on Tomato Disease and Pest Detection Method

In recent years, with the rapid development of artificial intelligence technology, computer vision-based pest detection technology has been widely used in agricultural production. Tomato diseases and pests are serious problems affecting tomato yield and quality, so it is important to detect them quickly and accurately. In this paper, we propose a tomato disease and pest detection model based on an improved YOLOv5n to overcome the problems of low accuracy and large model size in traditional pest detection methods. Firstly, we use the Efficient Vision Transformer as the feature extraction backbone network to reduce model parameters and computational complexity while improving detection accuracy, thus solving the problems of poor real-time performance and model deployment. Second, we replace the original nearest neighbor interpolation upsampling module with the lightweight general-purpose upsampling operator Content-Aware ReAssembly of FEatures to reduce feature information loss during upsampling. Finally, we use Wise-IoU instead of the original CIoU as the regression loss function of the target bounding box to improve the regression prediction accuracy of the predicted bounding box while accelerating the convergence speed of the regression loss function. We perform statistical analysis on the experimental results of tomato diseases and pests under data augmentation conditions. The results show that the improved algorithm improves mAP50 and mAP50:95 by 2.3% and 1.7%, respectively, while reducing the number of model parameters by 0.4 M and the computational complexity by 0.9 GFLOPs. The improved model has a parameter count of only 1.6 M and a computational complexity of only 3.3 GFLOPs, demonstrating a certain advantage over other mainstream object detection algorithms in terms of detection accuracy, model parameter count, and computational complexity. The experimental results show that this method is suitable for the early detection of tomato diseases and pests.

Inpainting surgical occlusion from laparoscopic video sequences for robot-assisted interventions.

Medical technology for minimally invasive surgery has undergone a paradigm shift with the introduction of robot-assisted surgery. However, it is very difficult to track the position of the surgical tools in a surgical scene, so it is crucial to accurately detect and identify surgical tools. This task can be aided by deep learning-based semantic segmentation of surgical video frames. Furthermore, due to the limited working and viewing areas of these surgical instruments, there is a higher chance of complications from tissue injuries (e.g., tissue scars and tears). With the aid of digital inpainting algorithms, we present an application that uses image segmentation to remove surgical instruments from laparoscopic/endoscopic video. We employ a modified U-Net architecture (U-NetPlus) to segment the surgical instruments. It consists of a redesigned decoder and a pre-trained VGG11 or VGG16 encoder. The decoder was modified by substituting an up-sampling operation based on nearest-neighbor interpolation for the transposed convolution operation. Furthermore, these interpolation weights do not need to be learned to perform upsampling, which eliminates the artifacts generated by the transposed convolution. In addition, we use a very fast and adaptable data augmentation technique to further enhance performance. The instrument segmentation mask is filled in (i.e., inpainted) by the tool removal algorithms using the previously acquired tool segmentation masks and either previous instrument-containing frames or instrument-free reference frames. We have shown the effectiveness of the proposed surgical tool segmentation/removal algorithms on a robotic instrument dataset from the MICCAI 2015 and 2017 EndoVis Challenge. We report a 90.20% DICE for binary segmentation, a 76.26% DICE for instrument part segmentation, and a 46.07% DICE for instrument type (i.e., all instruments) segmentation on the MICCAI 2017 challenge dataset using our U-NetPlus architecture, outperforming the results of earlier techniques used and tested on these data. In addition, we demonstrated the successful execution of the tool removal algorithm from surgical tool-free videos that contained moving surgical tools that were generated artificially. Our application successfully separates and eliminates the surgical tool to reveal a view of the background tissue that was otherwise hidden by the tool, producing results that are visually similar to the actual data.

Smoking behavior detection algorithm based on YOLOv8-MNC.

The detection of smoking behavior is an emerging field faced with challenges in identifying small, frequently occluded objects like cigarette butts using existing deep learning technologies. Such challenges have led to unsatisfactory detection accuracy and poor model robustness. To overcome these issues, this paper introduces a novel smoking detection algorithm, YOLOv8-MNC, which builds on the YOLOv8 network and includes a specialized layer for small target detection. The YOLOv8-MNC algorithm employs three key strategies: (1) It utilizes NWD Loss to mitigate the effects of minor deviations in object positions on IoU, thereby enhancing training accuracy; (2) It incorporates the Multi-head Self-Attention Mechanism (MHSA) to bolster the network's global feature learning capacity; and (3) It implements the lightweight general up-sampling operator CARAFE, in place of conventional nearest-neighbor interpolation up-sampling modules, minimizing feature information loss during the up-sampling process. Experimental results from a customized smoking behavior dataset demonstrate significant improvement in detection accuracy. The YOLOv8-MNC model achieved a detection accuracy of 85.887%, signifying a remarkable increase of 5.7% in the mean Average Precision (mAP@0.5) when compared to the previous algorithm. The YOLOv8-MNC algorithm represents a valuable step forward in resolving existing problems in smoking behavior detection. Its enhanced performance in both detection accuracy and robustness indicates potential applicability in related fields, thus illustrating a meaningful advancement in the sphere of smoking behavior detection. Future efforts will focus on refining this technique and exploring its application in broader contexts.

YOLOv7-Plum: Advancing Plum Fruit Detection in Natural Environments with Deep Learning.

The plum is a kind of delicious and common fruit with high edible value and nutritional value. The accurate and effective detection of plum fruit is the key to fruit number counting and pest and disease early warning. However, the actual plum orchard environment is complex, and the detection of plum fruits has many problems, such as leaf shading and fruit overlapping. The traditional method of manually estimating the number of fruits and the presence of pests and diseases used in the plum growing industry has disadvantages, such as low efficiency, a high cost, and low accuracy. To detect plum fruits quickly and accurately in a complex orchard environment, this paper proposes an efficient plum fruit detection model based on an improved You Only Look Once version 7(YOLOv7). First, different devices were used to capture high-resolution images of plum fruits growing under natural conditions in a plum orchard in Gulin County, Sichuan Province, and a dataset for plum fruit detection was formed after the manual screening, data enhancement, and annotation. Based on the dataset, this paper chose YOLOv7 as the base model, introduced the Convolutional Block Attention Module (CBAM) attention mechanism in YOLOv7, used Cross Stage Partial Spatial Pyramid Pooling-Fast (CSPSPPF) instead of Cross Stage Partial Spatial Pyramid Pooling(CSPSPP) in the network, and used bilinear interpolation to replace the nearest neighbor interpolation in the original network upsampling module to form the improved target detection algorithm YOLOv7-plum. The tested YOLOv7-plum model achieved an average precision (AP) value of 94.91%, which was a 2.03% improvement compared to the YOLOv7 model. In order to verify the effectiveness of the YOLOv7-plum algorithm, this paper evaluated the performance of the algorithm through ablation experiments, statistical analysis, etc. The experimental results showed that the method proposed in this study could better achieve plum fruit detection in complex backgrounds, which helped to promote the development of intelligent cultivation in the plum industry.

How does high resolution topography affect flood simulation at watershed scale: A case study in a small watershed based on tilt photography

The data source and resolution of DEM will affect the extraction of watershed features and flood simulation precision. In this paper, based on the 7 cm resolution DEM of the Liulin watershed obtained by tilt photography technology, the nearest neighbor interpolation, bilinear interpolation, and cubic convolution methods were used to resample DEMs with 1m and 30m resolution, and 6 resampled DEMs were obtained. The Aster 30m resolution DEM was downloaded from the geospatial data cloud. The watershed features were extracted from the 7 DEMs and compared. Based on these DEMs, the HEC-HMS model was established. 20 flood events were selected in the Liulin watershed for model calibration and verification. The results showed that the resampling method has little effect on the topographic features, but there were some differences between the resampling and downloaded DEM topographic features. The flood simulation results of the 1m resolution DEM-based HEC-HMS model are slightly better than that of the 30m resolution DEM-based model. The resampled 30m resolution DEM-based model performed identically with Aster 30m resolution DEM-based model. Therefore, an Aster 30m DEM can be used for flood simulation in a watershed that lacks measured high-precision topographic data.

Quantum image scaling with applications to image steganography and fusion

A quantum hue, saturation, and lightness model is proposed in which a triple qubit sequence (QHTS) is encoded and used as a data model for the implementation of quantum image scaling. The preparation and retrieval of QHTS images is presented, in which only q+2 qubits (where q is the bit depth) are required to encode color information while retaining relevant HSL image features and operability. A conventional nearest neighbor interpolation was adopted to implement quantum image up-scaling and down-scaling operations, from which two other scaling applications were developed. One such technique is a form of quantum steganography based on end-to-end encryption, which provides high capacity while ensuring the security of carrier images and secret messages. The other is a spatial remote sensing image fusion algorithm, based on QHTS images, which pioneers quantum pseudocolor composites of multi-spectral and panchromatic images. Simulation experiments demonstrated the proposed methodology provides an embedding capacity more than double that of existing quantum image steganography algorithms. In addition, a complexity analysis demonstrated the efficiency of the two proposed quantum image scaling applications, which take full advantage of quantum parallelism.

Exploring modern bathymetry: A comprehensive review of data acquisition devices, model accuracy, and interpolation techniques for enhanced underwater mapping

Building a high-precision bathymetry digital elevation model is essential for navigation planning, marine and lake resource planning, port construction, and underwater archaeological projects. However, existing bathymetry methods have yet to be effectively and comparatively analyzed. This paper comprehensively reviews state-of-the-art bathymetry methods, including data acquisition techniques, model accuracy, and interpolation algorithms for underwater terrain mapping. First, We assess the merits and drawbacks of novel data acquisition devices, such as single-beam/multi-beam echo sounders and light detection and ranging systems. After that, we analyze the accuracy of the ETOPO1, GEBCO_2022 and SRTM15 to provide valuable insights into their performance. Furthermore, we evaluate ANUDEM, Inverse Distance Weighting, Kriging and Nearest Neighbor interpolation algorithms in different underwater terrains by comparing their applicability, reliability, and accuracy in various underwater environments. Finally, we discuss the development trends and challenges in underwater bathymetry technology and offer a forward-looking perspective on the future of this essential field.