EURASIP Journal on Advances in Signal Processing最新文献

To address the issues of poor detection accuracy and the large number of target detection model parameters in existing AGV monocular vision location detection algorithms, this paper presents an AGV vision location method based on Gaussian saliency heuristic. The proposed method introduces a fast and accurate AGV visual detection network called GAGV-net. In the GAGV-net network, a Gaussian saliency feature extraction module is designed to enhance the network’s feature extraction capability, thereby reducing the required output for model fitting. To improve the accuracy of target detection, a joint multi-scale classification and detection task header are designed at the stage of target frame regression to classification. This header utilizes target features of different scales, thereby enhancing the accuracy of target detection. Experimental results demonstrate a 12% improvement in detection accuracy and a 27.38 FPS increase in detection speed compared to existing detection methods. Moreover, the proposed detection network significantly reduces the model’s size, enhances the network model’s deployability on AGVs, and greatly improves detection accuracy.

For the processing of highly squinted synthetic aperture radar (SAR) echo signals, three key challenges need to be considered: rectifying the nonzero Doppler centroid, compensating for azimuthal side-lobe defocusing (ASLD), and correcting the range cell migration (RCM). To address these three problems, we developed a reliable improved fourth-order spectral analysis (SPECAN) algorithm for highly squinted SAR imaging in this study. First, we present a fourth-order phase model (FoPM) that is more suitable for the highly squinted SAR system through a theoretical analysis. Second, based on the FoPM, we derive an improved fourth-order SPECAN algorithm in detail. In this derivation, the nonzero Doppler centroid, the ASLD, and the RCM caused by the high squint angle are corrected. Moreover, the whole simulation procedure of the improved algorithm only contains fast Fourier transform and complex multiplication, so the proposed algorithm can efficiently process highly squinted SAR echoes. Furthermore, the results of a comparison with the traditional SPECAN algorithm show the better performance of the proposed algorithm.

Abstract

In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-known compressed sensing by considering a threshold for sparsity-promoting reconstruction of the underlying graph signals. The proposed ITCSR algorithm enhances the performance of sparse graph signal reconstruction by introducing a threshold function to determine a suitable threshold. Furthermore, we demonstrate that the suitable parameters for the threshold can be automatically determined by leveraging the sparrow search algorithm. Moreover, we analytically prove the convergence property of the proposed ITCSR algorithm. In the experimental, numerical tests with synthetic as well as 3D point cloud data demonstrate the merits of the proposed ITCSR algorithm relative to the baseline algorithms.

The advent of intelligent reflecting surface (IRS) technology has revolutionized the landscape of wireless communication systems, offering promising opportunities for enhancing the performance of Internet of Things (IoT) applications. This paper presents a comprehensive performance evaluation of multi-agent IoT monitoring systems leveraging IRS technology. We focus on three criteria for selecting IRS units and assess the impact on system performance. Specifically, we analyze the system performance by deriving an outage probability expression for each criterion. Our study begins by introducing the concept of IRS and its role in IoT monitoring. We then present three IRS unit selection criteria: optimal selection (OS), partial selection (PS), and random selection (RS). For each criterion, we mathematically model and analyze the system outage probability, shedding light on the reliability and connectivity of IoT devices. The outage probability expressions derived in this work offer valuable insights into the trade-offs associated with IRS unit selection criteria in the context of IoT monitoring. Additionally, our findings contribute to the optimization of multi-agent IoT monitoring systems, enabling improved communication performance and enhanced reliability.

Target detection based on hyperspectral images refers to the integrated use of spatial information and spectral information to accomplish the task of localization and identification of targets. There are two main methods for hyperspectral target detection: supervised and unsupervised methods. Supervision method refers to the use of spectral differences between the target to be tested and the surrounding background to identify the target when the target spectrum is known. In ideal situations, supervised object detection algorithms perform better than unsupervised algorithms. However, the current supervised object detection algorithms mainly have two problems: firstly, the impact of uncertainty in the ground object spectrum, and secondly, the universality of the algorithm is poor. A hyperspectral target detection framework based on 3D–2D CNN and transfer learning was proposed to solve the problems of traditional supervised methods. This method first extracts multi-scale spectral information and then preprocesses hyperspectral images using multiple spectral similarity measures. This method not only extracts spectral features in advance, but also eliminates the influence of complex environments to a certain extent. The preprocessed feature maps are used as input for 3D–2D CNN to deeply learn the features of the target, and then, the softmax method is used to output and obtain the detection results. The framework draws on the ideas of integrated learning and transfer learning, solves the spectral uncertainty problem with the combined similarity measure and depth feature extraction network, and solves the problem of poor robustness of traditional algorithms by model migration and parameter sharing. The area under the ROC curve of the proposed method has been increased to over 0.99 in experiments on both publicly available remote sensing hyperspectral images and measured land-based hyperspectral images. The availability and stability of the proposed method have been demonstrated through experiments. A feasible approach has been provided for the development and application of specific target detection technology in hyperspectral images under different backgrounds in the future.

