Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ronan Kerviche

dblp:158/9312 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorArtificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 87% Computational photography and imaging · 13%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.212016
ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements · CVPR 2016
Image and video processing › image reconstruction › regularized reconstruction
compressive sensing reconstruction
0.212016
ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements · CVPR 2016
Image and video processing
image reconstruction
0.212016
ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements · CVPR 2016
Computational photography and imaging › computational optics
single-pixel imaging
0.112016
ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements · CVPR 2016

Methods — techniques the papers use, named apart from their topics

denoiser · 0.5convolutional neural network · 0.5
YearPublicationVenuePosition
2017 Fundamental limit of resolving two point sources limited by an arbitrary point spread function
abstract
Estimating the angular separation between two incoherently radiating monochromatic point sources is a canonical toy problem to quantify spatial resolution in imaging. In recent work, Tsang et al. showed, using a Fisher Information analysis, that Rayleigh's resolution limit is just an artifact of the conventional wisdom of intensity measurement in the image plane. They showed that the optimal sensitivity of estimating the angle is only a function of the total photons collected during the camera's integration time but entirely independent of the angular separation itself no matter how small it is, and found the information-optimal mode basis, intensity detection in which achieves the aforesaid performance. We extend the above analysis, which was done for a Gaussian point spread function (PSF) to a hard-aperture pupil proving the information optimality of image-plane sinc-Bessel modes, and generalize the result further to an arbitrary PSF. We obtain new counterintuitive insights on energy vs. information content in spatial modes, and extend the Fisher Information analysis to exact calculations of minimum mean squared error, both for Gaussian and hard aperture pupils.
Ronan Kerviche, Amit Ashok
ISIT1
2016 ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements
abstract
The goal of this paper is to present a non-iterative and more importantly an extremely fast algorithm to reconstruct images from compressively sensed (CS) random measurements. To this end, we propose a novel convolutional neural network (CNN) architecture which takes in CS measurements of an image as input and outputs an intermediate reconstruction. We call this network, ReconNet. The intermediate reconstruction is fed into an off-the-shelf denoiser to obtain the final reconstructed image. On a standard dataset of images we show significant improvements in reconstruction results (both in terms of PSNR and time complexity) over state-of-the-art iterative CS reconstruction algorithms at various measurement rates. Further, through qualitative experiments on real data collected using our block single pixel camera (SPC), we show that our network is highly robust to sensor noise and can recover visually better quality images than competitive algorithms at extremely low sensing rates of 0.1 and 0.04. To demonstrate that our algorithm can recover semantically informative images even at a low measurement rate of 0.01, we present a very robust proof of concept real-time visual tracking application.
Kuldeep Kulkarni, Suhas Lohit, Pavan Turaga, Ronan Kerviche, Amit Ashok
CVPR4
2014 Information optimal scalable compressive imager demonstrator
abstract
We present a compressive imager demonstrator based on a scalable, parallel architecture. It primarily utilizes information-optimal projections and a Piece-wise Linear Minimum Mean Square Error Estimator (PLE-MMSE) combined with a block-based statistical model of natural images. Such system delivers high-resolution images from low resolution sensor with near real-time snapshots. This testbed provides a highly programmable compressive imager that allows testing of a variety of projection designs for different tasks (e.g. random binary, PCA) and also enables adaptive or dynamic designs.
Ronan Kerviche, Amit Ashok
ICIP1