Next Article in Journal
AMGAA: Attention-Guided Multi-Target Generative Adversarial Attack for Vision Transformers
Previous Article in Journal
Limit-Cycle Proliferation Under Parametric Delayed Feedback in a Conductance-Based Neuron: Bifurcation Landscape, Orbit Catalog, and Capacity Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Information-Geometric Detection via Local SPD Structure Fields in the Time–Frequency Domain

1
School of Information Science and Engineering, Shandong University, Qingdao 266237, China
2
National Space Science Center, Chinese Academy of Sciences, Beijing 100190, China
*
Authors to whom correspondence should be addressed.
Entropy 2026, 28(6), 679; https://doi.org/10.3390/e28060679 (registering DOI)
Submission received: 6 May 2026 / Revised: 2 June 2026 / Accepted: 10 June 2026 / Published: 12 June 2026
(This article belongs to the Section Signal and Data Analysis)

Abstract

Non-stationary signal detection is challenging when discriminative information is not reflected in global energy, mean spectra, or a single covariance statistic, but is instead embedded in the organization of local time–frequency structures. This paper proposes an information-geometric detector defined on local symmetric positive definite (SPD) structure fields. Time–frequency patches are transformed into a spatially distributed field of second-order tensors to characterize local directional organization and anisotropy. Under a locally isotropic Riemannian Gaussian approximation on the SPD manifold, the local distance-difference evidence is monotonically related to an approximate log-likelihood ratio, providing an information-geometric interpretation without implying strict Neyman–Pearson optimality. Instead of forming a single global statistic or stacking patch-level features, the proposed method constructs a spatially distributed field of structured SPD objects and derives local distance-difference evidence, which is subsequently aggregated into a sample-level detection statistic. Experiments under a controlled SPD structure-field locality benchmark show that performance gains are primarily driven by the proposed SPD structure-field representation, with the Riemannian metric providing only secondary refinement.

1. Introduction

Non-stationary signal detection is a fundamental problem in statistical signal processing and arises widely in radar sensing and wireless communications. Classical detection theory is usually formulated within the framework of binary hypothesis testing and the likelihood-ratio test, and detection performance is commonly evaluated under fixed false-alarm probability constraints [1]. However, many traditional detection statistics rely on global energy, mean spectral features, template correlation, or a single covariance matrix. When the two classes have similar global low-order statistics, discriminative information may be carried primarily by local time–frequency structures, directional organization, and spatial arrangement. In such cases, global statistics may suppress or discard the local evidence that is most relevant to detection.
Time–frequency analysis provides a finer representation for non-stationary signals and can reveal structural phenomena such as transient energy concentration, local ridges, frequency drift, and fragmented textures [2,3]. Existing spectro-temporal patch methods have shown that structural patterns within local time–frequency patches can provide effective information for language identification and acoustic event detection [4,5,6]. Nevertheless, most of these methods still treat spectrogram patches as ordinary intensity maps, template vectors, or inputs to learning models, and they lack explicit geometric modeling of local directional relationships and anisotropy. By contrast, the structure tensor can stably characterize directional energy, directional coupling, and anisotropy through local second-order gradient statistics [7,8,9]. After regularization, it naturally forms a symmetric positive definite (SPD) matrix object. Therefore, transforming a time–frequency patch into an SPD-valued structure field provides a more appropriate representation for detection tasks dominated by local structural information.
In this work, an SPD field is a spatially distributed collection of local symmetric positive definite tensors. Each tensor describes the local directional organization and anisotropy of a time–frequency patch, while the field preserves how such local structures are spatially arranged across the entire observation.
For the purpose of this study, the relevant non-stationary behavior is considered from a structural time–frequency perspective. The signal characteristics of interest are not assumed to be fully described by a time-invariant spectrum, a stationary covariance model, or a global energy statistic. Instead, the class-relevant information may appear as local organization patterns in the time–frequency plane, including local ridges, drifting spectral components, directional continuity, fragmented structures, or spatially localized texture changes. The purpose of introducing a local SPD structure field is therefore to model how these local time–frequency structures are organized, rather than to detect non-stationarity merely as a binary property of a signal.
The SPD manifold and information geometry provide intrinsic metrics for comparing such structural objects [10,11,12,13,14]. Previous studies have shown that the affine-invariant Riemannian metric (AIRM), the Karcher mean, the Riemannian geometric mean, and related matrix-manifold methods have been used for covariance modeling and brain–computer interface classification [15,16]. In radar detection, information-geometric and matrix information-geometric methods usually represent an observation cell as a single covariance matrix, Hermitian positive definite (HPD) matrix, or cell-level matrix object, and then construct detection statistics using matrix distances, divergences, or geometric filtering [17,18,19,20,21,22,23]. These methods effectively exploit the non-Euclidean geometry of matrix objects, but most remain at the level of sample-wise or cell-level matrix comparison and preserve little of the spatial distribution of local structures inside a patch.
Recent matrix-manifold studies further show that SPD/HPD matrix representations can be equipped with different intrinsic metrics, alignment operations, and discriminative projections. For example, O ( n ) -invariant Riemannian metrics provide a broad geometric framework for SPD matrices, Riemannian Procrustes analysis uses geometry-aware transformations for transfer learning on SPD covariance features, and discriminative HPD-manifold projection has been used for matrix information-geometric radar detection in non-Gaussian clutter [24,25,26]. These works reinforce the importance of respecting matrix-manifold geometry when positive-definite matrix objects are used as signal representations.
This leaves a methodological gap. Time–frequency patch methods preserve locality but usually lack SPD geometry-consistent modeling; SPD information-geometric detectors have a mature manifold foundation but often compress each observation into a single matrix object; and structure-tensor methods describe local directional organization but have rarely been formulated as sample-level detection statistics under fixed false-alarm probability ( P fa ) constraints. The present work addresses this gap by modeling each sample as a spatially distributed local SPD structure field, thereby preserving both the local organization of time–frequency structures and the intrinsic geometry of SPD matrices.
Motivated by this gap, this paper proposes an information-geometric detector based on local SPD structure fields for non-stationary signal detection problems in which the discriminative information is mainly reflected in local time–frequency structural organization. The proposed method first represents a time–frequency log-amplitude patch as a local SPD structure field composed of pointwise structure tensors. It then estimates two class-conditional pointwise Karcher mean reference fields under AIRM, and constructs local distance-difference evidence using the pointwise difference between squared AIRM geodesic distances. Finally, discriminative weighting, block-wise robust evidence pooling, and fixed- P fa threshold calibration based on an independent null-hypothesis ( H 0 ) calibration set are combined to form a sample-level detection statistic.
The main contributions of this paper are fourfold. First, we introduce an object-level reformulation for non-stationary signal detection by using local symmetric positive definite (SPD) structure fields as detection objects. This reformulation bridges time–frequency patch representations and Riemannian matrix-based detection frameworks, shifting the detection object from conventional scalar statistics or single-matrix summaries to spatially distributed structural objects.
Second, we construct a geometry-consistent relative-closeness detector on the proposed SPD structure-field representation. Class-conditional reference fields are estimated by pointwise Karcher means under the affine-invariant Riemannian metric (AIRM), and local distance-difference evidence is defined through pointwise differences between squared AIRM geodesic distances. This provides a field-level, geometry-consistent reformulation of the classical relative-closeness decision principle on the SPD manifold.
Third, we develop a robust evidence aggregation mechanism for local-structure-dominated detection. Discriminative weighting is used to emphasize stable local structural regions, whereas block-wise robust pooling suppresses low-information areas, local misalignment, and abnormal responses. The resulting aggregation framework integrates spatially nonuniform local distance-difference evidence into a sample-level detection statistic under fixed- P fa calibration.
Fourth, we provide a mechanism-level analysis and validation framework based on a controlled SPD-field structured-locality benchmark, baseline comparisons, ablation studies, structural perturbation experiments, non-Gaussian background experiments, and paired-difference analysis. This analysis separates the roles of the object-layer representation and the Riemannian metric, showing that the local SPD structure-field representation is the primary source of performance gain, while Riemannian geometry provides a complementary consistency constraint and improves stable comparison within the same representation layer.
The remainder of this paper is organized as follows. Section 2 introduces the theoretical motivation and algorithmic construction of the proposed detector. Section 3 presents the experimental setup and results. Section 4 discusses the methodological relationships, applicability limits, and future directions. Section 5 concludes the paper.

2. Materials and Methods

2.1. Problem Formulation and Information-Geometric Motivation

Classical binary hypothesis testing is usually formulated within the likelihood-ratio test (LRT) framework [1]. Under an ideal setting in which the statistical models are known, let the observation x follow the probability models p 0 ( x ) and p 1 ( x ) under the null hypothesis H 0 and the alternative hypothesis H 1 , respectively. The classical likelihood-ratio test can then be written as
Λ ( x ) = p 1 ( x ) p 0 ( x ) H 0 H 1 η ,
where η is the decision threshold. For N independent and identically distributed observations { x i } i = 1 N , the normalized log-likelihood ratio is
1 N i = 1 N ln Λ ( x i ) = 1 N i = 1 N ln p 1 ( x i ) p 0 ( x i ) .
As N , the law of large numbers implies that the above expression converges to an expectation under the true distribution q ( x ) . Combined with the Kullback–Leibler (KL) divergence [27],
D ( q p ) = q ( x ) ln q ( x ) p ( x ) d x ,
the normalized log-likelihood ratio is equivalent to
D ( q p 0 ) D ( q p 1 ) .
Therefore, under ideal large-sample conditions, classical detection can be interpreted as a relative-closeness decision in the sense of KL divergence [18,28]: the observation distribution is compared with the two hypothesized models, and the class with the smaller Kullback–Leibler divergence is selected.
This interpretation is used only as theoretical motivation. In the present work, the detection object is not a distribution-level hypothesis model or a single global covariance matrix, but an SPD-valued structure field defined over a local support Ω :
S = { S ( x ) : x Ω } , S ( x ) S + + 2 .
Here, S + + 2 denotes the set of 2 × 2 symmetric positive definite matrices.
Correspondingly, the objects to be compared are no longer the two probability models p 0 and p 1 , but two class-conditional reference structure fields,
S 0 = { S 0 ( x ) : x Ω } , S 1 = { S 1 ( x ) : x Ω } .
This object-layer redefinition is the key starting point that distinguishes the proposed method from the classical detection object level.
On this new object layer, the idea of classical relative closeness can be reformulated at the field level. Let d R ( · , · ) denote the geodesic distance on the SPD manifold, and let w ( x ) 0 be a spatial weight. The field-level energy functional relative to the class-c reference structure field can be defined as
E c ( S ) = x Ω w ( x ) d R 2 S ( x ) , S c ( x ) , c { 0 , 1 } .
The corresponding field-level relative-closeness statistic is then defined as
T geo ( S ) = E 0 ( S ) E 1 ( S ) .
A larger value of T geo ( S ) indicates that the test structure field is globally closer, in the geometric sense, to S 1 than to S 0 ; conversely, a smaller value indicates greater closeness to S 0 . Expanding Equation (7) gives
T geo ( S ) = x Ω w ( x ) d R 2 S ( x ) , S 0 ( x ) d R 2 S ( x ) , S 1 ( x ) .
This expression shows that field-level relative closeness can be naturally written as a spatially weighted sum of pointwise differences between squared geodesic distances. The local distance-difference evidence and its sample-level aggregation developed below are constructed precisely from this field-level reformulation.
The field-level statistic above is used only to explain the design logic of the proposed method, not as a formal optimality statement for the proposed detector. The proposed method inherits the geometric idea of making a decision according to relative closeness from classical detection [29,30,31], but on the new detection object of local SPD structure fields, it redefines the class-conditional reference centers, the local comparison criterion, and the sample-level evidence aggregation mechanism.

2.2. Local Time–Frequency Structure-Field Representation

Let the observed discrete-time signal be x [ n ] , where n = 0 , 1 , , N 1 . To characterize local structural features of non-stationary signals in the joint time–frequency domain, we first use the short-time Fourier transform (STFT) to map the raw observation onto the time–frequency plane [2,3]. It is defined as
X ( m , k ) = n = 0 N 1 x [ n ] ω [ n m R ] e j 2 π k n / K ,
where ω [ · ] is the analysis window, R is the frame shift, m is the time-frame index, k is the frequency-bin index, and K is the number of discrete frequency points. The corresponding magnitude spectrum is denoted by
A ( m , k ) = | X ( m , k ) | .
In this paper, the time–frequency representation is not the final decision object, but an intermediate domain for constructing the local structure-field representation. Compared with the raw one-dimensional waveform, the time–frequency representation can more directly reveal transient energy concentration, local ridges, directional continuity, frequency drift, and fragmented textures. These local organizational patterns are often more directly related to the task-relevant discriminative information in complex non-stationary detection tasks than any single global statistic.
Thus, the role of non-stationarity in the proposed pipeline is twofold. First, it motivates the use of a time–frequency representation, because the discriminative structures may change with time and may not be visible in a global spectrum or in raw waveform energy alone. Second, it motivates a local field representation rather than a single pooled statistic, because the useful evidence may be spatially localized, directionally organized, and unevenly distributed over the time–frequency support. The subsequent SPD structure-field construction is designed to preserve this local organization at the object level.
To reduce numerical instability caused by a large amplitude dynamic range and to enhance the separability of weak structural regions, we further use the log-amplitude representation
L ( m , k ) = log A ( m , k ) + ε α ,
where ε α > 0 is a small regularization term used to avoid numerical singularities. Local patches are then extracted from L ( m , k ) , and the patch support is denoted by
Ω Z 2 , x = ( t , f ) Ω .
The input object of the subsequent detector is the local structure field defined on Ω . This object choice means that the focus of the paper is not the intensity values themselves, but the directional relationships and spatial organization of local structural units within the patch.
On a local patch, we first compute the local gradient of the log-amplitude map,
L ( x ) = L t ( x ) L f ( x ) , x Ω ,
where L t ( x ) and L f ( x ) denote the first-order derivatives along the temporal and frequency directions, respectively. The gradient directly reflects the direction and magnitude of local intensity variations. However, a single gradient vector is sensitive to noise, slight misalignment, and isolated outliers, and is therefore not stable enough to represent neighborhood-level structural organization. For this reason, we do not use the gradient itself as the final local feature; instead, we further construct a second-order structure tensor.
The raw second-order tensor is defined as
J 0 ( x ) = L ( x ) L ( x ) T = L t 2 ( x ) L t ( x ) L f ( x ) L t ( x ) L f ( x ) L f 2 ( x ) .
This tensor encodes local directional energy, directional coupling, and anisotropy into a 2 × 2 symmetric matrix [7,8,9,32]. To lift this representation from a pointwise gradient outer product to a stable neighborhood-scale second-order structural statistic, we further apply local smoothing to J 0 ( x ) :
J ( x ) = G σ T J 0 ( x ) ,
where G σ T is the Gaussian kernel corresponding to the integration scale of the structure tensor, and ∗ denotes convolution. This smoothing step is not merely denoising; rather, it accumulates directional information over a local neighborhood, so that the structure tensor more stably reflects the directional organization pattern inside a patch.
Based on this smoothed tensor, we add a ridge regularization term and define the pointwise structure tensor as
S ( x ) = J ( x ) + λ I 2 , λ > 0 .
Thus, for any x Ω ,
S ( x ) S + + 2 .
The membership in S + + 2 is ensured by two factors: local smoothing lifts the structural statistic from a pointwise gradient outer product to neighborhood-level second-order information, while λ I 2 further moves the matrix away from the degenerate boundary. This guarantees that subsequent Riemannian distances, Karcher means, and sample-level geometric comparisons are all performed in a valid SPD space.
Therefore, the entire patch can be represented as an SPD-valued structure field defined on Ω :
S = { S ( x ) : x Ω } .
This representation is not a lossless transform of the raw patch, but a task-oriented local structural representation designed to preserve detection-relevant second-order geometric information, including directional organization, anisotropy, and spatial organization. All subsequent modeling and comparison steps are built around this SPD structure field.

2.3. Class-Conditional Reference Structure Fields Under AIRM

After obtaining the local SPD structure-field representation, the core training-stage task is to estimate, from the two classes of training samples, class-conditional reference structure fields that represent their local geometric organization patterns. Because the subsequent local comparison uses the affine-invariant Riemannian metric (AIRM), the reference centers must be defined under the same geometry. Otherwise, reference modeling and distance comparison would no longer share a unified intrinsic geometric framework.
Let the structure field of the i-th training patch in class c { 0 , 1 } be denoted by
S i ( c ) = { S i ( c ) ( x ) : x Ω } , S i ( c ) ( x ) S + + 2 .
For any fixed position x Ω , the training samples from the same class provide a set of SPD matrices,
S i ( c ) ( x ) i = 1 N c ,
where N c is the number of training samples in class c. Instead of globally compressing the entire patch first, this paper estimates the class-conditional reference structure tensor separately at each fixed position, thereby preserving the spatial distribution of local geometric relationships. The reference structure field for class c is therefore defined as
S c = { S ¯ c ( x ) : x Ω } , c { 0 , 1 } ,
where S ¯ c ( x ) is the class-conditional reference structure tensor at position x. For any A , B S + + 2 , the AIRM geodesic distance is defined as [11,12,13]
d R ( A , B ) = log A 1 / 2 B A 1 / 2 F ,
where log ( · ) denotes the matrix logarithm and · F denotes the Frobenius norm. This distance is affine-invariant on the SPD manifold and characterizes intrinsic geometric differences between covariance-like objects. It has therefore been widely used for geometric modeling and classification of SPD matrices.
Accordingly, the reference structure tensor of class c at position x is defined as the pointwise Karcher mean under AIRM [10,11,33]:
S ¯ c ( x ) = arg min Y S + + 2 i = 1 N c d R 2 Y , S i ( c ) ( x ) .
The two class-conditional reference structure fields are thus given by
S 0 = { S ¯ 0 ( x ) : x Ω } , S 1 = { S ¯ 1 ( x ) : x Ω } .
This pointwise estimation strategy preserves the spatial distribution of class-conditional local structures and keeps the reference fields structurally aligned with the test structure field. Compared with the arithmetic mean, the Karcher mean is more consistent with the intrinsic geometry of the SPD manifold [14,24,34], and it also keeps reference estimation consistent with the subsequent AIRM-based distance comparison.

2.4. Local Distance-Difference Evidence

