Work place: Senior Professor, Department of Computer Engineering MPSTME, SVKM’s NMIMS University, Mumbai, India
Research Interests: Image Processing, Computer Networks, Computer systems and computational processes
Dr. H. B. Kekre has received B.E. (Hons.) in Telecomm. Engineering. from Jabalpur University in 1958, M.Tech (Industrial Electronics) from IIT Bombay in 1960, M.S.Engg. (Electrical Engg.) from University of Ottawa in 1965 and Ph.D. (System Identification) from IIT Bombay in 1970 He has worked as Faculty of Electrical Engg. and then HOD Computer Science and Engg. at IIT Bombay. For 13 years he was working as a professor and head in the Department of Computer Engg. at Thadomal Shahani Engineering. College, Mumbai. Now he is Senior Professor at MPSTME, SVKM’s NMIMS University. He has guided 17 Ph.Ds, more than 100 M.E./M.Tech and several B.E./ B.Tech projects. His areas of interest are Digital Signal processing, Image Processing and Computer Networking. He has more than 450 papers in National / International Conferences and Journals to his credit. He was Senior Member of IEEE. Presently He is Fellow of IETE and Life Member of ISTE. 13 Research Papers published under his guidance have received best paper awards. Recently 5 research scholars have been conferred Ph. D. by NMIMS University. Currently 07 research scholars are pursuing Ph.D. program under his guidance.v
DOI: https://doi.org/10.5815/ijigsp.2015.04.01, Pub. Date: 8 Mar. 2015
A hybrid watermarking technique using Singular value Decomposition with orthogonal transforms like DCT, Haar, Walsh, Real Fourier Transform and Kekre transform is proposed in this paper. Later, SVD is combined with wavelet transforms generated from these orthogonal transforms. Singular values of watermark are embedded in middle frequency band of column/row transform of host image. Before embedding, Singular values are scaled with suitable scaling factor and are sorted. Column/row transform reduces the computational complexity to half and properties of singular value decomposition and transforms add to robustness. Behaviour of proposed method is evaluated against various attacks like compression, cropping, resizing, and noise addition. For majority of attacks wavelet transforms prove to be more robust than corresponding orthogonal transform from which it is generated.[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2014.04.05, Pub. Date: 8 Mar. 2014
In this paper image compression using hybrid wavelet transform is proposed. Hybrid wavelet transform matrix is formed using two component orthogonal transforms. One is base transform which contributes to global features of an image and another transform contributes to local features. Here base transform is varied to observe its effect on image quality at different compression ratios. Different transforms like Discrete Kekre Transform (DKT), Walsh, Real-DFT, Sine, Hartley and Slant transform are chosen as base transforms. They are combined with Discrete Cosine Transform (DCT) that contributes to local features of an image. Sizes of component orthogonal transforms are varied as 16-16, 32-8 and 64-4 to generate hybrid wavelet transform of size 256x256. Results of different combinations are compared and it has been observed that, DKT as a base transform combined with DCT gives better results for size 16x16 of both component transforms.[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2014.01.10, Pub. Date: 8 Nov. 2013
This paper describes the histogram bins matching approach for CBIR. Histogram bins are reduced from 256 to 32 and 16 by linear grouping and effect of this dimensionality reduction is analyzed, compared, and evaluated. Work presented in this paper contributes in all three main phases of CBIR that are feature extraction, similarity matching and performance evaluation. Feature extraction explores the idea of histogram bins matching for three colors R, G and B. Histogram bin contents are used to represent the feature vector in three forms. First form of feature is count of pixels, and then other forms are obtained by computing the total and mean of intensities for the pixels falling in each of the histogram bins. Initially the size of the feature vector is 256 components as histogram with the all 256 bins. Further the size of the feature vector is reduced to 32 bins and then 16 bins by simple linear grouping of the bins. Feature extraction processes for each size and type of the feature vector is executed over the database of 2000 BMP images having 20 different classes. It prepares the feature vector databases as preprocessing part of this work. Similarity matching between query and database image feature vectors is carried out by means of first five orders of Minkowski distance and also with the cosine correlation distance. Same set of 200 query images are executed for all types of feature vector and for all similarity measures. Performance of all aspects addressed in this paper are evaluated using three parameters PRCP (Precision Recall Cross over Point), LS (longest string), LSRR (Length of String to Retrieve all Relevant images).[...] Read more.
DOI: https://doi.org/10.5815/ijigsp.2013.11.01, Pub. Date: 8 Sep. 2013
Breast cancer is most common and leading cause of death among women. With improvement in the imaging modalities it is possible to diagnose the cancer at an early stage moreover treatment at an early stage reduces the mortality rate. B-mode ultrasound (US) imaging is very illustrious and reliable technique in early detection of masses in the breast. Though it is complimentary to the mammography, dense breast tissues can be examined more efficiently and detects the small nodules that are usually not observed in mammography. Segmentation of US images gives the clear understanding of nature and growth of the tumor. But some inherent artifact of US images makes this process difficult and computationally inefficient. Many methods are discussed in the literature for US image segmentation, each method has its pros and cons. In this paper, initially region merging based watershed and marker-controlled watershed transforms are discussed and implemented. In the subsequent sections we proposed a method for segmentation, based on clustering. Proposed method consists of three stages, in first stage probability images and its equalized histogram images are obtained from the original US images without any preprocessing. In the next stage, we used VQ based clustering technique with LBG, KPE and KEVR codebook generation algorithm followed by sequential cluster merging. Last stage is the post processing, where we removed unwanted regions from the selected cluster image by labeling the connected components and moreover used morphological operation for closing the holes in the final segmented image. Finally, results by our method are compared with initially discussed methods.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals