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

Siddharth Advani

dblp:131/5004 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0002-8146-1989ORCID · corroborated

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

Systems, architecture and hardware · 6 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 2 since 2021

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 · 63% Generative modeling · 32% Efficient and distributed learning · 5%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 61% GPUs and heterogeneous computing · 30% Performance modeling and evaluation · 9%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
depth estimation
1.122022
Robust Multimodal Depth Estimation using Transformer based Generative Adversarial Networks · ACM Multimedia 2022
Sparse to Dense Depth Completion using a Generative Adversarial Network with Intelligent Sampling Strategies · ACM Multimedia 2021
Machine learning › Generative modeling
generative adversarial network
1.122022
Robust Multimodal Depth Estimation using Transformer based Generative Adversarial Networks · ACM Multimedia 2022
Sparse to Dense Depth Completion using a Generative Adversarial Network with Intelligent Sampling Strategies · ACM Multimedia 2021
Computer vision › 3D vision › depth estimation
multimodal depth estimation
0.612022
Robust Multimodal Depth Estimation using Transformer based Generative Adversarial Networks · ACM Multimedia 2022
Computer vision › 3D vision › depth estimation
depth completion
0.512021
Sparse to Dense Depth Completion using a Generative Adversarial Network with Intelligent Sampling Strategies · ACM Multimedia 2021
Hardware accelerators and domain-specific architectures › accelerator integration
accelerator-rich CMP
0.212015
Exploring architectural heterogeneity in intelligent vision systems · HPCA 2015
GPUs and heterogeneous computing
heterogeneous architecture
0.212015
Exploring architectural heterogeneity in intelligent vision systems · HPCA 2015
Machine learning › Efficient and distributed learning › inference efficiency
resource-constrained inference
0.212022
Robust Multimodal Depth Estimation using Transformer based Generative Adversarial Networks · ACM Multimedia 2022
Internet of things and sensor networks
iot applications
0.112021
Sparse to Dense Depth Completion using a Generative Adversarial Network with Intelligent Sampling Strategies · ACM Multimedia 2021

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