After obtaining the two class-conditional reference structure fields S 0 and S 1 , the testing-stage task is to construct local distance-difference evidence by comparing the test structure field with the two reference fields under a unified SPD/AIRM geometry. Let the structure field corresponding to a test sample be
S = { S ( x ) : x Ω } , S ( x ) S + + 2 .
Because the local structure tensor at each position belongs to the SPD space, the local comparison between the test structure field and the reference structure fields should not be reduced to element-wise Euclidean differences or Frobenius differences. Instead, it should be built on the intrinsic geometry that is consistent with reference modeling [13,14,15,16]. For this reason, AIRM is again adopted as the distance metric for pointwise comparison.
For any position x Ω , the pointwise geodesic distance from the test structure tensor to each class reference structure tensor is defined as
d c ( x ) = d R S ( x ) , S ¯ c ( x ) , c { 0 , 1 } .
Here, S ¯ c ( x ) is the pointwise Karcher mean reference tensor of class c at position x. The local distance-difference evidence is then defined pointwise as
Δ ( x ) = d 0 2 ( x ) d 1 2 ( x ) , x Ω .
The sign of this quantity has a direct local discriminative meaning. When Δ ( x ) > 0 , the test structure tensor at position x is locally closer, in the geometric sense, to S ¯ 1 ( x ) than to S ¯ 0 ( x ) . When Δ ( x ) < 0 , it is closer to S ¯ 0 ( x ) . Thus, Δ ( x ) forms a spatially distributed local distance-difference evidence map over the entire region Ω .
The key point of this construction is that local comparison and class-conditional reference modeling share the same geometric framework. In Section 2.3, the class-conditional centers are given by pointwise Karcher means under AIRM; in this section, the local comparison of the test sample with the reference centers is also performed using AIRM. Therefore, Δ ( x ) is not a comparison of raw intensity, gradient magnitude, or a single local energy value. It is a comparison of the relative closeness of local second-order structural objects on the SPD manifold. Accordingly, Δ ( x ) can be viewed as the pointwise expansion of the field-level relative-closeness statistic introduced in Section 2.1, characterizing the local geometric tendency of the test structure field toward the two reference fields.
Under this definition, Δ ( x ) is not merely an empirical distance-difference quantity; it can also be given an explicit information-geometric interpretation under local approximation conditions [13,35].
Proposition 1.
Information-geometric interpretation of local distance-difference evidence. Suppose that, for any position x Ω , the test structure tensor S ( x ) satisfies a locally isotropic Riemannian Gaussian approximation model in a neighborhood of the class-c reference tensor S ¯ c ( x ) [35]:
p c ( S ( x ) ) exp d R 2 S ( x ) , S ¯ c ( x ) 2 σ 2 , c { 0 , 1 } ,
where d R 2 ( · , · ) is the squared AIRM geodesic distance and σ 2 is a shared local perturbation scale for the two classes. If the correlation among local positions is approximately absorbed into a nonnegative spatial weight w ( x ) 0 in the field-level statistic, then the weighted distance-difference statistic
x Ω w ( x ) d R 2 S ( x ) , S ¯ 0 ( x ) d R 2 S ( x ) , S ¯ 1 ( x )
differs from the approximate log-likelihood ratio only by a positive proportionality factor and an additive constant.
Proof of Proposition 1.
Under the locally isotropic Riemannian Gaussian approximation above,
log p c ( S ( x ) ) = d R 2 S ( x ) , S ¯ c ( x ) 2 σ 2 + C c ( x ) , c { 0 , 1 } .
When the two classes share the same local perturbation scale and the difference between normalization constants is absorbed into an additive constant, we have
log p 1 ( S ( x ) ) p 0 ( S ( x ) ) = d R 2 S ( x ) , S ¯ 1 ( x ) 2 σ 2 + d R 2 S ( x ) , S ¯ 0 ( x ) 2 σ 2 + C .
Rearranging gives
log p 1 ( S ( x ) ) p 0 ( S ( x ) ) = 1 2 σ 2 d R 2 S ( x ) , S ¯ 0 ( x ) d R 2 S ( x ) , S ¯ 1 ( x ) + C ,
that is,
log p 1 ( S ( x ) ) p 0 ( S ( x ) ) = 1 2 σ 2 Δ ( x ) + C .
Further taking a spatially weighted sum over x Ω yields
x Ω w ( x ) log p 1 ( S ( x ) ) p 0 ( S ( x ) ) = 1 2 σ 2 x Ω w ( x ) Δ ( x ) + C .
Therefore, under the local approximation conditions above, the field-level weighted distance-difference statistic is monotonically consistent with the approximate log-likelihood ratio. This proposition explains only the information-geometric meaning of the additive distance-difference statistic under a locally isotropic Riemannian Gaussian approximation. The discriminative weighting and block-wise robust pooling introduced below are sample-level aggregation mechanisms built on this local distance-difference evidence. They are intended to enhance stable discriminative regions and reduce the effects of local misalignment, structural fragmentation, and abnormal responses, but they do not constitute an optimality proof in the Neyman–Pearson sense. □

2.5. Discriminative Weighting and Block-Wise Robust Pooling

The local distance-difference evidence map Δ ( x ) provides spatially distributed geometric information, but different positions do not contribute equally to the final decision. To enhance stable discriminative regions and suppress the effects of local misalignment, structural fragmentation, and abnormal responses, we introduce discriminative weighting and block-wise robust evidence pooling.
Let S ¯ 0 ( x ) and S ¯ 1 ( x ) denote the two class-conditional reference structure tensors at position x. The local between-class separation is defined as
Sep ( x ) = d R 2 S ¯ 0 ( x ) , S ¯ 1 ( x ) .
For class c { 0 , 1 } , the within-class dispersion at position x is defined as
Disp c ( x ) = 1 N c i = 1 N c d R 2 S i ( c ) ( x ) , S ¯ c ( x ) .
The unnormalized discriminative weight is then given by
W raw ( x ) = Sep ( x ) Disp 0 ( x ) + Disp 1 ( x ) + ε w , ε w > 0 .
This quantity measures the stable local separability of the geometric structure at position x. Positions with large between-class separation and small within-class dispersion are expected to provide persistent discriminative evidence, whereas positions dominated by high dispersion and low separation are down-weighted.
To make the weights comparable across spatial positions and reduce high-frequency fluctuations caused by finite training samples, W raw ( x ) is first min–max normalized,
W 0 ( x ) = MinMax W raw ( x ) ,
and then mildly smoothed and clipped to the interval [ 0 , 1 ] :
W ( x ) = clip G σ W W 0 ( x ) , 0 , 1 .
The resulting discriminative weight map W ( x ) emphasizes stable local discriminative regions while preserving spatial continuity in the weight field.
After obtaining Δ ( x ) and W ( x ) , the remaining task is to aggregate the weighted local distance-difference evidence into a sample-level detection statistic. A direct global summation of the weighted evidence,
x Ω W ( x ) Δ ( x ) ,
can still be sensitive to local shifts, missing structures, and isolated abnormal responses. In complex non-stationary scenarios, discriminative evidence is often concentrated in a small number of local structural regions rather than uniformly distributed over the entire patch. This idea is related to multiple-instance learning and set-level pooling, where sample-level decisions are inferred from local instances. However, the proposed method uses non-learned, geometry-driven evidence aggregation rather than trainable attention weights or deep pooling functions [36,37,38].
We define a set of overlapping blocks over Ω :
B = { B } = 1 L .
For each block B , the weighted block score is computed as follows:
s = x B W ( x ) Δ ( x ) x B W ( x ) + ε b , = 1 ,   ,   L , ε b > 0 .
This block-level averaging reduces the influence of pointwise outliers and small local shifts, while preserving the spatial concentration of high-response local structures.
The block scores { s } = 1 L are then sorted in descending order. Given a top-block fraction q ( 0 , 1 ] , the number of selected high-response blocks is
K = max { 1 , q L } .
The global mean term and the top-block mean term are defined as
μ all = 1 L = 1 L s ,
μ top = 1 K L top s ,
where L top denotes the index set of the selected top K blocks. The final sample-level statistic is
T = ( 1 α ) μ all + α μ top , α [ 0 , 1 ] .
Here, μ all captures the overall geometric tendency over the field, whereas μ top emphasizes salient responses from sparse discriminative structures [39]. The aggregation coefficient α controls the trade-off between global stability and local saliency. This aggregation is not intended as a theoretically optimal mixture; rather, it provides a controlled balance for local-structure detection, where discriminative evidence can be spatially sparse and locally unstable. In the experiments, the top-block fraction q and the aggregation coefficient α are fixed across all nominal signal-to-noise ratio/signal-to-clutter ratio (SNR/SCR)-like index points, random seeds, and proposed and ablated variants; they are not re-tuned separately for individual operating points. The general selection principles of these and other numerical parameters are summarized in the subsection entitled “Controlled SPD-Field Benchmark Generation”.
Thus, the test sample is mapped from the local distance-difference evidence map Δ ( x ) to a sample-level statistic T. The discriminative weight map emphasizes stable discriminative positions, block-wise scoring reduces pointwise anomalies and local shifts, and the combination of μ all and μ top balances global stability with local saliency.

2.6. Final Decision Rule and Fixed- P Fa Threshold Calibration

Given the sample-level statistic T, the final decision rule is defined as
T H 0 H 1 γ .
Here, γ is the detection threshold. A larger value of T indicates that the test sample is closer to the target-class reference structure field S 1 after discriminative weighting and robust pooling; conversely, a smaller value indicates greater closeness to the null-class reference structure field S 0 . Therefore, the threshold is calibrated using an independent H 0 calibration set [40,41,42].
Let the statistics computed from the independent H 0 calibration set be { T j cal , 0 } j = 1 M cal . Sorting them in ascending order gives
T ( 1 ) cal , 0 T ( 2 ) cal , 0     T ( M cal ) cal , 0 .
For a target false-alarm probability P fa , we use the empirical order-statistic threshold
k ( P fa ) = min max ( 1 P fa ) M cal , 1 , M cal , γ ( P fa ) = T ( k ( P fa ) ) cal , 0 .
The final decision is
T > γ ( P fa ) H 1 , T γ ( P fa ) H 0 .
Because γ ( P fa ) is estimated from a finite number of H 0 calibration samples, the achieved false-alarm probability does not necessarily equal the nominal target value exactly. We therefore estimate empirical false-alarm probability, referred to as achieved P fa , using an independent H 0 audit set:
P ^ fa audit = 1 M audit j = 1 M audit 1 T j audit , 0 > γ ( P fa ) .
The detection probability is estimated using an independent H 1 test set:
P ^ d = 1 M 1 j = 1 M 1 1 T j test , 1 > γ ( P fa ) .
This protocol explicitly separates threshold estimation, detection evaluation, and false-alarm auditing. It avoids calibration/test leakage and ensures that fixed- P fa comparisons among different detectors are performed on a consistent experimental basis. Receiver operating characteristic (ROC) curves are obtained by sweeping the threshold, whereas all fixed- P fa operating-point results use the independent H 0 calibration set for threshold determination and the independent H 0 audit set for false-alarm validation.

2.7. Algorithmic Summary of the Proposed Detector

The leading idea of the proposed detector is to compare local structural organization rather than raw intensity or a single global statistic. As illustrated in Figure 1, a waveform or time–frequency patch is first represented as a local SPD structure field. Class-conditional reference fields are then estimated by pointwise Karcher means under AIRM. During testing, the test field is compared with the two reference fields to obtain local distance-difference evidence, which is weighted, robustly pooled, and finally converted into a fixed- P fa decision using an independently calibrated threshold.
Algorithm 1 summarizes the complete procedure. For raw waveform or spectrogram inputs, the local SPD structure field is constructed using the STFT and structure-tensor procedure described in Section 2.2. In the controlled benchmark of Section 3, generated SPD fields are directly used as inputs to the reference-estimation and scoring stages.
Algorithm 1. Proposed information-geometric detector based on local SPD structure fields
Input:
Raw training samples or precomputed SPD-field samples X i ( 0 ) , X i ( 1 ) / S i ( 0 ) , S i ( 1 ) ;
raw test sample or precomputed SPD-field sample X / S ;
independent H 0 calibration set { X j cal , 0 } j = 1 M cal ;
target false-alarm probability P fa ;
local patch support Ω ;
overlapping block set B = { B } = 1 L ;
top-block fraction q;
aggregation coefficient α .
Output:
Sample-level detection statistic T and final decision.
Training phase:
1:
For each training sample, obtain its local SPD structure field.
2:
If raw inputs are used, construct the local SPD structure field following Section 2.2.
3:
If the input is a controlled SPD-field sample, use the generated SPD field directly.
4:
End for.
5:
For each position x Ω and each class c { 0 , 1 } , estimate the pointwise Karcher mean reference tensor according to Equation (24).
6:
Obtain the two class-conditional reference fields S 0 and S 1 .
7:
Compute Sep ( x ) , Disp 0 ( x ) , and Disp 1 ( x ) for all x Ω .
8:
Construct the discriminative weight map W ( x ) by normalization, smoothing, and clipping.
Calibration phase:
9:
For each calibration sample X j cal , 0 , do.
10:
Compute its local SPD structure field S j cal , 0 .
11:
Compute the local distance-difference evidence Δ ( x ) according to Equation (28).
12:
For each block B , compute the weighted block score s according to Equation (42).
13:
Sort { s } = 1 L in descending order and select the top K = max { 1 , q L } blocks.
14:
Compute the calibration statistic T according to Equation (46).
15:
End for.
16:
Sort the calibration H 0 statistics and obtain γ ( P fa ) using the empirical order-statistic rule in Section 2.6.
Testing phase:
17:
Compute the local SPD structure field S of the test sample X.
18:
Compute the local distance-difference evidence Δ ( x ) according to Equation (28).
19:
For each block B , compute the weighted block score s according to Equation (42).
20:
Sort { s } = 1 L in descending order and select the top K blocks.
21:
Compute μ all and μ top according to Equations (44) and (45).
22:
Compute the final statistic T = ( 1 α ) μ all + α μ top .
23:
If T > γ ( P fa ) , decide H 1 ; otherwise, decide H 0 .

