SearcharxivSearch

arXiv subjects

Tamer Khattab

Publications and source records attributed to Tamer Khattab.

At least 19 recordsLinked to original sources

Global Minimax Readout of a Qubit Direction

We determine the exact worst-direction Fisher-information cost of using a parameter-independent readout to estimate an unknown qubit direction at known Bloch-vector length $\eta$. Every fixed-local architecture, including recorded classical randomization, heterogeneous single-copy measurements, and arbitrary outcome spaces, reduces exactly to a zero-barycenter probability measure on the Bloch ball. For every full-rank qubit and every trace-balanced spectral Fisher loss, the resulting minimax problem is rigid: the unique optimal aggregate design is the spin-coherent Haar positive-operator-valued measure (POVM). For $N$ copies, inverse-Fisher $A$ loss has the exact value $2/[Nf(\eta)]$, where $ f(\eta)= \frac{2\eta-(1-\eta^2)\log[(1+\eta)/(1-\eta)]}{4\eta}$. This uniqueness has an immediate finite-readout consequence. No finite-support measurement attains the unrestricted mixed-state optimum, while at the smallest globally regular support the tetrahedral symmetric informationally complete (SIC) measurement is uniquely $A$- and $D$-minimax, with exact worst-direction values. Relaxing the fixed-readout constraint separates the asymptotic resources: one-way local operations and classical communication (LOCC), unrestricted LOCC, and separable measurements have $A$-loss coefficient $4/\eta^2$, whereas collective measurements attain $2(1+\eta)/\eta^2$. We further classify the rigidity conditions for unequal contrasts and show that Haar uniqueness survives at the nonregular pure-state endpoint.

quant-ph

Secure High-Resolution ISAC via Multi-Layer Intelligent Metasurfaces: A Layered Optimization Framework

Integrated sensing and communication (ISAC) has emerged as a pivotal technology for next-generation wireless networks, enabling simultaneous data transmission and environmental sensing. However, existing ISAC systems face fundamental limitations in achieving high-resolution sensing while maintaining robust communication security and spectral efficiency. This paper introduces a transformative approach leveraging stacked intelligent metasurfaces (SIM) to overcome these challenges. We propose a multi-functional SIM-assisted system that jointly optimizes communication secrecy and sensing accuracy through a novel layered optimization framework. Our solution employs a multi-objective optimization formulation that balances secrecy rate maximization with sensing error minimization under practical hardware constraints. The proposed layered block coordinate descent algorithm efficiently coordinates sensing configuration, secure beamforming, communication metasurface optimization, and resource allocation while ensuring robustness to channel uncertainties. Extensive simulations demonstrate significant performance gains over conventional approaches, achieving 32-61\% improvement in sensing accuracy and 15-35\% enhancement in secrecy rates while maintaining computational efficiency. This work establishes a new paradigm for secure and high-precision multi-functional wireless systems.

eess.SP

Stroke Locus Net: Occluded Vessel Localization from MRI Modalities

A key challenge in ischemic stroke diagnosis using medical imaging is the accurate localization of the occluded vessel. Current machine learning methods in focus primarily on lesion segmentation, with limited work on vessel localization. In this study, we introduce Stroke Locus Net, an end-to-end deep learning pipeline for detection, segmentation, and occluded vessel localization using only MRI scans. The proposed system combines a segmentation branch using nnUNet for lesion detection with an arterial atlas for vessel mapping and identification, and a generation branch using pGAN to synthesize MRA images from MRI. Our implementation demonstrates promising results in localizing occluded vessels on stroke-affected T1 MRI scans, with potential for faster and more informed stroke diagnosis.

cs.CV

Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions

Quantum network routing requires online decisions under probabilistic entanglement generation, finite quantum memories, decoherence, imperfect operations, and classical feedback, while the controller has incomplete knowledge of the physical state. This paper develops a robust belief-state routing framework based on a quantum partially observable Markov decision process (q-POMDP) and a feasibility-masked graph neural network (GNN). The model uses atomic micro-epochs in which each selected operation completes before the next decision boundary. This enables explicit accounting of memory reservations, pair-instance inventories, purification consumption, swapping outcomes, release decisions, queue service, and completion-time delivery fidelity. The controller maintains a classical belief over hidden physical states, including latent environmental conditions, and uses this belief to evaluate feasible actions and update posterior pair states. To make planning scalable, we introduce feasibility-stratified prototypes, identifier-free signatures, and role-aware action matching, which preserve hard resource constraints while enabling value transfer across structurally similar information states. A cached q-POMDP planner is then fused with a role-aware GNN policy through an adaptive trust rule, with a safe fallback for previously unseen feasibility signatures. We provide theoretical guarantees on feasibility, value approximation, policy performance, robustness, regret, and learning variance. Simulations over finite-memory quantum-network topologies show that the proposed hybrid controller improves high-fidelity goodput, reduces below-threshold deliveries, and maintains lower online decision cost than planner-only control, while outperforming heuristic, purification-aware, and learning-based baselines.

quant-ph

RAPID Quantum Detection and Demodulation of Covert Communications: Breaking the Noise Limit with Solid-State Spin Sensors

We introduce a comprehensive framework for the detection and demodulation of covert electromagnetic signals using solid-state spin sensors. Our approach, named RAPID, is a two-stage hybrid strategy that leverages nitrogen-vacancy (NV) centers to operate below the classical noise floor employing a robust adaptive policy via imitation and distillation. We first formulate the joint detection and estimation task as a unified stochastic optimal control problem, optimizing a composite Bayesian risk objective under realistic physical constraints. The RAPID algorithm solves this by first computing a robust, non-adaptive baseline protocol grounded in the quantum Fisher information matrix (QFIM), and then using this baseline to warm-start an online, adaptive policy learned via deep reinforcement learning (Soft Actor-Critic). This method dynamically optimizes control pulses, interrogation times, and measurement bases to maximize information gain while actively suppressing non-Markovian noise and decoherence. Numerical simulations demonstrate that the protocol achieves a significant sensitivity gain over static methods, maintains high estimation precision in correlated noise environments, and, when applied to sensor arrays, enables coherent quantum beamforming that achieves Heisenberg-like scaling in precision. This work establishes a theoretically rigorous and practically viable pathway for deploying quantum sensors in security-critical applications such as electronic warfare and covert surveillance.

quant-ph

Adaptive Learning for IRS-Assisted Wireless Networks: Securing Opportunistic Communications Against Byzantine Eavesdroppers

We propose a joint learning framework for Byzantine-resilient spectrum sensing and secure intelligent reflecting surface (IRS)--assisted opportunistic access under channel state information (CSI) uncertainty. The sensing stage performs logit-domain Bayesian updates with trimmed aggregation and attention-weighted consensus, and the base station (BS) fuses network beliefs with a conservative minimum rule, preserving detection accuracy under a bounded number of Byzantine users. Conditioned on the sensing outcome, we pose downlink design as sum mean-squared error (MSE) minimization under transmit-power and signal-leakage constraints and jointly optimize the BS precoder, IRS phase shifts, and user equalizers. With partial (or known) CSI, we develop an augmented-Lagrangian alternating algorithm with projected updates and provide provable sublinear convergence, with accelerated rates under mild local curvature. With unknown CSI, we perform constrained Bayesian optimization (BO) in a geometry-aware low-dimensional latent space using Gaussian process (GP) surrogates; we prove regret bounds for a constrained upper confidence bound (UCB) variant of the BO module, and demonstrate strong empirical performance of the implemented procedure. Simulations across diverse network conditions show higher detection probability at fixed false-alarm rate under adversarial attacks, large reductions in sum MSE for honest users, strong suppression of eavesdropper signal power, and fast convergence. The framework offers a practical path to secure opportunistic communication that adapts to CSI availability while coherently coordinating sensing and transmission through joint learning.

eess.SP

IRS-Assisted IoT Activity Detection Under Asynchronous Transmission and Heterogeneous Powers: Detectors and Performance Analysis

This paper addresses the problem of activity detection in distributed Internet of Things (IoT) networks, where devices employ asynchronous transmissions with heterogeneous power levels to report their local observations. The system leverages an intelligent reflecting surface (IRS) to enhance detection reliability, with optional incorporation of a direct line-of-sight (LoS) path. We formulate the detection problem as a binary hypothesis test and develop four detectors: an optimal detector alongside three computationally efficient detectors designed for practical scenarios with different levels of prior knowledge about noise variance, channel state information, and device transmit powers. For each detector, we derive closed-form expressions for both detection and false alarm probabilities, establishing theoretical performance benchmarks. Extensive simulations validate our analytical results and systematically evaluate the impact of key system parameters including the number of antennas, samples, users, and IRS elements on detection performance. The proposed framework effectively bridges theoretical optimality with implementation practicality, providing a scalable solution for IRS-assisted IoT networks in emerging 6G systems.

eess.SP

A Hybrid CNN-VSSM model for Multi-View, Multi-Task Mammography Analysis: Robust Diagnosis with Attention-Based Fusion

Early and accurate interpretation of screening mammograms is essential for effective breast cancer detection, yet it remains a complex challenge due to subtle imaging findings and diagnostic ambiguity. Many existing AI approaches fall short by focusing on single view inputs or single-task outputs, limiting their clinical utility. To address these limitations, we propose a novel multi-view, multitask hybrid deep learning framework that processes all four standard mammography views and jointly predicts diagnostic labels and BI-RADS scores for each breast. Our architecture integrates a hybrid CNN VSSM backbone, combining convolutional encoders for rich local feature extraction with Visual State Space Models (VSSMs) to capture global contextual dependencies. To improve robustness and interpretability, we incorporate a gated attention-based fusion module that dynamically weights information across views, effectively handling cases with missing data. We conduct extensive experiments across diagnostic tasks of varying complexity, benchmarking our proposed hybrid models against baseline CNN architectures and VSSM models in both single task and multi task learning settings. Across all tasks, the hybrid models consistently outperform the baselines. In the binary BI-RADS 1 vs. 5 classification task, the shared hybrid model achieves an AUC of 0.9967 and an F1 score of 0.9830. For the more challenging ternary classification, it attains an F1 score of 0.7790, while in the five-class BI-RADS task, the best F1 score reaches 0.4904. These results highlight the effectiveness of the proposed hybrid framework and underscore both the potential and limitations of multitask learning for improving diagnostic performance and enabling clinically meaningful mammography analysis.

eess.IV

Flatten Wisely: How Patch Order Shapes Mamba-Powered Vision for MRI Segmentation

Vision Mamba models promise transformer-level performance at linear computational cost, but their reliance on serializing 2D images into 1D sequences introduces a critical, yet overlooked, design choice: the patch scan order. In medical imaging, where modalities like brain MRI contain strong anatomical priors, this choice is non-trivial. This paper presents the first systematic study of how scan order impacts MRI segmentation. We introduce Multi-Scan 2D (MS2D), a parameter-free module for Mamba-based architectures that facilitates exploring diverse scan paths without additional computational cost. We conduct a large-scale benchmark of 21 scan strategies on three public datasets (BraTS 2020, ISLES 2022, LGG), covering over 70,000 slices. Our analysis shows conclusively that scan order is a statistically significant factor (Friedman test: $χ^{2}_{20}=43.9, p=0.0016$), with performance varying by as much as 27 Dice points. Spatially contiguous paths -- simple horizontal and vertical rasters -- consistently outperform disjointed diagonal scans. We conclude that scan order is a powerful, cost-free hyperparameter, and provide an evidence-based shortlist of optimal paths to maximize the performance of Mamba models in medical imaging.

eess.IV

Large Array Antenna Spectrum Sensing in Cognitive Radio Networks

We investigate the problem of spectrum sensing in cognitive radios (CRs) when the receivers are equipped with a large array of antennas. We propose and derive three detectors based on the concept of linear spectral statistics (LSS) in the field of random matrix theory (RMT). These detectors correspond to the generalized likelihood ratio (GLR), Frobenius norm, and Rao tests employed in conventional multiple antenna spectrum sensing (MASS). Subsequently, we compute the Gaussian distribution of the proposed detectors under the noise-only hypothesis, leveraging the central limit theorem (CLT) applied to high-dimensional random matrices. We evaluate the performance of the proposed detectors and analyze the impact of the number of antennas and samples on their efficacy. Furthermore, we assess the accuracy of the theoretical results by comparing them with simulation outcomes. The simulation results provide evidence that the proposed detectors exhibit efficient performance in wireless networks featuring large array antennas. These detectors find practical applications in diverse domains, including massive MIMO wireless communications, radar systems, and astronomical applications.

