Dr. Tanuja K. Sarode

Publications (2)0 Total impact

• Source

  Available from: Hemant B Kekre

  Article: Mixing Codebooks of LBG, KPE and KFCG Algorithms to Increase Capacity of Information Hiding

  Dr. H. B. Kekre, Athawale Archana, Dr. Tanuja K. Sarode, Sagvekar Kalpana
  [show abstract] [hide abstract]
  ABSTRACT: Many researchers have studied reversible data hiding techniquesin recent years and most have proposed reversible data hidingschemes that guarantees only that the original cover image can bereconstructed completely. Once the secret data are embedded inthe compression domain and the receiver wants to store the coverimage in a compression mode to save storage space, the receivermust extract the secret data, reconstruct the cover image, andcompress the cover image again to generate compression codes. Inthis paper, we propose a novel data hiding method based on VQcompressed images. Codebooks of secret message & coverimages are combined using shuffle algorithm. Experimentalresults indicate that our proposed scheme provides 100% hidingcapacity or more that means secret message can be of same ormore size than cover image and better image quality comparedwith existing schemes based on VQ compressed images. Thetechnique is robust against stegaanalysis technique.
  International Journal of Computer Applications. 01/2010;
• Source

  Available from: Hemant B Kekre

  Article: SPEAKER IDENTIFICATION USING 2-D DCT, WALSH AND HAAR ON FULL AND BLOCK SPECTROGRAM

  Dr. H. B. Kekre, Dr. Tanuja K. Sarode, Shachi J. Natu, Prachi J. Natu
  [show abstract] [hide abstract]
  ABSTRACT: This paper aims to provide different approaches to text dependent speaker identification using DCT, Walsh and Haar transform along with use of spectrograms. Spectrograms obtained from speech samples are used as image database for the study undertaken. This image database is then subjected to various transforms. Using Euclidean distance as measure of similarity, most appropriate speaker match is obtained and is declared as identified speaker. Each transform is applied to spectrograms in two different ways: on full image and on imageblocks. In both the ways, effect of different number of coefficientsof transformed image is observed. Haar transform on full image reduces multiplications required by DCT and Walsh by 28 times whereas applying Haar transform on image blocks requires 18 times less mathematical computations as compared to DCT and Walsh on image blocks. Transforms when applied to image blocks, yield better or equal identification rates with reduced computational complexity.
  International Journal on Computer Science and Engineering. 01/2010;