SearcharxivSearch

arXiv subjects

Dimitris A. Pados

Publications and source records attributed to Dimitris A. Pados.

16 recordsLinked to original sources

Taxonomy-aware deep learning for hierarchical marine species classification in underwater imagery

Automated classification of marine species from underwater imagery is essential for scalable ocean biodiversity monitoring and conservation policy. Existing approaches struggle with severe domain shift across collection platforms, fine-grained visual similarity between closely related species, and uneven annotation granularity, where many specimens can only be identified to genus or a coarser taxonomic rank. We present a taxonomy-aware deep learning framework that aligns both the training loss and the inference rule with the hierarchical structure of biological classification, combining a taxonomy-weighted loss, minimum-risk Bayesian inference, multi-scale feature encoding, and independent per-rank classification heads. Evaluated on the FathomNet 2025 dataset1 (79 marine classes across seven taxonomic ranks), the system achieves a mean taxonomic distance of 1.581, within 3% of the 1st-place solution (1.535), with the largest gains from metric-aligned inference and simple, decoupled components that generalize better than learned dependencies under distribution shift.

cs.CV

StormWave: An Open-Source Portable SDR Platform for Over-the-Air Resilience Evaluation of Terrestrial and Aerial Communications

This paper presents \emph{StormWave}, an open-source, portable software-defined Radio Frequency (RF) interference generation and monitoring platform designed for realistic field-based evaluation of the resilience of wireless communication systems. StormWave enables seamless composition and runtime switching among a wide range of narrowband and wideband waveforms, while supporting multiple digital modulations, adaptive coding, and multi-radio orchestration with real-time spectrum visualization. We evaluate the effectiveness of StormWave through both outdoor ground and air-to-air (A2A) experiments. Ground experiments demonstrate clear waveform- and modulation-dependent interference effects under realistic propagation conditions, while A2A experiments reveal pronounced distance-dependent constellation distortion and access-symbol degradation under active interference. The StormWave source code will be released to the community, with the expectation that StormWave will be used as a flexible, extensible, and field-ready platform for systematically validating interference resilience of wireless systems under realistic operating conditions.

eess.SY

Hankel and Toeplitz Rank-1 Decomposition of Arbitrary Matrices with Applications to Signal Direction-of-Arrival Estimation

We consider the problems of computing the optimal rank-1 Hankel and Toeplitz-structured approximation of arbitrary matrices under L2 and L1-norm error. Such problems arise naturally in engineered systems, including the basic few-shot signal Direction-of-Arrival (DoA) estimation problem that is of importance to modern autonomous systems applications. We develop accurate and computationally efficient structured matrix decomposition algorithms for both formulations and then derive analytically grounded small-sample-support DoA estimators for practical sensing system deployments. The resulting estimators under the L2 and L1 norms are formally shown to be maximum-likelihood optimal under white Gaussian and Laplace noise, respectively. The estimators are further validated through extensive simulation studies and real-world data experiments in few-shot DoA inference.

cs.LG

Super-resolution Multi-signal Direction-of-Arrival Estimation by Hankel-structured Sensing and Decomposition

Motivated by sensing modalities in modern autonomous systems that involve hardware-constrained spatial sampling over large arrays with limited coherence time, we develop a novel framework for rapid super-resolution multi-signal direction-of-arrival (DoA) estimation based on Hankel-structured sensing and data matrix decomposition of arbitrary rank, under both the $L_2$ and $L_1$-norm formulation. The resulting $L_2$-norm estimator is shown to be maximum-likelihood optimal in white Gaussian noise. The $L_1$-norm estimator is shown to be maximum-likelihood optimal in independent, identically distributed (i.i.d.) isotropic Laplace noise, offering broad robustness to impulsive interference and corrupted measurements commonly encountered in practice. Extensive simulations demonstrate that the proposed methods exhibit powerful super-resolution capabilities, requiring significantly lower SNR and achieving substantially higher resolution probability than recent competing approaches.

cs.LG

Demonstration of a 1.2 Gbps Always-on Fully-Connected Mesh Network with RFSoC SDRs

