SDSwapnil Deelip Dabhade

Swapnil Deelip Dabhade

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Swapnil Deelip Dabhade has a total of 3 co-authors. Here are the top co-authors by number of shared publications:

  • G. N. Rathna

    Electrical Engineering Department, Indian Institute of Science, Bangalore, India

    1 shared publication
  • Kunal N. Chaudhury

    Department of Electrical Engineering, Indian Institute of Science, Bangalore, India

    1 shared publication
  • Kunal Narayan Chaudhury

    Electrical Engineering Department, Indian Institute of Science, Bangalore, India

    1 shared publication

Latest Publications

  • A Reconfigurable and Scalable FPGA Architecture for Bilateral Filtering

    by Swapnil Deelip Dabhade, G. N. Rathna, Kunal Narayan Chaudhury

    Bilateral filter is an edge-preserving smoother that has applications in image processing, computer vision, and computational photography. In the past, fieldprogrammable gate array (FPGA) implementations of the filter have been proposed that can achieve high throughput using parallelization and pipelining. An inherent limitation with direct implementations is that their complexity scales as O(ω 2 ) with the filter width ω. In this paper, we propose an FPGA implementation of a fast bilateral filter that requires just O(1) operations for any arbitrary ω. The attractive feature of the FPGA implementation is that it is both scalable and reconfigurable. To the best of our knowledge, this is the first scalable FPGA implementation of the bilateral filter. As an application, we use the FPGA implementation for image denoising.


  • Fast and Provably Accurate Bilateral Filtering

    by Kunal N. Chaudhury, Swapnil D. Dabhade

    The bilateral filter is a non-linear filter that uses a range filter along with a spatial filter to perform edge-preserving smoothing of images. A direct computation of the bilateral filter requires O(S) operations per pixel, where S is the size of the support of the spatial filter. In this paper, we present a fast and provably accurate algorithm for approximating the bilateral filter when the range kernel is Gaussian. In particular, for box and Gaussian spatial filters, the proposed algorithm can cut down the complexity to O(1) per pixel for any arbitrary S. The algorithm has a simple implementation involving N+1 spatial filterings, where N is the approximation order. We give a detailed analysis of the filtering accuracy that can be achieved by the proposed approximation in relation to the target bilateral filter. This allows us to estimate the order N required to obtain a given accuracy. We also present comprehensive numerical results to demonstrate that the proposed algorithm is competitive with the state-of-the-art methods in terms of speed and accuracy.