M Tech Dissertations
Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3
Browse
Search Results
Item Open Access Detection and localization of tampering in a digital medical image using discrete wavelet transform(Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Gadhiya, Tushar; Roy, Anil K.; Mitra, Suman K.Use of digital images has increased tremendously in medical science as a diagnosis tool. It made investigation easier and quick. But at the same time it raises the question of authenticity of the image under scrutiny. Authenticity of the digital image has been very important in the areas like scientific research, legal proceedings, lifestyle publications, brand marketing, forensic investigations, government documents etc. With the help of powerful and easy to use image editing software like Microsoft Paint and Photoshop, it became extremely easy to tamper with a digital image for malicious objective. Digital form of the image draws attention of many researcher towards automatic diagnosis system for image analysis and enhancement. These kinds of systems use harmless image manipulation operations like brightness enhancement, gamma correction, contrast enhancement etc. which improve quality of the image. It helps in better diagnosis. So it should not be considered as a tampering. Likely and reported tampering of malicious intention may be found in medical claims, health insurances or even legal battles in which a medical problem may influence the judicial decision. Since use of digital images in medical profession still is in nascent stage, we addressed the likelyto- be-wrong-use of such input in this thesis. We propose an algorithm to enable anybody to detect if or not a tampering is done with such malicious intention. And if it is so, the almost precise localization of such tempering can also be done successfully in a suspect digital medical image. The basis of our proposed algorithm is the hash-based representation of a digital image. We use discrete wavelet transform as a tool. It allows us to identify direction of tampering. The direction of tampering helps us converge on the tampered object in the localization area. We will show that our algorithm is robust against harmless manipulation, sensitive enough for even a minute tampering. In case of multiple tampering, proposed method is able to identify location as well as direction of multiple tampering, while some of the existing methods fail in this area. Our proposed technique is fast and generates smaller hash, as it works with smaller hash function in comparison with the similar available techniques.Item Open Access Object-background segmentation from video(Dhirubhai Ambani Institute of Information and Communication Technology, 2015) Domadiya, Prashant; Mitra, Suman K.Fast and accurate algorithms for background-foreground separation are an essential part ofany video surveillance system. GMM (Gaussian Mixture Models) based object segmentation
methods give accurate results for background-foreground separation problems but are
computationally expensive. In contrast, modeling with only single Gaussian improves the
time complexity with the reduction in the accuracy due to variations in illumination and
dynamic nature of the background. It is observed that these variations affect only a few
pixels in an image. Most of the background pixels are unimodal. We propose a method
to account for the dynamic nature of the background and low lighting conditions. It is an
adaptive approach where each pixel is modeled as either unimodal Gaussian or multimodal
Gaussians. The flexibility in terms of number of Gaussians used to model each pixel, along
with learning when it is required approach reduces the time complexity of the algorithm
significantly. To resolve problems related to false negative due to the homogeneity of color
and texture in foreground and background, a spatial smoothing is carried out by K-means,
which improves the overall accuracy of proposed algorithm. The shadow causes the problem
in many applications which rely on segmentation results. Shadow cause variation in
RGB values of pixels, RGB value dependent GMM based method can’t remove shadow
from detection results. The preprocessing stage involving illumination invariant representation
takes care of the object shadow as well.
Item Open Access Locality preserving projection: a study and applications(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Shikkenawis, Gitam; Mitra, Suman KLocality Preserving Projection (LPP) is a recently proposed approach for dimensionality reduction that preserves the neighbourhood information and obtains a subspace that best detects the essential data manifold structure. Currently it is widely used for finding the intrinsic dimensionality of the data which is usually of high dimension. This characteristic of LPP has made it popular among other available dimensionality reduction approaches such as Principal Component Analysis (PCA). A study on LPP reveals that it tries to preserve the information about nearest neighbours of data points, thus may lead to misclassification in the overlapping regions of two or more classes while performing data analysis. It has also been observed that the dimension reducibility capacity of conventional LPP is much less than that of PCA. A new proposal called Extended LPP (ELPP) which amicably resolves two issues mentioned above is introduced. In particular, a new weighing scheme is designed that pays importance to the data points which are at a moderate distance, in addition to the nearest points. This helps to resolve the ambiguity occurring at the overlapping regions as well as increase the reducibility capacity. LPP is used for a variety of applications for reducing the dimensions one of which is Face Recognition. Face Recognition is one of the most widely used biometric technology for person identification. Face images are represented as highdimensional pixel arrays and due to high correlation between the neighbouring pixel values; they often belong to an intrinsically low dimensional manifold. The distribution of data in a high dimensional space is non-uniform and is generally concentrated around some kind of low dimensional structures. Hence, one of the ways of performing Face Recognition is by reducing the dimensionality of the data and finding the subspace of the manifold in which face images reside. Both LPP and ELPP are used for Face and Expression Recognition tasks. As the aim is to separate the clusters in the embedded space, class membership information may add more discriminating power. With this in mind, the proposal is further extended to the supervised version of LPP (SLPP) that uses the known class labels of data points to enhance the discriminating power along with inheriting the properties of ELPPItem Open Access Design & layout of a low voltage folding & interpolation ADC for high speed applications(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Tiwari, Sandeep Kumar; Sen, SubhajitAnalog to Digital Converters (ADC) and Digital to Analog Converters (DAC) plays a vital role in mixed analog signalling, communication and digital signal processing world. Now a day, the demand for designing of high speed, low power and low voltage ADCs are increasing tremendously in high speed data processing applications. In the folding and interpolation ADCs folding amplifiers have the serious bandwidth limitation problem because of larger parasitic capacitance and resistance at the output node. In this thesis work a low voltage and high speed folding and interpolation ADC is implemented using current steering CMOS folding amplifier followed by transresistance amplifier (TRA) in UMC 180nm CMOS technology. The current steering folding amplifier significantly reduces power as well as number of tail current sources compared to the conventional folding amplifier. Transresistance amplifier, which is connected at the output of folding amplifier, avoids the analog bandwidth limitation problem. MSB and LSB bits are generated simultaneously at the output therefore sample and hold circuit is not required in this architecture. This proposed circuit works at 1.8V power supply and 85 MSamples/S and consumes 70mW power. Simulation and Layout of Folding and Interpolation ADC were done using UMC CMOS 180nm technology in the Cadence Analog Design EnvironmentItem Open Access Fingerprint image preprocessing for robust recognition(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Munshi, Paridhi; Mitra, Suman KFingerprint is the oldest and most widely used form of biometric identification. Since they are mainly used in forensic science, accuracy in the fingerprint identification is highly important. This accuracy is dependent on the quality of image. Most of the fingerprint identification systems are based on minutiae matching and a critical step in correct matching of fingerprint minutiae is to reliably extract minutiae from the fingerprint images. However, fingerprint images may not be of good quality. They may be degraded and corrupted due to variations in skin, pressure and impression conditions. Most of the feature extraction algorithms work on binary images instead of the gray scale image and results of the feature extraction depends upon the quality of binary image used. Keeping these points in mind, image preprocessing including enhancement and binarization is proposed in this work. This preprocessing is employed prior to minutiae extraction to obtain a more reliable estimation of minutiae locations and hence to get a robust matching performance. In this dissertation, we give an introduction to the ngerprint structure and identification system . A discussion on the proposed methodology and implementation of technique for fingerprint image enhancement is given. Then a rough-set based method for binarization is proposed followed by the discussion on the methods for minutiae extraction. Experiments are conducted on real fingerprint images to evaluate the performance of the implemented techniques.Item Open Access FPGA implementation of multiband and multimode modem for software defined radio (SDR)(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Timbadiya, Jaykant; Dubey, RahulNow a days Software Defined Radio(SDR) is becoming popular for wireless communication because of it’s flexibility to change as per requirement through software. The work presented here describes the different methods of designing a Multiband and Multimode MODEM, implementation on programmable device like FPGA and verification for different functionality and specification. The design presented here has ability to switch between different modulation scheme and different data rate. Multiband and Multimode modem includes BPSK and QPSK modulator and demodulator with Forward Error Correction and other base band processingItem Open Access Application of compressive sensing to tow-way relay channel estimation(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Nair, Rahit R.; Chakka, VijaykumarAn Amplify and Forward Two-Way Relay Network is one where two nodes transmit data to each other via an intermediate relay. The relay amplifies the superimposed data from both the nodes before sending it to both the nodes. A method for the estimation of channel is proposed for Amplify and Forward Two-Way Relay Network (AF-TWRN). The proposed method utilizes the fact that the channel in the case of AF-TWRN shows sparse characteristic. The sparse multipath channel is estimated in the case of AF-TWRN using compressive sensing (CS) reconstruction algorithm, namely Iterative Hard Thresholding (IHT). MSE based performance of these methods in estimating the composite AF-TWRN channel was calculated and compared to that using Compressive Sampling Matching Pursuit (CoSaMP) and Orthogonal Matching Pursuit (OMP). IHT and CoSaMP are seen to perform slightly better than OMP with lesser computational complexity than OMP. It was also shown that all three CS based estimation methods perform better than the traditional Least Squares (LS) method in the estimation of Sparse AF-TWRN channel. A low complexity detection strategy was proposedItem Open Access Multiresolution fusion using compressive sensing and graph cuts(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Harikumar, V.; Joshi, Manjunath V.Multiresolution fusion refers to the enhancement of low spatial resolution (LR) of Multispectral (MS) images to that of Panchromatic (Pan ) image without compro- mising on the spectral details. Many of the present day methods for multiresolution fusion require that the Pan and MS images are registered. In this thesis we propose a new approach for multiresolution fusion which is based on the theory of compressive sensing and graph cuts. We rst estimate a close approximation to the fused image by using the sparseness in the given Pan and MS images. Assuming that the Pan and LR MS image have the same sparseness, the initial estimate of the fused image is obtained as the linear combination of the Pan blocks. The weights in the linear combination are estimated using the l1 minimization by making use of MS and the down sampled Pan image. The nal solution is obtained by using a model based approach. The low resolution MS image is modeled as the degraded and noisy version of the fused image in which the degradation matrix entries are estimated by using the initial estimate and the MS image. Since the MS fusion is an ill-posed inverse problem, we use a regularization based approach to obtain the nal solution. We use the truncated quadratic prior for the preservation of the discontinuities in the fused image. A suitable energy function is then formed which consists of data tting term and the prior term and is minimized using a graph cuts based approach in order to obtain the fused image. The advantage of the proposed method is that it does not require the registration of Pan and MS data. Also the spectral characteristics are well preserved in the fused image since we are not directly operating on the Pan digital numbers. Effectiveness of the proposed method is illustrated by conducting experiments on synthetic as well as on real satellite images. Quantitative comparison of the proposed method in terms of Erreur Relative Globale Adimensionnelle de Synthse (ERGAS), Correlation Coecient(CC) , Relative Average Spectral Error(RASE) and Spectral Aangle Mapper(SAM) with the state of the art approaches indicate superiority of our approachItem Open Access Texton based auto region detection for image inpainting(Dhirubhai Ambani Institute of Information and Communication Technology, 2012) Vora, Manali; Joshi, Manjunath V.Historical monuments are considered as one of the key aspects for modern communities. Unfortunately, because of variety of factors these monuments are sometimes damaged or destroyed. Image inpainting is the process of restoring the damaged image and hence can be used as a useful tool for restoring the images of historical monumnets. Inpainting techniques developed so far require the user to manually select regions to be inpainted. In this thesis, we propose a novel approach for automatic region detection for inpainting. Given a frontal face test image and a set of face images of monument consisting of vandalized and nonvandalized regions, our task is to: 1. extract potential regions of interest like eyes, nose and lips, 2. identify whether a particular region is vandalized or not and 3. inpaint the vandalized regions using the available non-vandalized regions. In our approach, potential regions of interest are rst localized using the bilateral symmetry based method, while the identication of vandalized and non-vandalized regions is done based on the texture statistics. The texture statistics are obtained by extracting the textons from the lter response space by using the Kmeans algorithm. After identifying vandalized regions, Poisson image editing technique is used to inpaint them using the non-vandalized regions available either in the same image or from the other images in the database. Novelty of our approach lies in 1. automatic detection of target regions for inpaiting and 2. automatic selection of optimum number of textons. Experiments conducted on the frontal face images of monuments downloaded from the Internet give promising resultsItem Open Access Image ranking based on clustering(Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Sharma, Monika; Mitra, Suman K.In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high feature similarities to the query may be very different from the query. We introduced a novel scheme to rank images, cluster based image ranking, which tackle this difference in query image and retrieved images based on hypothesis: semantically similar images tends to clustered in same cluster. Clustering approach attempts to capture the difference in query and retrieved images by learning the way that similar images belongs to same cluster. For clustering color moments based clustering approach is used. The moment is the weighted average intensity of pixels. The proposed method is to compute color Moments of separated R,G,B components of images as a feature to get information of the image. This information can be used further in its detail analysis or decision making systems by classification techniques. The moments define a relationship of that pixel with its neighbors. The set of moments computed will be feature vector of that image. After obtaining the feature vector of images, k-means classification technique is used to classify these vectors in k number of classes. Initial assignment of data to the cluster is not random, it is based on maximum connected components of images. The two types of features are used to cluster the images namely: block median based clustering and color moment based clustering. Experiments are performed using these features to analyze their effect on results. To demonstrate the effectiveness of the proposed method, a test database from retrieval result of LIRE search engine is used and result of Lire is used as base line. The results conclude that the proposed methods probably give better result than Lire result. All the experiments have been performed on in MATLAB(R). Wang database of 10000 images is used for retrieval. It can be downloaded from http://wang.ist.psu.edu/iwang/test1.tar