Papers › Nearest Subspace Search in The Signed Cumulative Distribution Transform Space for 1D...
Nearest Subspace Search in The Signed Cumulative Distribution Transform Space for 1D Signal Classification
Abu Hasnat Mohammad Rubaiyat, Mohammad Shifat-E-Rabbi, Yan Zhuang, Shiying Li, Gustavo K. Rohde
This paper presents a new method to classify 1D signals using the signed cumulative distribution transform (SCDT). The proposed method exploits certain linearization properties of the SCDT to render the problem easier to solve in the SCDT space. The method uses the nearest subspace search technique in the SCDT domain to provide a non-iterative, effective, and simple to implement classification algorithm. Experiments show that the proposed technique outperforms the state-of-the-art neural networks using a very low number of training samples and is also robust to out-of-distribution examples on simulated data. We also demonstrate the efficacy of the proposed technique in real-world applications by applying it to an ECG classification problem. The python code implementing the proposed classifier can be found in PyTransKit (https://github.com/rohdelab/PyTransKit).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections