Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

58117175233 · May 202619922001200920172026
48 results for anatomical landmark localization

Paper introduces conformal prediction for reliable uncertainty quantification in landmark localization.

problem Systematic underestimation of total predictive uncertainty in landmark localization.
method Conformal prediction framework for multi-output regression, generating flexible prediction regions.
result Methods outperform existing approaches in validity and efficiency across 2D and 3D datasets.

Purpose: We perform anatomical landmarking for craniomaxillofacial (CMF) bones without explicitly segmenting them. Towards this, we propose a new simple yet efficient deep network architecture, called \textit{relational reasoning network (RRN)}, to accurately learn the local and the global relations among the landmarks…

2019-04-08abs ↗pdf ↗

In this paper, we propose a novel deep learning framework for anatomy segmentation and automatic landmark- ing. Specifically, we focus on the challenging problem of mandible segmentation from cone-beam computed tomography (CBCT) scans and identification of 9 anatomical landmarks of the mandible on the geodesic space. T…

2018-10-06abs ↗pdf ↗

Novel approach uses quasi-conformal geometry for OSA classification from cephalometry.

problem Classifying obstructive sleep apnea (OSA) based on craniofacial profiles.
method Quasi-conformal geometry for local deformation analysis of 15 landmark points in lateral cephalograms.
result Proposed model achieves 92.5% testing accuracy.

Landmark-based node embeddings approximate shortest path distances in random graphs.

problem Capturing global graph distances in node representations.
method Landmark-based node embeddings using shortest path distances from a subset of reference nodes (landmarks).
result Random graphs require lower dimensions in landmark-based embeddings compared to worst-case graphs.

For their ability to capture non-linearities in the data and to scale to large training sets, local Support Vector Machines (SVMs) have received a special attention during the past decade. In this paper, we introduce a new local SVM method, called L3^3-SVMs, which clusters the input space, carries out dimensionality r…

2017-03-01abs ↗pdf ↗

We present a novel approach to automatically segment magnetic resonance (MR) images of the human brain into anatomical regions. Our methodology is based on a deep artificial neural network that assigns each voxel in an MR image of the brain to its corresponding anatomical region. The inputs of the network capture infor…

2015-02-09abs ↗pdf ↗

Method generates anatomically-controllable medical images with segmentation guidance.

problem Challenging to enforce anatomical constraints in generated medical images.
method Segmentation-guided diffusion models with random mask ablation training.
result New state-of-the-art in faithfulness to input anatomical masks.

The study extends stochastic completeness to landmark spaces with any number of landmarks.

problem Stochastic completeness for landmark spaces with arbitrary numbers of landmarks.
method Volume growth criterion and eigenvalue bounds for geodesic balls.
result Stochastic completeness for landmark spaces with any number of landmarks is proven.

Stochastic gradient descent optimizes Nyström samples for kernel matrix approximation.

problem Optimizing Nyström samples for kernel matrix approximation.
method Stochastic gradient descent applied to multisets of landmark points (Nyström samples) using a surrogate criterion (radial SKD).
result Local minimization of the radial SKD yields improved Nyström approximation accuracy.

Paper proposes a new landmark selection method for kernel ridge regression.

problem Efficient landmark selection for scalable kernel methods.
method Two-step approach: first computes importance scores, then clusters them into landmarks.
result Proposed method provides better accuracy and efficiency trade-offs.

Researchers prove long-time existence for two landmark Brownian motion.

problem Proving long-time existence of Brownian motion on configurations of two landmarks.
method Classification and analysis of long-time existence for configurations of exactly two landmarks, using a radial kernel.
result For configurations of exactly two landmarks, long-time existence is possible for certain kernels, but not for others.

Exact universal interpolation property for landmark configurations in Euclidean space.

problem Representing and deforming landmark configurations through flows of vector fields.
method Explicitly describe vector fields for exact universal interpolation property in all dimensions.
result Achieve controllability by combining constant and polynomial vector fields.

Improved 3D ECG feature attributions for clinical interpretation.

