Work place: Department of Computer Science and Engineering, University College of Engineering Jawaharlal Nehru Technological University Kakinada Kakinada, AP, India.
Research Interests: Information Security, Image Processing
L.Sumalatha recieved her B.Tech from Acharya Nagarjuna University, Guntur in the year 2000 and M.Tech(CSE) from JNT University, Hyderabad in the year 2004. At present she is working as Associate Professor in Dept of Computer Science and Engineering, University College of Engineering, JNTUK, Kakinada. She is having teaching experience of about 12years and taught many courses to UG and PG Students. She is pursuing her Ph. D from JNT University Kakinada. Her research areas includes Information Security and Digital image Processing.
DOI: https://doi.org/10.5815/ijigsp.2018.06.07, Pub. Date: 8 Jun. 2018
We present a new technique for content based image retrieval by deriving a Local motif pattern (LMP) code co-occurrence matrix (LMP-CM). This paper divides the image into 2 x 2 grids. On each 2 x 2 grid two different Peano scan motif (PSM) indexes are derived, one is initiated from top left most pixel and the other is initiated from bottom right most pixel. From these two different PSM indexes, this paper derived a unique LMP code for each 2 x 2 grid, ranges from 0 to 35. Each PSM minimizes the local gradient while traversing the 2 x 2 grid. A co-occurrence matrix is derived on LMP code and Grey level co-occurrence features are derived for efficient image retrieval. This paper is an extension of our previous MMCM approach . Experimental results on popular databases reveal an improvement in retrieval rate than existing methods.[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2018.04.07, Pub. Date: 8 Apr. 2018
In this paper, two extended versions of motif co-occurrence matrices (MCM) are derived and concatenated for efficient content-based image retrieval (CBIR). This paper divides the image into 2 x 2 grids. Each 2 x 2 grid is replaced with two different Peano scan motif (PSM) indexes, one is initiated from top left most pixel and the other is initiated from bottom right most pixel. This transforms the entire image into two different images and co-occurrence matrices are derived on these two transformed images: the first one is named as “motif co-occurrence matrix initiated from top left most pixel (MCMTL)” and second one is named as “motif co-occurrence matrix initiated from bottom right most pixel (MCMBR)”. The proposed method concatenates the feature vectors of MCMTL and MCMBR and derives multi motif co-occurrence matrix (MMCM) features. This paper carried out investigation on image databases i.e. Corel-1k, Corel-10k, MIT-VisTex, Brodtaz, and CMU-PIE and the results are compared with other well-known CBIR methods. The results indicate the efficacy of the proposed MMCM than the other methods and especially on MCM  method.[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2018.03.07, Pub. Date: 8 Mar. 2018
To extract local features efficiently Jhanwar et al. proposed Motif Co-occurrence Matrix (MCM)  in the literature. The Motifs or Peano Scan Motifs (PSM) is derived only on a 2*2 grid. The PSM are derived by fixing the initial position and this has resulted only six PSM’s on the 2*2 grid. This paper extended this ap-proach by deriving Motifs on a 3*3 neighborhood. This paper divided the 3*3 neighborhood into cross and diag-onal neighborhoods of 2*2 pixels. And on this cross and diagonal neighborhood complete Motifs are derived. The complete Motifs are different from initial Motifs, where the initial PSM positions are not fixed. This complete Motifs results 24 different Motifs on a 2*2 gird. This paper derived cross diagonal complete Motifs matrix (CD-CMM) that has relative frequencies of cross and diagonal complete Motifs. The GLCM features are de-rived on cross diagonal complete Motifs texture matrix for efficient face recognition. The proposed CD-CMM is evaluated face recognition rate on four popular face recognition databases and the face recognition rate is compared with other popular local feature based methods. The experimental results indicate the efficacy of the proposed method over the other existing methods.[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2012.09.05, Pub. Date: 8 Sep. 2012
Digital images make up a large component in the multimedia information. Hence Image authentication has attained a great importance and lead to the development of several image authentication algorithms. This paper proposes a block based watermarking scheme for image authentication based on the edge information extracted from each block. A signature is calculated from each edge block of the image using simple hash function and inserted in the same block. The proposed local edge based content hash (LECH) scheme extracts the original image without any distortion from the marked image after the hidden data have been extracted. It can also detect and localize tampered areas of the watermarked image. Experimental results demonstrate the validity of the proposed scheme.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals