Related papers: Hyperspherical Dirac Mixture Reapproximation
Out-of-Distribution (OOD) generalization has become a primary metric for evaluating image analysis systems. Since deep learning models tend to capture domain-specific context, they often develop shortcut dependencies on these non-causal…
As one type of efficient unsupervised learning methods, clustering algorithms have been widely used in data mining and knowledge discovery with noticeable advantages. However, clustering algorithms based on density peak have limited…
We report tests and results from a new approach to the spectral density and the mode number distribution of the Dirac operator in lattice gauge theories. The algorithm generates the spectral density of the lattice Dirac operator as a…
High-dispersion coronagraphy (HDC) optimally combines high contrast imaging techniques such as adaptive optics/wavefront control plus coronagraphy to high spectral resolution spectroscopy. HDC is a critical pathway towards fully…
This article proposes a hybrid adaptive numerical method based on the Dual Reciprocity Method (DRM) to solve problems with non-linear boundary conditions and large-scale problems, named Hybrid Adaptive Dual Reciprocity Method (H-DRM). The…
The rapid evolution of generative models has enabled the creation of highly realistic and diverse synthetic images, posing significant challenges to reliable and generalizable Synthetic Image Detection (SID). However, existing detectors are…
Decoders play significant roles in recovering scene depths. However, the decoders used in previous works ignore the propagation of multilevel lossless fine-grained information, cannot adaptively capture local and global information in…
Semi-supervised learning provides great significance in left atrium (LA) segmentation model learning with insufficient labelled data. Generalising semi-supervised learning to cross-domain data is of high importance to further improve model…
In a previous work, a simple approach to derive the jamming packing fraction of a hard-sphere mixture from the knowledge of the random close-packing fraction of the monocomponent system was proposed. Now, an extension of that approach is…
Clustering analysis is of substantial significance for data mining. The properties of big data raise higher demand for more efficient and economical distributed clustering methods. However, existing distributed clustering methods mainly…
We introduce a family of hybrid discretisations for the numerical approximation of optimal control problems governed by the equations of immiscible displacement in porous media. The proposed schemes are based on mixed and discontinuous…
We consider a Hidden Markov Model (HMM) where the integrated continuous-time Markov chain can be observed at discrete time points perturbed by a Brownian motion. The aim is to derive a filter for the underlying continuous-time Markov chain.…
Computed Tomography (CT) technology reduces radiation haz-ards to the human body through sparse sampling, but fewer sampling angles pose challenges for image reconstruction. Score-based generative models are widely used in sparse-view CT…
Computing marginal distributions of discrete or semidiscrete Markov random fields (MRFs) is a fundamental, generally intractable problem with a vast number of applications in virtually all fields of science. We present a new family of…
We propose a new framework for Hamiltonian Monte Carlo (HMC) on truncated probability distributions with smooth underlying density functions. Traditional HMC requires computing the gradient of potential function associated with the target…
The primary dynamical Dirac relativistic effects can only be seen in hydrogenic systems without the complications introduced by electron-electron interactions in many-electron systems. They are known to be the contraction-towards-the-origin…
Let $\mathfrak{C}$ be a class of probability distributions over the discrete domain $[n] = \{1,...,n\}.$ We show that if $\mathfrak{C}$ satisfies a rather general condition -- essentially, that each distribution in $\mathfrak{C}$ can be…
The increasing demand for larger and higher fidelity simulations has made Adaptive Mesh Refinement (AMR) and unstructured mesh techniques essential to focus compute effort and memory cost on just the areas of interest in the simulation…
This paper, the fourth part of a series of papers on the arithmetic average (AA) density fusion approach and its application for target tracking, addresses the intricate challenge of distributed heterogeneous multisensor multitarget…
The discrete-dipole approximation (DDA) is a powerful method for calculating absorption and scattering by targets that have sizes smaller than or comparable to the wavelength of the incident radiation. We present a new prescription -- the…