Basis Decomposition Theory
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
STGBD-Net: Spatio-temporal Gradient Basis Decomposition Network for Infrared Small Target Detection
arXiv:2512.03470v5 Announce Type: replace Abstract: A key challenge in infrared small target detection (IRSTD) is that weak target signal responses are easily obscured by strong background clutter, frequently resulting in missed detections. While traditional gradient-based methods attempt to capture fine details, their robustness is limited by the static fusion of multi-directional gradient features. In this paper, we rethink feature fusion from the perspective of Basis Decomposition Theory...
On the Covalent Fields of Molecule-Surface Interactions
arXiv:2606.08619v1 Announce Type: new Abstract: The ambiguity of the active site, the empirical status of Br{\o}nsted-Evans-Polanyi relations, and the unpredictability of linear scaling relation breakdown are three symptoms of a single representational choice: treating chemical affinity as an attribute of discrete geometric sites. Here we show that all three are resolved when chemical affinity is represented as a continuous property of the interface: the covalent field. We present a...
Multicontinuum Generalized Multiscale Finite Element Method (MC-GMsFEM). Theory and applications to upscaling of two-phase flow
arXiv:2606.01303v1 Announce Type: new Abstract: We develop a multicontinuum Generalized Multiscale Finite Element Method (MC-GMsFEM) for constructing coarse-scale models in heterogeneous media that simultaneously provide accurate numerical approximations and physically consistent macroscopic equations. Classical multiscale methods efficiently approximate fine-scale solutions on coarse grids using localized basis functions, but they do not offer a systematic pathway for deriving macroscopic...
Odd Cycle Transversal in $P_k$-Free Graphs
arXiv:2606.07453v1 Announce Type: new Abstract: The Odd Cycle Transversal (OCT) problem, which asks for a minimum subset of vertices whose removal renders a graph bipartite, is a central problem in algorithmic graph theory. It is known to be NP-complete even on $P_k$-free graphs for $k \ge 6$. Furthermore, assuming the Unique Games Conjecture (UGC), OCT does not admit a constant-factor approximation algorithm on general graphs.
CoFi-UCGen: Coarse-to-Fine Unsupervised Conditional Generation without Label Priors
arXiv:2606.05652v1 Announce Type: new Abstract: Unsupervised conditional image generation (UCGen) aims to control generation without relying on manually annotated labels, yet remains challenging due to unstructured semantic representations across granularities. To address this, we propose a novel coarse-to-fine UCGen framework (CoFi-UCGen) that explicitly disentangles global semantics from fine-grained variations, which to the best of our knowledge, sets out the first successful attempt for...
Whole-genome duplication shaped cell-type evolution in the vertebrate brain
Abstract The complex brains of vertebrates have more cell types than those of their closest relatives. Whole-genome duplications (WGDs) occurred during early vertebrate evolution1, but it is unclear whether the duplicated genes (ohnologues) facilitated cell-type evolution. Here using brain single-cell transcriptomes from five chordates—human2, mouse3, lizard4, lamprey5 and amphioxus—we report that many cell-type families with conserved core transcription factors in vertebrates do not show...