Search PubMed⌕ Search

Biomedical subjects

Nikhil R Pal

Publications and source records attributed to Nikhil R Pal.

5 recordsLinked to original sources

Genetic programming for simultaneous feature selection and classifier design.

This paper presents an online feature selection algorithm using genetic programming (GP). The proposed GP methodology simultaneously selects a good subset of features and constructs a classifier using the selected features. For a c-class problem, it provides a classifier having c trees. In this context, we introduce two new crossover operations to suit the feature selection process. As a byproduct, our algorithm produces a feature ranking scheme. We tested our method on several data sets having dimensions varying from 4 to 7129. We compared the performance of our method with results available in the literature and found that the proposed method produces consistently good results. To demonstrate the robustness of the scheme, we studied its effectiveness on data sets with known (synthetically added) redundant/bad features.

Algorithms↗

A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses.

We propose a two layer neural network for computation of an approximate convex-hull of a set of points or a set of circles/ellipses of different sizes. The algorithm is based on a very elegant concept - shrinking of a rubber band surrounding the set of planar objects. Logically, a set of neurons is placed on a circle (rubber band) surrounding the objects. Each neuron has a parameter vector associated with it. This may be viewed as the current position of the neuron. The given set of points/objects exerts a force of attraction on every neuron, which determines how its current position will be updated (as if, the force determines the direction of movement of the neuron lying on the rubber band). As the network evolves, the neurons (parameter vectors) approximate the convex-hull more and more accurately. The scheme can be applied to find the convex-hull of a planar set of circles or ellipses or a mixture of the two. Some properties related to the evolution of the algorithm are also presented.

Algorithms↗

Design of vector quantizer for image compression using self-organizing feature map and surface fitting.

We propose a new scheme of designing a vector quantizer for image compression. First, a set of codevectors is generated using the self-organizing feature map algorithm. Then, the set of blocks associated with each code vector is modeled by a cubic surface for better perceptual fidelity of the reconstructed images. Mean-removed vectors from a set of training images is used for the construction of a generic codebook. Further, Huffman coding of the indices generated by the encoder and the difference-coded mean values of the blocks are used to achieve better compression ratio. We proposed two indices for quantitative assessment of the psychovisual quality (blocking effect) of the reconstructed image. Our experiments on several training and test images demonstrate that the proposed scheme can produce reconstructed images of good quality while achieving compression at low bit rates. Index Terms-Cubic surface fitting, generic codebook, image compression, self-organizing feature map, vector quantization.

Algorithms↗

A neuro-fuzzy scheme for simultaneous feature selection and fuzzy rule-based classification.

Most methods of classification either ignore feature analysis or do it in a separate phase, offline prior to the main classification task. This paper proposes a neuro-fuzzy scheme for designing a classifier along with feature selection. It is a four-layered feed-forward network for realizing a fuzzy rule-based classifier. The network is trained by error backpropagation in three phases. In the first phase, the network learns the important features and the classification rules. In the subsequent phases, the network is pruned to an "optimal" architecture that represents an "optimal" set of rules. Pruning is found to drastically reduce the size of the network without degrading the performance. The pruned network is further tuned to improve performance. The rules learned by the network can be easily read from the network. The system is tested on both synthetic and real data sets and found to perform quite well.

Fuzzy Logic↗

A neuro-fuzzy framework for inferencing.

Earlier we proposed a connectionist implementation of compositional rule of inference (COI) for rules with antecedents having a single clause. We first review this net, then generalize it so that it can deal with rules with antecedent having multiple clauses. We call it COIN, the compositional rule of inferencing network. Given a relational representation of a set of rules, the proposed architecture can realize the COI. The outcome of COI depends on the choice of both the implication function and the inferencing scheme. The problem of choosing an appropriate implication function is avoided through neural learning. COIN can automatically find a 'good' relation to represent a set of fuzzy rules. We model the connection weights so as to ensure learned weights lie in [0,1]. We demonstrate through extensive numerical examples that the proposed neural realization can find a much better representation of the rules than that by usual implication and hence results in much better conclusions than the usual COI.

Fuzzy Logic↗