2.8. Computational Complexity

Table 1 summarizes the computational complexity of the proposed detector. Let N = N 0 + N 1 denote the total number of training samples, | Ω | the number of spatial positions, I K the maximum number of Karcher iterations, L the number of overlapping blocks, | B | the size of block B , M the number of calibration samples, and C det the cost of evaluating one sample-level statistic.
The main computational cost of the proposed detector comes from pointwise Riemannian reference estimation and repeated AIRM distance evaluation. Although AIRM provides an intrinsic comparison on the SPD manifold, faster alternatives such as Log-Euclidean metrics or tangent-space approximations may reduce the online cost in large-scale settings [24,34,43].

3. Experimental Results

3.1. Experimental Setup and Main Detection Scene

The experiments evaluate the effectiveness, component contributions, and applicability limits of the proposed detector. In all formal experiments, the training, calibration, testing, and audit sets are mutually independent. Receiver operating characteristic (ROC) curves are obtained by directly sweeping the detection threshold. For fixed false-alarm probability operating points, the threshold is determined from the empirical quantile of an independent H 0 calibration set matched to the corresponding experimental condition. Two target operating points, P fa = 10 2 and P fa = 10 3 , are reported throughout the experiments. The achieved false-alarm probability is also reported as an empirical calibration check to verify whether the nominal false-alarm target is realized at the expected order of magnitude.
The main experiment uses a structured-locality detection scene. This scene is not designed to create separability through pronounced global energy differences, mean spectral appearance differences, or a single pooled covariance statistic. Instead, the class difference is mainly encoded in local structural orientation, spatial arrangement, and structural stability. From the viewpoint of non-stationary signal analysis, this scene represents the situation in which the informative content is spatially inhomogeneous and locally organized over the time–frequency support. The local structural pattern varies with position, and the class distinction is expressed through localized orientation organization and spatial arrangement rather than through a single global distribution. Therefore, the benchmark is intended to emulate a local-structure-dominated non-stationary detection setting at the SPD-field object layer. Additional structural perturbation and non-Gaussian background experiments are further conducted to examine the robustness and applicability limits of the proposed detector.
In the formal experiments, 20,000 independent H 0 samples are used for fixed- P fa threshold calibration, 500 H 0 test samples and 500 H 1 test samples are used for ROC, area under the curve (AUC), and detection probability ( P d ) evaluation, and another 20,000 independent H 0 audit samples are used only for achieved P fa validation. All evaluated methods share the same data splits, target false-alarm probabilities, calibration protocol, and audit protocol. Therefore, the performance differences are mainly attributable to the detection statistics themselves rather than to threshold implementation or sample reuse.
The experiments are conducted on a controlled SPD-field object-layer benchmark. Section 2 describes the complete construction, from raw observations or time–frequency patches to local SPD structure fields. In Section 3, however, samples are generated directly at the SPD-field object layer in order to isolate and evaluate the core detector mechanisms after the representation stage, including reference-field estimation, local distance-difference evidence, discriminative weighting, block-wise robust pooling, and fixed- P fa calibration. This design allows the experiment to focus on whether the proposed detector can exploit local structural organization once such structures have been represented as SPD fields. Therefore, the experimental conclusions validate the detector mechanism after SPD-field representation, rather than a complete end-to-end waveform-level detection pipeline.

Controlled SPD-Field Benchmark Generation

The main scene generates samples directly at the local SPD structure-field object layer. The patch support is defined as
Ω = { 1 ,   ,   H } × { 1 ,   ,   W } , H = W = 32 .
Each sample is represented as an SPD-valued field,
S i = { S i ( x ) : x Ω } , S i ( x ) S + + 2 .
For an orientation angle θ , the directional SPD prototype matrix is defined as
C ( θ ) = R ( θ ) λ 1 0 0 λ 2 R ( θ ) T ,
where R ( θ ) is a two-dimensional rotation matrix, λ 1 = 1.80 , and λ 2 = 0.55 . All generated matrices are symmetrized and constrained by a minimum eigenvalue condition,
λ min S i ( x ) 10 4 .
The background structure is generated from a shared orientation atlas θ bg atlas ( x ) . This atlas is constructed from four quadrant-wise base orientations, 55 ° , 15 ° , 35 ° , and 70 ° , and is mildly smoothed by a Gaussian kernel to avoid artificial discontinuities. At background positions, the SPD tensor is generated in the log domain as
S bg ( x ) = Π S + + 2 exp log C θ bg atlas ( x ) + ε θ + E bg ,
where ε θ denotes background orientation jitter, E bg is a symmetric log-domain perturbation, and Π S + + 2 denotes SPD correction under the eigenvalue-flooring constraint.
Class-discriminative differences are introduced through stable local structural islands. The class-defining orientation separation is set to θ sep = 44 ° . With the base orientation set to 0 ° , the two class-discriminative orientations are
θ disc ( 0 ) = θ sep 2 , θ disc ( 1 ) = + θ sep 2 .
The main scene contains three discriminative local structures centered at ( 8 , 8 ) , ( 12 , 22 ) , and ( 23 , 14 ) , with a radius of 3.2 and relative amplitudes of 1.00 , 0.82 , and 0.68 , respectively. The mask of the k-th local structure is defined as
M k ( x ) = a k exp x c k 2 2 r 2 max x Ω exp x c k 2 2 r 2 .
Inside a discriminative local structure, the local orientation is obtained by interpolating between the background orientation and the class-discriminative orientation:
θ loc ( c ) ( x ) = arg 1 M k ( x ) e j θ bg ( x ) + M k ( x ) e j θ disc ( c ) + ε disc .
The discriminative orientation jitter is set to 0.4 ° , and the discriminative log-domain perturbation amplitude is set to 0.006 .
To avoid reducing the scene to a simple template-matching problem, each sample further includes six shared unstable distractors. The center of each distractor is randomly sampled, its radius is set to 2.2 , its orientation is randomly selected from
{ 75 ° ,   45 ° ,   15 ° ,   15 ° ,   45 ° ,   75 ° } ,
and a rotation jitter of 16 ° is applied. Its amplitude is randomly sampled from [ 0.22 , 0.48 ] . These distractors serve as nuisance local structures and simulate local interference, misalignment, and non-discriminative structural responses. Consequently, each generated sample is a spatially inhomogeneous SPD field rather than a homogeneous field generated from a single position-independent tensor distribution. The background atlas, localized discriminative islands, orientation jitter, and shared unstable distractors jointly create position-dependent local structural variations. These variations are used to represent, at the object layer, the kind of non-stationary time–frequency organization that motivates the proposed detector.
In this benchmark, the nominal index ρ is a background-difficulty control parameter rather than a measured physical signal-to-noise ratio or signal-to-clutter ratio. It does not modify the class-defining structural separation or the amplitudes of the discriminative local structures. Instead, ρ controls nuisance factors, including background perturbation, background orientation jitter, distractor perturbation, and distractor strength. Although the benchmark does not define a physical SCR, the nominal index serves an analogous role by controlling the strength of background nuisance factors.
The perturbation scale is defined as
η ( ρ ) = clip 10 ( ρ ref ρ ) / s , η min , η max ,
where ρ ref = 12 dB, s = 20 , η min = 0.75 , and η max = 2.50 in the main experiments. The exponential form in Equation (60) is not intended to model a physical SNR or SCR relationship. It is adopted as a convenient monotonic mapping that produces approximately logarithmic changes in nuisance intensity when the nominal index is varied in dB. Therefore, the nominal SNR/SCR-like index sweep evaluates how the detectors behave under different background-difficulty conditions. It facilitates fixed- P fa performance comparison across nuisance levels, while avoiding artificial separability caused by changing the class-defining local structures themselves.
All experiments use mutually independent training, calibration, testing, and audit sets. The training sets are used to estimate class-conditional pointwise reference fields and the discriminative weight map. The calibration set is used only for fixed- P fa threshold estimation. The testing sets are used for AUC and P d evaluation, and the independent H 0 audit set is used only for achieved P fa validation.
The parameters listed in Table 2 are not used as free fitting degrees of freedom for individual curves or operating points. They are fixed before the formal comparisons and kept unchanged across nominal SNR/SCR-like index values, random seeds, calibration/test splits, and proposed and ablated variants, unless an experiment explicitly studies a perturbation factor. This fixed-configuration policy is intended to avoid treating the detector as an unconstrained multi-parameter fitting model.
The selection of these parameters follows the principles of numerical stability, local-structure preservation, SPD validity, robust aggregation, and fair fixed- P fa comparison. Specifically, ϵ α is used as a small stabilization term to prevent logarithmic singularities; σ T sets the local integration scale of the structure tensor; λ and the eigenvalue floor keep tensors inside the valid SPD cone; ϵ w and σ W stabilize the discriminative weight map; the block size, stride, and ϵ b control robust local pooling; q and α balance sparse local saliency with global stability; the Karcher tolerance and iteration limit are determined by convergence and computational cost; and the calibration, test, and audit sample sizes are used to separate threshold calibration, detection evaluation, and achieved- P fa auditing. The selected values are not claimed to be universally optimal; rather, they provide a fixed and transparent configuration for comparing detector mechanisms under the same controlled benchmark and calibration protocol.