eess.SP

Caching Through the Skies: The Case of LEO Satellites Connected Edges for 6G and Beyond

The deployment of low earth orbit (LEO) satellites with terrestrial networks can potentially increase the efficiency and reduce the cost of relaying content from a data center to a set of edge caches hosted by 6G and beyond enabled macro base stations. In this work, the characteristics of the communication system and the mobility of LEO satellites are thoroughly discussed to describe the channel characteristics of LEO satellites, in terms of their frequency bands, latency, Doppler shifts, fading effects, and satellite access. Three different scenarios are proposed for the relay of data from data centers to edge caches via LEO satellites, which are the "Immediate Forward", "Relay and Forward", and "Store and Forward" scenarios. A comparative problem formulation is utilized to obtain numerical results from simulations to demonstrate the effectiveness and validity as well as the trade-offs of the proposed system model. The simulation results indicate that the integration of LEO satellites in edge caching for 6G and beyond networks decreased the required transmission power for relaying the data from the data center to the edge caches. Future research directions based on the proposed model are discussed.

eess.SP

Terahertz Multiple Access: A Deep Reinforcement Learning Controlled Multihop IRS Topology

We investigate THz communication uplink multiple access using cascaded intelligent reflecting surfaces (IRSs) assuming correlated channels. Two independent objectives to be achieved via adjusting the phases of the cascaded IRSs: 1) maximizing the received rate of a desired user under interference from the second user and 2) maximizing the sum rate of both users. The resulting optimization problems are non-convex. For the first objective, we devise a sub-optimal analytical solution by maximizing the received power of the desired user, however, this results in an over determined system. Approximate solutions using pseudo-inverse and block-based approaches are attempted. For the second objective, a loose upperbound is derived and an exhaustive search solution is utilized. We then use deep reinforcement learning (DRL) to solve both objectives. Results reveal the suitability of DRL for such complex configurations. For the first objective, the DRL-based solution is superior to the sub-optimal mathematical methods, while for the second objective, it produces sum rates almost close to the exhaustive search. Further, the results reveal that as the correlation-coefficient increases, the sum rate of DRL increases, since it benefits from the presence of correlation in the channel to improve statistical learning.

cs.IT

A General Model for Pointing Error of High Frequency Directional Antennas

This paper focuses on providing an analytical framework for the quantification and evaluation of the pointing error for a general case at high-frequency millimeter wave (mmWave) and terahertz (THz) communication links. For this aim, we first derive the the probability density function (PDF) and cumulative distribution functions (CDF) of the pointing error between an unstable transmitter (Tx) and receiver (Rx), that have different antenna patterns and for which the vibrations are not similar in the Yaw and Pitch directions. The special case where the Tx and Rx are both equipped with uniform linear array antenna is also investigated. In addition, using $α-μ$ distribution, which is a valid model for small-scale fading of mmWave/THz links, the end-to-end PDF and CDF of the considered channel is derived for all the considered cases. Finally, by employing Monte-Carlo simulations, the accuracy of the analytical expressions is verified and the performance of the system is studied.

eess.SP

Enabling Long mmWave Aerial Backhaul Links via Fixed-Wing UAVs: Performance and Design

We propose a fixed wing unmanned aerial vehicles (UAV)-based millimeter wave (mmWave) backhaul links, that is offered as a cost effective and easy to deploy solution, to connect a disaster or remote area to the nearest core network. First, we fully characterize the single relay fixed-wing UAV-based communication system by taking into account the effects of realistic physical parameters, such as the UAV's circular path, critical points of the flight path, heights and positions of obstacles, flight altitude, tracking error, the severity of UAV's vibrations, the real 3D antenna pattern, mmWave atmospheric channel loss, temperature and air pressure. Second, we derive the distribution of the signal-to-noise ratio (SNR) metric, which is based on the sum of a series of Dirac delta functions. Using the SNR distribution, we derive closed-form expressions for the outage probability and the ergodic capacity of the considered system as a function of all system parameters. To provide an acceptable quality of service for longer link lengths, we extend the analytical expressions to a multi-relay system. The accuracy of the closed-form expressions are verified by Monte-Carlo simulations. Finally, by providing sufficient simulation results, we investigate the effects of key channel parameters such as antenna pattern gain and flight path on the performance of the considered system; and we carefully analyze the relationships between these parameters in order to maximize the average channel capacity.

eess.SP

Long mmWave Backhaul Connectivity Using Fixed-Wing UAVs

This paper discusses the analysis of a fixed-wing unmanned aerial vehicle (UAV)-based millimeter wave (mmWave) backhaul link, that is offered as a cost-effective and easy deploy the solution to connect a disaster or remote area to the nearest core network. We present the optimal design of a relay system based on fixed-wing UAV, taking into account the actual channel parameters such as the UAV vibrations, tracking error, real 3GPP antenna pattern, UAV's height, flight path, and the effect of physical obstacles. The performance of the considered system is evaluated in terms of outage probability and the channel capacity while taking into account the impact of the system parameters such as optimal selection of UAV flight path and antenna patterns.

eess.SP

A Study of Multihop mmW Aerial Backhaul Links

The main contribution of this paper is to analyze a long networked flying platform (NFP)-based millimeter wave (mmWave) backhaul link that is offered as a cost effective and easy to deploy solution to connect a disaster or remote area to the nearest core network. For this aim, we characterize the backhaul channel as a function of realistic physical parameters such as heights and distances of obstacles along the route, flight altitude and the intensity of NFPs' vibrations, the real 3D antenna pattern provided by 3GPP, etc. For the characterized channel, we derive an analytical closed-form expression for the outage probability. Finally, using the obtained results, we provide a fast algorithm for the optimal parameter design of the considered system that minimizes the cost.

eess.SP

A Critical Review of Baseband Architectures for CubeSats Communication Systems

Small satellite communications recently entered a period of massive interest driven by the uprising space applications. CubeSats are particularly attractive due to their low development costs which makes them very promising in playing a central role in the global wireless communication sector with numerous applications. Moreover, constellations of CubeSats in low-earth orbits can meet the increasing demands of global-coverage flexible low-cost high-speed connectivity. However, this requires innovative solutions to overcome the significant challenges that face high-data-rate low-power space communications. This paper provides a comprehensive and critical review of the design and architecture of recent CubeSat communication systems with a particular focus on their baseband architectures. The literature is surveyed in detail to identify all baseband design, testing, and demonstration stages as well as accurately describe the systems architecture and communication protocols. The reliability, performance, data rate, and power consumption of the reviewed systems are critically evaluated to understand the limitations of current CubeSat systems and identify directions of future developments. It is concluded that CubeSat communication systems still face many challenges, namely the development of energy-efficient high-speed modems that satisfy CubeSats requirements. Nevertheless, there are several promising directions for improvements such as the use of improved coding algorithms, use of Field Programmable Gate Arrays, multiple access techniques, beamforming, advanced antennas, and transition to higher frequency bands. By providing a concrete summary of current CubeSat communication systems and by critically evaluating their features, limitations, and offering insights about potential improvements, the review should aid CubeSat developers to develop more efficient and high data rate systems.

eess.SP

VisDrone-CC2020: The Vision Meets Drone Crowd Counting Challenge Results

Crowd counting on the drone platform is an interesting topic in computer vision, which brings new challenges such as small object inference, background clutter and wide viewpoint. However, there are few algorithms focusing on crowd counting on the drone-captured data due to the lack of comprehensive datasets. To this end, we collect a large-scale dataset and organize the Vision Meets Drone Crowd Counting Challenge (VisDrone-CC2020) in conjunction with the 16th European Conference on Computer Vision (ECCV 2020) to promote the developments in the related fields. The collected dataset is formed by $3,360$ images, including $2,460$ images for training, and $900$ images for testing. Specifically, we manually annotate persons with points in each video frame. There are $14$ algorithms from $15$ institutes submitted to the VisDrone-CC2020 Challenge. We provide a detailed analysis of the evaluation results and conclude the challenge. More information can be found at the website: \url{http://www.aiskyeye.com/}.

cs.CV