scispace - formally typeset
Search or ask a question
Author

Ishwar K. Sethi

Bio: Ishwar K. Sethi is an academic researcher from University of Rochester. The author has contributed to research in topics: Feature detection (computer vision) & Artificial neural network. The author has an hindex of 33, co-authored 153 publications receiving 5012 citations. Previous affiliations of Ishwar K. Sethi include Oakland University & Wayne State University.


Papers
More filters
Journal ArticleDOI
TL;DR: This work forms the correspondence problem as an optimization problem and proposes an iterative algorithm to find trajectories of points in a monocular image sequence and demonstrates the efficacy of this approach considering synthetic, laboratory, and real scenes.
Abstract: Identifying the same physical point in more than one image, the correspondence problem, is vital in motion analysis. Most research for establishing correspondence uses only two frames of a sequence to solve this problem. By using a sequence of frames, it is possible to exploit the fact that due to inertia the motion of an object cannot change instantaneously. By using smoothness of motion, it is possible to solve the correspondence problem for arbitrary motion of several nonrigid objects in a scene. We formulate the correspondence problem as an optimization problem and propose an iterative algorithm to find trajectories of points in a monocular image sequence. A modified form of this algorithm is useful in case of occlusion also. We demonstrate the efficacy of this approach considering synthetic, laboratory, and real scenes.

496 citations

Journal ArticleDOI
TL;DR: This work describes a scheme that is able to classify audio segments into seven categories consisting of silence, single speaker speech, music, environmental noise, multiple speakers' speech, simultaneous speech and music, and speech and noise, and shows that cepstral-based features such as the Mel-frequency cep stral coefficients (MFCC) and linear prediction coefficients (LPC) provide better classification accuracy compared to temporal and spectral features.

315 citations

Proceedings ArticleDOI
02 Nov 2003
TL;DR: This paper investigates different cross-modal association methods using the linear correlation model, and introduces a novel method for cross- modal association called Cross-modAL Factor Analysis (CFA), which shows several advantages in analysis performance and feature usage.
Abstract: Multimodal information processing has received considerable attention in recent years The focus of existing research in this area has been predominantly on the use of fusion technology In this paper, we suggest that cross-modal association can provide a new set of powerful solutions in this area We investigate different cross-modal association methods using the linear correlation model We also introduce a novel method for cross-modal association called Cross-modal Factor Analysis (CFA) Our earlier work on Latent Semantic Indexing (LSI) is extended for applications that use off-line supervised training As a promising research direction and practical application of cross-modal association, cross-modal information retrieval where queries from one modality are used to search for content in another modality using low-level features is then discussed in detail Different association methods are tested and compared using the proposed cross-modal retrieval system All these methods achieve significant dimensionality reduction Among them CFA gives the best retrieval performance Finally, this paper addresses the use of cross-modal association to detect talking heads The CFA method achieves 911% detection accuracy, while LSI and Canonical Correlation Analysis (CCA) achieve 661% and 739% accuracy, respectively As shown by experiments, cross-modal association provides many useful benefits, such as robust noise resistance and effective feature selection Compared to CCA and LSI, the proposed CFA shows several advantages in analysis performance and feature usage Its capability in feature selection and noise resistance also makes CFA a promising tool for many multimedia analysis applications

286 citations

Journal ArticleDOI
01 Oct 1990
TL;DR: How the mapping of decision trees into a multilayer neural network structure can be exploited for the systematic design of a class of layered neural networks, called entropy nets (which have far fewer connections), is shown.
Abstract: How the mapping of decision trees into a multilayer neural network structure can be exploited for the systematic design of a class of layered neural networks, called entropy nets (which have far fewer connections), is shown. Several important issues such as the automatic tree generation, incorporation of the incremental learning, and the generalization of knowledge acquired during the tree design phase are discussed. A two-step methodology for designing entropy networks is presented. The methodology specifies the number of neurons needed in each layer, along with the desired output, thereby leading to a faster progressive training procedure that allows each layer to be trained separately. Two examples are presented to show the success of neural network design through decision-tree mapping. >

269 citations

Journal ArticleDOI
TL;DR: This paper proposes a new active learning approach, confidence-based active learning, based on identifying and annotating uncertain samples, which takes advantage of current classifiers' probability preserving and ordering properties and is robust without additional computational effort.
Abstract: This paper proposes a new active learning approach, confidence-based active learning, for training a wide range of classifiers. This approach is based on identifying and annotating uncertain samples. The uncertainty value of each sample is measured by its conditional error. The approach takes advantage of current classifiers' probability preserving and ordering properties. It calibrates the output scores of classifiers to conditional error. Thus, it can estimate the uncertainty value for each input sample according to its output score from a classifier and select only samples with uncertainty value above a user-defined threshold. Even though we cannot guarantee the optimality of the proposed approach, we find it to provide good performance. Compared with existing methods, this approach is robust without additional computational effort. A new active learning method for support vector machines (SVMs) is implemented following this approach. A dynamic bin width allocation method is proposed to accurately estimate sample conditional error and this method adapts to the underlying probabilities. The effectiveness of the proposed approach is demonstrated using synthetic and real data sets and its performance is compared with the widely used least certain active learning method

223 citations


Cited by
More filters
Book
01 Jan 1983
TL;DR: The methodology used to construct tree structured rules is the focus of a monograph as mentioned in this paper, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.
Abstract: The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.

14,825 citations

01 Jan 2002

9,314 citations

Journal ArticleDOI
TL;DR: The objective of this review paper is to summarize and compare some of the well-known methods used in various stages of a pattern recognition system and identify research topics and applications which are at the forefront of this exciting and challenging field.
Abstract: The primary goal of pattern recognition is supervised or unsupervised classification. Among the various frameworks in which pattern recognition has been traditionally formulated, the statistical approach has been most intensively studied and used in practice. More recently, neural network techniques and methods imported from statistical learning theory have been receiving increasing attention. The design of a recognition system requires careful attention to the following issues: definition of pattern classes, sensing environment, pattern representation, feature extraction and selection, cluster analysis, classifier design and learning, selection of training and test samples, and performance evaluation. In spite of almost 50 years of research and development in this field, the general problem of recognizing complex patterns with arbitrary orientation, location, and scale remains unsolved. New and emerging applications, such as data mining, web searching, retrieval of multimedia data, face recognition, and cursive handwriting recognition, require robust and efficient pattern recognition techniques. The objective of this review paper is to summarize and compare some of the well-known methods used in various stages of a pattern recognition system and identify research topics and applications which are at the forefront of this exciting and challenging field.

6,527 citations

MonographDOI
01 Jan 2006
TL;DR: This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms, into planning under differential constraints that arise when automating the motions of virtually any mechanical system.
Abstract: Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms. The treatment is centered on robot motion planning but integrates material on planning in discrete spaces. A major part of the book is devoted to planning under uncertainty, including decision theory, Markov decision processes, and information spaces, which are the “configuration spaces” of all sensor-based planning problems. The last part of the book delves into planning under differential constraints that arise when automating the motions of virtually any mechanical system. Developed from courses taught by the author, the book is intended for students, engineers, and researchers in robotics, artificial intelligence, and control theory as well as computer graphics, algorithms, and computational biology.

6,340 citations