We design and implement on Radio Frequency System-on-Chip (RFSoC) software-defined radios (SDRs) a complete-graph network of four unmanned aerial vehicles and demonstrate real-time 4K video streaming over twelve always-on 2x2 multiple-input multiple-output (MIMO) links. The testbed operates at an aggregate network throughput of approximately 1.2 Gbps (i.e., 12 links of 99.84 Mbps) across a shared bandwidth of 200 MHz. To the best of our knowledge, this is the first demonstration of low-latency digitally controlled frequency-division duplex (FDD) RFSoC-based MIMO wireless links capable of simultaneously supporting multiple real-time, uncompressed 4K video streams. The testbed consists of four AMD/Xilinx Zynq UltraScale+ RFSoC ZCU111 evaluation kits configured as a fully-connected mesh network with custom-built physical and medium-access-control layers, adaptive equalization, and adjacent-band filtering implemented entirely in RFSoC's programmable logic. A host-side graphical user interface (GUI) provides real-time visualization of each link's performance including error vector magnitude (EVM), pre-detection signal-to-interference-plus-noise ratio (SINR), and bit error rate (BER), and enables dynamic reconfiguration of link parameters during operation.

cs.NI

BenchLink: An SoC-Based Benchmark for Resilient Communication Links in GPS-Denied Environments

Accurate timing and synchronization, typically enabled by GPS, are essential for modern wireless communication systems. However, many emerging applications must operate in GPS-denied environments where signals are unreliable or disrupted, resulting in oscillator drift and carrier frequency impairments. To address these challenges, we present BenchLink, a System-on-Chip (SoC)-based benchmark for resilient communication links that functions without GPS and supports adaptive pilot density and modulation. Unlike traditional General Purpose Processor (GPP)-based software-defined radios (e.g. USRPs), the SoC-based design allows for more precise latency control. We implement and evaluate BenchLink on Zynq UltraScale+ MPSoCs, and demonstrate its effectiveness in both ground and aerial environments. A comprehensive dataset has also been collected under various conditions. We will make both the SoC-based link design and dataset available to the wireless community. BenchLink is expected to facilitate future research on data-driven link adaptation, resilient synchronization in GPS-denied scenarios, and emerging applications that require precise latency control, such as integrated radar sensing and communication.

eess.SP

Spectrum Sharing by Space-Time Waveform Shaping

In this paper, we consider the task of introducing a new wireless data link over a given occupied frequency band using a multi-antenna transmitter and receiver. We design formally a dynamic multiple-input multiple-output (MIMO) wireless link that can coexist in the fixed congested frequency band by (a) optimally avoiding sensed interference in the joint space-time domain, and (b) protecting existing links by minimizing its own transmitted power in the band. In particular, the transmit beam weight vector and time domain pulse code sequence are jointly optimized to minimize the transmit energy per bit per antenna, while maintaining a pre-defined signal-to-interference-plus-noise ratio (SINR) at the output of the joint space-time maximum SINR receiver filter. Extensive numerical studies are carried out to demonstrate the derived algorithmic solution in light and heavily congested band scenarios with non-cooperative co-channel links. We show that the proposed autonomously reconfigurable 4x4 MIMO link outperforms a non-adaptive transceiver and other forms of waveform shaping in terms of the pre-detection SINR performance and the capability to protect ongoing non-cooperative links by not occupying the band with redundant transmissions.

cs.NI

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Kamax is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity. Simulation results in terms of bit-error-rate (BER) demonstrate that the performance of the proposed decoder has only a 1-2 dB degradation in signal-to-noise ratio (SNR) at a BER of 10^-3 when compared to ML. Moreover, we derive the proof of the minimum Manhattan distance of such UD codes and we provide the proofs for the propositions; these proofs constitute the foundation of the formal proof for the maximum number users Kamax for L=8 .

eess.SP

Adaptive Multiuser MCDM for Underwater Acoustic Communications

