Anisotropic Interpolation of Sparse Generalized Image Samples

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Depleted Monolithic Active Pixel Sensor (DMAPS) sensors developed in the Tower Semiconductor 180 nm CMOS imaging process have been designed in the context of the ATLAS ITk upgrade Phase-II at the HL-LHC and for future collider experiments. The "MALTA-Czoch ...

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

Noise is an intrinsic part of any sensor and is present, in various degrees, in any content that has been captured in real life environments. In imaging applications, several pre- and post-processing solutions have been proposed to cope with noise in captu ...

Data imputation of incomplete image sequences is an essential prerequisite for analyzing and monitoring all development stages of plants in precision agriculture. For this purpose, we propose a conditional Wasserstein generative adversarial network TransGr ...

Machine learning has become the state of the art for the solution of the diverse inverse problems arising from computer vision and medical imaging, e.g. denoising, super-resolution, de-blurring, reconstruction from scanner data, quantitative magnetic reson ...

We consider a least-squares/relaxation finite element method for the numerical solution of the prescribed Jacobian equation. We look for its solution via a least-squares approach. We introduce a relaxation algorithm that decouples this least-squares proble ...

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

There has been a recent surge of interest in the study of asymptotic reconstruction performance in various cases of generalized linear estimation problems in the teacher-student setting, especially for the case of i.i.d standard normal matrices. Here, we g ...

We introduce HP, an implementation of density-functional perturbation theory, designed to compute Hubbard parameters (on-site U and inter-site V ) in the framework of DFT+U and DFT+U+V. The code does not require the use of computationally expensive superce ...

Representing and reconstructing 3D deformable shapes are two tightly linked problems that have long been studied within the computer vision field. Deformable shapes are truly ubiquitous in the real world, whether be it specific object classes such as human ...

Anisotropic Interpolation of Sparse Generalized Image Samples

Chat with Graph Search

MALTA-Cz: a radiation hard full-size monolithic CMOS sensor with small electrodes on high-resistivity Czochralski substrate

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

On combining denoising with learning-based image decoding

Time Dependent Image Generation of Plants from Incomplete Sequences with CNN-Transformer

Combining Model Driven and Data Driven Approaches for Inverse Problems in Parameter Estimation and Image Reconstruction: From Modelling to Validation

A Least-Squares Method for the Solution of the Non-smooth Prescribed Jacobian Equation

Leveraging topology, geometry, and symmetries for efficient Machine Learning

Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)

HP - A code for the calculation of Hubbard parameters using density-functional perturbation theory

Learning to Represent and Reconstruct 3D Deformable Objects