Proves Thurston's bounded image theorem for Haken manifolds.
problem Proving Thurston's bounded image theorem for Haken manifolds.
method Using recent developments in Kleinian group theory.
result A proof of Thurston's original bounded image theorem.
Uniform bound on geodesic images for surfaces using bicorn curves.
problem Bounding geodesic images on closed surfaces.
method Utilizing bicorn curves and properties of 1-slim triangles.
result Uniform bound of 44 for non-annular subsurfaces, 3 for specific cases.
We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be given for the diameter of the geodesic image. We also generalize the theorem for pro…
This study uses CNN-IOs to estimate MRI image reconstruction performance bounds.
problem Estimating task-based performance limits for MRI image reconstruction methods.
method Utilized stylized multi-coil SENSE MRI systems and deep-generated stochastic models to estimate IO performance.
result Estimation of IO performance provides guidance for designing under-sampled MRI systems.
New reweighted losses improve diffusion model training and image quality.
problem Training and improving diffusion models for image generation.
method Constructing a cascade of time-dependent variational lower bounds.
result Significant improvements in pixel-space image modeling quality.
Estimates convex hulls of smooth function images with error bounds.
problem Estimating the convex hull of the image of a smooth boundary set.
method Using submersion properties and sampling inputs, derive bounds on Hausdorff distance.
result New tighter and more general error bounds for geometric inference.
Extends L2-norm LDA to 2D inputs using Bhattacharyya bound.
problem L2-norm LDA loses useful image information for 2D inputs.
method 2DBLDA maximizes matrix-based between-class distance and minimizes within-class distance, optimizing Bhattacharyya error bound.
result 2DBLDA improves image recognition and face reconstruction.
Study on holomorphic isometries between complex domains, revealing geometric properties.
problem Characterizing holomorphic isometries between bounded symmetric domains.
method Analyzing holomorphic isometries between complex unit ball and other bounded symmetric domains, using classical results for complex-analytic subvarieties of Stein manifolds.
result Images of holomorphic isometries have specific geometric properties, including intersections with affine-linear subspaces.
Minimal surfaces can be mapped to 3D with bounded images.
problem Mapping minimal surfaces to 3D with bounded images.
method Analyzes various types of minimal immersions into R3 and complex manifolds. result Every surface contains a Cantor set allowing bounded conformal minimal immersions.
PAC-Bayesian method improves deep learning generalization in medical imaging.
problem Overfitting in deep networks for medical imaging datasets.
method PAC-Bayesian framework applied to large (stochastic) networks.
result PAC-Bayesian bounds are competitive and more explainable than simpler methods.
Localized curvature bounds ensure harmonic maps are constant.
problem Ensuring harmonic maps are constant under localized curvature constraints.
method Localized Bochner-type rigidity theorem for harmonic maps with image-dependent curvature bounds.
result Harmonic maps are constant if minimal Ricci curvature dominates image-dependent curvature bounds.
New method certifies images against transformations like rotations and translations.
problem Certifying robustness of images against transformations like rotations and translations.
method Randomized smoothing with three different kinds of defenses.
result Individual certificates can be obtained via statistical error bounds or efficient online inverse computation.
An ODE variational calculation shows that an image principle curvature ratio factor can raise the lower bound, 2(Image Area), on energy of a harmonic map of a surface into Rn. In certain situations, including all radially symmetry harmonic maps, equality is achieved.
As deep neural networks become more adept at traditional tasks, many of the most exciting new challenges concern multimodality---observations that combine diverse types, such as image and text. In this paper, we introduce a family of multimodal deep generative models derived from variational bounds on the evidence (dat…
This work proves intrinsic robustness bounds for natural image distributions.
problem Understanding the robustness of natural image distributions against adversarial attacks.
method Assumes natural image distributions are captured by conditional generative models and proves robustness bounds for classifiers.
result Shows a large gap between theoretical robustness limits and current state-of-the-art adversarial robustness.
We study the mean curvature flow of complete space-like submanifolds in pseudo-Euclidean space with bounded Gauss image, as well as that of complete submanifolds in Euclidean space with convex Gauss image. By using the confinable property of the Gauss image under the mean curvature flow we prove the long time existence…
The paper establishes lower bounds on Yang-Mills functionals for fibrations.
problem Analyzing the stability and nefness of direct image sheaves in fibrations.
method Generalizing mean curvature and Harder-Narasimhan filtrations to arbitrary polarized fibrations.
result Optimal lower bounds on fibered Yang-Mills functionals in terms of direct image sheaves.
We improve image perturbation defenses using a better-defined Wasserstein threat model.
problem Real-world image perturbations are not pixel-independent, unlike ℓp threat models. method We rectify flaws in the Wasserstein threat model and explore stronger attacks and defenses.
result Current Wasserstein-robust models are ineffective against real-world perturbations.
Uniform diameter bound for reflection group disk patterns.
problem Uniform bounded diameter conjecture for reflection groups.
method Skinning map analysis and discrete extremal width on Coxeter graph.
result Diameter of skinning image is bounded by a constant.
Paper tightens lower bounds on decentralized training complexity.
problem Understanding and optimizing iteration complexity in decentralized training.
method Proved a tight lower bound on iteration complexity and proposed DeTAG algorithm.
result DeTAG achieves the theoretical lower bound with only a logarithmic gap.
Revises a theorem by Thurston, finding a counter-example and a weaker version.
problem The bounded image theorem in Haken manifolds.
method Providing a counter-example and a weaker version of the second statement of Thurston's theorem.
result A counter-example and a weaker version of the second statement of Thurston's theorem are presented.
In the previous paper, the authors constructed a complete holomorphic immersion of the unit disk D into C^2 whose image is bounded. In this paper, we shall prove existence of complete holomorphic null immersions of Riemann surfaces with arbitrary genus and finite topology, whose image is bounded in C^2. To construct su…
The paper studies hyperbolic phenomena on closed surfaces using bicorn curves.
problem Understanding hyperbolic phenomena on curve graphs of closed surfaces.
method Using the theory of bicorn curves to analyze the curve graphs of closed surfaces.
result Proves that the curve graph of any closed surface is 15-hyperbolic with one exception.
We describe an approach for incorporating prior knowledge into machine learning algorithms. We aim at applications in physics and signal processing in which we know that certain operations must be embedded into the algorithm. Any operation that allows computation of a gradient or sub-gradient towards its inputs is suit…
Paper proposes an efficient method for bounding box annotation in object detection.
problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.
This work is motivated by the problem of image mis-registration in remote sensing and we are interested in determining the resulting loss in the accuracy of pattern classification. A statistical formulation is given where we propose to use data contamination to model and understand the phenomenon of image mis-registrat…
Study bounds VAR model's circuit complexity, showing it's limited to TC^0 circuits.
problem Understanding the limitations of the Visual AutoRegressive model.
method Established circuit complexity bounds for the VAR model.
result VAR model is equivalent to a TC^0 threshold circuit with hidden dimension ≤ O(n).
Researchers describe the Gromov boundary of a graph related to surfaces.
problem Understanding the Gromov boundary of a graph associated with surfaces.
method Described a dense subset of the Gromov boundary as geodesic laminations, proving the graph satisfies a bounded geodesic image theorem.
result The boundary is not compact.
Deep convolutional neural networks have recently achieved state-of-the-art performance on a number of image recognition benchmarks, including the ImageNet Large-Scale Visual Recognition Challenge (ILSVRC-2012). The winning model on the localization sub-task was a network that predicts a single bounding box and a confid…
Study improves confidence measures in medical imaging pipelines by addressing bias.
problem Bias in metric-based imaging pipelines compromises the efficiency of prediction intervals.
method Formalized symmetric and asymmetric CP formulations, analyzed bias effects, and validated empirically.
result Symmetric intervals are inflated by bias, while asymmetric intervals remain unaffected.
Triangulates surfaces with bounded energy using diffeomorphisms.
problem Triangulating surfaces with bounded Kolasinski--Menger energy.
method Uses bounded distortion diffeomorphisms of subsets of a plane.
result Triangulation with bounded number of triangles.
The paper analyzes and proposes an algorithm for multi-modal nonlinear embeddings with theoretical performance bounds.
problem Generalizability of multi-modal nonlinear embeddings to unseen data.
method Theoretical analysis and a multi-modal nonlinear representation learning algorithm motivated by performance bounds.
result The proposed algorithm yields promising performance in multi-modal image classification and cross-modal image-text retrieval applications.
The paper studies volumes of direct images for high tensor powers of ample bundles.
problem Understanding asymptotics of Monge-Ampère volumes for high tensor powers of ample line bundles.
method Analyzes the leading term of asymptotics and classifies bundles saturating a topological bound.
result Provides a characterization of bundles admitting projectively flat Hermitian structures in the case of high symmetric powers of ample vector bundles.
The paper evaluates and improves uncertainty estimates in neural networks for safety-critical applications.
problem Quantifying uncertainty in neural networks for safety-critical systems.
method Proposes a statistical test for evaluating uncertainty realism in neural networks and transfers a classification architecture to image-to-image tasks.
result The variational U-Net architecture significantly improves uncertainty realism in image-to-image tasks compared to a plain model.
Efficiently processes high res images by selecting relevant patches.
problem High memory and compute requirements for processing large images.
method Differentiable Top-K operator to select relevant patches.
result End-to-end trainable model using backpropagation.
In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or semi-Pfaffian cases, which depend only on the combinatoric data representing the objects…
New attack tricks certifiably robust models into mislabeling images.
problem Defeating certified defenses against adversarial examples.
method Spoofed robustness certificates and large perturbations.
result Certifiably robust models can be fooled by large perturbations.
Proposes a deep neural network approach for image response regression.
problem Associations between medical images and covariates.
method Spatially varying coefficient models with deep neural networks.
result Explicitly accounts for spatial smoothness and subject heterogeneity.
High-quality image synthesis with diffusion models, achieving state-of-the-art FID score.
problem Generating high-quality images from latent variables.
method Training diffusion probabilistic models with a weighted variational bound, inspired by denoising score matching and Langevin dynamics.
result State-of-the-art FID score of 3.17 on CIFAR10 dataset.
Study improves pollen detection in optical and holographic images using deep learning.
problem Improving pollen detection accuracy in holographic microscopy images.
method Used YOLOv8s for detection and MobileNetV3L for classification, addressing performance gaps through dataset expansion and automated labeling.
result Significant improvement in detection and classification performance on holographic images.
New method addresses error bounds for PnP-ULA under mismatched models.
problem Error bounds for PnP-ULA under mismatched measurement and prior models.
method Posterior-L2 pseudometric to quantify error bounds.
result Explicit error bound for PnP-ULA under mismatched posterior distribution.
The Generative Adversarial Network (GAN) has recently been applied to generate synthetic images from text. Despite significant advances, most current state-of-the-art algorithms are regular-grid region based; when attention is used, it is mainly applied between individual regular-grid regions and a word. These approach…
Convolutional neural networks converge quickly with gradient descent.
problem Learning efficient image classifiers with over-parameterized networks.
method Gradient descent for training over-parametrized CNNs with global average-pooling.
result Gradient descent quickly reduces the misclassification risk of CNNs.
Anomaly detection aims to recognize samples with anomalous and unusual patterns with respect to a set of normal data. This is significant for numerous domain applications, such as industrial inspection, medical imaging, and security enforcement. There are two key research challenges associated with existing anomaly det…
We obtain a gradient estimate for the Gauss maps from complete spacelike constant mean curvature hypersurfaces in Minkowski space into the hyperbolic space. As applications, we prove a Bernstein theorem which says that if the image of the Gauss map is bounded from one side, then the spacelike constant mean curvature hy…
Improved visual representation learning with conditional negative sampling.
problem Learning strong unsupervised visual representations using contrastive learning.
method Introduce a family of mutual information estimators that sample negatives conditionally.
result Improves accuracy by 2-5% points on four standard image datasets.
AI enhances pollen recognition in veterinary imaging using holographic microscopy.
problem Challenges in recognizing pollen in holographic images due to speckle noise and artifacts.
method Training YOLOv8s and MobileNetV3L on dual-modality dataset, employing WGAN-SN for synthetic data augmentation.
result GAN-based augmentation improves object detection and classification in holographic images, closing the performance gap.
Adaptive object detection method synthesizes target domain images from source domain images.
problem Large domain gap between source and target domains in object detection.
method Cross-domain CutMix with adversarial learning.
result Higher accuracy in different domain settings compared to conventional methods.