A new method clusters hyperspectral images using spatially regularized diffusion.
problem Clustering hyperspectral images effectively.
method Spatially regularized random walks and diffusion geometry.
result The method outperforms state-of-the-art algorithms on real data.
Paper develops a method to predict spatial point processes with guarantees.
problem Predicting the number of events in space with uncertainty.
method Regularized method to learn spatial models with out-of-sample guarantees.
result Method provides valid prediction intervals even when model is misspecified.
This research shows adding regularization boosts accuracy and spatial robustness for adversarially transformed examples.
problem Improving accuracy and spatial robustness for adversarially transformed examples.
method Invariance-inducing regularization using worst-case transformations.
result Adding regularization on top of standard or adversarial training reduces relative error by 20% for CIFAR10 without increasing computational cost.
New algorithm clusters hyperspectral images at multiple scales.
problem Clustering hyperspectral images at various scales.
method M-SRDL algorithm using spectral-spatial diffusion distances.
result More accurate clustering labels achieved with spatial regularization.
New method estimates spatial weights matrix for lattice data, improving prediction accuracy.
problem Estimating spatial dependence structure for regular lattice data.
method Adaptive lasso with cross-sectional resampling to estimate sparse spatial weights matrix.
result Improves prediction accuracy of nitrogen dioxide concentrations.
Incorporating spatial information into hyperspectral unmixing procedures has been shown to have positive effects, due to the inherent spatial-spectral duality in hyperspectral scenes. Current research works that consider spatial information are mainly focused on the linear mixing model. In this paper, we investigate a …
The paper introduces a test to distinguish spatial graphs based on their knot diagrams.
problem Distinguishing isotopic spatial graphs from diagrams.
method Using the writhe of knot diagrams from cycles in the graph.
result A necessary condition for distinguishing isotopic spatial graphs.
A new method classifies high-dimensional images with minimal labels using diffusion geometry.
problem Classifying high-dimensional images efficiently and accurately.
method Spatially-regularized nonlinear diffusion geometry for clustering and active learning.
result High-accuracy labelings achieved with a very small number of training labels.
Scalable method for regionalizing and extracting temporal patterns from time series data.
problem Static spatial snapshots and ad hoc regularization limit effective spatial analysis and resource management.
method Minimum description length principle for fully nonparametric spatial partitioning and time series archetypes.
result Accurately recovers planted regional structure and drivers in synthetic and empirical data.
Agents can learn spatial structure from raw sensorimotor experience.
problem Understanding spatial knowledge and its emergence in autonomous agents.
method A simple sensorimotor predictive scheme applied to various agents and exploration types.
result Agents can capture spatial topology and metric regularity without prior knowledge or supervision.
Proposes a DR method for HSI classification with limited labeled data.
problem High dimensionality, singularity, limited training samples, lack of labeled data, heteroscedasticity, nonlinearity.
method Semi-supervised graph-based, HGF for smoothing, MLP for linear patches, RMLSC and NPMLSC for dissimilarity matrices, optimization for projection matrix.
result Improves HSI classification with limited labeled data.
GCNs model complex spatial patterns of POI check-ins.
problem Capturing complex spatial patterns in irregular data.
method Graph Convolutional Neural Networks (GCNs) for semi-supervised prediction.
result Demonstrates feasibility of GCNs for complex geographic data.
STARK improves denoising of low-depth spatial transcriptomics images.
problem Denoising spatial transcriptomics images at ultra-low sequencing depths.
method Adaptive regularization with kernel ridge regression and graph Laplacian.
result STARK optimizes denoising performance over competing methods.
Agents learn spatial structure without supervision.
problem Understanding spatial knowledge in autonomous agents.
method Sensorimotor predictive scheme applied to various agents and exploration types.
result Agents can learn egocentric spatial structure without supervision.
We prove a sharp version of the Hopf boundary point lemma for Black-Scholes type equations. We also investigate the existence and the regularity of the spatial derivative of the solutions at the spatial boundary.
This paper compares traditional and new CSP methods for EEG classification in BCIs.
problem Improving signal-to-noise ratio in EEG signals for better BCI performance.
method Spatial filtering using traditional and new CSP methods with regularization.
result The traditional CSP method generally gives better results in binary classification.
This paper improves RL for PDE control with function-valued actions.
problem Control of PDEs with high-dimensional, spatially related actions.
method Action descriptors and deep deterministic policy gradient.
result Action descriptor approach is more sample efficient.
A new DR method for HSI classification improves accuracy with limited samples.
problem Challenges in DR for HSI classification with limited training samples.
method Graph-based spatial and spectral regularized local scaling cut (SSRLSC).
result Improved classification accuracy compared to spectral-only methods.
Uniform consistency proven for spatial distribution and depth estimators in any dimension.
problem Uniform consistency of spatial distribution and depth estimators in arbitrary dimensions.
method Proof of uniform L1-consistency using sample size n as the only dependency. result Consistency rate is independent of dimension d and sample size n. LOCO-Reg improves CNN accuracy by promoting feature cohesion near filter centers.
problem Current regularization schemes in CNNs violate the principle that weights near the center of a filter are larger than weights on the outside.
method Introduces Locality-Promoting Regularization (LOCO-Reg) to correct this issue.
result LOCO-Reg yields accuracy gains across multiple architectures and datasets.
Hyperspectral remote sensing images (HSIs) usually have high spectral resolution and low spatial resolution. Conversely, multispectral images (MSIs) usually have low spectral and high spatial resolutions. The problem of inferring images which combine the high spectral and high spatial resolutions of HSIs and MSIs, resp…
New method improves convergence of spatial filters in neural networks.
problem Poor convergence behavior of spatial filters in neural networks.
method Correlated initialization for spatial filters.
result Uncorrelated initialization leads to poor convergence and slow training of some parameters.
Study spin-0 fields on n-dimensional Minkowski spacetimes, computing asymptotic charges.
problem Analyzing spin-0 fields on Minkowski spacetimes near infinity.
method Conformal geometry and Friedrich's cylinder at spatial infinity.
result Found infinitely many well-defined asymptotic charges in even dimensions, no charges in odd dimensions.
A new method aligns spatial and temporal data, improving on Dynamic Time Warping.
problem Comparing data over space and time, accounting for both spatial and temporal variability.
method Spatio-Temporal Alignments (STA) using regularized optimal transport (OT) and soft-DTW.
result Soft-DTW increases quadratically with time shifts, effectively handling spatio-temporal data.
Hyperspectral remote sensing images (HSIs) are characterized by having a low spatial resolution and a high spectral resolution, whereas multispectral images (MSIs) are characterized by low spectral and high spatial resolutions. These complementary characteristics have stimulated active research in the inference of imag…
Spatial Adapter adds structured spatial representation to frozen predictors.
problem Efficiently adding spatial structure to pre-trained models.
method Structured spatial decomposition and closed-form covariance for residual fields.
result Adapter improves spatial prediction and uncertainty quantification.
Image-to-image networks speed up SAR model parameter estimation.
problem Computational infeasibility of MLE for large, non-stationary spatial fields.
method Used image-to-image networks to estimate SAR model parameters.
result Image-to-image networks enable faster and more accurate parameter estimation.
Gradient boosting for spatial regression models improves prediction accuracy.
problem Spatial data with autoregressive disturbances.
method Model-based gradient boosting algorithm for spatial regression models.
result Improves prediction accuracy on out-of-sample spatial data.
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of n-dimension…
Estimates spatio-temporal data with satellite NO2 concentrations using Yule-Walker equations.
problem Estimating large spatio-temporal autoregressions with unknown spatial interactions.
method Sparse generalized Yule-Walker estimation, penalized regression, spatial and temporal dependence.
result Strong forecast improvements and evidence of spatial interactions in NO2 satellite data.
Gradient boosting algorithm for spatial panel models improves estimation in high-dimensional settings.
problem Estimation failure in high-dimensional spatial panel models.
method Model-based gradient boosting algorithm for spatial panel models with random and fixed effects.
result Feasibility and interpretability in both low- and high-dimensional settings.
A new method matches measures across different spaces using cost-regularized optimal transport.
problem Matching measures in different spaces without aligned data.
method Cost-regularized optimal transport formulation to match measures across two Euclidean spaces.
result Demonstrated applicability to single-cell spatial transcriptomics/multiomics matching tasks.
Paper proposes dp-VAE for preserving spatial context in gene expression data.
problem Inaccessibility of spatial context in single-cell gene expression data.
method Generic representation learning and transfer learning framework with a distance-preserving regularizer.
result dp-VAE effectively reconstructs and imputes spatial context from gene expression data.
Physics-informed methods infer spatial dynamics from static snapshots, but limits exist.
problem Inferring spatial dynamics from static molecular patterns.
method Combining flexible representations with mechanistic constraints, analyzing structural identifiability, and adapting physics-informed schemes.
result Static spatial patterns can identify spatially varying dynamics, but limits exist due to modeling choices.
Inverse inference, or "brain reading", is a recent paradigm for analyzing functional magnetic resonance imaging (fMRI) data, based on pattern recognition and statistical learning. By predicting some cognitive variables related to brain activation maps, this approach aims at decoding brain activity. Inverse inference ta…
Graph CNN method improves classification of irregular spatial data like building patterns.
problem Challenges in analyzing irregular spatial data with machine learning.
method Graph Fourier transform and convolution theorem to convert irregular spatial data into a learnable format.
result Significantly improved classification of building patterns compared to other methods.
Paper presents a new algorithm for predicting crop yield across fields.
problem Predicting within-field spatial variability of crop yield in complex environments.
method Spatial-temporal Multi-Task Learning algorithm integrating multiple data sources.
result Algorithm outperforms conventional methods in predicting crop yield.
New method generates geolocated synthetic populations from real data.
problem Generating synthetic populations with explicit geographic coordinates.
method Mapping coordinates into a latent space using Normalizing Flows (NF), then combining with other features in a Variational Autoencoder (VAE).
result NF+VAE architecture outperforms existing methods in generating geolocated synthetic populations.
Graph neural networks extend neural Bayes estimators to irregular spatial data.
problem Estimating parameters from irregular spatial data with computational efficiency.
method Employing graph neural networks to approximate Bayes estimators for irregular spatial data.
result Extending neural Bayes estimation to irregular spatial data with computational benefits.
Modeling spatial extremes with non-Gaussian fields using SAR models and CNNs.
problem Challenges in modeling spatial data with heavy-tailed distributions and missing cells.
method Spatial autoregressive models with Generalized Extreme Value innovations, combined with CNN for fast parameter estimation.
result Effective modeling of spatial extremes in non-Gaussian fields, demonstrated on precipitation data.
Paper constructs infinitely many pairs of Seifert surfaces for each link.
problem Constructing infinitely many pairs of Seifert surfaces for each link.
method Using a multiple group rack (MGR) to construct invariants and distinguishing surfaces using these invariants.
result Presented infinitely many pairs of Seifert surfaces for each link, satisfying specific conditions.
Study on Kähler-Ricci flow's Hölder regularity on compact manifolds.
problem Hölder regularity of Kähler-Ricci flow on compact Kähler manifolds.
method Adapting Hein-Tosatti's method for collapsing Calabi-Yau metrics, uniform spatial Hölder estimate obtained for all time.
result Uniform spatial Hölder estimate of Kähler-Ricci flow for all time.
Efficiently infers gene regulatory networks from spatial data.
problem Inferring spatially-varying gene regulatory networks.
method Proposed an efficient optimization problem for SV-GMRFs.
result Solves large-scale SV-GMRF problems in minutes.
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
Substantial evidence indicates that major psychiatric disorders are associated with distributed neural dysconnectivity, leading to strong interest in using neuroimaging methods to accurately predict disorder status. In this work, we are specifically interested in a multivariate approach that uses features derived from …
Dataset for rainfall modeling in central Europe from 1981-2011.
problem Improving rainfall streamflow modeling beyond simple catchments.
method Spatially resolved meteorological and ancillary data compilation.
result Dataset for neural network-driven hydrological modeling.
New method proves heat flow of harmonic maps into CAT(0) spaces.
problem Global existence and uniqueness of suitable weak solutions.
method Elliptic regularization and variational structure.
result Lipschitz continuity of solutions in spatial variables.
Identification of regions of interest (ROI) associated with certain disease has a great impact on public health. Imposing sparsity of pixel values and extracting active regions simultaneously greatly complicate the image analysis. We address these challenges by introducing a novel region-selection penalty in the framew…