3.2. Main Results Under the Structured-Locality Detection Scene

This section compares the proposed detector with the uniform-weight variant and the global-pooling variant in the main scene. The nominal SNR/SCR-like background-difficulty index is swept from 20 dB to 0 dB. Both the overall ranking ability and the detection performance at fixed- P fa operating points are evaluated under this controlled nuisance-difficulty sweep.
As shown in Figure 2, the proposed detector achieves the highest average AUC in the main scene, but the source of this advantage should be interpreted in layers. Compared with the global-pooling variant, the proposed detector shows a more consistent advantage across the nominal SNR/SCR-like index sweep, indicating that purely global aggregation weakens the contribution of local discriminative structures. Compared with the uniform-weight variant, the improvement is smaller but generally stable, suggesting that discriminative weighting provides a supplementary benefit by emphasizing stable local structural regions. Because the benchmark deliberately suppresses global low-order cues, the AUC does not vary strictly monotonically with the nominal SNR/SCR-like index. Local fluctuations between adjacent nominal SNR/SCR-like index points mainly reflect the joint effects of nuisance/background variability, random distractors, and the finite number of random seeds, rather than a simple energy-detection behavior.
Figure 3 presents the fixed- P fa detection probability curves under different values of the nominal SNR/SCR-like background-difficulty index. These curves are intended to facilitate performance comparison under controlled nuisance levels, in the same spirit as comparing detection probability under different signal-to-noise or signal-to-clutter conditions. Although the benchmark does not define a physical signal-to-clutter ratio, the nominal index plays an analogous role by controlling the intensity of background nuisance factors while keeping the class-defining local structures unchanged.
At fixed- P fa operating points, the proposed detector performs better overall than the uniform-weight and global-pooling variants. At P fa = 10 2 , the detection probabilities at 20 dB, 12 dB, and 0 dB are 0.3624, 0.4316, and 0.5232, respectively, all of which are higher than those of the two simplified variants. At P fa = 10 3 , the advantage of the proposed detector is generally retained, and it achieves the highest or joint-highest performance in the mid-to-high nominal SNR/SCR-like index range. This fixed- P fa advantage should be interpreted together with the paired-difference analysis in Section 3.3, because the gains over geometry-simplified structure-field baselines are clearly smaller than the gains over global low-order baselines.

3.3. Baseline Comparison and Ablation Analysis

To assess comparability against external baselines and the contribution of individual components, we further conduct baseline comparisons and ablation analyses in the main scene. All methods use the same data splits and the same fixed- P fa calibration protocol. Therefore, the comparison focuses on the choice of detection object and the construction of the sample-level statistic, rather than on differences in threshold implementation. Figure 4 summarizes the baseline comparison under the main scene, and Table 3 reports the corresponding average performance results.
The baseline comparison shows that local structure-field methods clearly outperform the global-energy and pooled-covariance baselines. This indicates that, in the present main scene, the discriminative information mainly resides in local structural organization rather than in global energy or a single pooled covariance statistic. The template-correlation baseline is competitive at fixed- P fa operating points, but its AUC is substantially lower than those of local structure-field methods, suggesting that simple template similarity cannot fully capture the geometric variations in local SPD structure fields. The achieved P fa values of all methods are close to their corresponding target levels, supporting a fair comparison under fixed- P fa conditions.
Within the structure-field baselines, the proposed detector provides only a modest improvement over the Euclidean/Frobenius structure-field baseline. To avoid over-interpreting small mean differences, we further conduct paired-difference analysis. For any metric
m { AUC , P d @ 10 2 , P d @ 10 3 } ,
given a baseline b and a paired experimental unit u, the paired difference is defined as
Δ m u , b = m u , proposed m u , b .
For the main nominal SNR/SCR-like index sweep, the paired difference is first computed for each seed–index pair and then averaged over all nominal SNR/SCR-like index points within each random seed. Therefore, the independent paired unit for the confidence interval is the random seed rather than an individual seed–index pair. This prevents adjacent nominal SNR/SCR-like index points under the same seed from being treated as fully independent observations and reduces the risk of underestimating the confidence interval.
We report the mean paired difference and its 95% confidence interval. This analysis is used to avoid over-interpreting small mean performance differences.
Δ m ¯ b ± t 0.975 , n 1 s Δ m , b n .
Table 4 reports the resulting paired performance differences between the proposed detector and the competing methods.
The seed-averaged paired-difference analysis shows that the proposed detector achieves positive AUC gains over both the uniform-weight and global-pooling variants on the main sweep. Its fixed- P fa gains over the global-pooling variant are also relatively clear. For the uniform-weight variant, the confidence interval of the P d difference at P fa = 10 3 slightly crosses zero after seed-level aggregation; therefore, the improvement at this operating point should be interpreted cautiously. In contrast, the gains over global low-order baselines are much larger, whereas the gains over the Euclidean/Frobenius structure-field baseline are small. The main evidence therefore supports the effectiveness of the local SPD structure-field object layer. AIRM-based geometry-consistent modeling should be interpreted as a smaller supplementary contribution rather than as the sole source of a large performance jump. Figure 5 presents the ablation analysis under the main scene.
In the ablation analysis, the proposed detector, the uniform-weight variant, and the global-pooling variant share the same local SPD structure-field representation and the same pointwise AIRM distance-difference map. They differ only in whether discriminative weighting and top-block emphasis are used. The results indicate that the proposed detector achieves the best values on all three core metrics. This suggests that useful discriminative information is not uniformly distributed over the whole patch, but is concentrated in several stable local structural regions. Discriminative weighting increases the contribution of these regions, while block-wise pooling reduces the influence of low-information areas and local abnormal responses on the sample-level statistic.

3.4. Robustness Under Structural Perturbations and Non-Gaussian Conditions

This section evaluates robustness under local structural perturbations and non-Gaussian background perturbations. The purpose is to examine whether the performance ordering remains stable when structural strength and background distribution change. Figure 6 reports the robustness results under local structural perturbations.
In the local structural perturbation experiment, the structural-strength perturbation results show that the gain of the proposed detector over the uniform-weight variant remains generally stable across perturbation settings around the main scene. Under the slightly stronger, main, slightly weaker, and boundary auxiliary conditions, Δ AUC remains positive and stays on the order of 10 2 . This indicates that, when the orientation separation and stability of local structures undergo small to moderate changes, the ranking advantage of the proposed detector does not reverse. The result suggests that the proposed detector retains its advantage when local structures remain present but their strength and stability are perturbed.
The non-Gaussian background perturbation experiment compares Gaussian, Laplace-distributed, impulsive, and heavy-tailed field-level background perturbations. Perturbations are applied at the SPD-field object layer. For an SPD tensor S ( x ) at position x, the tensor is first symmetrized, and a symmetric random perturbation is then added in the log domain:
S ˜ ( x ) = Π S + + 2 exp log S ( x ) + S ( x ) T 2 + Δ ξ ( x ) ,
where Δ ξ ( x ) = Δ ξ ( x ) T is a symmetric random perturbation matrix, and Π S + + 2 denotes SPD correction under the same minimum eigenvalue constraint used in the main scene, namely λ min 10 4 . The perturbation matrix is defined as
Δ ξ ( x ) = σ ξ Z ξ ( x ) + Z ξ ( x ) T 2 ,
where σ ξ is the noise scale.
Four field-level perturbations are compared. In Gaussian perturbation, the entries of Z ξ are independently sampled from the standard normal distribution. The Laplace-distributed perturbation is generated by inverse-transform sampling:
Z ξ = sign ( U ) log 1 2 | U | , U Uniform ( 0.5 , 0.5 ) .
Impulsive perturbation is based on Gaussian perturbation and amplifies the perturbation magnitude by a factor of 4 with probability p imp = 0.08 :
Z ξ = A , A i j N ( 0 , 1 ) , 4 A , with probability 0.08 .
Heavy-tailed perturbation uses a Student-t distribution with ν = 3 degrees of freedom and variance normalization:
Z ξ = T 3 3 .
The perturbation scales are set to 0.010 , 0.010 , 0.012 , and 0.012 for Gaussian, Laplace-distributed, impulsive, and heavy-tailed perturbations, respectively. All perturbations are independently generated for each sample and each spatial position. After perturbation, matrices are symmetrized again and SPD correction is applied.
In this experiment, non-Gaussian perturbations are not applied to the training H 0 / H 1 sets. Therefore, the class-conditional reference fields and the discriminative weight map are still estimated from the main-scene training data. Non-Gaussian perturbations are applied only to the calibration H 0 , test H 0 , test H 1 , and audit H 0 sets. For each noise condition, the fixed- P fa threshold is re-estimated using the corresponding perturbed independent H 0 calibration set. Figure 7 reports the robustness results under non-Gaussian background perturbations.
The results indicate that the main performance ordering is not reversed under the four field-level background perturbations. The proposed detector remains higher than the uniform-weight and global-pooling variants in AUC and at both operating points. Since the threshold is recalibrated using the perturbed H 0 calibration set under each noise condition, this result indicates robustness to moderate field-level distributional perturbations. It does not imply, however, that a threshold calibrated under one noise condition can be directly transferred to another noise condition without recalibration.

4. Discussion

4.1. Sources of Performance Gain

The experimental results indicate that the primary gain arises from the local SPD-field representation, rather than from the Riemannian metric alone. Compared with the global-energy and pooled-covariance baselines, local structure-field methods preserve the directional organization, anisotropy, and spatial distribution within the patch, and are therefore more suitable for the present local-structure-dominated detection scenario.
Within the local structure-field object layer, AIRM-based comparison and pointwise Karcher mean reference fields provide a geometry-consistent way to define class-conditional reference fields and local distance-difference evidence. However, the empirical gain over the Euclidean/Frobenius structure-field baselines is relatively small. Therefore, the role of AIRM should be understood as a geometry-consistent modeling component within the object-layer framework, rather than as a factor that alone produces a large performance jump.
Discriminative weighting and block-wise robust pooling mainly improve sample-level evidence aggregation. They shift the statistic from a purely global average response toward stable local discriminative regions, thereby reducing the influence of low-information areas, local misalignment, and abnormal responses on the final statistic.

4.2. Relationship to Existing Methods and Future Directions

