Anirban Mukherjee
Indian Institute of Technology Kharagpur
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Anirban Mukherjee.
Signal Processing | 2009
Santanu Ghorai; Anirban Mukherjee; Pranab K. Dutta
We observed that the two costly optimization problems of twin support vector machine (TWSVM) classifier can be avoided by introducing a technique as used in proximal support vector machine (PSVM) classifier. With this modus operandi we formulate a much simpler nonparallel plane proximal classifier (NPPC) for speeding up the training of it by reducing significant computational burden over TWSVM. The formulation of NPPC for binary data classification is based on two identical mean square error (MSE) optimization problems which lead to solving two small systems of linear equations in input space. Thus it eliminates the need of any specialized software for solving the quadratic programming problems (QPPs). The formulation is also extended for nonlinear kernel classifier. Our computations show that a MATLAB implementation of NPPC can be trained with a data set of 3 million points with 10 attributes in less than 3s. Computational results on synthetic as well as on several bench mark data sets indicate the advantages of the proposed classifier in both computational time and test accuracy. The experimental results also indicate that performances of classifiers obtained by MSE approach are sufficient in many cases than the classifiers obtained by standard SVM approach.
IEEE Transactions on Instrumentation and Measurement | 2013
Santanu Ghorai; Anirban Mukherjee; M. Gangadaran; Pranab K. Dutta
Automatic defect detection on hot-rolled steel surface is challenging owing to its localization on a large surface, variation in appearance, and their rare occurrences. It is difficult to detect these defects either by physics-based models or by small-sample statistics using a single threshold. As a result, this problem is focused to derive a set of good-quality defect descriptors from the surface images. These descriptors should discriminate the various surface defects when fed to suitable machine learning algorithms. This research work has evaluated the performance of a number of different wavelet feature sets, namely, Haar, Daubechies 2 (DB2), Daubechies 4 (DB4), biorthogonal spline, and multiwavelet in different decomposition levels derived from 32 × 32 contiguous (nonoverlapping) pixel blocks of steel surface images. We have developed an automated visual inspection system for an integrated steel plant to capture surface images in real time. It localizes defects employing kernel classifiers, such as support vector machine and recently proposed vector-valued regularized kernel function approximation. Test results on 1000 defect-free and 432 defective images comprising of 24 types of defect classes reveal that three-level Haar feature set is more promising to address this problem than the other wavelet feature sets as well as texture-based segmentation or thresholding technique of defect detection.
IEEE/ACM Transactions on Computational Biology and Bioinformatics | 2011
Santanu Ghorai; Anirban Mukherjee; Sanghamitra Sengupta; Pranab K. Dutta
The most important application of microarray in gene expression analysis is to classify the unknown tissue samples according to their gene expression levels with the help of known sample expression levels. In this paper, we present a nonparallel plane proximal classifier (NPPC) ensemble that ensures high classification accuracy of test samples in a computer-aided diagnosis (CAD) framework than that of a single NPPC model. For each data set only, a few genes are selected by using a mutual information criterion. Then a genetic algorithm-based simultaneous feature and model selection scheme is used to train a number of NPPC expert models in multiple subspaces by maximizing cross-validation accuracy. The members of the ensemble are selected by the performance of the trained models on a validation set. Besides the usual majority voting method, we have introduced minimum average proximity-based decision combiner for NPPC ensemble. The effectiveness of the NPPC ensemble and the proposed new approach of combining decisions for cancer diagnosis are studied and compared with support vector machine (SVM) classifier in a similar framework. Experimental results on cancer data sets show that the NPPC ensemble offers comparable testing accuracy to that of SVM ensemble with reduced training time on average.
international conference on information technology coding and computing | 2000
Jana Dittmann; Anirban Mukherjee; Martin Steinebach
Watermarking has become a major topic to solve authentication problems and copyright protection as major security demands in digital marketplaces. A wide variety of watermarking techniques have been proposed in the literature. Most techniques have been developed for still images; currently the research community is also enforcing approaches for other multimedia data like video, audio and 3D models. In our paper we summarize the main watermarking parameters and introduce a media independent classification scheme. Our classification scheme is based on the application areas. We show the important parameters and possible attacks. Based on our proposed classification the quality of the watermarking techniques can be evaluated. Furthermore we address the need for combining digital video and audio watermarking for media authentication.
Signal Processing | 2010
Santanu Ghorai; Shaikh Jahangir Hossain; Anirban Mukherjee; Pranab K. Dutta
In our previous research we observed that the nonparallel plane proximal classifier (NPPC) obtained by minimizing two related regularized quadratic optimization problems performs equally with that of other support vector machine classifiers but with a very lower computational cost. NPPC classifies binary patterns by the proximity of it to one of the two nonparallel hyperplanes. Thus to calculate the distance of a pattern from any hyperplane we need the Euclidean norm of the normal vector of the hyperplane. Alternatively, this should be equal to unity. But in the formulation of NPPC these equality constraints were not considered. Without these constraints the solutions of the objective functions do not guarantee to satisfy the constraints. In this work we have reformulated NPPC by considering those equality constraints and solved it by Newtons method and the solution is updated by solving a system of linear equations by conjugate gradient method. The performance of the reformulated NPPC is verified experimentally on several bench mark and synthetic data sets for both linear and nonlinear classifiers. Apart from the technical improvement of adding those constraints in the NPPC formulation, the results indicate enhanced computational efficiency of nonlinear NPPC on large data sets with the proposed NPPC framework.
Journal of Clinical Pathology | 2005
Ranjan Rashmi Paul; Anirban Mukherjee; Pranab K. Dutta; Swapna Banerjee; Mousumi Pal; Jyotirmoy Chatterjee; Keya Chaudhuri; K Mukkerjee
Aim: To describe a novel neural network based oral precancer (oral submucous fibrosis; OSF) stage detection method. Method: The wavelet coefficients of transmission electron microscopy images of collagen fibres from normal oral submucosa and OSF tissues were used to choose the feature vector which, in turn, was used to train the artificial neural network. Results: The trained network was able to classify normal and oral precancer stages (less advanced and advanced) after obtaining the image as an input. Conclusions: The results obtained from this proposed technique were promising and suggest that with further optimisation this method could be used to detect and stage OSF, and could be adapted for other conditions.
IEEE Transactions on Neural Networks | 2010
Santanu Ghorai; Anirban Mukherjee; Pranab K. Dutta
In this brief we have proposed the multiclass data classification by computationally inexpensive discriminant analysis through vector-valued regularized kernel function approximation (VVRKFA). VVRKFA being an extension of fast regularized kernel function approximation (FRKFA), provides the vector-valued response at single step. The VVRKFA finds a linear operator and a bias vector by using a reduced kernel that maps a pattern from feature space into the low dimensional label space. The classification of patterns is carried out in this low dimensional label subspace. A test pattern is classified depending on its proximity to class centroids. The effectiveness of the proposed method is experimentally verified and compared with multiclass support vector machine (SVM) on several benchmark data sets as well as on gene microarray data for multi-category cancer classification. The results indicate the significant improvement in both training and testing time compared to that of multiclass SVM with comparable testing accuracy principally in large data sets. Experiments in this brief also serve as comparison of performance of VVRKFA with stratified random sampling and sub-sampling.
international conference on systems | 2010
Santanu Ghorai; Anirban Mukherjee; Sanghamitra Sengupta; Pranab K. Dutta
The discovery of DNA microarray technologies have given immense opportunity to make gene expression profiles for different cancer types. Besides binary classification such as normal versus tumor samples the discrimination of multiple tumor types is also important. In this work, we have first extended the recently developed binary nonparallel plane proximal classifier (NPPC) to multiclass NPPC by decomposition techniques. The multiclass NPPC is then used in a computer aided diagnosis framework to classify multicategory cancer from gene expression data by selecting very few genes by using mutual information criterion. The idea of binary NPPC ensemble is extended to form multiclass NPPC ensemble. Besides usual majority voting method, we have introduced minimum average proximity based decision combiner for multiclass NPPC ensemble. The effectiveness of the proposed method are demonstrated on four benchmark microarray data sets and compared with support vector machine (SVM) classifier in a similar framework.
Oral Oncology | 2008
M.E. Tathagata Ray; D. Shivashanker Reddy; Anirban Mukherjee; Jyotirmoy Chatterjee; Ranjan Rashmi Paul; Pranab K. Dutta
This paper concentrates on the segmentation of histological images of oral sub-mucous fibrosis (OSF) into its constituent layers. In this regard hybrid segmentation algorithm shows very interesting results. The segmentation results depict the superiority of hybrid segmentation algorithm (HSA) in comparison to region growing algorithm (RGA). In clinical sense, the presented method provides an automatic means for segmenting histological layers (reference class map provided by the expert). The method shows potential in mimicking clinical acumen to act as a support system to oncologist.
ieee india conference | 2010
Santanu Ghorai; Shaikh Jahangir Hossian; Anirban Mukherjee; Pranab K. Dutta
In this work we have reformulated the twin support vector machine (TWSVM) classifier by considering unity norm of the normal vector of the hyperplanes as the constraints. TWSVM with unity norm hyperplanes removes the shortcomings of the classical TWSVM formulation. The resulting new formulation is a nonlinear programming problem which is solved by sequential quadratic optimization method. The performance of the modified classifier verified experimentally on synthetic as well as on benchmark data sets.