Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

B. Ravichandran

dblp:15/2383 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Image recognition and object detection · 50% 3D vision · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › object matching
model-based matching
0.011994
Model-Based Matching Using a Hybrid Genetic Algorithm · ICRA 1994
Computer vision › Image recognition and object detection
object recognition
0.011994
Model-Based Matching Using a Hybrid Genetic Algorithm · ICRA 1994
Mathematical optimization
combinatorial optimization
0.011994
Model-Based Matching Using a Hybrid Genetic Algorithm · ICRA 1994
Mathematical optimization › evolutionary computation
genetic algorithm
0.011994
Model-Based Matching Using a Hybrid Genetic Algorithm · ICRA 1994

Methods — techniques the papers use, named apart from their topics

minimum description length · 0.0hybrid genetic algorithm · 0.0
YearPublicationVenuePosition
2005 XCS for robust automatic target recognition
abstract
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyond so-called standard operating conditions (SOCs, those conditions for which training data is available) to extended operating conditions (EOCs, conditions of known targets that cannot be foreseen and trained for). EOCs include things like vehicle-specific variations, environmental effects (mud, etc.), unanticipated viewing angles, and articulation of components of the target (hatches, turrets, etc.). This paper presents experiments where XCS addresses structural generalization over global and local features normally used in ATR classification. In many SOCs, these features are adequate for target recognition. Our goal with XCS is to form generalized rules that utilize these features for effective ATR in EOCs. Results show that XCS is effective in this generalization task. Conclusions and future directions for research are discussed.
B. Ravichandran, Avinash Gandhe, Robert E. Smith 0001
GECCO1
2000 Statistical Traffic Modeling for Network Intrusion Detection
abstract
Examines the application of statistical traffic modeling for detecting novel attacks against computer networks. We discuss the application of network activity models and application models using the 1998 DARPA Intrusion Detection Evaluation data set. Network activity models monitor the volume of traffic in the network, while application models describe the operation of application protocols. By plotting the ROC (receiver operating characteristic) curves induced by the traffic activity, we quantify the effectiveness of network activity models in discriminating normal connections from attack connections generated by denial-of-service and probing attacks. It is verified that denial-of-service and probing attacks leave traces on simple network activity models, with rates of false alarm which are comparable to the false alarm rates obtained by the participants of the 1998 DARPA evaluation, in which much more complex detection schemes were utilized. For application models, we use the Kolmogorov-Smirnov test to show that attacks using telnet connections in the DARPA data set form a population which is statistically different from the normal telnet connections. The statistics used in our study are the number of bytes from the responder and the responder-originator byte ratio. Again, our results are comparable to those obtained in the DARPA evaluation.
João B. D. Cabrera, B. Ravichandran, Raman K. Mehra
MASCOTS2
1994 Model-Based Matching Using a Hybrid Genetic Algorithm
abstract
This paper describes a hybrid genetic algorithm (HGA) for model-based matching of observed scenes that are noisy, where only a small fraction of the scene features are expected to correspond to the model features. The problem of finding the match is framed within a hypothesize-and-test paradigm and the HGA, with a representation size minimum description length evaluation function, is formulated as the method to search for the match. Unlike most genetic algorithms, the HGA introduced is based on an integer representation with a position based recombination operator. An assignment operator, also used as a reproduction operator, introduces domain-specific constraints and defines the hybrid nature of the algorithm. Results for models and scenes derived from images of occluded and cluttered environments are described. The results show the HGA to be an efficient search technique and the related matching technique to be robust in a variety of cases.>
B. Ravichandran, Arthur C. Sanderson
ICRA1