Compared with existing methods, the core difference of the proposed method is not simply the use of a more complex distance or a more complex pooling strategy, but the change in the detection object layer. Classical detection and constant false-alarm rate (CFAR) methods usually operate on scalar statistics and adaptive thresholds under fixed false-alarm probability constraints. They have clear detection-theoretic interpretations, but their ability to represent local structural organization is limited. Spectrogram patch methods preserve time–frequency locality, but most of them still treat patches as intensity templates or learning inputs. Existing matrix information-geometric detectors place covariance matrices or HPD matrices on SPD/HPD manifolds and compare them using intrinsic matrix geometry, forming a mature route for radar detection. However, such methods usually compress each observation cell into a single matrix object. The proposed method lies at the intersection of these routes: it inherits the locality of time–frequency patch methods, transforms local structures into an SPD-valued field through the structure tensor, and performs reference estimation and local distance-difference evidence construction under AIRM. The relationship between the proposed method and representative methodological families is summarized in Table 5.
One representative research line in information-geometric signal detection is the series of works by Cheng, Hua, Wang, Wu, Yang, and collaborators on matrix information geometry detection. This line starts from an information-geometric interpretation of signal detection, connects Neyman–Pearson detection, Kullback–Leibler divergence, and radar CFAR detection, and further develops radar target detection methods based on symmetrized KL divergence, total KL divergence, total Jensen–Bregman divergence, and matrix information geometry. More recent work extends this line to weak target detection in heterogeneous clutter and track-before-detect scenarios in range–azimuth measurements. In particular, discriminative HPD-manifold projection and TBD-MIG detectors further show that manifold projection can enhance the discriminative capability of HPD matrix representations for range-spread radar targets in non-Gaussian clutter [26]. These developments indicate that matrix information geometry has evolved from theoretical interpretation toward more complex radar detection tasks. In contrast to this line, the present work does not continue to construct a detector around a single covariance or HPD matrix object. Instead, it represents each sample as a spatially distributed local SPD structure field in order to preserve the local structural distribution inside a patch.
Another representative line is matrix information geometry for radar processing associated with Barbaresco and related work. This line introduced Cartan/Siegel geometry, SPD/HPD matrix manifolds, Fréchet metric spaces, and related tools into radar covariance matrix processing, and explored robust statistical processing methods such as OS-HDR-CFAR, OS-STAP, and Riemannian means/medians. Along this direction, Ono and Peng recently compared AIRM, Log-Euclidean, and Bures–Wasserstein geometries for HPD matrices in Matrix-CFAR signal detectors, while also analyzing detection performance, outlier robustness, and computational complexity. These developments suggest that an important future direction is not merely to add more detector modules, but to establish a more systematic connection among different SPD/HPD geometries, robust reference estimation, and local structure-field representations.
The additional SPD-manifold studies also help clarify the geometric scope of the present method. General studies of O ( n ) -invariant metrics emphasize that AIRM is one member of a broader family of meaningful intrinsic geometries on SPD matrices [24]. Riemannian Procrustes analysis further demonstrates that SPD covariance features can be aligned across domains while respecting manifold geometry [25]. These studies mainly operate on covariance, SPD, or HPD matrix objects, whereas the present work focuses on a spatially distributed field of local SPD structure tensors, where the spatial organization of local time–frequency structures is itself part of the discriminative information.

4.3. Information-Geometric Interpretation and Its Limits

The design of the proposed method is inspired by a classical relative-closeness decision principle. In classical detection, the likelihood-ratio test can be interpreted, under large-sample conditions, as a comparison between the Kullback–Leibler divergences from the observation distribution to the two hypothesized distributions. This relationship provides an information-geometric motivation for the local distance-difference evidence used in this paper.
However, the proposed detector should not be interpreted as a strict generalization of the classical LRT. The object layer in this paper is the local SPD structure field. The quantity Δ ( x ) represents local distance-difference evidence under the SPD/AIRM geometry, while discriminative weighting and block-wise robust pooling are sample-level evidence aggregation mechanisms. Under additional approximation assumptions, such as locally isotropic Riemannian Gaussian perturbations, the difference between squared AIRM distances can be monotonically related to an approximate log-likelihood ratio. This relationship should be understood as an explanatory motivation rather than as a strict optimality proof.

4.4. Limitations and Applicability

The proposed detector is most suitable for non-stationary detection tasks in which discriminative information is primarily encoded in local structural organization, directional continuity, and spatial arrangement patterns. In such scenarios, the relevant class differences are not adequately captured by global energy, mean spectral intensity, or a single covariance-scale statistic. Conversely, if the class difference is mainly reflected in global energy, average spectral strength, or a single covariance-scale variation, simpler global statistics may already be sufficient, and the advantage of the proposed method may diminish.
A potential class of physical applications is the analysis of measurement signals whose diagnostic information appears as specific local structures in the time–frequency plane. Examples include radar or wireless sensing signals with drifting spectral components, multipath-induced ridges, fragmented time–frequency textures, or local directional continuity. Related GNSS radio-occultation and reflected-signal studies have shown that direct and reflected signal components can produce structured signatures in spectral or time–frequency representations [44,45]. For such problems, the proposed detector may be useful if the class-relevant information can be stably encoded as local ridges, directional organization, or spatially localized texture changes in the time–frequency plane.
However, this applicability is conditional. The present manuscript does not claim direct validation on GNSS radio-occultation data, reflected-signal datasets, or any other specific physical measurement dataset. Applying the proposed method to such problems would require an end-to-end validation pipeline, including raw waveform preprocessing, time–frequency representation design, local SPD structure-field construction, and fixed- P fa calibration under the corresponding physical clutter or noise conditions. Therefore, validation on real non-stationary physical data is an important future direction rather than a conclusion of the current controlled benchmark.
The benefit of the method also depends on the existence of local discriminative structures that can be stably estimated. When discriminative local structures are too few, overly fragmented, or strongly contaminated by local interference, the gains from discriminative weighting and top-block emphasis may not persist. The boundary setting in the structural perturbation experiment also indicates that the method is not unconditionally superior under all local complexity conditions.
In addition, AIRM distance computation, pointwise Karcher mean estimation, and block-wise pooling introduce higher computational cost than global-energy or pooled-covariance baselines. Therefore, the proposed method is more appropriate for scenarios where structural interpretability and local-structure detection performance are prioritized over minimum-cost detection.
Finally, the experiments in this paper are conducted on a controlled SPD-field object-layer benchmark. These experiments mainly validate the detector mechanism after local structures have been represented as SPD fields. They do not constitute a complete end-to-end validation on raw non-stationary waveforms or real physical measurement datasets. Moreover, the nominal SNR/SCR-like index used in the benchmark is a controlled background-difficulty index and should not be regarded as a measured physical signal-to-noise ratio or signal-to-clutter ratio. End-to-end validation on raw waveforms, real public datasets, cross-scene fixed- P fa calibration, and more efficient geometric approximations remain important directions for future work.

5. Conclusions

This paper has presented an information-geometric detector for non-stationary signal detection problems dominated by local structural differences. The proposed method represents a time–frequency patch as a local SPD structure field, estimates class-conditional pointwise Karcher mean reference fields under AIRM, and constructs local distance-difference evidence from pointwise differences between squared AIRM distances. Through discriminative weighting, block-wise robust pooling, and independent H 0 calibration, the local distance-difference evidence is integrated into a fixed- P fa detection statistic.
Controlled SPD-field experiments show that, under the adopted object-layer protocol, the proposed detector achieves the best overall performance among the evaluated methods. The most evident gains are obtained over the global-energy and pooled-covariance baselines, indicating that local SPD structure-field representation is the primary source of improvement. The gains over Euclidean/Frobenius structure-field variants are smaller, suggesting that AIRM mainly acts as a geometry-consistent modeling choice within the same object layer. Structural perturbation and non-Gaussian experiments further indicate that the method remains stable under perturbations around the main scene, but its advantage depends on the presence of local discriminative structures that can be estimated reliably.

Author Contributions

Conceptualization, Y.Y. (Yaohao Yue) and B.W.; methodology, Y.Y. (Yaohao Yue); software, Y.Y. (Yaohao Yue); validation, Y.Y. (Yaohao Yue); formal analysis, Y.Y. (Yaohao Yue); investigation, Y.Y. (Yaohao Yue); data curation, Y.Y. (Yaohao Yue); writing—original draft preparation, Y.Y. (Yaohao Yue); writing—review and editing, Y.Y. (Yaohao Yue), B.W. and Y.Y. (Yang Yang); visualization, Y.Y. (Yaohao Yue); supervision, B.W. and Y.Y. (Yang Yang); project administration, B.W. and Y.Y. (Yang Yang); funding acquisition, Y.Y. (Yang Yang). All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Key R&D Program of China, grant number 2023YFF0717402. The APC was funded by the authors.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data used in this study are procedurally generated controlled SPD-field samples. No external dataset was used in the main experiments. The source code, scene-generation scripts, configuration files, random seeds, and per-run CSV result files supporting the reported figures and tables are publicly available at https://github.com/YaohaoYue-79/local-spd-structure-field-detection.git (accessed on 1 June 2026). Since the experimental samples are procedurally generated, the complete experimental data can be regenerated from the released scripts and random seeds.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
AIRMAffine-invariant Riemannian metric
AUCArea under the receiver operating characteristic curve
CFARConstant false-alarm rate
HPDHermitian positive definite
KLKullback–Leibler
LRTLikelihood-ratio test
ROCReceiver operating characteristic
SCRSignal-to-clutter ratio
SNRSignal-to-noise ratio
SPDSymmetric positive definite
STFTShort-time Fourier transform