Cellular-connected unmanned aerial vehicles (UAVs), which have the potential to extend cellular services from the ground into the airspace, represent a promising technological advancement. However, the presence of communication coverage black holes among base stations and various obstacles within the aerial domain pose significant challenges to ensuring the safe operation of UAVs. This paper introduces a novel trajectory planning scheme, namely the double-map assisted UAV approach, which leverages deep reinforcement learning to address these challenges. The mission execution time, wireless connectivity, and obstacle avoidance are comprehensively modeled and analyzed in this approach, leading to the derivation of a novel joint optimization function. By utilizing an advanced technique known as dueling double deep Q network (D3QN), the objective function is optimized, while employing a mechanism of prioritized experience replay strengthens the training of effective samples. Furthermore, the connectivity and obstacle information collected by the UAV during flight are utilized to generate a map of radio and environmental data for simulating the flying process, thereby significantly reducing operational costs. The numerical results demonstrate that the proposed method effectively circumvents obstacles and areas with weak connections during flight, while also considering mission completion time.

Interferences pose a significant risk to applications that rely on global navigation satellite systems (GNSSs). They have the potential to degrade GNSS performance and even result in service disruptions. The most notable type of intentional interference is characterized by a constant modulus, such as chirp and tone interferences. These interferences have a straightforward structure, leading to the creation of complex circles when attempting to identify their contribution. To address the interference and improve the situation, we calculate the maximum likelihood estimator for the relevant parameters (time delay and Doppler shift) while considering the presence of these latent variables. To achieve this, we employ the expectation–maximization algorithm, which has previously demonstrated its effectiveness in similar scenarios. Experiments conducted using synthetic signals confirm the efficiency of the proposed algorithm.

Abstract

Learning graph structure from observed signals over graph is a crucial task in many graph signal processing (GSP) applications. Existing approaches focus on inferring static graph, typically assuming that all nodes are available. However, these approaches ignore the situation where only a subset of nodes are available from spatiotemporal measurements, and the remaining nodes are never observed due to application-specific constraints, resulting in time-varying graph estimation accuracy declines dramatically. To handle this problem, we propose a framework that consider the presence of hidden nodes to identify time-varying graph. Specifically, we assume that the graph signals are smooth and stationary on the graphs and only a small number of edges are allowed to change between two consecutive graphs. With these assumptions, we present a challenging time-varying graph inference problem, which models the influence of hidden nodes in terms of estimating the graph-shift operator matrices that have a form of graph Laplacian. Moreover, we emphasize similar edge pattern (column-sparsity) between different graphs. Finally, our method is evaluated on both synthetic and real-world data. The experimental results demonstrate the advantage of our method when compared to existing benchmarking methods.

Space-air-ground integrated networks comprise a multi-level heterogeneous integrated network that combines satellite-based, aerial, and terrestrial networks. With the increasing human exploration of space and growing demands for internet applications, space-air-ground integrated networks have gradually emerged as the direction for communication network development. These networks face various challenges such as extensive coverage, diverse communication node types, low-quality communication links, and simultaneous operation of multiple network protocols. However, the rapid development and widespread application of artificial intelligence and machine learning technologies in recent years have offered new perspectives and solutions for the communication architecture and routing algorithm research within space-air-ground integrated networks. In these networks, not all nodes can typically communicate directly with satellites; instead, a specific set of specialized communication nodes facilitates data communication between aerial and satellite networks due to their superior communication capabilities. Consequently, in contrast to traditional communication architectures, space-air-ground integrated networks, particularly in the terrestrial layer, often need to address challenges related to the diversity of communication node types and low-quality communication links. A well-designed routing approach becomes crucial in addressing these issues. Therefore, this paper proposes an AODV routing network protocol based on an improved ant colony algorithm (AC-AODV), specifically designed for the terrestrial layer within the space-air-ground integrated networks. By integrating information such as the type, energy, and location of communication nodes, this protocol aims to facilitate network communication. The objective is to guide information flow through nodes that are more suitable for communication, either by relaying communication or by connecting with satellites through specialized nodes. This approach alleviates the burden on ordinary nodes within the terrestrial communication network, thereby enhancing the overall network performance. In this protocol, specialized nodes hold a higher forwarding priority than regular nodes. When a source node needs to transmit data, it enters the route discovery phase, utilizing its own type, location, and energy information as heuristic data to calculate forwarding probabilities. Subsequently, it broadcasts route request (RREQ) messages to find the path. Upon receiving the RREQ message, the destination node sends an RREP message for updating information elements and selects the optimal path based on these information elements. Compared to AODV, AC-AODV shows significant improvements in performance metrics such as transmission latency, throughput, energy conversion rate, and packet loss rate.

We address the sensor selection problem where linear measurements under correlated noise are gathered at the selected nodes to estimate the unknown parameter. Since finding the best subset of sensor nodes that minimizes the estimation error requires a prohibitive computational cost especially for a large number of nodes, we propose a greedy selection algorithm that uses the log-determinant of the inverse estimation error covariance matrix as the metric to be maximized. We further manipulate the metric by employing the QR and LU factorizations to derive a simple analytic rule which enables an efficient selection of one node at each iteration in a greedy manner. We also make a complexity analysis of the proposed algorithm and compare with different selection methods, leading to a competitive complexity of the proposed algorithm. For performance evaluation, we conduct numerical experiments using randomly generated measurements under correlated noise and demonstrate that the proposed algorithm achieves a good estimation accuracy with a reasonable selection complexity as compared with the previous novel selection methods.