Study pentagon growth with laser-cut models.
problem Explore topological and geometric properties of pentagon cell growth.
method Cell growth process in Euclidean plane, physical representations created with laser cutter.
result Aesthetic and geometric insights from pentagon growth models.
Many mobile robots rely on 2D laser scanners for localization, mapping, and navigation. However, those sensors are unable to correctly provide distance to obstacles such as glass panels and tables whose actual occupancy is invisible at the height the sensor is measuring. In this work, instead of estimating the distance…
This work uses neural density estimation to analyze laser-induced breakdown spectroscopy data, enabling accurate predictions and uncertainty quantification.
problem Inference of probability densities in high-dimensional spectral data is often intractable.
method Normalizing flows on structured spectral latent spaces for density estimation and uncertainty quantification.
result The approach enables generation of realistic spectral samples and accurate prediction of state vectors with well-calibrated uncertainties.
In microsurgery, lasers have emerged as precise tools for bone ablation. A challenge is automatic control of laser bone ablation with 4D optical coherence tomography (OCT). OCT as high resolution imaging modality provides volumetric images of tissue and foresees information of bone position and orientation (pose) as we…
Ultra-short laser pulses with femtosecond to attosecond pulse duration are the shortest systematic events humans can create. Characterization (amplitude and phase) of these pulses is a key ingredient in ultrafast science, e.g., exploring chemical reactions and electronic phase transitions. Here, we propose and demonstr…
A RL approach optimizes metal AM process parameters for consistent melt pool depth.
problem Optimizing process parameters for metal additive manufacturing to ensure repeatability and control microstructure.
method A Reinforcement Learning (RL) framework based on Q-learning is applied to find optimal laser power and scan velocity combinations.
result The RL framework learns optimal process parameters without prior knowledge, providing a model-free approach.
LASER compresses recursive model activations by exploiting their low-dimensional structure.
problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.
INNs improve acceptance rates in electron spectra analysis.
problem Analyzing electron spectra from near-critical laser-plasmas.
method Invertible Neural Networks (INNs) for forward and inverse modeling.
result INNs significantly increase acceptance rates up to a factor of 10.
The paper analyzes the performance of delay-based reservoir computing using eigenvalue analysis.
problem Quantifying the performance of delay-based reservoir computing.
method Eigenvalue analysis of the dynamical system to predict reservoir computing performance.
result The performance of a reservoir computing system can be predicted by analyzing the small signal response and eigenvalue spectrum.
Convolutional neural network localizes OD and fovea in UWFoV-SLO images.
problem Localizing optic disc and fovea centers in ultra-widefield retinal images.
method Convolutional neural network trained on reflectance and autofluorescence images.
result 99.4% OD localisation accuracy and 99.1% fovea localisation accuracy.
Paper uses CNN to predict process parameters from molten pool data in WLAM.
problem Achieving high quality in WLAM through real-time process control.
method Proposes a multi-modality CNN architecture to predict process parameters from molten pool sensor data.
result Improved prediction performance of multi-modal CNN compared to uni-modal approach.
NeuralCut learns to select cutting planes by looking ahead, outperforming traditional methods.
problem Selecting effective cutting planes for MILP optimization.
method Imitation learning on a lookahead expert to train a neural network for cut selection.
result NeuralCut outperforms standard baselines in cut selection for MILP benchmarks.
Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.
problem Solving parametric mixed-integer linear optimization problems with changing data.
method Introducing cutting-plane layers (CPLs) for differentiable cutting-plane generation.
result The algorithm computes solutions with low integrality gaps and generalizes to unseen instances.
NeVI-Cut uses neural networks to efficiently propagate uncertainty without feedback.
problem Efficiently propagating uncertainty in downstream Bayesian analysis without feedback.
method NeVI-Cut combines neural networks and normalizing flows for variational inference.
result NeVI-Cut achieves significant computational gains and higher accuracy than traditional methods.
Paper connects probability density cuts to graph theory eigenfunctions.
problem Developing sparse cuts for probability densities.
method Defines sparse cuts and principal eigenfunctions for probability densities, proving Cheeger and Buser inequalities.
result No such inequalities hold for prior definitions, proving new inequalities for probability densities.
Study Riemannian metrics on lens spaces, find cut loci and diameters.
problem Understanding Riemannian metrics on lens spaces and their geometric properties.
method Geometric control theory methods applied to axisymmetric metrics.
result Cut loci and cut times converge to sub-Riemannian structure's values.
Study Riemannian metrics on lens spaces, find cut loci and diameters.
problem Analyzing Riemannian metrics on lens spaces.
method Geometric control theory methods.
result Cut loci and cut times converge to sub-Riemannian structure's cut locus and time.
We consider a left invariant Riemannian metric on SO(3) with two equal eigenvalues. We find the cut locus and the equation for the cut time. We find the diameter of such metric and describe the set of all most distant points from the identity. Also we prove that the cut locus and the cut time converge to the cut locus …
Stability of cut locus under metric perturbations in compact Riemannian manifolds.
problem Stability of cut locus under C2-perturbations of the metric. method Proving stability with respect to the Hausdorff metric of the cut locus under C2 perturbation of the metric. result The Hausdorff distance between cut loci converges to zero as the metrics converge.
New equivalence relation for links using cut-diagrams.
problem Classical link concordance.
method Cut-diagrams and cut-concordance.
result Nilpotent peripheral system invariant of cut-concordance.
Study shows convergence rates for Cheeger cuts on data clouds.
problem Optimizing graph cuts for clustering data sampled from a manifold.
method Analyzes statistical properties of Cheeger cuts on proximity graphs built from data.
result Obtains high probability convergence rates for Cheeger constant and cuts.
Unified framework for differentiable graph partitioning with probabilistic cuts.
problem Lack of general guarantees and principled gradients in prior probabilistic relaxations of graph cuts.
method Unified probabilistic framework covering a wide class of cuts, including Normalized Cut, with tight analytic upper bounds.
result Rigorous, numerically stable foundation for scalable, differentiable graph partitioning.
Stochastic cutting planes improve data-driven optimization speed.
problem Data-driven Mixed-Integer Nonlinear Optimization problems.
method Stochastic version of cutting-plane method.
result Stochastic algorithm converges to ε-optimal solution with high probability.
Study of Randers metrics on spheres with simple cut loci.
problem Understanding Randers metrics on spheres and their cut loci.
method Analyzing geodesics, conjugate, and cut loci of Finsler metrics of Randers type.
result Found new families of Randers metrics with simple cut loci.
Manifold methods improve amino acid classification in LIBS spectra.
problem Improving classification accuracy of amino acids in LIBS spectra.
method Developed an information theoretic method for measuring LIBS energy spectra, implemented manifold methods for nonlinear dimensionality reduction.
result Nonlinear methods lead to increased classification accuracy in amino acid classification.
We define spin-c prequantization of a symplectic manifold to be a spin-c structure and a connection which are compatible with the symplectic form. We describe the cutting of an S^1-equivariant spin-c prequantization. The cutting process involves a choice of a spin-c prequantization for the complex plane. We prove that …
A symplectic cut of a manifold M with a Hamiltonian circle action is a symplectic quotient of M x C. If M is Kaehler then, since C is Kaehler, the cut space is Kaehler as well. The symplectic structure on the cut is well understood. In this paper we describe the complex structure (and hence the metric) on the cut. We t…
In this note, we study the cut locus of the free, step two Carnot groups Gk with k generators, equipped with their left-invariant Carnot-Carathéodory metric. In particular, we disprove the conjectures on the shape of the cut loci proposed in [Myasnichenko - 2002] and [Montanari, Morbidelli - 2016], by exh…
Max flow/min cut theorem extended to currents and topology.
problem Continuous max flow/min cut theorem for complex domains.
method Continuous analogue of max flow/min cut theorem considering topology.
result Continuous max flow/min cut theorem proven for currents and laminations.
Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced k-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to th…
Spectral clustering is sensitive to how graphs are constructed from data particularly when proximal and imbalanced clusters are present. We show that Ratio-Cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced data since they tend to emphasize cut sizes over cut values. We propose a graph partit…
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our f…
New upper bound for geodesic complexity derived from cut locus decompositions.
problem Understanding geodesic complexity in Riemannian manifolds.
method Study of decompositions of cut loci and their tangent fibers.
result Established a new upper bound for geodesic complexity.
New 2-spheres of revolution with simple cut locus structures.
problem Determining surfaces of revolution with simple cut locus structures.
method Introducing a new family of 2-spheres of revolution.
result The new family {M_n}_n has a simple cut locus structure.
We consider the Lie group PSL(2) (the group of orientation preserving isometries of the hyperbolic plane) and a left-invariant Riemannian metric on this group with two equal eigenvalues that correspond to space-like eigenvectors (with respect to the Killing form). For such metrics we find a parametrization of geodesics…
In this article we extend cutting and blowing up to the nonrational symplectic toric setting. This entails the possibility of cutting and blowing up for symplectic toric manifolds and orbifolds in nonrational directions.
Spectral clustering methods which are frequently used in clustering and community detection applications are sensitive to the specific graph constructions particularly when imbalanced clusters are present. We show that ratio cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced cluster sizes sin…
Functor connects symplectic and contact structures via cutting and blowups.
problem Establishing a functorial relationship between symplectic and contact structures.
method Developed a cutting procedure and its inverse for manifolds with boundary and equivariant transverse maps, then applied it to non-symplectic and non-contact structures.
result Obtained an inverse functor for equivariant radial-squared blowups.
In this paper we investigate the small time heat kernel asymptotics on the cut locus on a class of surfaces of revolution, which are the simplest 2-dimensional Riemannian manifolds different from the sphere with non trivial cut-conjugate locus. We determine the degeneracy of the exponential map near a cut-conjugate poi…
Proves a generalized Whitehead cut vertex lemma for tree groups.
problem Extending Whitehead's cut vertex lemma to tree group conjugacy classes.
method Proves a version of Whitehead's lemma for tree groups.
result Establishes a cut vertex in star graphs for tree group conjugacy classes.
Extends Milnor invariants to surface-links using cut-diagrams.
problem Tackles invariants for surface-links in 4-space.
method Introduces cut-diagrams and groups associated to them.
result Yields concordance and link-homotopy invariants for surface-links.
In this contribution, we present a novel approach for segmenting laser radar (lidar) imagery into geometric time-height cloud locations with a fully convolutional network (FCN). We describe a semi-supervised learning method to train the FCN by: pre-training the classification layers of the FCN with image-level annotati…
This paper improves Gaussian process predictions by integrating prior knowledge.
problem Gaussian processes lack predictive power when prior information is ignored.
method Derive mean and covariance functions from previous data using weighted sums of basis functions.
result Integrating prior knowledge significantly increases look-ahead time and accuracy.
We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.
Surgeons normally need surgical scissors and tissue grippers to cut through a deformable surgical tissue. The cutting accuracy depends on the skills to manipulate these two tools. Such skills are part of basic surgical skills training as in the Fundamentals of Laparoscopic Surgery. The gripper is used to pinch a point …
The paper extends IPC framework to stationary physical systems and validates it with a photonic system.
problem Characterizing the computational capabilities of stationary physical systems in a principled, data-efficient way.
method Extended IPC framework, established fundamental results, derived asymptotic bias, introduced data-efficient estimation methods.
result IPC strongly correlates with machine-learning performance and provides a reliable estimate of system dimensionality.
Researchers predict butt rot volume using harvester data and remote sensing.
problem Predicting butt rot volume in Norway spruce stands for optimal forest management.
method Used random forest models with harvester information, remote sensing, and environmental data.
result Remotely sensed predictor variables were more important than environmental variables.
A new spectrum recovers cobordism cut and paste groups of manifolds with boundary.
problem Defining and studying cobordism cut and paste groups of manifolds with boundary.
method Constructing a spectrum that recovers the cobordism cut and paste groups of manifolds with boundary.
result Construction of a spectrum that recovers the cobordism cut and paste groups of manifolds with boundary.