The paper studies maps in the Heisenberg group and their images, called Rickman rugs.
problem Understanding maps and their images in the Heisenberg group.
method Analyzes maps f:WoH, where H is the first Heisenberg group and W is a vertical subgroup. result Rickman rugs in the Heisenberg group admit a corona decomposition by intrinsic bilipschitz graphs.
A geometric account explains why 'The Dress' is ambiguous, predicting observable signatures in image processing.
problem Understanding and predicting ambiguity in image processing, particularly in intrinsic image decomposition.
method Geometric analysis of intrinsic image decomposition, focusing on the discontinuous switch in prior-mode sections.
result Predicted signatures in albedo Jacobian and Fernet curvature can be observed in various models and datasets.
Unified tensor model disentangles object appearance factors.
problem Representing hierarchical intrinsic and extrinsic causal factors of object appearance.
method Compositional hierarchical tensor factorization.
result Interpretable object representation robust to occlusion and reduced training data requirements.
This paper proposes a subspace decomposition method based on an over-complete dictionary in sparse representation, called "Sparse Signal Subspace Decomposition" (or 3SD) method. This method makes use of a novel criterion based on the occurrence frequency of atoms of the dictionary over the data set. This criterion, wel…
Develops PRPCA for smooth image recovery combining low-rank and smoothness.
problem Image matrix recovery under low-rank and smoothness assumptions.
method Projected Robust PCA (PRPCA) framework combining low-rank and smoothness.
result Explicit statistical guarantees for PRPCA, reducing matrix dimensionality.
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.
This paper addresses the following questions pertaining to the intrinsic dimensionality of any given image representation: (i) estimate its intrinsic dimensionality, (ii) develop a deep neural network based non-linear mapping, dubbed DeepMDS, that transforms the ambient representation to the minimal intrinsic space, an…
Develops intrinsic curved cosets for Cartan geometries.
problem Defines curved cosets for arbitrary Cartan geometries.
method Defines intrinsic holonomy group and curved cosets.
result Curved cosets retain characteristics of homogeneous counterparts and behave well under automorphisms.
The paper explores how neural networks generalize differently from natural and medical images.
problem Discrepancies in generalization error between natural and medical images.
method Established and empirically validated a generalization scaling law with respect to intrinsic dataset properties.
result Higher intrinsic 'label sharpness' of medical images leads to higher adversarial vulnerability.
New stratification reveals intrinsic singularity types of orbit spaces.
problem Understanding the intrinsic structure of orbit spaces under Lie group actions.
method Introduced the isostabilizer decomposition and established a map to Klein strata.
result A new canonical stratification on the manifold clarifies the relationship with classical structures.
Low-dimensional structure in images helps deep learning models generalize better.
problem Understanding the intrinsic dimensionality of images for better model performance.
method Applied dimension estimation tools to popular image datasets and used GANs to manipulate intrinsic dimensionality.
result Natural image datasets have very low intrinsic dimensionality, which aids neural networks in learning and generalizing.
We provide the proof that the space of time series data is a Kolmogorov space with T0-separation axiom using the loop space of time series data. In our approach we define a cyclic coordinate of intrinsic time scale of time series data after empirical mode decomposition. A spinor field of time series data comes fro…
A method uses ITD and XGBoost for precise power transformer fault diagnosis.
problem Fault diagnosis of power transformers using DGA data.
method Ranking DGA parameters by skewness, extracting ITD features, and using an XGBoost classifier.
result The method achieves over 95% accuracy in classification.
Synthetic images rendered by graphics engines are a promising source for training deep networks. However, it is challenging to ensure that they can help train a network to perform well on real images, because a graphics-based generation pipeline requires numerous design decisions such as the selection of 3D shapes and …
Dual energy computed tomography (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Image-domain decomposition operates directly on CT images using linear matrix inversion, but the decomposed material images can be severely degraded by noise and artifact…
Several intrinsic topological ways to encode connections on vector bundles on smooth complex algebraic curves will be described. In particular the notion of {\em Stokes decompositions} will be formalised, as a convenient intermediate category between the Stokes filtrations and the Stokes local systems/wild monodromy re…
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.
CNNs trained by gradient descent can learn intrinsic image rank robustly to background noises.
problem Understanding the intrinsic dimension of data in over-parameterized CNNs.
method Theoretical analysis and experiments on synthetic and real datasets.
result CNNs trained by gradient descent can learn the intrinsic dimension of clean images robustly to background noises.
The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.
problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.
Study reveals differences in medical image models' hidden representation refinement.
problem Understanding how intrinsic dimensionality changes in neural network hidden representations across different domains.
method Analysis of 11 natural and medical image datasets using 6 network architectures.
result Medical image models refine hidden representations earlier, suggesting differences in feature abstraction.
SRMD uses random features for efficient time-frequency analysis.
problem Efficiently analyzing time-series data with low computational cost.
method Sparse Random Mode Decomposition (SRMD) constructs a sparse approximation to the spectrogram.
result SRMD outperforms other methods in signal representation, outlier removal, and mode decomposition.
Axis-aligned subspace clustering generally entails searching through enormous numbers of subspaces (feature combinations) and evaluation of cluster quality within each subspace. In this paper, we tackle the problem of identifying subsets of features with the most significant contribution to the formation of the local n…
Paper proposes ONTD for nonnegative tensor data.
problem Handling nonnegative tensor data efficiently.
method Orthogonal Nonnegative Tucker Decomposition (ONTD) with convex relaxation algorithm.
result Demonstrates effectiveness on real-world image data applications.
We show how the tangent bundle decomposition generated by a system of ordinary differential equations may be generalized to the case of a system of second order PDEs `of connection type'. Whereas for ODEs the decomposition is intrinsic, for PDEs it is necessary to specify a closed 1-form on the manifold of independent …
Data living on manifolds commonly appear in many applications. Often this results from an inherently latent low-dimensional system being observed through higher dimensional measurements. We show that under certain conditions, it is possible to construct an intrinsic and isometric data representation, which respects an …
We study the decomposition of the Riemannian curvature R tensor of an almost quaternion-Hermitian manifold under the action of its structure group Sp(n)Sp(1). Using the minimal connection, we show that most components are determined by the intrinsic torsion ξand its covariant derivative \widetilde\nablaξand determine r…
PFDL improves deep learning models' OOD generalization by decorrelating feature embeddings.
problem Out-of-distribution generalization in deep learning models.
method PFDL algorithm that optimizes feature decomposition network and image classification model.
result PFDL improves the accuracy of image classification models on OOD datasets.
Two new minor minimal intrinsically chiral graphs identified.
problem Identifying intrinsically chiral graphs in molecular structures.
method Analyzing graph symmetry and embedding properties.
result Found two new minor minimal intrinsically chiral graphs Γ7 and Γ8. Deep generative models have shown promising results in generating realistic images, but it is still non-trivial to generate images with complicated structures. The main reason is that most of the current generative models fail to explore the structures in the images including spatial layout and semantic relations betwe…
TensorShield defends images from adversarial attacks using tensor decomposition.
problem Adversarial attacks on images can fool deep neural networks.
method Tensor decomposition to find low-rank approximations of images, reducing high-frequency perturbations.
result TensorShield outperforms existing methods like SLQ by 14% against FGSM attacks.
Study shows bottlenecks improve image segmentation quality.
problem Robust object discovery in real-world images remains challenging.
method Empirical investigation of reconstruction bottlenecks in GENESIS model.
result Reconstruction bottlenecks determine reconstruction and segmentation quality.
Paper proposes TBSD for efficient anomaly detection in textured images.
problem Challenges in anomaly detection for textured images, especially in manufacturing systems.
method Texture basis integrated smooth decomposition (TBSD) approach.
result TBSD surpasses benchmarks with less misidentification and superior performance.
Study shows dataset properties impact adversarial machine learning robustness.
problem Vulnerability of DNNs to adversarial attacks.
method Examined five datasets, analyzed input size and contrast effects.
result Input size and contrast significantly influence adversarial success.
We extend cell decomposition to moduli space of convex projective structures.
problem Cell decomposition of moduli space of convex projective structures.
method Use Fock and Goncharov's A-coordinates and edge-flipping algorithm. result Holonomy groups are semi-arithmetic in many cases.
Paper proposes using DMD for feature extraction in image classification.
problem Lack of labelled data for machine learning.
method Dynamic Mode Decomposition (DMD) for feature extraction.
result DMD features with RKS give competitive results.
Enhances Koopman operator estimation with intrinsic observables in RKHS.
problem Accurate estimation of Koopman operator and its spectrum.
method Jet Extended Dynamic Mode Decomposition (JetEDMD) leveraging RKHS jets.
result Proves JetEDMD's superiority with error bounds and convergence rate.
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictionary, is learned to adapt to specific data. This approach has proven to be very effective in many image processing tasks. Traditionally, the di…
We describe a natural decomposition of a normal complex surface singularity (X,0) into its "thick" and "thin" parts. The former is essentially metrically conical, while the latter shrinks rapidly in thickness as it approaches the origin. The thin part is empty if and only if the singularity is metrically conical; the…
This work improves tensor decomposition methods, especially for large datasets.
problem Lack of efficient methods for estimating Tucker decompositions.
method Applies Johnson-Lindenstrauss type guarantees to Tucker decompositions with random embeddings.
result Effective dimension reduction with minimal error for large tensors.
Introduces intrinsically Lipschitz graphs in metric spaces.
problem Graphs in metric spaces with Lipschitz conditions.
method Focuses on quotient maps and intrinsically Lipschitz sections.
result Compactness, Ahlfors regularity, and extension theorems.
Algorithm D4 decomposes data into useful and orthogonal components.
problem Data representation and task-specific information.
method Decision-Directed Data Decomposition (D4) algorithm.
result Improves predictive generalization and debiasing in word embeddings.
To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary. A new formulation of sparse coding is proposed which enables high dimensional tensors dictiona…
Transverse one dimensional foliations play an important role in the study of codimension one foliations. In \cite{KR2}, the authors introduced the notion of flow box decomposition of a 3-manifold M. This is a decomposition of M that reflects both the structure of a given codimension one foliation and that of a give…
We solve the ANOVA decomposition for categorical inputs.
problem Lack of a closed-form expression for ANOVA decomposition with categorical dependent variables.
method Bridge functional analysis with discrete Fourier analysis to derive a closed-form decomposition.
result Closed-form decomposition for categorical inputs without assumptions.
The paper improves the probability flow ODE sampler for faster sampling of natural images.
problem Improving the convergence rate of the probability flow ODE sampler.
method Adapting the probability flow ODE sampler to exploit intrinsic low-dimensional structures in natural image data.
result Achieves a dimension-free convergence rate of O(k/T) in total variation distance, improving upon existing results. Proposes eDNNs and iDNNs for deep learning on manifolds.
problem Deep learning on manifolds with geometric preservation and intrinsic geometry incorporation.
method Intrinsic and extrinsic deep neural networks (iDNNs and eDNNs) with geometric embeddings and maps.
result Empirical risk minimizers of eDNNs and iDNNs converge optimally.
New method uses SVD entropy to price artworks.
problem Lack of fine measurements in traditional art pricing models.
method SVD entropy of painting images for content measurement.
result SVD entropy positively affects sales price at 1% significance level.
We study the foliation space of complex and invariant (by torsion of intrinsic Hermitian connection) umbilic distribution on an isometric immersion from a nearly Kähler manifold M into the Euclidean space. Under suitable conditions this leaf space is nearly Kähler and M can be decomposed into a product of this leaf…