problem Lack of interpretability in deep learning models for 12-lead ECG analysis.
method Cross-modal mapping of feature attributions from 12-lead ECG models onto CineECG 3D space.
result Mapped feature attributions yield higher Dice scores than standard 12-lead attributions.

Paper evaluates CNN-based facial landmark detection methods.

problem Evaluate characteristics and performance of CNN-based facial landmark detection methods.
method Divided into regression and heatmap approaches, investigated using a hybrid loss function and discrimination network.
result Proposed model outperforms other models in all tested datasets.

Selecting diverse and important items, called landmarks, from a large set is a problem of interest in machine learning. As a specific example, in order to deal with large training sets, kernel methods often rely on low rank matrix Nyström approximations based on the selection or sampling of landmarks. In this context, …

2019-05-29abs ↗pdf ↗

Neumann eigenmaps improve landmark-based diffusion map embeddings.

problem Landmark-based diffusion map embeddings can be computationally inefficient and unstable.
method NeuMaps use a renormalized Neumann Laplacian for eigendecomposition, incorporating landmarks as a subgraph.
result NeuMaps offer a computationally efficient and stable embedding method.

The paper explores a new method for landmark matching using sub-Riemannian geometry and neural networks.

problem Finding a time-dependent vector field to warp points from an initial set to a target set.
method Sub-Riemannian geometry and residual neural networks.
result Demonstrates the importance of regularization in landmark matching.

This paper puts forth a novel bi-linear modeling framework for data recovery via manifold-learning and sparse-approximation arguments and considers its application to dynamic magnetic-resonance imaging (dMRI). Each temporal-domain MR image is viewed as a point that lies onto or close to a smooth manifold, and landmark …

2018-12-27abs ↗pdf ↗

Kernel methods obtain superb performance in terms of accuracy for various machine learning tasks since they can effectively extract nonlinear relations. However, their time complexity can be rather large especially for clustering tasks. In this paper we define a general class of kernels that can be easily approximated …

2015-10-28abs ↗pdf ↗

An agent that has well understood the environment should be able to apply its skills for any given goals, leading to the fundamental problem of learning the Universal Value Function Approximator (UVFA). A UVFA learns to predict the cumulative rewards between all state-goal pairs. However, empirically, the value functio…

2019-08-15abs ↗pdf ↗

Survey of Locally Linear Embedding and its variants.

problem Representing high-dimensional data in a lower-dimensional space while preserving local structure.
method Explains various LLE and variant methods, including kernel LLE, inverse LLE, feature fusion, out-of-sample embedding, incremental LLE, landmark LLE, supervised LLE, robust LLE, fusion with other methods, and weighted LLE.
result Comprehensive overview of LLE and its variants.

In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we first build the adjacency matrix of the corresponding graph of the dataset. To bui…

2017-04-07abs ↗pdf ↗

In this work we propose a method for anatomical data augmentation that is based on using slices of computed tomography (CT) examinations that are adjacent to labeled slices as another resource of labeled data for training the network. The extended labeled data is used to train a U-net network for a pixel-wise classific…

2018-01-07abs ↗pdf ↗

MosaicMRI expands public datasets for musculoskeletal MRI, revealing cross-anatomical correlations.

problem Limited diversity in public MRI datasets hinders model evaluation across different anatomical settings.
method Developed a large, diverse dataset (MosaicMRI) and conducted experiments on a baseline model (VarNet).
result Models trained on combined anatomies outperform anatomy-specific models in low-sample regimes.

Kernel methods have achieved very good performance on large scale regression and classification problems, by using the Nyström method and preconditioning techniques. The Nyström approximation -- based on a subset of landmarks -- gives a low rank approximation of the kernel matrix, and is known to provide a form of impl…

2020-02-20abs ↗pdf ↗

Prediction and interpolation for long-range video data involves the complex task of modeling motion trajectories for each visible object, occlusions and dis-occlusions, as well as appearance changes due to viewpoint and lighting. Optical flow based techniques generalize but are suitable only for short temporal ranges. …

2019-09-06abs ↗pdf ↗