Chirp signals have been exploited extensively in radar and underwater acoustic (UW-A) communication systems for their robustness to multipath and superior correlation properties. We present a multiuser multicarrier chirp-division multiplexing (MU-MCDM) system which orthogonal chirp spread spectrum are utilized in frequency subcarriers for multiuser applications. Furthermore, orthogonal chirp transform (OCT) and discrete orthogonal chirp transform (DOCT) are developed for continuous and discrete implementations of MCDM systems. In addition, we design a maximum likelihood (ML) receiver capable of synchronization, channel estimation, and symbol detection. MU-MCDM systems consider factors, including preamble length, number of subcarriers, portion of pilots, guard period, and multiuser access scenarios to adapt time-variant UW-A channels. The bit-error-rate (BER) performance and adaptive transmission are evaluated in simulation studies. Therefore, we have demonstrated MCDM modulation systems in simulations that they improve performance of UW-A communications adaptively and support multiple users. Moreover, MCDM architectures can be applied in higher order modulations for providing higher transmission rates in UW-A channels.

eess.SP

Multicarrier Chirp-Division Multiplexing for Wireless Communications

We propose a multicarrier chirp-division multiplexing (MCDM) system in which orthogonal chirp waveforms are utilized as frequency subcarriers. Orthogonal characteristics of chirp subcarriers are analyzed in respect to cross-correlation coefficients among subcarriers. Moreover, orthogonal chirp transform (OCT) is developed to implement MCDM systems. In addition, we design a low complexity receiver, including packet synchronization, carrier frequency offset compensation, channel estimation, and symbol detection. Proposed MCDM systems have both advantages of chirp waveforms and multicarrier architectures. Computational complexity of our proposed detector is discussed in detail. The bit-error-rate (BER) performance of the MCDM system is evaluated in simulations and indoor radio frequency (RF) experiments. We have demonstrated effectiveness of MCDM systems both in simulation and experimental results, comparing to orthogonal frequency division multiplexing (OFDM) systems. Moreover, MCDM can be further applied to higher order modulations for enabling higher data rates for RF wireless communications.

eess.SP

M-ary Orthogonal Chirp Modulation for Coherent and Non-coherent Underwater Acoustic Communications

We propose an orthogonal chirp waveform design for underwater acoustic (UW-A) communications and analyze the cross-correlation characteristics of orthogonal chirp waveforms in coherent and non-coherent detections. We consider information symbols are carried over proposed M-ary orthogonal chirp waveforms for UW-A transmissions. Moreover, we develop a coherent and an optimal non-coherent receivers based on proposed chirp waveforms. Explicit derivations include closed-form expressions for cross-correlation coefficients, and theoretical bit-error-rate (BER) of coherent and non-coherent receivers. Performance of M-ary orthogonal chirp waveforms is evaluated in water tank experiments. Therefore, we have demonstrated the effectiveness of proposed M-ary orthogonal chirp modulation in UW-A multipath fading channel.

eess.SP

L1-norm Principal-Component Analysis of Complex Data

L1-norm Principal-Component Analysis (L1-PCA) of real-valued data has attracted significant research interest over the past decade. However, L1-PCA of complex-valued data remains to date unexplored despite the many possible applications (e.g., in communication systems). In this work, we establish theoretical and algorithmic foundations of L1-PCA of complex-valued data matrices. Specifically, we first show that, in contrast to the real-valued case for which an optimal polynomial-cost algorithm was recently reported by Markopoulos et al., complex L1-PCA is formally NP-hard in the number of data points. Then, casting complex L1-PCA as a unimodular optimization problem, we present the first two suboptimal algorithms in the literature for its solution. Our experimental studies illustrate the sturdy resistance of complex L1-PCA against faulty measurements/outliers in the processed data.

cs.DS

Efficient L1-Norm Principal-Component Analysis via Bit Flipping

It was shown recently that the $K$ L1-norm principal components (L1-PCs) of a real-valued data matrix $\mathbf X \in \mathbb R^{D \times N}$ ($N$ data samples of $D$ dimensions) can be exactly calculated with cost $\mathcal{O}(2^{NK})$ or, when advantageous, $\mathcal{O}(N^{dK - K + 1})$ where $d=\mathrm{rank}(\mathbf X)$, $K<d$ [1],[2]. In applications where $\mathbf X$ is large (e.g., "big" data of large $N$ and/or "heavy" data of large $d$), these costs are prohibitive. In this work, we present a novel suboptimal algorithm for the calculation of the $K < d$ L1-PCs of $\mathbf X$ of cost $\mathcal O(ND \mathrm{min} \{ N,D\} + N^2(K^4 + dK^2) + dNK^3)$, which is comparable to that of standard (L2-norm) PC analysis. Our theoretical and experimental studies show that the proposed algorithm calculates the exact optimal L1-PCs with high frequency and achieves higher value in the L1-PC optimization metric than any known alternative algorithm of comparable computational cost. The superiority of the calculated L1-PCs over standard L2-PCs (singular vectors) in characterizing potentially faulty data/measurements is demonstrated with experiments on data dimensionality reduction and disease diagnosis from genomic data.

cs.DS

Optimal Algorithms for $L_1$-subspace Signal Processing

We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We start with the computation of the $L_1$ maximum-projection principal component of a data matrix containing $N$ signal samples of dimension $D$. We show that while the general problem is formally NP-hard in asymptotically large $N$, $D$, the case of engineering interest of fixed dimension $D$ and asymptotically large sample size $N$ is not. In particular, for the case where the sample size is less than the fixed dimension ($N<D$), we present in explicit form an optimal algorithm of computational cost $2^N$. For the case $N \geq D$, we present an optimal algorithm of complexity $\mathcal O(N^D)$. We generalize to multiple $L_1$-max-projection components and present an explicit optimal $L_1$ subspace calculation algorithm of complexity $\mathcal O(N^{DK-K+1})$ where $K$ is the desired number of $L_1$ principal components (subspace rank). We conclude with illustrations of $L_1$-subspace signal processing in the fields of data dimensionality reduction, direction-of-arrival estimation, and image conditioning/restoration.

cs.DS

Some Options for L1-Subspace Signal Processing

We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We focus on the computation of the $L_1$ maximum-projection principal component of a data matrix containing N signal samples of dimension D and conclude that the general problem is formally NP-hard in asymptotically large N, D. We prove, however, that the case of engineering interest of fixed dimension D and asymptotically large sample support N is not and we present an optimal algorithm of complexity $O(N^D)$. We generalize to multiple $L_1$-max-projection components and present an explicit optimal $L_1$ subspace calculation algorithm in the form of matrix nuclear-norm evaluations. We conclude with illustrations of $L_1$-subspace signal processing in the fields of data dimensionality reduction and direction-of-arrival estimation.

stat.ML

Waveform Design for Secure SISO Transmissions and Multicasting

Wireless physical-layer security is an emerging field of research aiming at preventing eavesdropping in an open wireless medium. In this paper, we propose a novel waveform design approach to minimize the likelihood that a message transmitted between trusted single-antenna nodes is intercepted by an eavesdropper. In particular, with knowledge first of the eavesdropper's channel state information (CSI), we find the optimum waveform and transmit energy that minimize the signal-to-interference-plus-noise ratio (SINR) at the output of the eavesdropper's maximum-SINR linear filter, while at the same time provide the intended receiver with a required pre-specified SINR at the output of its own max-SINR filter. Next, if prior knowledge of the eavesdropper's CSI is unavailable, we design a waveform that maximizes the amount of energy available for generating disturbance to eavesdroppers, termed artificial noise (AN), while the SINR of the intended receiver is maintained at the pre-specified level. The extensions of the secure waveform design problem to multiple intended receivers are also investigated and semidefinite relaxation (SDR) -an approximation technique based on convex optimization- is utilized to solve the arising NP-hard design problems. Extensive simulation studies confirm our analytical performance predictions and illustrate the benefits of the designed waveforms on securing single-input single-output (SISO) transmissions and multicasting.

cs.CR