Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Subject: search.filters.subject.Discrete Cosine Transform(DCT)

Search Results

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Implementation of comprehensive address generator for digital signal processor
    (2013) Ramesh Kini, R.M.; Sumam David, S.
    The performance of signal-processing algorithms implemented in hardware depends on the efficiency of datapath, memory speed and address computation. Pattern of data access in signal-processing applications is complex and it is desirable to execute the innermost loop of a kernel in a single-clock cycle. This necessitates the generation of typically three addresses per clock: two addresses for data sample/coefficient and one for the storage of processed data. Most of the Reconfigurable Processors, designed for multimedia, focus on mapping the multimedia applications written in a high-level language directly on to the reconfigurable fabric, implying the use of same datapath resources for kernel processing and address generation. This results in inconsistent and non-optimal use of finite datapath resources. Presence of a set of dedicated, efficient Address Generator Units (AGUs) helps in better utilisation of the datapath elements by using them only for kernel operations; and will certainly enhance the performance. This article focuses on the design and application-specific integrated circuit implementation of address generators for complex addressing modes required by multimedia signal-processing kernels. A novel algorithm and hardware for AGU is developed for accessing data and coefficients in a bit-reversed order for fast Fourier transform kernel spanning over log 2 N stages, AGUs for zig-zag-ordered data access for entropy coding after Discrete Cosine Transform (DCT), convolution kernels with stored/streaming data, accessing data for motion estimation using the block-matching technique and other conventional addressing modes. When mapped to hardware, they scale linearly in gate complexity with increase in the size. © 2013 Copyright Taylor and Francis Group, LLC.
  • No Thumbnail Available
    Item
    Magnetic resonance image denoising using nonlocal maximum likelihood paradigm in DCT-framework
    (John Wiley and Sons Inc, 2015) Kumar, P.K.; Darshan, P.; Kumar, S.; Ravindra, R.; Rajan, J.; Saba, L.; Suri, J.S.
    The data acquired by magnetic resonance (MR) imaging system are inherently degraded by noise that has its origin in the thermal Brownian motion of electrons. Denoising can enhance the quality (by improving the SNR) of the acquired MR image, which is important for both visual analysis and other post processing operations. Recent works on maximum likelihood (ML) based denoising shows that ML methods are very effective in denoising MR images and has an edge over the other state-of-the-art methods for MRI denoising. Among the ML based approaches, the Nonlocal maximum likelihood (NLML) method is commonly used. In the conventional NLML method, the samples for the ML estimation of the unknown true pixel are chosen in a nonlocal fashion based on the intensity similarity of the pixel neighborhoods. Euclidean distance is generally used to measure this similarity. It has been recently shown that computing similarity measure is more robust in discrete cosine transform (DCT) subspace, compared with Euclidean image subspace. Motivated by this observation, we integrated DCT into NLML to produce an improved MRI filtration process. Other than improving the SNR, the time complexity of the conventional NLML can also be significantly reduced through the proposed approach. On synthetic MR brain image, an average improvement of 5% in PSNR and 86%reduction in execution time is achieved with a search window size of 91 × 91 after incorporating the improvements in the existing NLML method. On an experimental kiwi fruit image an improvement of 10% in PSNR is achieved. We did experiments on both simulated and real data sets to validate and to demonstrate the effectiveness of the proposed method. © 2015 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 25, 256-264, 2015 © 2015 Wiley Periodicals, Inc.
  • No Thumbnail Available
    Item
    Randomised visual secret sharing scheme for grey-scale and colour images
    (Institution of Engineering and Technology journals@theiet.org, 2018) Mhala, N.C.; Jamal, R.; Pais, A.R.
    Randomised visual secret sharing is an encryption technique that utilises block-based progressive visual secret sharing and discrete cosine transform (DCT) based reversible data embedding technique to recover a secret image. The recovery method is based on progressive visual secret sharing, which recovers the secret image block by block. The existing block based schemes achieve the highest contrast level of 50% for noise-like and meaningful shares. The proposed scheme achieves a contrast level of 70-90% for noise-like and 70-80% for meaningful shares. The enhancement of contrast is achieved by embedding additional information in the shares using DCT-based reversible data embedding technique. Experimental results showed that the proposed scheme restores the secret image with better visual quality in terms of human visual system based parameters. © The Institution of Engineering and Technology 2017.