arXiv subjects

Kévin Polisano

Publications and source records attributed to Kévin Polisano.

14 recordsLinked to original sources

arXiv2026

Zeros of the Spectrogram of White Noise with Hermite Windows

We study the zeros of the spectrogram of complex white noise analyzed with Hermite windows of order n, extending the classical Gaussian-window correspondence with Gaussian Analytic Functions to the polyanalytic setting. Using the polyanalytic Bargmann transform, these zeros split into two families according to the sign of the local Jacobian, giving rise to a natural notion of charge, and we show that these zeros are almost surely simple, isolated, and form a translation and rotation-invariant point process. We derive closed-form expressions for the one-point intensity, decomposed by charge, and also for the unsigned, signed, and hybrid two-point intensities. Besides, we prove that unlike the total repulsion observed with a Gaussian window, the Hermite window of order n generates a pair correlation function that converges at the origin to a strictly positive constant depending on n. Finally, we propose a numerical method for detecting spectrogram zeros via the winding number around candidate local minima.

math.PR↗

arXiv2026

Instantaneous Frequency Estimation in Noisy Multicomponent Signals with Interfering Modes Based on Prony Method and Spline Approximation

In this paper, we propose a novel estimator of the instantaneous frequencies (IFs) of the modes making up multicomponent signals (MCSs). We are particularly interested in dealing with noisy MCSs containing close modes in the time-frequency plane. Though it is possible to adapt Prony approach to estimate IFs in such situations, interference between the modes generates oscillations in the obtained estimations. After having investigated the nature of these oscillations, we propose an algorithm to remove these in IFs estimation, based on spline approximation. Numerical applications in various situations illustrate the benefit of mixing Prony technique with spline approximation for IF estimation in noisy MCSs containing close modes.

eess.SP↗

arXiv2025

Manifold Learning for Hyperspectral Images

Traditional feature extraction and projection techniques, such as Principal Component Analysis, struggle to adequately represent X-Ray Transmission (XRT) Multi-Energy (ME) images, limiting the performance of neural networks in decision-making processes. To address this issue, we propose a method that approximates the dataset topology by constructing adjacency graphs using the Uniform Manifold Approximation and Projection. This approach captures nonlinear correlations within the data, significantly improving the performance of machine learning algorithms, particularly in processing Hyperspectral Images (HSI) from X-ray transmission spectroscopy. This technique not only preserves the global structure of the data but also enhances feature separability, leading to more accurate and robust classification results.

cs.CV↗

arXiv2025

G{é}n{é}ration de Matrices de Corr{é}lation avec des Structures de Graphe par Optimisation Convexe

This work deals with the generation of theoretical correlation matrices with specific sparsity patterns, associated to graph structures. We present a novel approach based on convex optimization, offering greater flexibility compared to existing techniques, notably by controlling the mean of the entry distribution in the generated correlation matrices. This allows for the generation of correlation matrices that better represent realistic data and can be used to benchmark statistical methods for graph inference.

eess.SP↗

arXiv2025

On the Shift Invariance of Max Pooling Feature Maps in Convolutional Neural Networks

This paper focuses on improving the mathematical interpretability of convolutional neural networks (CNNs) in the context of image classification. Specifically, we tackle the instability issue arising in their first layer, which tends to learn parameters that closely resemble oriented band-pass filters when trained on datasets like ImageNet. Subsampled convolutions with such Gabor-like filters are prone to aliasing, causing sensitivity to small input shifts. In this context, we establish conditions under which the max pooling operator approximates a complex modulus, which is nearly shift invariant. We then derive a measure of shift invariance for subsampled convolutions followed by max pooling. In particular, we highlight the crucial role played by the filter's frequency and orientation in achieving stability. We experimentally validate our theory by considering a deterministic feature extractor based on the dual-tree complex wavelet packet transform, a particular case of discrete Gabor-like decomposition.

cs.CV↗

arXiv2025

Disentangling Modes and Interference in the Spectrogram of Multicomponent Signals

In this paper, we investigate how the spectrogram of multicomponent signals can be decomposed into a mode part and an interference part. We explore two approaches: (i) a variational method inspired by texture-geometry decomposition in image processing, and (ii) a supervised learning approach using a U-Net architecture, trained on a dataset encompassing diverse interference patterns and noise conditions. Once the interference component is identified, we explain how it enables us to define a criterion to locally adapt the window length used in the definition of the spectrogram, for the sake of improving ridge detection in the presence of close modes. Numerical experiments illustrate the advantages and limitations of both approaches for spectrogram decomposition, highlighting their potential for enhancing time-frequency analysis in the presence of strong interference.

cs.CV↗

arXiv2025

Benchmarking Brain Connectivity Graph Inference: A Novel Validation Approach

