Related papers: On recent advances in 2D Constrained Delaunay tria…
Detailed applications of minisuperspace methods are presented and compared with results obtained in recent years by means of causal dynamical triangulations (CDTs), mainly in the form of effective actions. The analysis sheds light on…
The formalism of Causal Dynamical Triangulations (CDT) attempts to provide a non-perturbative regularization of quantum gravity, viewed as an ordinary quantum field theory. In two dimensions one can solve the lattice theory analytically and…
We study metrics that assess how close a triangulation is to being a Delaunay triangulation, for use in contexts where a good triangulation is desired but constraints (e.g., maximum degree) prevent the use of the Delaunay triangulation…
The Clock Drawing Test (CDT) is a rapid, inexpensive, and popular neuropsychological screening tool for cognitive conditions. The Digital Clock Drawing Test (dCDT) uses novel software to analyze data from a digitizing ballpoint pen that…
Computational cytology is a critical, rapid-developing, yet challenging topic in the field of medical image computing which analyzes the digitized cytology image by computer-aided technologies for cancer screening. Recently, an increasing…
The paper introduces DelTriC (Delaunay Triangulation Clustering), a clustering algorithm which integrates PCA/UMAP-based projection, Delaunay triangulation, and a novel back-projection mechanism to form clusters in the original…
This paper presents a generalized flux-corrected transport (FCT) algorithm, which is shown to be total variation diminishing under some conditions. The new algorithm has improved properties from the standpoint of use and analysis. Results…
Causal dynamical triangulations (CDT) can be used as a regularization of quantum gravity. In two dimensions the theory can be solved anlytically, even before the cut-off is removed and one can study in detail how to take the continuum…
This work tackles the issue of noise removal from images, focusing on the well-known DCT image denoising algorithm. The latter, stemming from signal processing, has been well studied over the years. Though very simple, it is still used in…
We review some recent results from the causal dynamical triangulation (CDT) approach to quantum gravity. We review recent observations of dimensional reduction at a number of previously undetermined points in the parameter space of CDT, and…
Convolutional networks are successful due to their equivariance/invariance under translations. However, rotatable data such as images, volumes, shapes, or point clouds require processing with equivariance/invariance under rotations in cases…
Automated methods for breast cancer detection have focused on 2D mammography and have largely ignored 3D digital breast tomosynthesis (DBT), which is frequently used in clinical practice. The two key challenges in developing automated…
Three-dimensional (3D) reconstruction of head Computed Tomography (CT) images elucidates the intricate spatial relationships of tissue structures, thereby assisting in accurate diagnosis. Nonetheless, securing an optimal head CT scan…
We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to…
The causal dynamical triangulations (CDT) program has for the first time allowed for path-integral computation of correlation functions in full general relativity without symmetry reductions and taking into account Lorentzian signature. One…
Deep neural networks (DNN) have achieved unprecedented performance in computer-vision tasks almost ubiquitously in business, technology, and science. While substantial efforts are made to engineer highly accurate architectures and provide…
This technical note reviews sate-of-the-art algorithms for linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). While repeating several parts of our article "low-rank dynamic mode…
As incremental Structure from Motion algorithms become effective, a good sparse point cloud representing the map of the scene becomes available frame-by-frame. From the 3D Delaunay triangulation of these points, state-of-the-art algorithms…
Tooth arrangement is an essential step in the digital orthodontic planning process. Existing learning-based methods use hidden teeth features to directly regress teeth motions, which couples target pose perception and motion regression. It…
In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk,…