Demo Data from EDBT 2026 / reviewers in the wild / expert
Parikshit Sakurikar
dblp:39/11103
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2019
0000-0002-9523-5640ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 6 · 4 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1
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.
| Artificial intelligence
2 papers |
3D vision · 72% Generative modeling · 28% | |
| Computer graphics and multimedia
1 paper |
Computational photography and imaging · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › generative adversarial network
image-to-image translation |
0.3 | 1 | 2018 | RefocusGAN: Scene Refocusing Using a Single Image · ECCV (4) 2018 |
Computational photography and imaging › light field imaging
refocusing |
0.3 | 1 | 2018 | RefocusGAN: Scene Refocusing Using a Single Image · ECCV (4) 2018 |
Computer vision › 3D vision
depth estimation |
0.3 | 1 | 2017 | Composite Focus Measure for High Quality Depth Maps · ICCV 2017 |
Computer vision › 3D vision › depth estimation › focus-based depth estimation
depth from focus |
0.3 | 1 | 2017 | Composite Focus Measure for High Quality Depth Maps · ICCV 2017 |
Computer vision › 3D vision › depth estimation
depth map refinement |
0.3 | 1 | 2017 | Composite Focus Measure for High Quality Depth Maps · ICCV 2017 |
Methods — techniques the papers use, named apart from their topics
GAN · 0.7focus measure · 0.3cost-volume propagation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Defocus Magnification Using Conditional Adversarial NetworksabstractDefocus magnification is the process of rendering a shallow depth-of-field in an image captured using a camera with a narrow aperture. Defocus magnification is a useful tool in photography for emphasis on the subject and for highlighting background bokeh. Estimating the per-pixel blur kernel or the depth-map of the scene followed by spatially-varying re-blurring is the standard approach to defocus magnification. We propose a single-step approach that directly converts a narrow-aperture image to a wide-aperture image. We use a conditional adversarial network trained on multi-aperture images created from light-fields. We use a novel loss term based on a composite focus measure to improve generalization and show high quality defocus magnification. Parikshit Sakurikar, Ishit Mehta, P. J. Narayanan |
WACV | 1 |
| 2018 | Structured Adversarial Training for Unsupervised Monocular Depth EstimationabstractThe problem of estimating scene-depth from a single image has seen great progress lately. Recent unsupervised methods are based on view-synthesis and learn depth by minimizing photometric reconstruction error. In this paper, we introduce Structured Adversarial Training (StrAT) to this problem. We generate multiple novel views using depth (or disparity), with the stereo-baseline changing in an increasing order. Adversarial training that goes from easy examples to harder ones produces richer losses and better models. The impact of StrAT is shown to exceed traditional data augmentation using random new views. The combination of an adversarial framework, multiview learning, and structured adversarial training produces state-of-the-art performance on unsupervised depth estimation for monocular images. The StrAT framework can benefit several problems that use adversarial training. Ishit Mehta, Parikshit Sakurikar, P. J. Narayanan |
3DV | 2 |
| 2018 | RefocusGAN: Scene Refocusing Using a Single Image
Parikshit Sakurikar, Ishit Mehta, Vineeth N. Balasubramanian, P. J. Narayanan |
ECCV (4) | 1 |
| 2017 | Composite Focus Measure for High Quality Depth MapsabstractDepth from focus is a highly accessible method to estimate the 3D structure of everyday scenes. Today's DSLR and mobile cameras facilitate the easy capture of multiple focused images of a scene. Focus measures (FMs) that estimate the amount of focus at each pixel form the basis of depth-from-focus methods. Several FMs have been proposed in the past and new ones will emerge in the future, each with their own strengths. We estimate a weighted combination of standard FMs that outperforms others on a wide range of scene types. The resulting composite focus measure consists of FMs that are in consensus with one another but not in chorus. Our two-stage pipeline first estimates fine depth at each pixel using the composite focus measure. A cost-volume propagation step then assigns depths from confident pixels to others. We can generate high quality depth maps using just the top five FMs from our composite focus measure. This is a positive step towards depth estimation of everyday scenes with no special equipment. Parikshit Sakurikar, P. J. Narayanan |
ICCV | 1 |
| 2017 | Beyond OCRs for Document Blur EstimationabstractThe current document blur/quality estimation algorithms rely on the OCR accuracy to measure their success. A sharp document image, however, at times may yield lower OCR accuracy owing to factors independent of blur or quality of capture. The necessity to rely on OCR is mainly due to the difficulty in quantifying the quality otherwise. In this work, we overcome this limitation by proposing a novel dataset for document blur estimation, for which we physically quantify the blur using a capture set-up which computationally varies the focal distance of the camera. We also present a selective search mechanism to improve upon the recently successful patch-based learning approaches (using codebooks or convolutional neural networks). We present a thorough analysis of the improved blur estimation pipeline using correlation with OCR accuracy as well as the actual amount of blur. Our experiments demonstrate that our method outperforms the current state-of-the-art by a significant margin. Pranjal Kumar Rai, Sajal Maheshwari, Ishit Mehta, Parikshit Sakurikar, Vineet Gandhi |
ICDAR | 4 |
| 2017 | SynCam: Capturing sub-frame synchronous media using smartphonesabstractSmartphones have become the de-facto capture devices for everyday photography. Unlike traditional digital cameras, smartphones are versatile devices with auxiliary sensors, processing power, and networking capabilities. In this work, we harness the communication capabilities of smartphones and present a synchronous/co-ordinated multi-camera capture system. Synchronous capture is important for many image/video fusion and 3D reconstruction applications. The proposed system provides an inexpensive and effective means to capture multi-camera media for such applications. Our coordinated capture system is based on a wireless protocol that uses NTP based synchronization and device specific lag compensation. It achieves sub-frame synchronization across all participating smartphones of even heterogeneous make and model. We propose a new method based on fiducial markers displayed on an LCD screen to temporally calibrate smart-phone cameras. We demonstrate the utility and versatility of this system to enhance traditional videography and to create novel visual representations such as panoramic videos, HDR videos, multi-view 3D reconstruction, multi-flash imaging, and multi-camera social media. Ishit Mehta, Parikshit Sakurikar, Rajvi Shah, P. J. Narayanan |
ICME | 2 |
| 2012 | Fast graph cuts using shrink-expand reparameterizationabstractGlobal optimization of MRF energy using graph cuts is widely used in computer vision. As the images are getting larger, faster graph cuts are needed without sacrificing optimality. Initializing or reparameterizing a graph using results of a similar one has provided efficiency in the past. In this paper, we present a method to speedup graph cuts using shrink-expand reparameterization. Our scheme merges the nodes of a given graph to shrink it. The resulting graph and its mincut are expanded and used to reparameterize the original graph for faster convergence. Graph shrinking can be done in different ways. We use a block-wise shrinking similar to multiresolution processing of images in our Multiresolution Cuts algorithm. We also develop a hybrid approach that can mix nodes from different levels without affecting optimality. Our algorithm is particularly suited for processing large images. The processing time on the full detail graph reduces nearly by a factor of 4. The overall application time including all book-keeping is faster by a factor of 2 on various types of images. Parikshit Sakurikar, P. J. Narayanan |
WACV | 1 |