In multimodal biometrics, modalities can be robust against the authentication of certain people and weak for others. The conventional fusion techniques such as the Product, Mean, AND, OR and the Majority Voting do not take into account this kind of behaviour. In this paper, we propose a new approach to fusion procedures in the context of biometric authentication. The proposed method is based on the exploration of the Choquet integral that takes into account the interactions between the terms and people through fuzzy measures. The fuzzy measures, the ones we have proposed, are based on the number of confusion, the entropy and the uncertainty function. The results have been validated in two databases: the first one is virtual, which is based on synthetic scores and the second one on the biometric modalities which are: face, off-line handwriting and off-line signature. The achieved results demonstrate the robustness of our approaches and their adaptability.

In this paper, we introduce a face recognition algorithm based on doubly truncated multivariate Gaussian mixture model with DCT under logarithm domain. In face recognition, the face image is subject to the variation of illumination. The effect of illumination cannot be avoided by mere consideration of DCT coefficients as feature vector. The illumination effect can be minimized by utilizing DCT coefficients under logarithm domain and discarding sum of the DCT coefficients which represents the illumination in the face image. Here, it is assumed that the DCT coefficients under logarithm domain after adjusting the illumination follow a doubly truncated multivariate Gaussian mixture model. The truncation on the feature vector has a significant influence in improving the recognition rate of the system using EM algorithm with K-means or hierarchical clustering, the model parameters are estimated. A face recognition system is developed under Bayesian frame using maximum likelihood. The performance of the system is demonstrated by using the databases namely, JNTUK and Yale and comparing it’s performance with the face recognition system based on GMM. It is observed that the proposed face recognition system outperforms the existing systems.

In this paper, a wavelet-based progressive image transmission (PIT) scheme is proposed. Here a combined method is proposed to reduce the image browsing time. The proposed scheme transforms a digital image from spatial domain into frequency domain by using discrete wavelet transformation. For wavelet transformation phase we have used Haar wavelet transformation. But it is computationally rigorous. Using concurrent computing we have significantly reduced computation time overhead as well as transmission time. According to the experimental results, the proposed scheme provides the accuracy of reconstructed image and the image browsing time reduces significantly.

This paper presents a design of low complexity multichannel Nearly Perfect Reconstruction (NPR) Cosine Modulated Filter Bank (CMFB). CMFBs are used extensively because of ease realization and the inherent advantage of high stop-band attenuation. But, when the number of channel becomes large, it leads to certain limitations as it would require large number of filter coefficients to be optimized and hence longer CPU time; e.g. 32-band or 64-band CMFB. Large number of filter coefficients would also mean that computational complexity of the prototype filter is extremely increased that tends to slow down the convergence to best possible solution. Here, the prototype filter is designed using modified Interpolated Finite Impulse Response (IFIR) technique where masking filter is replaced by multiplier free cascaded structure and coefficients of model filter are converted to nearest Canonical Signed Digit (CSD). The interpolation factor is chosen in such a way that computational cost of the overall filter and different error parameters are reduced. The proposed approach thus leads to reduction in stop-band energy as well as high Side-Lobe-Fall-off-Rate (SLFOR). Three examples have been included to demonstrate the effectiveness of the proposed technique over the existing design methods and savings in computational complexity is also highlighted.

During past few years, brain tumor segmentation in magnetic resonance imaging (MRI) has become an emergent research area in the field of medical imaging system. Brain tumor detection helps in finding the exact size and location of tumor. An efficient algorithm is proposed in this paper for tumor detection based on segmentation and morphological operators. Firstly quality of scanned image is enhanced and then morphological operators are applied to detect the tumor in the scanned image.

Tracking occluded objects at different depths has become as extremely important component of study for any video sequence having wide applications in object tracking, scene recognition, coding, editing the videos and mosaicking. This paper experiments with the capabilities of image annotation contour based tracking for occluded object. Image annotation is applied on 3 similar normal video sequences varying in depth. In the experiment, one bike occludes the other at a depth of 60 cm, 80 cm and 100 cm respectively. The effect on tracking is also analyzed with illumination variations using 3 different light sources in video sequences having objects occluding one another at same depth. The paper finally studies the ability of annotation to track the occluded object based on pyramids with variation in depth further establishing a threshold at which the ability of the system to track the occluded object fails. The contour of both the individual objects can’t be tracked due to the distortion caused by overlapping of the object pyramids. The thresholds established can be used as a bench mark to estimate the capability of different softwares. The paper further computes the frame by frame error incurred by the system, supported by detailed simulations. This system can be effectively used to achieve flawless tracking as the error in motion tracking can be corrected. This can be of great interest to computer scientists while designing surveillance systems etc.

In this paper, a adopted approach to fully automatic satellite image segmentation, called JSEG, "JPEG image segmentation" is presented. First colors in the image are quantized to represent differentiate regions in the image. Then image pixel colors are replaced by their corresponding color class labels, thus forming a class-map of the image. A criterion for “good” segmentation using this class-map is proposed. Applying the criterion to local windows in the class-map results in the “J-image”, in which high and low values corresponding to possible region boundaries and region centers, respectively. A region growing method is then used to segment the image based on the multi-scale J-images. Experiments show that JSEG provides good segmentation and classification results on a variety of images.

Manually examine the blood smear for the detection of malaria parasite consumes lot of time for trend pathologists. As the computational power increases, the role of automatic visual inspection becomes more important. An automated system is therefore needed to complete as much work as possible for the identification of malaria parasites. The given scheme based on used of RGB color space, G layer processing, and segmentation of Red Blood Cells (RBC) as well as cell parasites by auto-thresholding with offset value and use of morphological processing. The work compare with the manual results obtained from the pathology lab, based on total RBC count and cells parasite count. The designed system successfully detects malaria parasites and RBC cells in thin smear image.