References

  1. Kay, S.M. Fundamentals of Statistical Signal Processing, Volume II: Detection Theory; Prentice Hall PTR: Upper Saddle River, NJ, USA, 1998. [Google Scholar]
  2. Flandrin, P. Time–Frequency/Time–Scale Analysis; Academic Press: San Diego, CA, USA, 1998; Volume 10. [Google Scholar]
  3. Cohen, L. Time-frequency analysis: What we know and what we don’t. In Landscapes of Time-Frequency Analysis: ATFA 2019; Birkhäuser: Cham, Switzerland, 2020; pp. 75–101. [Google Scholar]
  4. Sahni, K.; Dighe, P.; Singh, R.; Raj, B. Language identification using spectro-temporal patch features. In Proceedings of the SAPA-SCALE Conference, Portland, OR, USA, 7–8 September 2012; pp. 110–113. [Google Scholar]
  5. Espi, M.; Fujimoto, M.; Kinoshita, K.; Nakatani, T. Exploiting spectro-temporal locality in deep learning based acoustic event detection. EURASIP J. Audio Speech Music Process. 2015, 2015, 26. [Google Scholar] [CrossRef]
  6. Espi, M.; Fujimoto, M.; Kubo, Y.; Nakatani, T. Spectrogram patch based acoustic event detection and classification in speech overlapping conditions. In Proceedings of the 2014 4th Joint Workshop on Hands-Free Speech Communication and Microphone Arrays (HSCMA), Villers-lès-Nancy, France, 12–14 May 2014; pp. 117–121. [Google Scholar] [CrossRef]
  7. Bigun, J.; Granlund, G.H.; Wiklund, J. Multidimensional orientation estimation with applications to texture analysis and optical flow. IEEE Trans. Pattern Anal. Mach. Intell. 1991, 13, 775–790. [Google Scholar] [CrossRef]
  8. Weickert, J. Anisotropic Diffusion in Image Processing; B.G. Teubner: Stuttgart, Germany, 1998. [Google Scholar]
  9. Brox, T.; Weickert, J.; Burgeth, B.; Mrázek, P. Nonlinear structure tensors. Image Vis. Comput. 2006, 24, 41–55. [Google Scholar] [CrossRef]
  10. Karcher, H. Riemannian center of mass and mollifier smoothing. Commun. Pure Appl. Math. 1977, 30, 509–541. [Google Scholar] [CrossRef]
  11. Moakher, M. A differential geometric approach to the geometric mean of symmetric positive-definite matrices. SIAM J. Matrix Anal. Appl. 2005, 26, 735–747. [Google Scholar] [CrossRef]
  12. Bhatia, R.; Holbrook, J. Riemannian geometry and matrix geometric means. Linear Algebra Its Appl. 2006, 413, 594–618. [Google Scholar] [CrossRef]
  13. Pennec, X.; Fillard, P.; Ayache, N. A Riemannian framework for tensor computing. Int. J. Comput. Vis. 2006, 66, 41–66. [Google Scholar] [CrossRef]
  14. Arsigny, V.; Fillard, P.; Pennec, X.; Ayache, N. Geometric means in a novel vector space structure on symmetric positive-definite matrices. SIAM J. Matrix Anal. Appl. 2007, 29, 328–347. [Google Scholar] [CrossRef]
  15. Barachant, A.; Bonnet, S.; Congedo, M.; Jutten, C. Classification of covariance matrices using a Riemannian-based kernel for BCI applications. Neurocomputing 2013, 112, 172–178. [Google Scholar] [CrossRef]
  16. Barachant, A.; Bonnet, S.; Congedo, M.; Jutten, C. Multiclass brain-computer interface classification by Riemannian geometry. IEEE Trans. Biomed. Eng. 2012, 59, 920–928. [Google Scholar] [CrossRef]
  17. Barbaresco, F. Innovative tools for radar signal processing based on Cartan’s geometry of SPD matrices and information geometry. In Proceedings of the 2008 IEEE Radar Conference, Rome, Italy, 26–30 May 2008; pp. 1–6. [Google Scholar]
  18. Cheng, Y.; Hua, X.; Wang, H.; Qin, Y.; Li, X. The geometry of signal detection with applications to radar signal processing. Entropy 2016, 18, 381. [Google Scholar] [CrossRef]
  19. Hua, X.; Cheng, Y.; Wang, H.; Qin, Y.; Li, Y.; Zhang, W. Matrix CFAR detectors based on symmetrized Kullback–Leibler and total Kullback–Leibler divergences. Digit. Signal Process. 2017, 69, 106–116. [Google Scholar] [CrossRef]
  20. Hua, X.; Fan, H.; Cheng, Y.; Wang, H.; Qin, Y. Information geometry for radar target detection with total Jensen–Bregman divergence. Entropy 2018, 20, 256. [Google Scholar] [CrossRef]
  21. Wu, H.; Cheng, Y.; Wang, H. Isometric signal processing under information geometric framework. Entropy 2019, 21, 332. [Google Scholar] [CrossRef]
  22. Ono, Y.; Peng, L. The comparison of Riemannian geometric matrix-CFAR signal detectors. IEEE Trans. Aerosp. Electron. Syst. 2024, 60, 1679–1691. [Google Scholar] [CrossRef]
  23. Yang, Z.; Cheng, Y.; Wu, H.; Yang, Y.; Qin, Y.; Wang, H.; Li, X. Enhanced matrix information geometry detection for weak targets in heterogeneous clutter environment. Sci. China Inf. Sci. 2025, 68, 219301. [Google Scholar] [CrossRef]
  24. Thanwerdas, Y.; Pennec, X. O(n)-invariant Riemannian metrics on SPD matrices. Linear Algebra Its Appl. 2023, 661, 163–201. [Google Scholar] [CrossRef]
  25. Rodrigues, P.L.C.; Jutten, C.; Congedo, M. Riemannian Procrustes Analysis: Transfer Learning for Brain–Computer Interfaces. IEEE Trans. Biomed. Eng. 2019, 66, 2390–2401. [Google Scholar] [CrossRef] [PubMed]
  26. Hua, X.; Huang, H.; Huang, Z.; Huang, W.; Wu, L.; Peng, X.; Cheng, Y. Discriminative HPD-Manifold Projection and TBD-MIG Detectors for Range-Spread Radar Targets in Non-Gaussian Clutter. IEEE Trans. Aerosp. Electron. Syst. 2026, 62, 10004–10019. [Google Scholar] [CrossRef]
  27. Kullback, S.; Leibler, R.A. On information and sufficiency. Ann. Math. Stat. 1951, 22, 79–86. [Google Scholar] [CrossRef]
  28. Cover, T.M.; Thomas, J.A. Elements of Information Theory; Wiley: New York, NY, USA, 1991. [Google Scholar]
  29. Rao, C.R. Information and the accuracy attainable in the estimation of statistical parameters. Bull. Calcutta Math. Soc. 1945, 37, 81–91. [Google Scholar]
  30. Amari, S.-I. Information Geometry and Its Applications, 1st ed.; Springer: Tokyo, Japan, 2016. [Google Scholar]
  31. Chentsov, N.N. Statistical Decision Rules and Optimal Inference; American Mathematical Society: Providence, RI, USA, 1982; Volume 53. [Google Scholar]
  32. San José Estépar, R. Local Structure Tensor for Multidimensional Signal Processing: Applications to Medical Image Analysis. Ph.D. Thesis, Universidad de Valladolid, Valladolid, Spain, 2005. [Google Scholar]
  33. Fréchet, M. Sur l’extension de certaines évaluations statistiques au cas de petits échantillons. Rev. Int. Stat. Inst. 1943, 11, 182–205. [Google Scholar] [CrossRef]
  34. Thanwerdas, Y.; Pennec, X. Theoretically and computationally convenient geometries on full-rank correlation matrices. SIAM J. Matrix Anal. Appl. 2022, 43, 1851–1872. [Google Scholar] [CrossRef]
  35. Said, S.; Bombrun, L.; Berthoumieu, Y.; Manton, J.H. Riemannian Gaussian distributions on the space of symmetric positive definite matrices. IEEE Trans. Inf. Theory 2017, 63, 2153–2170. [Google Scholar] [CrossRef]
  36. Maron, O.; Lozano-Pérez, T. A framework for multiple-instance learning. In Advances in Neural Information Processing Systems 10; MIT Press: Cambridge, MA, USA, 1997; pp. 570–576. [Google Scholar]
  37. Zaheer, M.; Kottur, S.; Ravanbakhsh, S.; Poczos, B.; Salakhutdinov, R.R.; Smola, A.J. Deep sets. In Advances in Neural Information Processing Systems 30; Curran Associates, Inc.: Red Hook, NY, USA, 2017; pp. 3391–3401. [Google Scholar]
  38. Ilse, M.; Tomczak, J.; Welling, M. Attention-based deep multiple instance learning. In Proceedings of the 35th International Conference on Machine Learning, Stockholm, Sweden, 10–15 July 2018; pp. 2127–2136. [Google Scholar]
  39. Oner, M.U.; Kye-Jet, J.M.S.; Lee, H.K.; Sung, W.-K. Distribution-based MIL pooling filters: Experiments on a lymph node metastases dataset. Med. Image Anal. 2023, 87, 102813. [Google Scholar] [CrossRef]
  40. Finn, H.M.; Johnson, R.S. Adaptive detection mode with threshold control as a function of spatially sampled clutter-level estimates. RCA Rev. 1968, 29, 414–464. [Google Scholar]
  41. Rohling, H. Radar CFAR thresholding in clutter and multiple target situations. IEEE Trans. Aerosp. Electron. Syst. 1983, 19, 608–621. [Google Scholar] [CrossRef]
  42. Kelly, E.J. An adaptive detection algorithm. IEEE Trans. Aerosp. Electron. Syst. 1986, 22, 115–127. [Google Scholar] [CrossRef]
  43. Arsigny, V.; Fillard, P.; Pennec, X.; Ayache, N. Log-Euclidean metrics for fast and simple calculus on diffusion tensors. Magn. Reson. Med. 2006, 56, 411–421. [Google Scholar] [CrossRef]
  44. Beyerle, G.; Hocke, K. Observation and simulation of direct and reflected GPS signals in radio occultation experiments. Geophys. Res. Lett. 2001, 28, 1895–1898. [Google Scholar] [CrossRef]
  45. Cardellach, E.; Oliveras, S.; Rius, A. Applications of the reflected signals found in GNSS radio occultation events. In Proceedings of the GRAS SAF Workshop on Applications of GPS Radio Occultation Measurements, Reading, UK, 16–18 June 2008; pp. 133–143. [Google Scholar]