Inferring a binary connectivity graph from resting-state fMRI data for a single subject requires making several methodological choices and assumptions that can significantly affect the results. In this study, we investigate the robustness of existing edge detection methods when relaxing a common assumption: the sparsity of the graph. We propose a new pipeline to generate synthetic data and to benchmark the state of the art in graph inference. Simulated correlation matrices are designed to have a set of given zeros and a constraint on the signal-to-noise ratio. We compare approaches based on covariance or precision matrices, emphasizing their implications for connectivity inference. This framework allows us to assess the sensitivity of connectivity estimations and edge detection methods to different parameters.

stat.ME↗

arXiv2025

Generating Correlation Matrices with Graph Structures Using Convex Optimization

eess.SP↗

arXiv2024

From CNNs to Shift-Invariant Twin Models Based on Complex Wavelets

We propose a novel method to increase shift invariance and prediction accuracy in convolutional neural networks. Specifically, we replace the first-layer combination "real-valued convolutions + max pooling" (RMax) by "complex-valued convolutions + modulus" (CMod), which is stable to translations, or shifts. To justify our approach, we claim that CMod and RMax produce comparable outputs when the convolution kernel is band-pass and oriented (Gabor-like filter). In this context, CMod can therefore be considered as a stable alternative to RMax. To enforce this property, we constrain the convolution kernels to adopt such a Gabor-like structure. The corresponding architecture is called mathematical twin, because it employs a well-defined mathematical operator to mimic the behavior of the original, freely-trained model. Our approach achieves superior accuracy on ImageNet and CIFAR-10 classification tasks, compared to prior methods based on low-pass filtering. Arguably, our approach's emphasis on retaining high-frequency details contributes to a better balance between shift invariance and information preservation, resulting in improved performance. Furthermore, it has a lower computational cost and memory footprint than concurrent work, making it a promising solution for practical implementation.

cs.CV↗

arXiv2024

Gridless 2D Recovery of Lines using the Sliding Frank-Wolfe Algorithm

We present a new approach leveraging the Sliding Frank--Wolfe algorithm to address the challenge of line recovery in degraded images. Building upon advances in conditional gradient methods for sparse inverse problems with differentiable measurement models, we propose two distinct models tailored for line detection tasks within the realm of blurred line deconvolution and ridge detection of linear chirps in spectrogram images.

cs.CV↗

arXiv2023

Instantaneous Frequency Estimation in Multicomponent Signals in Case of Interference Based on the Prony Method

In this paper, we develop a general method to estimate the instantaneous frequencies of the modes making up a multicomponent signal when the former exhibit interference in the time-frequency plane. In particular, studying the representation given by the spectrogram, we show that it is possible to characterize the interference between the modes using the Prony method, which enables us to build a novel instantaneous frequency estimator for the mode. The relevance of the proposed approach is demonstrated by comparing it with different stateof-the art techniques based on ridge detection.

eess.SP↗

arXiv2018

Riesz-based orientation of localizable Gaussian fields

In this work we give a sense to the notion of orientation for self-similar Gaussian fields with stationary increments, based on a Riesz analysis of these fields, with isotropic zero-mean analysis functions. We propose a structure tensor formulation and provide an intrinsic definition of the orientation vector as eigenvector of this tensor. That is, we show that the orientation vector does not depend on the analysis function, but only on the anisotropy encoded in the spectral density of the field. Then, we generalize this definition to a larger class of random fields called localizable Gaussian fields, whose orientation is derived from the orientation of their tangent fields. Two classes of Gaussian models with prescribed orientation are studied in the light of these new analysis tools.

math.CA↗

arXiv2015

Modélisations de textures par champ gaussien à orientation locale prescrite

This paper presents two new models of oriented texture, based on a new class of Gaussian fields, called locally anisotropic fractional Brownian fields, with prescribed local orientation at any point. These fields are a local version of a specific class of anisotropic self-similar Gaussian fields with stationary increments. The simulation of such textures is obtained using a new algorithm mixing the tangent field formulation with the Cholesky method or the turning band method, this latter method having proved its efficiency for generating stationary anisotropic textures. Numerical experiments show the ability of the method for synthesis of textures with prescribed local orientation.

math.CA↗

arXiv2014

Texture Modeling by Gaussian fields with prescribed local orientation

This paper presents a new framework for oriented texture modeling. We introduce a new class of Gaussian fields, called Locally Anisotropic Fractional Brownian Fields, with prescribed local orientation at any point. These fields are a local version of a specific class of anisotropic self-similar Gaussian fields with stationary increments. The simulation of such textures is obtained using a new algorithm mixing the tangent field formulation and a turning band method, this latter method having proved its efficiency for generating stationary anisotropic textures. Numerical experiments show the ability of the method for synthesis of textures with prescribed local orientation.

math.PR↗