DNCF framework recovers real scenes from imperfect images robustly.
problem Recovering real scenes from imperfect images.
method Nonparametric deep network that learns physical image formation equations.
result DNCF framework robustly defends against adversarial attacks.
Photography method solves manifold invariants.
problem Constructing invariants of manifolds.
method General principle of photography, dealing with various data and data transmission.
result Dijkgraaf-Witten invariants are a specific application of the photography principle.
Paper develops techniques to create 3-manifold invariants.
problem Constructing non-trivial invariants of 3-manifolds.
method Photography principle and Ptolemy relation techniques.
result Direct implementation leads to a trivial invariant, highlighting difficulties.
This paper classifies typhoon damage features using aerial photography.
problem Typhoon damages and slow recovery times.
method Aerial photography for classification of eight classes including land covers and disaster areas.
result Visualize and explain typhoon disaster features using convolutional activation maps.
The use of computational methods to evaluate aesthetics in photography has gained interest in recent years due to the popularization of convolutional neural networks and the availability of new annotated datasets. Most studies in this area have focused on designing models that do not take into account individual prefer…
Study finds multiple solutions for Van der Waals-Cahn-Hilliard equation on manifolds.
problem Finding multiple solutions for a specific equation on manifolds.
method Combines Lusternik-Schnirelman and Morse theory with a photography method.
result Establishes multiplicity of solutions using topological invariants.
Study finds lower bounds for solutions on Riemannian orbifolds.
problem Finding solutions to nonlinear elliptic problems on Riemannian orbifolds.
method Employed the photography method to establish a lower bound.
result Lower bound for the number of solutions in terms of category.
Deep learning detects diabetic retinopathy stages from single fundus photos.
problem Early detection of diabetic retinopathy for treatment success.
method Convolutional neural networks (CNN) for automatic stage detection.
result Sensitivity and specificity of 0.99 on APTOS 2019 Blindness Detection Dataset.
We present and discuss several old and new methods for mapping a circular disc to a square. In particular, we present analytical expressions for mapping each point (u,v) inside the circular disc to a point (x,y) inside a square region. Ideally, we want the mapping to be smooth and invertible. In addition, we put emphas…
Recently, impressive denoising results have been achieved by Bayesian approaches which assume Gaussian models for the image patches. This improvement in performance can be attributed to the use of per-patch models. Unfortunately such an approach is particularly unstable for most inverse problems beyond denoising. In th…
In low light or short-exposure photography the image is often corrupted by noise. While longer exposure helps reduce the noise, it can produce blurry results due to the object and camera motion. The reconstruction of a noise-less image is an ill posed problem. Recent approaches for image denoising aim to predict kernel…
MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.
problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.
The paper solves pentagon equations using triangulations and edge transformations.
problem Solving pentagon equations with triangulations and edge transformations.
method General data and transformation rule method applied to triangulations.
result Recovery of initial data after transformations.
Improved CNN model accuracy and generalizability through data pre-processing.
problem Enhancing accuracy and generalizability of CNN-based LULC classification.
method Trials of different data preparation methods, including patch selection, size, and augmentations.
result Combining multiple grids and rotations of patches improved model accuracy and generalizability.
The problem of Poisson denoising appears in various imaging applications, such as low-light photography, medical imaging and microscopy. In cases of high SNR, several transformations exist so as to convert the Poisson noise into an additive i.i.d. Gaussian noise, for which many effective algorithms are available. Howev…
Survey on Allen-Cahn equations and systems, focusing on multiplicity results and geometric interpretation.
problem Multiplicity results for Allen-Cahn equations and systems in singular perturbation regime.
method Photography method, variational-topological approach based on localized approximate solutions and barycenter maps.
result Encoding of topology into multiplicity results through variational-topological approach.
Paper proposes a method to enhance low-quality retinal images using optimal transport.
problem Artifacts and imperfections in retinal images lead to diagnostic inaccuracies.
method Leveraging optimal transport theory, an unpaired image-to-image translation scheme is proposed.
result The method improves perceptually and quantitatively the quality of low-quality retinal images.
Automatic classification of trees using remotely sensed data has been a dream of many scientists and land use managers. Recently, Unmanned aerial vehicles (UAV) has been expected to be an easy-to-use, cost-effective tool for remote sensing of forests, and deep learning has attracted attention for its ability concerning…
Fluorescence microscopy has enabled a dramatic development in modern biology. Due to its inherently weak signal, fluorescence microscopy is not only much noisier than photography, but also presented with Poisson-Gaussian noise where Poisson noise, or shot noise, is the dominating noise source. To get clean fluorescence…
Proves existence of multiple solutions to a multiphasic equation on manifolds.
problem Existence of multiple solutions to a multiphasic equation with a small volume constraint.
method Lusternik-Schnirelmann and infinite-dimensional Morse theories, combined with isoperimetric theory and transversality theorem.
result Lower bound for the number of solutions depending on topological invariants.
OTRE uses OT to improve retinal images, outperforming existing methods.
problem Improving quality of non-mydriatic retinal images for accurate diagnoses.
method OT theory for image-to-image translation, regularization by enhancing.
result OTRE outperforms state-of-the-art methods on various retinal image tasks.
Neural networks have proven their capabilities by outperforming many other approaches on regression or classification tasks on various kinds of data. Other astonishing results have been achieved using neural nets as data generators, especially in settings of generative adversarial networks (GANs). One special applicati…
Deep learning has been successfully applied to a variety of image classification tasks. There has been keen interest to apply deep learning in the medical domain, particularly specialties that heavily utilize imaging, such as ophthalmology. One issue that may hinder application of deep learning to the medical domain is…
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
The paper analyzes the pricing of a new compute futures asset.
problem Uncertainty in AI adoption and pricing of compute capital.
method An asset-pricing framework for compute futures, including synthetic futures pricing.
result Preliminary evidence suggests a positive compute risk premium.
Quantum computing offers energy savings over classical computing.
problem Energy efficiency in computing services.
method Cournot competition model constrained by energy usage.
result Quantum computing firms can outperform classical counterparts in energy efficiency.
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
This work makes neural sequence models more efficient by controlling computation.
problem Fixed compute for all examples in neural networks.
method Conditional computation to adapt compute to example complexity.
result Conditional Computation Transformer (CCT) improves efficiency and performance.
Defines computable learning for binary classification over metric spaces.
problem Defines computable PAC learning for binary classification over computable metric spaces.
method Provides sufficient conditions for ERM learners to be computable and bounds the strong Weihrauch degree of an ERM learner.
result Gives a hypothesis class that does not admit any proper computable PAC learner with computable sample function.
Automatic computation speeds up crosscap number calculation for alternating knots.
problem Computing crosscap numbers for alternating knots efficiently.
method Introduced an automatic computation with complexity O(E3). result Crosscap numbers of alternating knots can be computed in O(E3) time. TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.
problem Modeling computation in a single step.
method Established Topological Kleene Field Theory (TKFT) as a new model of computation.
result Any computable function can be simulated in a single go of a dynamical system.
Stochastic reservoir computing is shown to be a universal approximator.
problem Theoretical justification for using stochastic reservoirs in machine learning.
method Investigated stochastic reservoir computing using probabilities of reservoir states as readout.
result Stochastic reservoir computers are universal approximating classes.
Machine learning impacts computational math, offering new functions approximations.
problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.
Coded computation techniques provide robustness against straggling servers in distributed computing, with the following limitations: First, they increase decoding complexity. Second, they ignore computations carried out by straggling servers; and they are typically designed to recover the full gradient, and thus, canno…
Method for computing Khovanov homology of tangles.
problem Limited explicit computational studies of Khovanov homology for tangles.
method Arc reduction approach to compute Khovanov homology.
result Derived and computed Poincaré polynomials for simple and complex tangles.
With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of…
This paper simplifies computing higher-order U-statistics efficiently.
problem The inefficiency of computing higher-order U-statistics in practice. method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute U-statistics. Quantum reservoir computing tackles noisy quantum computers for temporal tasks.
problem Efficiently process input sequences on noisy quantum computers.
method Quantum reservoir computing using dissipative quantum dynamics.
result Small and noisy quantum reservoirs can handle high-order nonlinear temporal tasks.
Survey on computational models in dynamical systems, including new universality concepts.
problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.
Computations for prime knots up to 11 crossings.
problem Computing HOMFLY homology for prime knots.
method Direct computations for all prime knots up to 11 crossings.
result HOMFLY homology determined for all prime knots up to 11 crossings.
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
New methods improve Reservoir Computing for chaotic time series prediction.
problem Chaotic time series prediction in Reservoir Computing.
method Established Recurrent Kernel limit, introduced Structured Reservoir Computing.
result Structured Reservoir Computing is faster and more memory-efficient.
Quantum computing promises faster bioinformatics, but challenges remain.
problem Efficient bioinformatics processing and drug discovery.
method Quantum algorithms for optimization, simulation, and machine learning.
result Quantum computing can significantly speed up bioinformatics tasks.
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the com…
Quantum computing promises new financial modeling.
problem Traditional financial modeling limitations.
method Overview of quantum computing applications in finance.
result Quantum computing can enhance financial modeling.
We look into computational aspects of two classical knot invariants. We look for ways of simplifying the computation of the coloring invariant and of the Alexander module. We support our ideas with explicit computations on pretzel knots.
Study error bounds in evaluating distributional computational graphs.
problem Error analysis in evaluating graphs with inputs as probability distributions.
method Establish non-asymptotic error bounds using Wasserstein-1 distance.
result Non-asymptotic error bounds for discretization errors in distributional computational graphs.