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

Saravanakumar Srinivasan

dblp:06/5626 · also Saravana Srinivasan · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › image retrieval
content-based image retrieval
0.112009
An Adaptable Image Retrieval System With Relevance Feedback Using Kernel Machines and Selective Sampling · IEEE Trans. Image Process. 2009
Information retrieval
relevance feedback
0.112009
An Adaptable Image Retrieval System With Relevance Feedback Using Kernel Machines and Selective Sampling · IEEE Trans. Image Process. 2009
Information retrieval
similarity search
0.112009
An Adaptable Image Retrieval System With Relevance Feedback Using Kernel Machines and Selective Sampling · IEEE Trans. Image Process. 2009
Information retrieval › query formulation
query selection
0.012009
An Adaptable Image Retrieval System With Relevance Feedback Using Kernel Machines and Selective Sampling · IEEE Trans. Image Process. 2009

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

regularization theory · 0.1kernel machine · 0.1fisher information · 0.1
YearPublicationVenuePosition
2009 An Adaptable Image Retrieval System With Relevance Feedback Using Kernel Machines and Selective Sampling
abstract
This paper presents an adaptable content-based image retrieval (CBIR) system developed using regularization theory, kernel-based machines, and Fisher information measure. The system consists of a retrieval subsystem that carries out similarity matching using image-dependant information, multiple mapping subsystems that adaptively modify the similarity measures, and a relevance feedback mechanism that incorporates user information. The adaptation process drives the retrieval error to zero in order to exactly meet either an existing multiclass classification model or the user high-level concepts using reference-model or relevance feedback learning, respectively. To facilitate the selection of the most informative query images during relevance feedback learning a new method based upon the Fisher information is introduced. Model-reference and relevance feedback learning mechanisms are thoroughly tested on a domain-specific image database that encompasses a wide range of underwater objects captured using an electro-optical sensor. Benchmarking results with two other relevance feedback learning methods are also provided.
Mahmood R. Azimi-Sadjadi, Jaime Salazar, Saravanakumar Srinivasan
IEEE Trans. Image Process.3
2007 An Adaptable Connectionist Text-Retrieval System With Relevance Feedback
abstract
This paper introduces a new connectionist network for certain domain-specific text-retrieval and search applications with expert end users. A new model reference adaptive system is proposed that involves three learning phases. Initial model-reference learning is first performed based upon an ensemble set of input-output of an initial reference model. Model-reference following is needed in dynamic environments where documents are added, deleted, or updated. Relevance feedback learning from multiple expert users then optimally maps the original query using either a score-based or a click-through selection process. The learning can be implemented, in regression or classification modes, using a three-layer network. The first layer is an adaptable layer that performs mapping from query domain to document space. The second and third layers perform document-to-term mapping, search/retrieval, and scoring tasks. The learning algorithms are thoroughly tested on a domain-specific text database that encompasses a wide range of Hewlett Packard (HP) products and for a large number of most commonly used single- and multiterm queries.
Mahmood R. Azimi-Sadjadi, Jaime Salazar, Saravanakumar Srinivasan, Sassan Sheedvash
IEEE Trans. Neural Networks3
2005 An iterative relevance feedback learning algorithm for image retrieval systems
abstract
A new feature adaptation mechanism is proposed in this paper that captures the relevance feedback information provided by the expert users. This relevance information is retained for future usage and subsequently made available to other users. The search and retrieval processes are implemented through a two-layer connectionist network structure and the relevance feedback learning is incorporated by appropriately modifying the network structure. The developed algorithm is tested on an electro-optical imagery database collected from different underwater mine-like and non-mine-like objects.
Saravanakumar Srinivasan, Mahmood R. Azimi-Sadjadi
IJCNN1
2004 An adaptable connectionist text retrieval system with relevance feedback
abstract
This paper introduces a new connectionist network for large-scale text retrieval applications. A learning mechanism is proposed to optimally map the original query using relevance feedback from multiple expert users. The query mapping not only meets the requirements of the expert users but also preserves the positions and ranks of other relevant documents. An updating algorithm is also proposed to incorporate new documents (or delete the obsolete ones) into the system either one-by-one or in a batch mode without requiring to retrain the system. The algorithms are successfully tested on a large database and for a large number of most commonly used single-term or multi-terms queries.
Mahmood R. Azimi-Sadjadi, Jaime Salazar, Saravanakumar Srinivasan, Sassan Sheedvash
IJCNN3