Lin-DBSCAN is a fast density-based clustering algorithm for spatial data.
problem Efficient clustering of large datasets without prior knowledge of cluster number and shape.
method Grid-based scan and merge approach to a discrete density model of DBSCAN.
result Lin-DBSCAN outperforms DBSCAN in efficiency and validity for spatial data clustering.
We revisit the development of grid based recursive approximate filtering of general Markov processes in discrete time, partially observed in conditionally Gaussian noise. The grid based filters considered rely on two types of state quantization: The \textit{Markovian} type and the \textit{marginal} type. We propose a s…
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…
Prototype for adaptive electron microscopy scans reduces dose and time.
problem Reduce electron microscopy scan time and dose with minimal loss.
method Adaptive partial scanning with reinforcement learning.
result Reinforcement learning trained neural network optimizes scan paths.
Docking is an important tool in computational drug discovery that aims to predict the binding pose of a ligand to a target protein through a combination of pose scoring and optimization. A scoring function that is differentiable with respect to atom positions can be used for both scoring and gradient-based optimization…
Gibbs sampling is a Markov Chain Monte Carlo sampling technique that iteratively samples variables from their conditional distributions. There are two common scan orders for the variables: random scan and systematic scan. Due to the benefits of locality in hardware, systematic scan is commonly used, even though most st…
Scanning Transmission Electron Microscopy (STEM) has become the main stay for materials characterization on atomic level, with applications ranging from visualization of localized and extended defects to mapping order parameter fields. In the last several years, attention was attracted by potential of STEM to explore b…
SparseVM registers clinical 3D scans faster and more accurately.
problem Inaccurate and slow registration of sparse clinical 3D scans.
method Learning-based registration method tailored for clinical sparse MRI.
result Orders of magnitude faster and more accurate than existing methods.
Random scan CAVI converges linearly under log-concave assumptions.
problem Analyzing the convergence rate of random scan Coordinate Ascent Variational Inference (CAVI) under log-concave conditions.
method Building on previous work, we analyze the random scan version of CAVI using optimal transport geometry.
result We obtain tight linear convergence rates for the random scan version of CAVI.
New technique halves scan time for multi-echo MR images.
problem Slow acquisition of multi-echo magnetic resonance images.
method Structured deep dictionary learning for adaptive reconstruction.
result Scan time reduced by half compared to state-of-the-art.
Adapts scanning algorithm for odd Khovanov homology.
problem Computing odd Khovanov homology efficiently.
method Uses mapping cone construction instead of tensor product.
result Determines odd Khovanov homology of 3-strand torus links.
FUNSD dataset tackles noisy scanned forms, offering comprehensive annotations.
problem Extracting and structuring textual content from noisy scanned documents.
method Comprehensive dataset with real, fully annotated forms, including text detection, OCR, layout analysis, and entity linking.
result First publicly available dataset for form understanding, addressing challenges in noisy scanned documents.
Proposes a continuous scan statistic to detect anomalies more accurately.
problem Binary region definitions limit the detection of smooth anomalies.
method Kernel Spatial Scan Statistic (KSS) that allows continuous point contributions.
result Efficient computation and high statistical power for detecting anomalous regions.
Nowadays more and more data are gathered for detecting and preventing cyber attacks. In cyber security applications, data analytics techniques have to deal with active adversaries that try to deceive the data analytics models and avoid being detected. The existence of such adversarial behavior motivates the development…
Paper explores vulnerabilities in image authenticity detection methods, especially printing and scanning attacks.
problem Vulnerability of image authenticity detection models to printing and scanning attacks.
method Demonstrates and proposes a new machine learning model to counter these attacks.
result Proposed model outperforms state-of-the-art models when trained on images from a single printer.
Detects anomalous inputs in neural networks using subset scanning.
problem Detecting adversarial noise and out-of-distribution samples in neural networks.
method Subset scanning applied to neural network activations using non-parametric scan statistics.
result Identifies the most anomalous subset of node activations in neural networks.
Early detection and precise characterization of emerging topics in text streams can be highly useful in applications such as timely and targeted public health interventions and discovering evolving regional business trends. Many methods have been proposed for detecting emerging events in text streams using topic modeli…
Paper reproduces a kernel-based scan B-statistic for online change-point detection.
problem Continuous detection of distribution changes in online data streams.
method Efficient kernel-based scan B-statistic for online change-point detection.
result Scan B-statistic outperforms parametric methods in challenging scenarios.
GAN normalizes CT scans for consistent radiomic feature values.
problem Variations in dose levels and slice thickness affect radiomic features sensitivity.
method Used a 3D generative adversarial network (GAN) to normalize reduced dose, thick slice images to normal dose, thinner slice images.
result GAN-based approach led to significantly smaller error in radiomic features.
New Gibbs sampling method improves MCMC efficiency.
problem Improving efficiency of Gibbs sampling.
method Non-uniform random scan with selection probability optimization.
result Non-uniform scan improves mixing time of Markov chain.
SCAN divides deep neural networks into shallow classifiers for efficient deployment.
problem Explosive growth in storage and computation limits deep neural networks on edge devices.
method SCAN divides networks into shallow classifiers, uses attention modules and knowledge distillation, and employs a threshold-controlled scalable inference mechanism.
result SCAN achieves significant performance gain on CIFAR100 and ImageNet without hyper-parameter adjustments.
Deep learning predicts SAH patient mortality from initial CT scans.
problem High mortality rates in SAH patients.
method CNN-based algorithm using transfer learning on CT scans.
result Model accurately predicts mortality (74% accuracy, 82% AUC).
The seemingly infinite diversity of the natural world arises from a relatively small set of coherent rules, such as the laws of physics or chemistry. We conjecture that these rules give rise to regularities that can be discovered through primarily unsupervised experiences and represented as abstract concepts. If such r…
Automated brain CT image retrieval from traumatic brain injury cohorts using deep neural networks.
problem Manual image retrieval of whole brain CT scans from large clinical cohorts is time-consuming and resource-intensive.
method Proposes a deep convolutional neural network (dMIR) for automated classification of 2D montage images.
result Achieved high accuracy (f1=1.0) for validation and testing data sets.
LOUPE optimizes MRI under-sampling patterns for faster scans.
problem Accelerating MRI scans while maintaining image quality.
method End-to-end learning framework that trains on full-resolution scans.
result LOUPE-optimized masks yield superior reconstructions with 8x faster scans.
Radiological imaging of the prostate is becoming more popular among researchers and clinicians in searching for diseases, primarily cancer. Scans might be acquired with different equipment or at different times for prognosis monitoring, with patient movement between scans, resulting in multiple datasets that need to be…
Optimized coordinate system improves sparse grid regression performance.
problem Sparse grid methods struggle with skewed and rotated coordinates.
method Proposes an optimized coordinate system to reduce effective dimensionality.
result Adaptive sparse grid least squares algorithm benefits from preprocessing.
A new knot invariant using tangle-valued 1-cocycles.
problem Creating a strong and calculable knot invariant.
method Constructing a non-trivial combinatorial 1-cocycle L that takes values in H0(Θ;Z) with the scan-property. result The Alexander tree is an isotopy invariant of knots, demonstrating the non-invertibility of specific knots.
Researchers use clustering to differentiate COVID-19 lung scans.
problem Identifying infected individuals with COVID-19.
method Applied unsupervised clustering techniques using PCA, K-Means++, and RCC.
result KM++ and RCC algorithms improved in clustering COVID-19 lung scans.
Six AI solutions accurately detect growth plate planes in mice bone scans.
problem Manual, time-consuming, and variable bone growth plate detection in micro-CT scans.
method Prepared and annotated a dataset of 3D μCT scans, organized a challenge, and developed six computer vision solutions.
result Achieved mean absolute error of 1.91±0.87 planes from ground truth.
Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…
Optimizes ASL-MRF scan design for precise brain hemodynamics quantification.
problem Fixing model parameters in ASL introduces bias, and multiparametric estimation degrades precision.
method Optimizes ASL labeling durations using Cramer-Rao Lower Bound (CRLB) and proposes a neural network regression framework.
result Improved precision in estimating multiple hemodynamic parameters from a single scan.
FlowScan models exchangeable data sets with flexible flow transformations.
problem Density estimation for exchangeable, non-i.i.d. data.
method Combines invertible flow transformations with a sorted scan.
result Achieves new state-of-the-art performance on point cloud and image set modeling.
Computer science scans LLMs to understand and manipulate their economic forecasts.
problem Understanding and controlling the reasoning of large language models in economics.
method Brain scanning techniques applied to LLMs to identify and manipulate underlying concepts.
result LLMs can be steered to generate forecasts with specific biases, allowing for correction or simulation.
Identifying anomalous patterns in real-world data is essential for understanding where, when, and how systems deviate from their expected dynamics. Yet methods that separately consider the anomalousness of each individual data point have low detection power for subtle, emerging irregularities. Additionally, recent dete…
New NIDS uses hypergraphs for real-time detection of evolving port scans.
problem Challenges in offline NIDS for auto-generated port scans.
method Hypergraph-based metrics for real-time ML ensemble NIDS.
result High accuracy, precision, and recall in detecting port scans and attacks.
Many methods have been proposed for detecting emerging events in text streams using topic modeling. However, these methods have shortcomings that make them unsuitable for rapid detection of locally emerging events on massive text streams. We describe Spatially Compact Semantic Scan (SCSS) that has been developed specif…
For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…
Investigates polynomial time algorithms for computing Khovanov homology of braids.
problem Computing Khovanov homology for general braids is intractable.
method Examines polynomial time algorithms for 3-braids and a variation of the scanning algorithm for more general braids.
result Shows that for 3-braids, Khovanov homology can be computed in polynomial time, while for more general braids, it can be computed in polynomial time for bounded homological degrees.
Microdata improves inflation forecasts after major shocks, study finds.
problem Forecasting inflation in a non-stationary environment with microeconomic data.
method Developed a scan test to detect periods of micro forecast outperformance, combined with adaptive machine learning.
result Micro forecasts improve inflation predictions after major shocks, especially after 2020.
We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics a…
This study assesses the reproducibility of 1H-MRS scans across different vendors and sessions.
problem Lack of harmonization in magnetic resonance spectroscopy protocols among vendors.
method Analysis of CV and ICC for within- and between-sessions, and correlation coefficients for across machines.
result Metabolite concentrations are highly reproducible across different vendors and sessions.
GD networks improve lung nodule classification accuracy.
problem Difficult classification of lung nodules of varying sizes.
method Proposes Gated-Dilated (GD) networks with Context-Aware sub-network.
result GD network outperforms state-of-the-art models with AUC > 0.95.
AI tool automates blood segmentation from head CT scans after SAH.
problem Accurate volumetric assessment of SAH patients for clinical and prognostic implications.
method Transformer-based Swin UNETR architecture for noncontrast CT scans.
result High accuracy and robust performance across internal and external validation cohorts.
3D U-Net improves kidney and tumor segmentation from CT scans.
problem Manual segmentation by clinicians is laborious and error-prone.
method Multi-scale supervised 3D U-Net with deep supervision and post-processing.
result MSS U-Net achieves high Dice coefficients (0.969 for kidney, 0.805 for tumor) on KiTS19 dataset.
DESS MRI and kernel learning enable precise myelin water quantification.
problem Quantifying myelin water content in the brain.
method Optimized DESS scans combined with kernel learning for precise estimation of myelin water fraction.
result DESS PERK ff estimates are quantitatively similar to conventional MESE MWF estimates.
We parallelize backpropagation for deep learning models, achieving significant speedups.
problem Sequential dependency in backpropagation limits scalability on parallel systems.
method Reformulated backpropagation as a scan operation, using Blelloch scan algorithm.
result Up to 2.75x speedup on overall training time and 108x on backward pass.
This study assesses ML methods for brain tumor segmentation and survival prediction.
problem Segmenting and predicting outcomes of brain tumors with varying sub-regions and heterogeneous properties.
method Evaluation of state-of-the-art machine learning algorithms on BraTS challenge datasets.
result Identification of best ML algorithms for brain tumor segmentation and survival prediction.