Vartika Sharma

Vartika Sharma

San Francisco Bay Area
10K followers 500+ connections

About

Software Engineer with 10+ years of industrial experience in backend engineering and data…

Activity

Join now to see all activity

Experience

  • Walmart Global Tech Graphic

    Walmart Global Tech

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

    Scottsdale, Arizona

  • -

    Bengaluru Area, India

  • -

    Okinawa, Japan

  • -

    Kuala Lumpur, Malaysia

  • -

    Jaipur Area, India

  • -

    Chennai Area, India

  • -

    Jaipur Area, India

  • -

    Kharagpur Area, India

Education

Licenses & Certifications

Publications

  • GPU Based Image Compression and Interpolation with Anisotropic Diffusion

    WMSC-2015, Jaipur, India

    Image compression is used to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. The best image quality at a given bit-rate or compression rate is the main goal of image compression. Methods based on partial differential equation (PDEs) have been used in the past for inpainting and reconstruction from digital image features. We go for PDE method because optimal set for image compression and interpolation depends on PDE, i.e.…

    Image compression is used to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. The best image quality at a given bit-rate or compression rate is the main goal of image compression. Methods based on partial differential equation (PDEs) have been used in the past for inpainting and reconstruction from digital image features. We go for PDE method because optimal set for image compression and interpolation depends on PDE, i.e., good PDEs can cope with bad points and good points allow sim-
    ple (suboptimal) PDEs. Suboptimal point set can pay off if coded efficiently. During encoding, the basic idea is to store only a few relevant pixel coordinates in the encoding step. We use an adaptive triangulation method based on binary tree coding for removing less significant pixels from the image. Decoding is done
    by the Perona and Malik diffusion process for which the remaining points serve as scattered interpolation data. Our goal in this paper is to analyse the potential of differential equations for image compression and interpolation and analyse the performance speed
    of the algorithm both on CPU and GPU. Graphics Processing Units (GPUs) are used in image processing because they accelerate parallel computing, are affordable and energy efficient. Research has also proved that GPUs perform better even at lower occupancies. In this paper, we will see the advantage we achieve with respect to the productivity and maintainability when applying concepts of the hardware system. Our experiment illustrates that the computation time for CPU code increases significantly as we
    increase the image dimension but higher dimensional images are processed with equal ease using GPU computing.

    Other authors
    See publication

Languages

  • Hindi

    -

  • English

    -

More activity by Vartika

View Vartika’s full profile

  • See who you know in common
  • Get introduced
  • Contact Vartika directly
Join to view full profile

Other similar profiles

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Others named Vartika Sharma in United States

Add new skills with these courses