Fast and accurate MRI image reconstruction from undersampled data is crucial in clinical practice. Deep learning based reconstruction methods have shown promising advances in recent years. However, recovering fine details from undersampled data is still challenging. In this paper, we introduce a novel deep learning bas…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “reconstruction module”
In the previous paper, the author defined equivariant Floer cohomology for a complete intersection in a toric variety and showed that it is isomorphic to the small quantum D-module after a mirror transformation when the first Chern class c_1(M) of the tangent bundle is nef. In this paper, even when c_1(M) is not nef, w…
Obtaining accurate and reliable images from low-dose computed tomography (CT) is challenging. Regression convolutional neural network (CNN) models that are learned from training data are increasingly gaining attention in low-dose CT reconstruction. This paper modifies the architecture of an iterative regression CNN, BC…
Geometric Approaches to Increase the Expressivity of Deep Neural Networks for MR Reconstructioncs.CV
Enhances deep neural networks for MRI reconstruction by increasing expressivity.
problem Balancing network complexity and performance in deep learning MRI reconstruction.
method Geometric approach using bootstrapping and subnetwork aggregation with attention module.
result Significant improvement in MRI reconstruction performance with minimal complexity increase.
Paper constructs observables using multisymplectic geometry and algebraic methods.
problem Building observables in multisymplectic geometry.
method Uses -algebras, Gerstenhaber algebras, BV-modules, and constraint triples.
result Reconstructs and explains recent geometric results.
Suitable lateral connections between encoder and decoder are shown to allow higher layers of a denoising autoencoder (dAE) to focus on invariant representations. In regular autoencoders, detailed information needs to be carried through the highest layers but lateral connections from encoder to decoder relieve this pres…
End-to-end deep metric learning tackles multi-label image classification.
problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.
Enhanced X-ray polarimetry with deep learning for better exposure times.
problem Improving sensitivity of X-ray telescopic observations with imaging polarimeters.
method A weighted maximum likelihood combination of predictions from a deep ensemble of ResNet convolutional neural networks trained on Monte Carlo event simulations.
result Improves effective exposure times by ~45% for power-law source spectra.
Network structures in various backgrounds play important roles in social, technological, and biological systems. However, the observable network structures in real cases are often incomplete or unavailable due to measurement errors or private protection issues. Therefore, inferring the complete network structure is use…
LAGE is a systematic framework developed in Java. The motivation of LAGE is to provide a scalable and parallel solution to reconstruct Gene Regulatory Networks (GRNs) from continuous gene expression data for very large amount of genes. The basic idea of our framework is motivated by the philosophy of divideand-conquer.…
This paper proposes an alternative to E2E training for deep networks, reducing memory footprint.
problem High GPUs memory footprint in end-to-end training of deep networks.
method Locally supervised learning with information propagation loss to avoid information collapse.
result The proposed method achieves competitive performance with less than 40% memory footprint compared to E2E training.
Recent years have witnessed growing interest in machine learning-based models and techniques for low-dose X-ray CT (LDCT) imaging tasks. The methods can typically be categorized into supervised learning methods and unsupervised or model-based learning methods. Supervised learning methods have recently shown success in …
In this work, a deep learning-based quantization scheme for log-likelihood ratio (L-value) storage is introduced. We analyze the dependency between the average magnitude of different L-values from the same quadrature amplitude modulation (QAM) symbol and show they follow a consistent ordering. Based on this we design a…
New algorithm improves sparse-view tomography without needing ground-truth data.
problem Poor image reconstructions with sparse projections and non-uniform sensors.
method Unsupervised deep learning with CNN and STN modules.
result Significantly outperforms filtered backprojection in sparse-view scenarios.
In this paper, we present a novel unsupervised feature learning architecture, which consists of a multi-clustering integration module and a variant of RBM termed multi-clustering integration RBM (MIRBM). In the multi-clustering integration module, we apply three unsupervised K-means, affinity propagation and spectral c…
Designs CNNs for better image reconstruction.
problem Image reconstruction from limited data.
method Parseval convolution operators and chaining of elementary modules.
result CNN-based algorithm yields better results than sparsity-based methods.
LargeMvC-Net improves scalability of multi-view clustering.
problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.
Inference of space-time varying signals on graphs emerges naturally in a plethora of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes, given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel…
We introduce a novel approach for predicting the progression of adolescent idiopathic scoliosis from 3D spine models reconstructed from biplanar X-ray images. Recent progress in machine learning have allowed to improve classification and prognosis rates, but lack a probabilistic framework to measure uncertainty in the …
A new method for feature fusion in U-Net decoders using difference-based gating.
problem Precise fusion of high-level semantics and low-level details in U-Net decoder reconstruction.
method Proposes two difference-based gating approaches: Feature-difference gating (FDG) and Entropy-difference gating (EDG).
result Both FDG and EDG methods outperform existing attention-based fusion methods, with EDG showing superior performance.
Tree-AMP simplifies inference in complex tree-structured models.
problem Inference in high-dimensional tree-structured models.
method Approximate Message Passing algorithms for various machine learning tasks.
result Theoretical performance predictions and automated entropy estimation.
We propose rectified factor networks (RFNs) to efficiently construct very sparse, non-linear, high-dimensional representations of the input. RFN models identify rare and small events in the input, have a low interference between code units, have a small reconstruction error, and explain the data covariance structure. R…
To improve the compressive sensing MRI (CS-MRI) approaches in terms of fine structure loss under high acceleration factors, we have proposed an iterative feature refinement model (IFR-CS), equipped with fixed transforms, to restore the meaningful structures and details. Nevertheless, the proposed IFR-CS still has some …
MoDeGPT compresses large language models without accuracy loss, saving 98% compute costs.
problem Compression of large language models for resource-constrained devices.
method Structured compression framework using modular decomposition and matrix pair reduction.
result MoDeGPT achieves 90-95% zero-shot performance with 25-30% compression rates.
Embeds skein algebras into quantum tori using Dehn-Thurston coordinates.
problem Studying representations of Kauffman bracket skein algebras at roots of unity.
method Using the action of the skein algebra on the skein module of the handlebody.
result Explicit reconstruction of unique representation with fixed classical shadow.
GeoFunFlow: Geometric Function Flow Matching for Inverse Operator Learning over Complex Geometriescs.LG
GeoFunFlow tackles inverse problems on complex geometries with efficient learning.
problem Challenges in inverse problems governed by PDEs, especially on irregular geometries.
method Combines geometric function autoencoder and latent diffusion model trained via rectified flow.
result Achieves state-of-the-art reconstruction accuracy and efficient inference.
Nesting behind -invariantsmath.RT
Proposes categorification of Z-invariants for specific 3-manifolds.
problem Categorification of Z-invariants for negative definite plumbed 3-manifolds.
method Abelian categorification using 3d N=2 theory and log VOAs.
result Nested Weyl-type character formulas reconstruct -invariants.
Maximizing Mutual Information Across Feature and Topology Views for Learning Graph Representationscs.LG
A novel method integrates feature and topology views for unsupervised graph representation learning.
problem Lack of mutual information across feature and topology views in graph representation learning.
method Proposes a multi-view representation learning module and a common representation learning module using mutual information maximization and reconstruction loss minimization.
result Demonstrates effectiveness in integrating feature and topology views, achieving comparable or better performance than supervised methods.
We present a machine learning-based approach to lossy image compression which outperforms all existing codecs, while running in real-time. Our algorithm typically produces files 2.5 times smaller than JPEG and JPEG 2000, 2 times smaller than WebP, and 1.7 times smaller than BPG on datasets of generic images across all …
Both the Dictionary Learning (DL) and Convolutional Neural Networks (CNN) are powerful image representation learning systems based on different mechanisms and principles, however whether we can seamlessly integrate them to improve the per-formance is noteworthy exploring. To address this issue, we propose a novel gener…
A-DLISTA and VLISTA learn dictionaries and sparse representations under varying sensing matrices.
problem Learning dictionaries and sparse representations under varying sensing matrices.
method Augmented Dictionary Learning ISTA (A-DLISTA) and Variational Learning ISTA (VLISTA).
result VLISTA provides a probabilistic way to jointly learn the dictionary distribution and the reconstruction algorithm.
Classifies modules of surface-knots in terms of their properties.
problem Characterizing modules of surface-knots in terms of their properties.
method Using homology and covering spaces, the reduced first module is characterized.
result The reduced first module for every genus g is characterized in terms of properties of a finitely generated module.
Proves finiteness and holonomicity of skein modules for 3-manifolds.
problem Finiteness and holonomicity of skein modules for 3-manifolds.
method Defining skein transfer bimodules and using q-analogues of D-module theory.
result Internal skein modules are holonomic modules over the internal skein algebra of the boundary.
Defines super projective modules and explores their properties.
problem Exploring the geometric-algebraic link in super geometry.
method Defined and explored super projective modules over supersmooth functions.
result Module of vector fields over a supersphere is a super projective module.
Detect knots from photos using machine learning and traditional algorithms.
problem Automatically recognize knots from images.
method Combining CNN and transformer architectures for image recognition with traditional knot invariants.
result Lightweight machine learning models can recover meaningful structural information from images.
Higher Skein Modulesmath.GT
We introduce higher skein modules of links generalizing the Conway skein module. We show that these modules are closely connected to the HOMFLY polynomial.
A new method to derive presentations of skein modules is developed. For the case of homotopy skein modules it will be shown how the topology of a 3-manifold is reflected in the structure of the module. The freeness problem for q-homotopy skein modules is solved, and a natural skein module related to linking numbers is …
In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …
Neural Module Networks, originally proposed for the task of visual question answering, are a class of neural network architectures that involve human-specified neural modules, each designed for a specific form of reasoning. In current formulations of such networks only the parameters of the neural modules and/or the or…
Paper compares skein modules to Kauffman bracket modules.
problem Comparing skein modules to Kauffman bracket modules.
method Using skein relations and Reshetikhin-Turaev model.
result Resolved the problem of comparing skein modules to Kauffman bracket modules.
Skein modules are the main objects of an algebraic topology based on knots (or position). In the same spirit as Leibniz we would call our approach "algebra situs." When looking at the panorama of skein modules we see, past the rolling hills of homologies and homotopies, distant mountains - the Kauffman bracket skein mo…
Generalized Steinberg module presentation for Gaussian and Eisenstein integers.
problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.
Enhanced Alexander module detects linking numbers in links.
problem Detecting linking numbers in links using Alexander modules.
method Defining and singling out meridians and longitudes in reduced Alexander modules.
result The enhanced Alexander module determines all linking numbers.
Nonabelian bundle 2-gerbesmath.DG
We define 2-crossed module bundle 2-gerbes related to general Lie 2-crossed modules and discuss their properties. A 2-crossed module bundle 2-gerbe over a manifold is defined in terms of a so called 2-crossed module bundle gerbe, which is a crossed module bundle gerbe equipped with an extra sructure. It is shown that s…
Combinatorial approach to compute satellite knot invariants using graph theory.
problem Computing knot invariants for satellite knots using bordered Heegaard Floer homology.
method Construct weighted -modules using decorated planar graphs and prove their isomorphism.
result Combinatorial proof of structure relations for the constructed modules.
New sl(2) action defined on a mathematical module.
problem No specific problem stated; focuses on mathematical construction.
method Construction of sl(2)-action on equivariant skein lasagna module.
result Infinitesimal sl(2)-symmetries constructed.
Admissible Skein Modulesmath.GT
Introduces admissible skein modules for non-semisimple categories.
problem No specific problem stated; generalization of Kauffman skein algebra.
method Introduces admissible skein modules associated to ideals in pivotal categories.
result These modules generalize Kauffman skein algebra and relate to quantum invariants.
Studies modules over a category of Jacobi diagrams in handlebodies.
problem Understanding modules over a specific category of Jacobi diagrams.
method Generalizes adjunctions and studies subquotient modules.
result Generalizes adjunctions between modules and Casimir Lie algebra modules.