generative adversarial network · 1.6feature-based directed sampling · 1.0transformer · 0.6self-attention · 0.6workload characterization · 0.2architectural modeling · 0.2
YearPublicationVenuePosition
2022 Robust Multimodal Depth Estimation using Transformer based Generative Adversarial Networks
abstract
Accurately measuring the absolute depth of every pixel captured by an imaging sensor is of critical importance in real-time applications such as autonomous navigation, augmented reality and robotics. In order to predict dense depth, a general approach is to fuse sensor inputs from different modalities such as LiDAR, camera and other time-of-flight sensors. LiDAR and other time-of-flight sensors provide accurate depth data but are quite sparse, both spatially and temporally. To augment missing depth information, generally RGB guidance is leveraged due to its high resolution information. Due to the reliance on multiple sensor modalities, design for robustness and adaptation is essential. In this work, we propose a transformer-like self-attention based generative adversarial network to estimate dense depth using RGB and sparse depth data. We introduce a novel training recipe for making the model robust so that it works even when one of the input modalities is not available. The multi-head self-attention mechanism can dynamically attend to most salient parts of the RGB image or corresponding sparse depth data producing the most competitive results. Our proposed network also requires less memory for training and inference compared to other existing heavily residual connection based convolutional neural networks, making it more suitable for resource-constrained edge applications. The source code is available at: https://github.com/kocchop/robust-multimodal-fusion-gan
Md Fahim Faysal Khan, Anusha Devulapally, Siddharth Advani, Narayanan Vijaykrishnan
ACM Multimedia3
2021 Sparse to Dense Depth Completion using a Generative Adversarial Network with Intelligent Sampling Strategies
abstract
Predicting dense depth accurately is essential for 3D scene understanding applications such as autonomous driving and robotics. However, the depth obtained from commercially available LiDAR and Time-of-Flight sensors is very sparse. With RGB color guidance, modern convolutional neural network (CNN) based approaches can recover the missing depth information. However, there could be scenarios such as low-light environments where it might be difficult to get an associated RGB image with the sparse depth. In this work, we propose a Generative Adversarial Network (GAN) that can accurately predict the dense depth using only sparse samples without any RGB inputs. Generally, the sparsity in the depth samples is uniformly distributed and cannot guarantee capturing all intricate details. In this study, we also explore different variants of sparse sampling strategies from uniform to feature based directed sampling. We find that feature based intelligent sampling enjoys better compression ratio without sacrificing intricate details, saving data communication bandwidth. Compared to uniform sampling, depending on how aggressively the directed sampling is done, we observe about 3% to 25% reduction in size. We can easily reduce the size by 8% with directed sampling without sacrificing the reconstruction accuracy. Although such directed sampling strategies are not readily available with commercially viable depth sensors, we believe that our study paves the way for future intelligent sensing and sampling strategies. To further investigate data reduction and reconstruction accuracy trade-offs we deploy our GAN to generate higher resolution dense depth from 4 times smaller sparse samples. With slight decrease in accuracy, our GAN is able to recover the depth successfully which shows great promise in edge Internet of Things (IoT) applications where we have very tight constraint on data transmission bandwidth. Our source code along with examples is available at: https://github.com/kocchop/depth-completion-gan
Md Fahim Faysal Khan, Nelson Daniel Troncoso Aldas, Siddharth Advani, Narayanan Vijaykrishnan
ACM Multimedia4
2016 A Saliency-Driven LCD Power Management System
abstract
Large liquid crystal display (LCD) technology is being widely used in every corner of our modern life, ranging from personal laptops to flat-panel televisions. Among all the components in an LCD display system, the backlight panel is the dominant power consumer, irrespective of lighting technology or class. In this paper, a saliency-based field-programmable gate array accelerator for revolutionary LCD power management is proposed that allows dynamic modulation of the different zones of the backlight panel. This hardware accelerator-based system is capable of processing a high-definition video stream in real-time and uses less than 50% of the power that a normal LCD display system consumes, with minimum overhead. We also compare our proposed approach with other state-of-the-art power-aware methods and show numerous advantages using our data-driven strategy.
Yang Xiao 0002, Siddharth Advani, Donghwa Shin, Naehyuck Chang, Jack Sampson, Narayanan Vijaykrishnan
IEEE Trans. Very Large Scale Integr. Syst.2
2015 A scalable architecture for multi-class visual object detection
abstract
As high-fidelity small form-factor cameras become increasingly available and affordable, there will be a subsequent growth and emergence of vision-based applications that take advantage of this increase in visual information. The key challenge is for the embedded systems, on which the bulk of these applications will be deployed, to maintain real-time performance in the midst of the exponential increase in spatial and temporal visual data. For example, a useful vision-based driver assistance system needs to locate and identify critical objects such as pedestrians, other vehicles, pot-holes, animals, and street signs with latency small enough to allow a human driver to react accordingly. In this work, we propose a digital accelerator architecture for a high-throughput, robust, scalable, and tunable visual object detection pipeline based on Histogram of Oriented Gradients (HOG) features. From a systems perspective, efficacy can be measured in terms of speed, accuracy, energy efficiency and scalability in performing such visual tasks. Since each application dictates the criticality of any one of these dimensions, our proposed architecture exposes design-time parameters that can take advantage of domain-specific knowledge while supporting tune-ability through run-time configurations. To evaluate the effectiveness of our vision accelerator we map the architecture to a modern FPGA and demonstrate full HD video processing at 30 fps (frames per second) operating at a conservative 100 MHz clock. Evaluations on a single object class show throughput improvements of 2× and 5× over GPU and multi-threaded CPU implementations respectively. Further more we provide a pathway for enhanced scalability for the many-class problem and achieve over 20× improvement over an equivalent CPU implementation for 5 object classes.
Siddharth Advani, Yasuki Tanabe, Kevin M. Irick, Jack Sampson, Narayanan Vijaykrishnan
FPL1
2015 Exploring architectural heterogeneity in intelligent vision systems
abstract
Limited power budgets and the need for high performance computing have led to platform customization with a number of accelerators integrated with CMPs. In order to study customized architectures, we model four customization design points and compare their performance and energy across a number of computer vision workloads. We analyze the limitations of generic architectures and quantify the costs of increasing customization using these micro-architectural design points. This analysis leads us to develop a framework consisting of low-power multi-cores and an array of configurable micro-accelerator functional units. Using this platform, we illustrate dataflow and control processing optimizations that provide for performance gains similar to custom ASICs for a wide range of vision benchmarks.
Nandhini Chandramoorthy, Giuseppe Tagliavini, Kevin M. Irick, Antonio Pullini, Siddharth Advani, Sulaiman Al Habsi, Matthew Cotter, Jack Sampson, Narayanan Vijaykrishnan, Luca Benini
HPCA5
2014 A hardware accelerated multilevel visual classifier for embedded visual-assist systems
abstract
Embedded visual assist systems are emerging as increasingly viable tools for aiding visually impaired persons in their day-to-day life activities. Novel wearable devices with imaging capabilities will be uniquely positioned to assist visually impaired in activities such as grocery shopping. However, supporting such time-sensitive applications on embedded platforms requires an intelligent trade-off between accuracy and computational efficiency. In order to maximize their utility in real-world scenarios, visual classifiers often need to recognize objects within large sets of object classes that are both diverse and deep. In a grocery market, simultaneously recognizing the appearance of people, shopping carts, and pasta is an example of a common diverse object classification task. Moreover, a useful visual-aid system would need deep classification capability to distinguish among the many styles and brands of pasta to direct attention to a particular box. Exemplar Support Vector Machines (ESVMs) provide a means of achieving this specificity, but are resource intensive as computation increases rapidly with the number of classes to be recognized. To maintain scalability without sacrificing accuracy, we examine the use of a biologically-inspired classifier (HMAX) as a front-end filter that can narrow the set of ESVMs to be evaluated. We show that a hierarchical classifier combining HMAX and ESVM performs better than either of the two individually. We achieve 12% improvement in accuracy over HMAX and 4% improvement over ESVM while reducing computational overhead of evaluating all possible exemplars.
Matthew Cotter, Siddharth Advani, Jack Sampson, Kevin M. Irick, Narayanan Vijaykrishnan
ICCAD2
2014 Refresh Enabled Video Analytics (REVA): Implications on power and performance of DRAM supported embedded visual systems
abstract
Video applications are becoming ubiquitous in mobile and embedded systems. Wearable video systems such as Google Glasses require capabilities for real-time video analytics and prolonged battery lifetimes. Further, the increasing resolution of image sensors in these mobile systems places an increasing demand on both the memory storage as well as the computational power. In this work, we present the Refresh Enabled Video Analytics (REVA) system, an embedded architecture for multi-object scene understanding and tackle the unique opportunities provided by real-time embedded video analytics applications for reducing the DRAM memory refresh energy. We compare our design with the existing design space and show savings of 88% in refresh power and 15% in total power, as compared to a standard DRAM refresh scheme.
Siddharth Advani, Nandhini Chandramoorthy, Karthik Swaminathan, Kevin M. Irick, Yong Cheol Peter Cho, Jack Sampson, Narayanan Vijaykrishnan
ICCD1
2013 A Configurable Architecture for a Visual Saliency System and Its Application in Retail
abstract
Summary form only given. The objective of this paper is to present a configurable architecture for a visual saliency model based on AIM. It presents algorithmic enhancements to AIM that facilitates the design of a performance-efficient hardware architecture that offers tradeoffs between accuracy, resource utilization and latency. The AIM computational model involves (1) extraction of a set of coefficient features for each local patch in an image, (2) estimation of probability density for each coefficient with respect to its local surround, (3) computation of their product to give a joint likelihood and (4) computation of the self information of each pixel from its log likelihood. Calculation of likelihood with respect to each pixel individually in a local surround is computationally expensive. It proposes to approximate the contribution of pixels in the surround in terms of “cells” grouped further into “support zones”, whose widths are configurable. This approximation leads to nearly a 10x reduction in the number of multipliers, a critical resource, for a 41x41 surround size.
Nandhini Chandramoorthy, Siddharth Advani, Kevin M. Irick, Narayanan Vijaykrishnan
FCCM2
2013 A multi-resolution saliency framework to drive foveation
abstract
The Human Visual System (HVS) exhibits multi-resolution characteristics, where the fovea is at the highest resolution while the resolution tapers off towards the periphery. Given enough activity at the periphery, the HVS is then capable to foveate to the next region of interest (ROI), to attend to it at full resolution. Saliency models in the past have focused on identifying features that can be used in a bottom-up manner to generate conspicuity maps, which are then combined together to provide regions of fixated interest. However, these models neglect to take into consideration the foveal relation of an object of interest. The model proposed in this work aims to compute saliency as a function of distance from a given fixation point, using a multi-resolution framework. Apart from computational benefits, significant motivation can be found from this work in areas such as visual search, robotics, communications etc.
Siddharth Advani, John P. Sustersic, Kevin M. Irick, Narayanan Vijaykrishnan
ICASSP1