Published Research Papers
Published Research Papers
Published Research Papers
ABSTRACT [2] to support features of images but it did not tell anything
The process of retrieval of relevant information from massive about relationship and associations between different contents
collection of documents, either multimedia or text documents of image. It also resulted in vain. The third model developed
is still a cumbersome task. Multimedia documents include was Dublin Core [3] that deals with semantic as well as
various elements of different data types including visible and structural content of image and text but it failed to depict
audible data types (text, images and video documents), relationship between text and image.
structural elements as well as interactive elements. In this With advancement in technology and predictions, some
paper, we have proposed a statistical high level multimedia IR probabilistic and futuristic models were also developed. In
model that is unaware of the shortcomings caused by classical following paper, statistical multimedia IR model has been
statistical model. It involves use of ontology and different proposed and compared with classical multimedia IR model.
statistical IR approaches (Extended Boolean Approach,
Bayesian Network Model etc) for representation of extracted 1. INTRODUCTION
text-image terms or phrases. Human knowledge is richest multimedia storage system.
A typical IR system that delivers and stores information is There are various mechanisms like vision, language that
affected by problem of matching between user query and expresses knowledge and information obtained from them
available content on web. Use of Ontology represents the must be processed by system efficiently. There must be
extracted terms in form of network graph consisting of nodes, systems designed that interprets and process human queries,
edges, index terms etc. The above mentioned IR approaches thus producing relevant results. It is often seen that users get
provide relevance thus satisfying user‟s query. baffled while searching results of their queries. The reasons
behind this are:
The paper also emphasis on analyzing multimedia documents
and performs calculation for extracted terms using different The content of information is unclear and needs user
statistical formulas. The proposed model developed reduces to refine that information.
semantic gap and satisfies user needs efficiently. The data stored on systems may or may not be
updated regularly.
Index Terms
Information Retrieval (IR), OWL, Statistical Approaches (BI There lies lower level of interaction between user
model, Extended Boolean Approach, Bayesian Network request and stored information on systems. The low-
Model), Query Expansion and Refinement. level links are called Semantic Gap.
Statistical approaches involves retrieved documents that
State of Art matches query closely in terms of statistics i.e. it must have
Research on multimedia information retrieval seems to be statistical model, calculations and analysis. These approaches
gargantuan and challenging task. Its areas are so diversified break given query into TERMS. Terms are words that occur
that it has lead to independent research in its own in collection of documents and are extracted automatically.
components. Firstly, there used to be human centered systems For reducing inconsistencies and semantic gap in multimedia
that focus on user‟s behavior and needs. Various experiments information, it is necessary to remove different forms of same
and studies were conducted in lieu of these systems. The users word because it makes user confused in choosing specific
were asked to present a set of valuable things in daily life. It terms that lies close to query. Some IR systems extract
was done on similarity of users. Some of choices are same phrases from documents. A phrase is a combination of two or
while some are different. Few of them prefer to use images more words that is found in document.
instead of text caption.
We have used approaches like extended Boolean approach,
In further experiments, it was noticed that new users were network model that performs structural analysis for retrieving
taking feedback from previous users. It leads to concept of text or image pairs. They also assign weights to given term.
relevance feedback module in information model. In early The weight is defined as measure of effectiveness of given
years, most research was done on content- based image term in distinguishing one document from other documents.
retrieval. The existing models are of different level and The paper has following sections: Section 2 describes
scope. These models are semantically unambiguous. For e.g.: architecture of classical multimedia model. Section 3 lets
IPTC model [1] uses location fields that focus on location of reader go through proposed IR model that is implemented
data but this model also failed due to lack of statistical using statistical approaches with the use of ontology. It also
approach. Another metadata model was developed i.e. EXIF requires conversion of low level features to high level features
35
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
using multimedia analysis. Section 4 deals with experimental There is communicational gap between user and
analysis and calculations depicting the relevance of proposed system. It is known that some systems are fast in
model. Finally, Section 5 concludes about paper. processing of calculations whereas human is not.
So, it leads to communication gap.
2. CONCEPT OF MULTIMEDIA IR
SYSTEM 2.1 Layout of Classical Multimedia Ir
The classical multimedia IR system has not proven effective
in extraction of relevant terms from document collections.
Model
Traditional IR systems are not intelligent that they are able to Since multimedia documents do not contain keywords or
produce accurate results. These systems use human perception symbols that facilitates easy process of searching through
to process query and returns results. The results may be document. Keeping this in mind, this classical model consists
relevant or non- relevant because these systems match query of Query Processing Module that translates the multimedia
with information stored in information database. information tokens into symbols / keywords which are easily
understood by system. The model has following modules:
The syntax of multimedia document is different from text
documents. Multimedia documents do not contain any Analysis Module: - IR system firstly analysis
information symbols or keywords that help in expressing multimedia documents and extract features from
information. They consist of: them. The features include low- level as well as
high- level features.
Visible and Audible Data Types: - It includes text,
images, graphs, videos and audio. Indexing Module: - The module that stores features
or terms retrieved from multimedia documents is
Structural Elements: - They are not visible. They called Indexing Module.
describe the organization of other data types.
Query Processing Module: - This module translates
The salient features of multimedia information [4] are given multimedia information tokens like audio, text-
below: pairs, videos etc into information symbols that are
now understood by system.
The information stored in document that is to be
searched can be audio, visual, videos etc. They Retrieval Module: - It finds rank of stored
communicate variety of messages and emotions that documents on basis of similar terms used in query.
helps to understand easily. After ranking of documents, the results satisfying
Structure information gives organization and query are presented to user.
usability in performing communications.
Query Query
Indexing Retrieval Application
Indexer
Results Documents
User
Multimedia
document
2.2 Shortcomings of Classical Multimedia It does not involve concept of ontology and
semantic associations for representing concepts
IR Model associated with terms in document.
They are explained below:
The terms which are relevant and similar to each
The classical model deals with terms or information other are identified at the end of phase by
symbols instead of maintaining relationships RETRIEVAL Module. The good model is one that
between them. It does not give any information has capability to distinguish between relevant and
about concepts used in extracted terms or image non relevant terms in the middle of phase in order to
pairs. prevent any confusion.
It creates semantic gap [6] between user and system The model does not involve the concept of re-use of
due to availability of irrelevant and superfluous queries. Once the query is expanded, it will not
information terms stored in information database of store in system for future use. Again, it has to
IR system. analyze large collection of documents and retrieve
terms from them.
36
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
It does not employ any statistical or probabilistic terms. In order to overcome this problem, the model includes
approaches for determining relevance of IR system. only those approaches that perform extraction of terms like
images, video, and text from multimedia documents as well as
3. PROPOSED HIGH LEVEL text documents.
MULTIMEDIA IR MODEL The block diagram of proposed model containing several
A model is being designed that employ use of statistical IR modules is shown below:
approaches for extracting terms from multimedia documents.
Ontology Module has been introduced that serves the task of
representing concepts and relationships among retrieved
Structure Analysis
IR Systems Terms and information
Multimedia
Documents (SMART, Indexer
(Text, Image pairs) symbols are extracted.
WEB (images, videos, INQUERY) Terms are phrases or
(stores info
symbols)
text etc) Collections (video, audio)
Ontology Module
Figure2 (a): Proposed High- level Statistical Multimedia IR Model
37
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
Ontology Module
INDEXING
Calculation of new
Query Refinement
and old weights
Dummy document
User
The model has following aspects: Low Computation and Cost: - The approaches that
are used to extract terms from documents are so
Improves user expressiveness: - It analyses terms efficient that they takes into account only relevant
that have close meaning to user‟s query and terms and discards non relevant terms. Only
expressive results are presented to user. relevant terms are expanded and it leads to saving of
Supports different modules: - Several modules like time and work.
Ontology Module, Extraction Module, Query
Expansion and Refinement have been introduced in
proposed model.
38
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
Good Retrieval Accuracy: - The model retrieves sub tasks that performs parallel to each other. It
only those terms from documents that satisfies helps in extraction of text- image documents by
user‟s information needs. dividing into smaller segments. Each segment holds
some information. As soon as each part is analyzed,
Pipelining Facility: - Pipelining means dividing of terms from different segments are retrieved and
complex tasks into certain number of independent combined to produce full document.
Original Image
3.1 Multimedia Document Analysis Module fully determine that random chosen documents are relevant or
There is large number of multimedia documents consisting of non relevant. The classical model works on low level
video text collections on web. The IR systems used in model multimedia analysis. The proposed multimedia model works
performs structural analysis of documents and extracts text- on high level multimedia analysis algorithm rather than low-
image terms from them [8]. At this stage, it is not possible to level analysis because of following reasons:
39
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
likelihood of terms in relevant documents is X = (Pk / 1- Pk)
They are related to prior and posterior probabilities. and in non relevant documents Y = (Uk / 1-Uk). Then Wk is
Prior means finding probability as earliest as given by X / Y. Wk is zero if Pk = UK, Wk > 0 if Pk > Uk
possible without knowing features of document.
Posterior means finding probability after examining The model concludes that the terms which occur many times
in single document is relevant but if same terms occur in large
40
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
number of large number of documents , then it is not relevant. statements describing term is relevant or not. A graph has
So, a weight function is developed that varies from idf to Wk following elements:
formula.
Document Nodes (Dn) : - They are called Root
Limitation of this model: - It is not able to distinguish Nodes
between low frequency terms and high frequency terms in
context of weights. It gives weight of low frequency terms as Text Nodes (Tn): - They are child nodes of
same as those of high frequency terms. It does not able to document nodes. It may include audio, video nodes,
extract terms from multiple queries also. So, to overcome text image nodes etc. So, child nodes have multiple
these problems, we have used Inference Network Model. representations of document.
(b) Bayesian Inference Network Model Concept Representation Nodes (CRn): - They are
It is one of statistical approach for extraction of terms from child of text nodes. The concepts used in terms that
multimedia documents with the help of constructing graph are in text nodes are represented by CR nodes.
called as Inference Network Graph. Besides computing These nodes are index terms or keywords that are
probabilities for different nodes, this model also determines matched in document and retrieves relevant terms.
concepts between various retrieved terms. It provides surety Document Network: - It is network consisting of
that user needs are fulfilled because it also combines multiple Document nodes, Text nodes, and CR nodes. It is
sources of evidence regarding relevance of document to user not tree as it has multiple roots and nodes.
query. Document Network is Directed Acyclic Graph
Graph Structure: - Inference Network is a graph that has (DAG) since it has no loop. The representation of
nodes connected by edges. Nodes represent True/ false document network for different documents from D1
to Dn is shown as:
D1 D2 ……………………. Dn-1 Dn
Tn
T2 Tn-1
T1
CR2 CRn
CR1 CRn-1
Figure4: Document Network (It describes concepts used in multiple terms from different documents)
Query Network: - Since we have extracted concepts describe relevant terms are shown in form of results
in Document Network, it is possible that different and presented to user.
concepts are used in same query nodes or different
The representation of query network for different
concepts in different nodes. The concepts that
query nodes from Q1 to Qn is shown as:
Q1 Qn-1 Qn
Query Nodes
r1 r2 rn
Leaf Nodes (Results)
41
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
Conceptualization of concepts, thus organizing them in Each document node has concept nodes that are treated as
hierarchical fashion [10]. Various phases of ontology module Vertices. An edge from one node to other node represents
are described below: - relationship among concepts.
(a) Creation of Ontology or Ontology Representation: -
Inference Graph consists of document nodes ( root nodes).
Ti
End for
CRi
Class Result = new (owl: class) // It is one of best methods for automatic query expansion. It
Result represents leaf nodes// expands terms from query, rank and weights them by using
certain formula.
Result.Id = Result. Name
LCA = Local Feedback Analysis + Global Analysis
DatatypeProperty ResultDP = new (owl: DatatypeProperty)
// to show value of leaf nodes// It is local because concept relevant terms are only retrieved
from globally retrieved documents. It is global because
ResultDP.Id = Result.Name, Result. Value; documents related to given query topic are selected randomly
// Leaf nodes have name and value// from huge collection of documents present on web (like we
Result.AddDomain (Result) have selected three documents related to semantic web from
web). When we put query in Google and press ENTER, query
For each edge E of Graph G is executed and it retrieves some documents. It is global
activity. LCA is concept based fixed length scheme. It
Class Relationship = new (owl: class)
expands user query and retrieves top n relevant terms that
Relationship.Id= “ “ closely satisfies query. It returns only fixed number of terms.
For each vertices of graph The retrieved terms are ranked accordingly as:
Relationship.Id= Relationship.Id + C.label; Belief (Q, C) = [ + log (af(c, ta)) idfc / log (n)] idfa
End for Where C= Concepts related to query Q
ResultDP.AddDomain (Relationship) Belief (Q, C) = Ranking Function
42
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
non relevant terms. It stores non relevant terms that are treated Solution: - Re-Use of queries.
as constant. Analysis: - The expanded and refined queries are stored in
database that is called as Query database. The query base
3.5.1 Query Refinement contains queries related to previously retrieved documents.
A tern can have different weights in each relevant document,
These queries are called Persistent Queries.
so there is need to refine query. Query Refinement means
calculation of old weights of expanded query terns in order to How to Use Persistent Queries with new Query?
produce new weights of same query terns. These query terms
are transformed into dummy document that is used for (a) If a new query is somewhat similar to persistent query,
Indexing. then result of new query is related to persistent query.
Here is formula used that calculates new weights of query (b) If user new query is not similar to persistent query in any
terms and produces optimal results by discarding non relevant way, then system has to find persistent query from database
terms. It is called Rocchio Formula. that satisfies new query to some extent.
Aim: - The aim of this formula is to increase weights of terms How to check similar queries?
that occur in relevant documents and decrease the weights of Using concept of Solution Region: - When search for an
terms occurring in non relevant documents. optimal query begins, system retrieves number of queries
Equation: - instead of only one query. All those queries are described in
query space. The region containing that query space is called
Qa (new) = x * Qa (old) + y * 1/ (RD) * ∑ wtaRD – z * 1/ Solution Region.
(NRD) * ∑ wtaNRD
We can check similarity between queries as the new queries
Where Qa (new) = New weight of query term a are compared with queries in solution region and if they get
matched, then both queries are said to be similar.
Qa (old) = old weights of tern s
RD = Relevant documents judged by user 4. EXPERIMENTAL ANALYSIS AND
NRD = Non- Relevant documents judged by user
CALCULATIONS
Consider a given sets of data. We have to compute
wtaRD = Weights of terms in relevant documents probabilities of relevant and non relevant terms and hence
calculate weight function for each term.
wtaNRD = Weights of terms in non relevant documents
∑ wtaRD = All weights of RD are added together
Given data:
Total number of relevant documents (R) = 10 Total number of Non relevant documents (N-r) = 15
43
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
20
Total no. of relevant
10 documents
0 Total no. of non relevant
0 5 10 15 documents
Total no of documents
Relevant Documents
For long queries, the concept of Continuous Random [3] Borgo, S., Masolo, C.: Foundational choices in DOLCE.
Variables can be used. Further, long queries may have some In: Handbook on Ontologies. 2nd edn. Springer (2009)
limit or they are infinite. For queries having limit, [4] Joao Miguel Costa Magalhaes: „Statistical Models for
approximation is used. The terms are integrated to particular Semantic – Multimedia Information Retrieval‟,
interval and produce results proximity to user‟s requirements. September 2008.
44
International Journal of Computer Applications (0975 – 8887)
Volume 94 – No 2, May 2014
[5] Meghini C, Sebastiani F, and Straccia U: „A model of 4th IET International Conference on Advances in
multimedia information retrieval‟ Journal of ACM Medical, Signal and Information Processing (MEDSIP
(JACM), 48(5), pages 909–970, 2001. 2008), January 2008 page 314.
[6] Grosky, W.I., Zhao, R.: „Negotiating the semantic gap: [20] S.Vigneshwari, M.Aramudhan: „An Ontological
From feature maps to semantic landscape‟, Lecture Notes Approach for effective knowledge engineering‟,
in Computer Science 2234 (2001). International Conference on Software Engineering and
Mobile Application Modeling and Development
[7] Adams, W. H., Iyengart, G., Lin, C. Y., Naphade, M. R., (ICSEMA 2012), January 2012 page 5.
Neti, C., Nock, H. J., and Smith, J.:‟ Semantic indexing
of multimedia content using visual, audio and text cues‟ [21] M.A. Moraga, C.Calero, and M.F. Bertoa: „Improving
EURASIP Journal on Applied Signal Processing 2003 interpretation of component-based systems quality
(2), pages 170-185. through visualization techniques‟, IET Software, Volume
4, Issue 1, February 2010, p. 79 – 90, DOI: 10.1049/iet-
[8] Datta, R., Joshi, D., Li, J., and Wang, J. Z.: „Image sen.2008.0056,Print ISSN 1751-8806, Online
retrieval: ideas, influences, and trends of the new age‟ ISSN 1751-8814.
ACM Computing Surveys, 2008.
[22] Michael S.Lew, Nicu Sebu, Chabane Djeraba and
[9] Hofmann, T., and Puzicha: „Statistical models for co- Ramesh Jain: „Content-based Multimedia Information
occurrence data. Technical Report‟, Massachusetts Retrieval: State of Art and Challenges‟, In ACM
Institute of Technology, 1998 Transactions on Multimedia Computing,
[10] M. Preethi, Dr. J. Akilandeswari,: „Combining Retrieval Communications, and Applications (TOMCCAP), Feb
with Ontology Browsing‟, International Journal of 2006.
Internet Computing, Vol.1, Issue-1”, 2011 [23] Alberto Del Bimbo, Pietro Pala: „Content- based retrieval
[11] Croft, W. B., Turtle, H. R., and Lewis, D. D.: „The use of of 3D Models‟, In ACM Transactions on Multimedia
phrases and structured queries in information retrieval‟, Computing, Communications, and Applications
In ACM SIGIR Conf. on research and development in (TOMCCAP), Vol. 2 Issue 1, Feb 2006, Pages 20-43.
information retrieval, Chicago, Illinois, United States [24] Carlo Meghini, Fabrizio Sebastiani and Umberto
2004 Straccia: „A model of multimedia information retrieval‟,
[12] Rifat Ozcan, Y. Alp: „Concept Based Information Access Journal of ACM (JACM), Vol 48, Issue 5 September
using Ontologies and Latent Semantic Analysis‟, 2001, Pages 909-970.
Technical Report, 2004-08. [25] Simone Sanitini: „Efficient Computation of queries on
[13] F. Crestani, M. Lalmas, C.J. van Rijsbergen, and I. feature streams‟, In ACM Transactions on Multimedia
Campbell: „Is this document relevant? . . . Probably: A Computing, Communications, and Applications
survey of probabilistic models in information retrieval‟, (TOMCCAP), Vol. 7 Issue 4, November 2011, Article
ACM Computing Surveys, 30(4), pages 528- 552, No. 38
December 1998. [26] Graham Bennett, Falk Scholer and Alexandra: „A
[14] Manning C.D., Raghavan P., and Schu¨tze H: „An comparative study of probabilistic and language models
Introduction to Information Retrieval‟, Cambridge for information retrieval‟, In Proceedings of nineteenth
University Press, Cambridge, 2007. conference on Australian database ADC‟08, Vol.75
ISBN: 978-1-920682-56-9, Pages 65-74.
[15] CAI, D., Yu, S. Wen, J.-R., and Ma, W.-Y: „Extracting
content structure for Web pages based on visual ABOUT THE AUTHORS
Representation‟. In Asia Pacific Web Conference 2003
[16] Metzler, D. Manmatha, R: „An inference network Gagandeep Singh has completed his B.Tech (CSE) from
approach to image retrieval‟, In Enser, P.G.B., GTBIT affiliated to Guru Gobind Singh Indraprastha
Kompatsiaris, Y., O‟Connor, N.E. Smeaton, A.F. University, Delhi. His Research areas include Semantic Web,
Smeulders, A.W.M., eds.: CIVR. Volume 3115 of Information Retrieval, Data Mining, Remote Sensing (GIS)
Lecture Notes in Computer Science. Springer (2004) 42– and Knowledge Engineering.
50.
Vishal Jain has completed his M.Tech (CSE) from USIT,
[17] Faloutsos C., Barber R., Flickner M., Hafner J., and Guru Gobind Singh Indraprastha University, Delhi and doing
Niblack W: „Efficient and effective querying by image PhD in Computer Science and Engineering Department,
content‟, J. Intell. Inform. Syst., 3:231–262, 1994. Lingaya‟s University, Faridabad. Presently, He is working as
Assistant Professor in Bharati Vidyapeeth‟s Institute of
[18] Ed Greengrass: „Information Retrieval: A Survey‟,
Computer Applications and Management, (BVICAM), New
November 2000
Delhi. His research area includes Web Technology, Semantic
[19] O.S. Al- Kadi: „Combined Statistical and Model based Web and Information Retrieval. He is also associated with
texture features for improved image classification‟, CSI, ISTE.
IJCATM : www.ijcaonline.org 45