Figure 1. Method overview of the proposed local SPD structure-field detector. Solid arrows denote data or processing flow, whereas dashed arrows indicate the influence of the discriminative weight map on the aggregation stage. For raw waveform or time–frequency inputs, the local SPD structure field is constructed through STFT/log-amplitude representation, local gradients, structure-tensor smoothing, and SPD regularization. In the controlled SPD-field benchmark, generated SPD-field samples enter the reference-estimation, calibration, and testing stages directly. The detector then estimates pointwise Karcher mean reference fields, constructs local distance-difference evidence, performs block-wise robust aggregation, and makes a fixed- P fa decision using an independently calibrated threshold. Abbreviations in the figure: TF, time–frequency; SPD, symmetric positive definite; STFT, short-time Fourier transform; AIRM, affine-invariant Riemannian metric; H0, null hypothesis; H1, alternative hypothesis; Pfa, false-alarm probability.
Figure 1. Method overview of the proposed local SPD structure-field detector. Solid arrows denote data or processing flow, whereas dashed arrows indicate the influence of the discriminative weight map on the aggregation stage. For raw waveform or time–frequency inputs, the local SPD structure field is constructed through STFT/log-amplitude representation, local gradients, structure-tensor smoothing, and SPD regularization. In the controlled SPD-field benchmark, generated SPD-field samples enter the reference-estimation, calibration, and testing stages directly. The detector then estimates pointwise Karcher mean reference fields, constructs local distance-difference evidence, performs block-wise robust aggregation, and makes a fixed- P fa decision using an independently calibrated threshold. Abbreviations in the figure: TF, time–frequency; SPD, symmetric positive definite; STFT, short-time Fourier transform; AIRM, affine-invariant Riemannian metric; H0, null hypothesis; H1, alternative hypothesis; Pfa, false-alarm probability.
Entropy 28 00679 g001
Figure 2. AUC versus the nominal SNR/SCR-like background-difficulty index under the main structured-locality detection scene. The index controls nuisance/background difficulty in the controlled SPD-field benchmark. As the nominal index decreases, the nuisance intensity increases, while the class-defining local structures remain unchanged.
Figure 2. AUC versus the nominal SNR/SCR-like background-difficulty index under the main structured-locality detection scene. The index controls nuisance/background difficulty in the controlled SPD-field benchmark. As the nominal index decreases, the nuisance intensity increases, while the class-defining local structures remain unchanged.
Entropy 28 00679 g002
Figure 3. Detection probability curves at fixed- P fa operating points versus the nominal SNR/SCR-like background-difficulty index under the main structured-locality detection scene. The index controls background perturbation, orientation jitter, distractor perturbation, and distractor strength, and is used here to facilitate performance comparison under different controlled nuisance levels. As the nominal index decreases, the nuisance intensity increases while the class-defining local structures remain unchanged.
Figure 3. Detection probability curves at fixed- P fa operating points versus the nominal SNR/SCR-like background-difficulty index under the main structured-locality detection scene. The index controls background perturbation, orientation jitter, distractor perturbation, and distractor strength, and is used here to facilitate performance comparison under different controlled nuisance levels. As the nominal index decreases, the nuisance intensity increases while the class-defining local structures remain unchanged.
Entropy 28 00679 g003
Figure 4. Baseline comparison under the main scene.
Figure 4. Baseline comparison under the main scene.
Entropy 28 00679 g004
Figure 5. Ablation analysis under the main scene.
Figure 5. Ablation analysis under the main scene.
Entropy 28 00679 g005
Figure 6. Robustness under local structural perturbations.
Figure 6. Robustness under local structural perturbations.
Entropy 28 00679 g006
Figure 7. Robustness under non-Gaussian background perturbations.
Figure 7. Robustness under non-Gaussian background perturbations.
Entropy 28 00679 g007
Table 1. Computational complexity summary of the proposed detector.
Table 1. Computational complexity summary of the proposed detector.
ModuleMain OperationComplexity
Training: STFT and structure-field constructionSTFT, log-amplitude patch extraction, and pointwise structure-tensor-field construction for all training samples O N · C STFT + N · | Ω |
Training: pointwise reference fieldsPointwise estimation of the two Karcher-mean reference fields over Ω O | Ω | · I K · N
Training: discriminative weighting mapPointwise computation of Sep ( x ) , Disp 0 ( x ) , Disp 1 ( x ) , and construction of W ( x ) O | Ω | · N
Test: structure-field constructionSTFT, patch extraction, and structure-tensor construction for the test sample O C STFT + | Ω |
Test: local distance-difference evidencePointwise computation of d 0 ( x ) , d 1 ( x ) , and  Δ ( x ) O ( | Ω | )
Test: block-wise robust poolingComputation of { s } = 1 L , sorting, and top-block selection O = 1 L | B | + L log L
Test: total online detectionEnd-to-end computation from the test sample to the final statistic T O C STFT + | Ω | + = 1 L | B | + L log L
Fixed- P fa threshold calibrationRepeated statistic evaluation on M independent H 0 calibration samples and empirical quantile extraction O M · C det + M log M
Memory: detector coreStorage of S 0 , S 1 , W ( x ) , and one test structure field O | Ω |
Memory: training structure fieldsExplicit storage of all training structure fields O N · | Ω |
Table 2. Core experimental and algorithmic parameter settings.
Table 2. Core experimental and algorithmic parameter settings.
CategoryParameterValueRole
Scene labelPublic nameMain structured-locality detection scenePublic scene name
SeedsRandom seeds101–105Repeated trials
Main evaluationNominal SNR/SCR-like index 20 dB to 0 dB in 2 dB stepsNuisance/background difficulty sweep
Fixed- P fa operating points P fa 10 2 , 10 3 Operating points
TrainingTrain H 0 /Train H 1 120/120Reference-field estimation
CalibrationCalibration H 0 20,000Threshold calibration
TestingTest H 0 /Test H 1 500/500AUC and P d evaluation
AuditAudit H 0 20,000Achieved P fa validation
PatchPatch size 32 × 32 Local time–frequency field size
SPD regularityMinimum eigenvalue 10 4 Lower eigenvalue bound
Class structureClass orientation separation 44 ° Class-defining orientation separation
Discriminative jitterDiscriminative rotation jitter 0.4 ° Discriminative structure stability
Discriminative perturbationDiscriminative perturbation amplitude0.006Local structural perturbation
Local structuresIsland radius3.2Local structure scale
Local structuresIsland amplitudes1.00, 0.82, 0.68Discriminative strength
DistractorsNumber6Nuisance local structures
DistractorsRadius2.2Distractor scale
DistractorsAmplitude range0.22–0.48Distractor strength
DistractorsRotation jitter 16 ° Distractor variability
PoolingBlock size/stride8/4Block-wise evidence pooling
PoolingTop-block fraction q0.2Top-block fraction
PoolingAggregation coefficient α 0.65Global/top-block mixing
Weight mapWeight-map smoothing scale1Spatial smoothing
Karcher meanKarcher tolerance/max iterations 10 6 /30Reference-field estimation
Table 3. Average performance results for baseline comparison under the main scene.
Table 3. Average performance results for baseline comparison under the main scene.
MethodAUC P d at 10 2 P ^ fa at 10 2 P d at 10 3 P ^ fa at 10 3
Proposed detector0.82400.43160.009270.38520.00111
Euclidean structure-field baseline 10.82070.42520.009350.36560.00098
Template-correlation baseline0.75800.43000.010050.37320.00115
Pooled-covariance baseline0.71660.04360.009660.00880.00089
Global energy baseline0.50480.01160.010150.00160.00118
1 The Frobenius structure-field baseline is numerically identical to the Euclidean structure-field baseline in the current implementation and is therefore omitted from the table to avoid duplication.
Table 4. Paired performance differences between the proposed detector and competing methods. Positive values indicate an advantage of the proposed detector.
Table 4. Paired performance differences between the proposed detector and competing methods. Positive values indicate an advantage of the proposed detector.
ComparisonPaired Unit Δ AUC Δ P d @ 10 2 Δ P d @ 10 3
Proposed vs. uniform-weightseed-avg. sweep ( n = 5 ) 0.0118 [0.0101, 0.0134]0.0192 [0.0113, 0.0271]0.0159 [ 0.0026 , 0.0343]
Proposed vs. global-onlyseed-avg. sweep ( n = 5 ) 0.0238 [0.0169, 0.0306]0.0392 [0.0272, 0.0513]0.0448 [0.0193, 0.0703]
Proposed vs. Euclidean/Frobenius SFseed ( n = 5 ) 0.0033 [0.0009, 0.0056]0.0064 [ 0.0005 , 0.0133]0.0196 [ 0.0149 , 0.0541]
Proposed vs. template correlationseed ( n = 5 ) 0.0660 [0.0405, 0.0915]0.0016 [ 0.0500 , 0.0532]0.0120 [ 0.0667 , 0.0907]
Proposed vs. pooled covarianceseed ( n = 5 ) 0.1073 [0.0793, 0.1353]0.3880 [0.3712, 0.4048]0.3764 [0.3366, 0.4162]
Proposed vs. global energyseed ( n = 5 ) 0.3192 [0.2920, 0.3464]0.4200 [0.3930, 0.4470]0.3836 [0.3402, 0.4270]
Table 5. Relationship between the proposed method and representative methodological families.
Table 5. Relationship between the proposed method and representative methodological families.
FamilyRepresentative WorksObjectMain AdvantageDifference from This Work
Classical/CFAR detectionKay; Finn and Johnson; Rohling; Kelly [1,40,41,42]Scalar statistic/adaptive thresholdClear fixed- P fa interpretationWeak local-structure modeling
Spectrogram patch methodsSahni; Espi; Espi [4,5,6]Spectrogram patchesPreserve time–frequency localityLack SPD geometric modeling
Structure-tensor methodsBigun; Weickert; Brox [7,8,9]Local second-order tensorEncode orientation and anisotropyUsually not formulated as detectors
Riemannian covariance classificationBarachant; Barachant [15,16]Covariance matrixMature SPD geometryMainly classification-oriented
Matrix information-geometric detectorsBarbaresco; Cheng; Hua; Ono and Peng; Yang [17,18,19,20,22,23,26]Covariance/HPD matrixIntrinsic matrix geometryMostly single-matrix objects
Proposed methodThis paperLocal SPD structure fieldPreserves locality and SPD geometryHigher cost; requires stable local structures
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yue, Y.; Wei, B.; Yang, Y. Information-Geometric Detection via Local SPD Structure Fields in the Time–Frequency Domain. Entropy 2026, 28, 679. https://doi.org/10.3390/e28060679

AMA Style

Yue Y, Wei B, Yang Y. Information-Geometric Detection via Local SPD Structure Fields in the Time–Frequency Domain. Entropy. 2026; 28(6):679. https://doi.org/10.3390/e28060679

Chicago/Turabian Style

Yue, Yaohao, Benjie Wei, and Yang Yang. 2026. "Information-Geometric Detection via Local SPD Structure Fields in the Time–Frequency Domain" Entropy 28, no. 6: 679. https://doi.org/10.3390/e28060679

APA Style

Yue, Y., Wei, B., & Yang, Y. (2026). Information-Geometric Detection via Local SPD Structure Fields in the Time–Frequency Domain. Entropy, 28(6), 679. https://doi.org/10.3390/e28060679

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop