Volume 25

Number 3
May - June 2008
 IETE TECHNICAL REVIEW
The Institution of Electronics and Telecommunication Engineers

PRESIDENT
S Narayana

VICE-PRESIDENTS
A K Agarwal P N Chopra Anita G Dandekar

PUBLICATIONS COMMITTEE

Chairman
M L Gupta
Co-Chairman
M C Chandra Mouly

Members
H O Agrawal S S Agrawal Smriti Dagur
M Jagadesh Kumar Surendra Pal Giridhar R Joshi
T K De T S Rathore S K Kshirsagar

Coopted
K M Paul K S Prakash Rao
Special Invitee
S C Dutta Roy P Banerjee

EDITORIAL BOARD
Chairman
Dilip Sahay

Members
H O Agrawal A K Bhatnagar R G Gupta
S S Motial Neeru Mohan Biswas H Kaushal

Secretary General Dy Managing Editor

V K Panday A P Sharma

The IETE Technical Review invites readable articles, preferably without mathematical expressions, state-of-the-art review papers
on current and futuristic technologies in the areas of electronics, telecommunication, computer science & engineering, information
technology (IT) and related disciplines. In addition, informative and general interest articles describing innovative products &
applications, analysis of technical events, articles on technology assessment & comparison, new & emerging topics of interest to
professionals are also welcome. While all the papers submitted will go through the same detailed review process, short papers and
Practical Designs will receive special attention to enable early publication. For submission of articles, please see 3rd cover of this
issue. Detailed guidelines to authors may be seen on IETE Website : http://www.iete.org under the heading ‘Publications.’
Annual Subscription : Subscription and Advertising rates are available on request and also on website: iete.org
Address for correspondence :
Managing Editor, IETE, 2, Institutional Area, Lodi Road, New Delhi 110 003, Telephone : +91 (11) 43538841-45
Fax : +91 (11) 24649429, email : ietend@gmail.com; mgeditor@iete.org, Website : http://www.iete.org; http://
www.iete.info
FREE TO IETE CORPORATE MEMBERS : (Cost of Production: Rs.19.00)

COPYRIGHT
IETE Technical Review is published bimonthly by the Institution of Electronics and Telecommunication Engineers. All rights
of publication are reserved by the IETE.
Copyright and Reprint permission : Abstracting is permitted with credit to the source. Libraries are permitted to photocopy
for private use of readers.
It is the IETE policy to own the copyright of the scientific and technical papers it publishes on behalf of the authors and their
employers, and to facilitate the appropriate reuse of this material by others. Authors are required to sign an IETE copyright transfer
form before publication. This form is available online in IETE website:www.iete.org. IETE retains the authors’ and their employers’
right to reuse their material for their own purposes.
 97

IETE TECHNICAL REVIEW

Published bimonthly by the Institution of Electronics and Telecommunication Engineers

May-June 2008 Vol 25 No 3

CONTENTS

97 SCAN 123 Corner Detection Algorithms for Digital

Images in Last Three Decades
Dilip Sahay
Ambar Dutta, Avijit Kar and B N Chatterji

99 An Automated Beam Extraction

System for Microtron 135 SPIHT: Highly Efficient Technique for
A M Khan, Mohammad Mahfooz Sheikh, Image Transmission and Coding
Ganesh, B Hanumaiah and K Siddappa Nilkanth B Chopade and A A Ghatol

105 Semantic Web Service Composition

Sandeep Kumar and R B Mishra

Note : The Institution of Electronics and Telecommunication Engineers assumes no responsibility for the statements and
opinions expressed by individual authors.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 98

SCAN

IETE Technical journal has made a few changes. Cover page design has
been changed to have a pleasing standard format. IETE headquarters is processing
for online submission and review of articles in IETE journal. The publication
department is putting in lots of efforts to make the IETE Technical Review of good
standard which may be accepted by readers as well as internationally.
In this issue of Technical Review, there are four articles.
The first article by A M Khan et al is regarding a computer based system
developed for a computerized control of a specific Beam Extraction System. This
was designed and tested according to the specification of the Beam Extraction
System. The authors claim that this design system has improvement over the
existing one. Beam Extraction System which is explained in this article is for
extracting electronic beam from desired orbit which is simple to operate remotely
and cost effective.
The second article is on Semantic Web Service Composition. This article
reviews some of the popular semantic web service composition method and
presents the same in tabular format. The systems based on semantic web require
performing many processes. However, in this article, authors Sandeep Kumar
and R B Mishra primarily deals regarding sementic web service composition
techniques.
Third article in this review is by Ambar Dutta et al. The paper present literature
survey of existing Corner Detection Algorithms developed during the last three
decades.
The fourth article in this Technical Review is by Chopade and Ghatol which
presents wavelet based coding algorithm, SPIHT for coding and compressing an
image mail data. The authors claim that this coding and decoding process is
comparatively fast.

Dilip Sahay
Chairman, Editorial Board

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 99

An Automated Beam Extraction

System for Microtron
A M KHAN, MOHAMMAD MAHFOOZ SHEIKH, GANESH,
B HANUMAIAH AND K SIDDAPPA

ABSTRACT
In this paper we report on a computer based system developed for the automated control of the Beam Extraction
System (BES) of Microtron (electron accelerator facility at Mangalore University). The BES helps in extracting the
electron beam from a desired orbit. The automated system is designed with two levels. At the system level, there is a
microcontroller along with some circuit components to place the mouth of the extraction channel at a particular orbit
so that an electron beam of a particular energy can be extracted from the microtron for experimental studies. The
computer kept in the control room away from the microtron machine (i.e. user level) passes the orbit number from
which the beam is to be extracted to the microcontroller. This automated system is very simple, easy to operate and
cost effective. It also helps in accurate setting of extraction channel and extraction of electron beam of desired
energy. The work described here is an attempt to improvise on the existing system and computerise the same for
accurate settings and control from a remote distance.

INTRODUCTION electrons is extracted from different orbits by

Microtron is an electron accelerator facility at
Mangalore University which accelerates electrons
to an energy range of 4-12 MeV. There are various
units which help in the operation of the microtron
and all these units are controlled using a control
system [1]. The electrons are emitted from the
electron emitter when it is heated to a temperature
of 1500 °C to 2000 °C. These electrons travel in the
microtron cavity in a circular path of increasing
radii called orbits, under the influence of magnetic
field. An RF power is applied to the cavity to
accelerate the electrons. On the application of each
RF pulse, the electrons jump into a circular path
with a greater radius. Thus, an electron beam orbits
in a circular path with increasing radii having a
common tangent at the emitter. The energy of
electron beam is different in different orbits and it
increases with increase in radius of the orbit. The
cross sectional view of the beam pattern exhibited
in the microtron is as shown in Fig 1. There are
many units in the microtron system which have to
be controlled and monitored for proper operation of
microtron [2-4]. One of the units of microtron which
help in extracting the electron beam is the Beam
Extraction System. The beam extraction system of
Microtron has been designed to extract electron
beam from any of the 14 orbits [5]. This beam of
means of an extraction mechanism which consists
of an extraction channel driven by two stepper
motors. The work described here emphasizes on
the design and development of an automated control
system to extract the electron beam from the
desired orbit. The extraction of the electron beam
from different orbits gives the electron beam with
different energy levels. The positioning of the mouth
of the extraction channel at the proper orbit is
essential in order to gain optimum energy of the
extracted beam.
SYSTEM AND ITS AUTOMATION
The existing system consists of bulky circuits
and the positioning of the mouth of the extraction
channel is done with the help of a stepper motor
control mechanism for both X- direction and Y-
direction. The distance (in mm) which the mouth of
the extraction channel must move in order to extract
the beam from the desired orbit is entered manually
with the help of a key pad. The driver circuit is thus
energised to rotate the stepper motor and move the
mouth of the extraction channel to the desired orbit.
With the help of ‘Inching Mode’, the stepper motor
can be moved in single steps to compensate any
error in the extraction of the optimum energy of the
electron beam from the desired orbit. This tedious

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 100

1 - Mouth of the Extraction Channel.

2 - Shaft to move the mouth of the
extraction channel with the stepper
motors.
3 - Microtron cavity where electron
beam pattern is exhibited.

Fig 1 Cross sectional view of the electron beam pattern in the microtron

manual operation can be minimised by the computer. The microcontroller receives data from
automation of the above described system. the computer and executes the microcontroller
program accordingly to rotate the stepper motors.
Since the orbits of the electron beam are fixed
These stepper motors are connected to the mouth
and electrons in every orbit have a definite energy,
of the extraction mechanism by means of a long
we can place the mouth of the extraction channel in
shaft that goes inside the microtron cavity. Thus by
that orbit and extract an electron beam of required
controlling the angle of rotation of the stepper
energy. The required energy value is entered by the
motors, the shaft is moved inward or outward to
user in the remote computer. The simple c code
position the mouth of the extraction channel in an
accepts the value and converts it to the orbit number
appropriate orbit. Since the rotation has to be in the
where the specified energy can be obtained. The
horizontal X direction and angular Y direction, two
previously set orbit is the reference and is always
motors are used to move the mouth of the extraction
kept in the data file. The newly computed orbit
channel. The number of steps the stepper motor
number is compared with the reference orbit number
requires to move the extraction channel from one
and the difference is computed. This difference
orbit to another are stored in a look - up table in the
data is passed to the MCU. The MCU receives the
microcontroller. Hence, the microcontroller moves
data from the remote computer and energises the
both the X and Y stepper motors by the required
driver circuits to rotate the stepper motor and place
number of steps to place the mouth of the extraction
the mouth of the extraction mechanism at the
channel in the desired orbit.
required orbit.

Data from the computer carries the information CIRCUIT DESCRIPTION AND WORKING
as to which orbit has to be selected for the
extraction of the electron beam. This data is sent to The Fig 2 shows the block diagram of the
the microcontroller through the parallel port of the control system used to control the beam extraction

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W


Data from
Computer
MCU CONTROL
LOGIC
Synchronisation
Clock
Fig 2 Block diagram of control system
system of microtron. The microcontroller used is
AT89C51 which is an Atmel make, low power, high
performance, 8-bit CMOS microcontroller with 4kB
of flash Programmable and Erasable Read Only
Memory (PEROM). It has 128x8 bit internal RAM,
32 programmable I/O lines and two 16-bit timers/
counters. The on-chip flash permits the program
memory to be reprogrammed by an in-system
programmer or a conventional non-volatile memory
programmer.
This combination of 8-bit CPU with flash
memory on a monolithic chip is a powerful, highly
flexible and cost-effective solution to many
embedded control applications [6,7]. The control
logic consists of an up/down counter and a decoder.
The CMOS technology up/down counter CD4029 is
used to count the clock for increasing the steps of
the stepper motor. This counter is controlled by a
single control pin for up/down counting. The TTL
series 74LS155 converts the binary count from the
counter to its decimal equivalent. The stepper
motor being a sequential device requires the binary
count of the counter to be decoded to its decimal
value. The output of the decoder is connected to the
driver circuit. Thus, the up/down count of the
counter is converted to sequential switching of the
driver circuits that rotate the stepper motors. An
external synchronisation clock circuit has been
used to provide synchronised clock for the timer/
Vol. 25, No. 3, May-June’08
101
DRIVER
STAGE
Stepper
Motors
counter of the microcontroller as well as the up/
down counters.
The stepper motor is connected to the control
logic that causes its rotation, through the motor
driver circuit. The stepper motor used has a 28
kg.cm torque with a 1.8 degree step. Thus a heavy
driver circuit (capable of handling approx. 1.5A) is
required to rotate the stepper motor. This
requirement is accomplished by using the 2N3055
transistors in the driver circuit. These power
transistors can draw current up to 15A without any
destruction. The four transistors are switched on/
off sequentially by the control logic to drive the four
coils of the stepper motor. When the transistor
conducts, 5V (Vcc) is applied to the motor coils and
current flows through them creating magnetic fields.
The magnetic field energy thus created is stored in
the coils and rotates the motors. When the
transistor stops conducting, power to the coils is
cut-off and the stored magnetic field collapses. Due
to the collapsing of the magnetic field a reverse
voltage (called inductive kick-back or back EMF) is
generated in the coils. The back EMF can be more
than 100 Volts and can destroy the coils itself by
burning them. Thus, diodes are required to be
connected across the coil in reverse direction to
absorb the reverse voltage spike. This voltage if
not absorbed by the diodes, may produce opposite
I E T E T E C H N I C A L R E V I E W
 102

Get the input data for

new position

Retrieve the old data

from the file and find
the difference

Send the
Is
complement of the
the
difference to the Yes
difference
microcontroller
negative?

No

Save the new data Send the difference

in the file for next to the
reference microcontroller

Fig 3 Flow diagram of the computer program

torque and cause improper rotation of the motor
and also damage the transistors. Any type of
rectifier or switching diodes of appropriate current
rating and reverse voltage breakdown rating can be
used. However the commonly available diodes the
1N4007 have been used here.
The AT89C51 microcontroller is programmed
using Atmel’s flash programmer. One step rotation
of the stepper motor used in the circuit is 1.8o.
When the motor is programmed for 200 steps, it
makes one complete rotation, i.e. 360o. The look-
up table is maintained at address location f000h to
count the steps of rotation for X and Y direction
motors. The data is checked for forward / backward
rotation by checking the MSB of the data. If the
MSB is “0” it is for forward rotation. Else if the MSB
is “1”, the data is for backward rotation. The required
count is loaded into the timer /counter registers of
the microcontroller that generates the required
delay. This delay at the microcontroller pin o/p
enables the up/down counter to count the steps of
rotation of the stepper motor. This count is
converted into a sequence of pulses that rotate the
stepper motor. The Figs 3 and 4 show the flow
diagrams of the programs for the working of the
system.
RESULTS
After a careful study of the requirements and
specification of the Beam Extraction System of the
microtron, the circuit described above was
designed, tested and was found to operate

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 103

Read the offset value for

rotation from the computer
port.

Check
Complement the offset Yes
if
value.
MSB = ‘1’ ?

No

Load corresponding count from

the look-up table to
timer/counter

Give enable signal and reset after Return

counter interrupts.

Fig 4 Flow diagram of microcontroller program

according to the required specifications of the
microtron. This circuit was first tested by simulating
it using an 8031 microcontroller kit and later the
program was burnt into AT89C51 microcontroller.
Thus, an automated control system for extraction
of electron beam of desired energy in the microtron
has been constructed. This system is more flexible
since the user can directly enter the value of
electron energy. The control can be done even from
a remote distance. The designed circuit is an
improvement over the existing circuit where the
distance by which the mouth of the extraction
channel has to be moved is entered manually.
information and support. We also thank the technical
staff of the Microtron Centre, Mangalore University, for
their help and support during every phase of the work.
REFERENCES
1. Y Sheth & B J Vaidya, Control system for Microtron
a Mangalore University, Proc. of the Intl. conference
on R&D using accelerators, p 103, September 1995.
2. A M Khan, Mohammed Mahfooz Sheikh, B
Hanumaiah, Ganesh & K Siddappa, Design of a
Computer based Control System for the Cathode
Power Supply of Microtron, Proc National Symposium
on Instrumentation (NSI) - 30, p 165, Nov-Dec 2005.

ACKNOWLEDGEMENTS 3. A M Khan, B Hanumaiah, Ganesh & K Siddappa,

Design of a control card for remote operation of the
We acknowledge the help rendered by Shri magnet power supply of microtron, Proc of the
Yogendra Sheth, Scientist, CAT, Indore and Dr. National Symposium on Radiation Physics (NSRP) -
Ganesh, Microtron Centre, in providing the technical 15, p 18, Nov 2003.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 104

4. A M Khan, Mohammed Mahfooz Sheikh, B
Hanumaiah, Ganesh & K Siddappa, Design of a
Computer based Control System for the Magnetron
Power Supply of Microtron, Proc. National
Conference on Emerging Trends in Embedded
Systems, p 1, Oct 2005.
5. S P Kapitza & V N Melekhin, The Microtron, 1st edition,
Hardwood Academic Publishers, London, 1969.
6. Muhammad A Mazidi & Janice G Mazidi, The
8051 microcontroller and embedded systems,
Fifth Indian Reprint, Pearson Education Inc.,
Delhi, 2003.
7. Kenneth J. Aiyala, The 8051 microcontroller
architecture programming and applications, Third
edition, Penram Intl Publications, Mumbai,
2003.

Authors
A M Khan obtained his MSc in Applied Electronics from Gulbarga University and his PhD from
Mangalore University. He is presently Reader & Chairman, Dept of Electronics, Mangalore
University. He has teaching and research experience of around 15 years. His research interests
include embedded systems, biomedical electronics and communications.
Address: Department of Electronics, Mangalore University, Mangalagangori 574 199.

email: <asifabc@yahoo.com>
* * *

Mohammad Mahfooz Sheikh obtained his MSc in Electronics from Mangalore University. He is
presently working as a research fellow in the Dept of Electronics, Mangalore University. He has
also worked at National Aerospace Laboratories, Bangalore as a graduate trainee. He is also
pursuing his PhD studies in the area of optical switching.

Address: Department of Electronics, Mangalore University, Mangalagangori 574 199.

email: <mahfooz_81@yahoo.com>
* * *
Ganesh Sanjeev obtained his MSc and PhD in Physics from Mangalore University. He is
presently working as senior physicist at Microtron Centre, Mangalore University. He has
research experience of over 15 years. He is involved in all the research activities associated
with the Microtron Centre.

Address: Microtron Centre, Mangalore University, Mangalagargotri 574 199.

email: <ganeshsanjeev@yahoo.com>
* * *
K Siddappa is former Director, Microtron Centre and former Vice-Chancellor, Bangalore
University. He is presently the Honorary Director, JSS Foundation for Science and Society,
Bangalore. He has teaching and research experience over three decades.

Address: Microtron Centre, Mangalore University, Mangalagargotri 574 199.

Paper No 13-B; Copyright © 2008 by the IETE.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 105

Semantic Web Service Composition

SANDEEP KUMAR AND R B MISHRA

ABSTRACT
The research community of Web, presently is working to generate its next generation i.e. Semantic Web. They are
moving towards automation of the retrieval and processing of web contents. The systems based on the semantic web
require performing various processes like discovery, selection, composition, orchestration, monitoring etc. on
services provided by it for satisfying client needs. In this paper, we will be concentrating on semantic web service
composition techniques. The work deals with exploring different type of composition techniques, categorization of
them, and comparing them based on some of their properties like process, reasoners & languages involved, interface
etc.

1. INTRODUCTION The research on semantic web service

The Semantic Web is not a separate Web but an
extension of the current one, in which information is
given well-defined meaning, better enabling
computers and people to work in cooperation, by
Tim Berners-Lee in Scientific American, 2001. The
aim of semantic web is to create a layer on the
existing web that enables advanced automatic
processing of the web contents so that data can be
shared and processed by both humans and
software. It is using the concept of self-describing,
machine-readable knowledge which is accessible
using standard web programming constructs.
Semantic web services (SWSs) are generally self-
sufficient, reusable software components which
can be used to fulfill a particular task. They have
modular structure and can be published and invoked
through the web. However in some cases, the
semantic web based systems can not satisfy the
client requirements using only the single service
components. In those cases, discovery and
selection is used for selecting the most appropriate
service components followed by service
composition for generating the aggregation of
available service components according to the
requested task. The service composition process
can involve composition of homogeneous as well
as heterogeneous services. The interface,
properties, and capabilities of the semantic web
services are encoded in a machine-understandable
form allow easy integration of heterogeneous
semantic web services.
composition techniques based on various
approaches is going on. Some of the approaches
used for service composition are AI (Artificial
Intelligence) planning based, workflow based,
ontology based, agent based, context based,
template based etc. Various techniques based upon
these approaches are proposed by various
researchers. Following points have been covered
in this paper.
1) Categorization and exploration of some
semantic web service composition
techniques.
2) Comparison of different composition
techniques about some of their properties
like process, reasoners & languages
involved, interface etc.
3) Observations on service composition
techniques.
The paper has been structured as: Apart from
introduction, section 2 provides categorized
description of different semantic web service
composition approaches. Section 3 deals with the
tabular comparison of various service composition
methods. Section 4 presents some observations on
different composition methods and conclusion is
given in section 5.
2. SWS COMPOSITION APPROACHES
We have categorized the different SWS
composition techniques discussed here into five

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W


groups based on their corresponding approach used
i.e. AI planning based, workflow based, ontology
based, agent based and other approaches. Other
approaches consist of approaches like iterative,
logic based, template based, interactive
composition methods, multilevel Composability.
2.1. AI Planning based
The AI planning based service composition
consists of firstly generating the plan for
composition before performing the actual
composition.
Java based Automatic Composition
A Java based completely automatic semantic
web service composition approach [1], not requiring
any human-intervention, has also been developed
which uses planning-based approach for handling
protocol heterogeneity problem and service-based
approach for handling data heterogeneity problem.
The loop generation in planning is based on the
pattern-based approach. The system extends
GraphPlan, an AI planning algorithm, for generating
the control flow of processes by considering the
structure of input and output messages in addition
to the precondition and effects of operations. The
system generates executable workflow directly in
BPEL using IBM BPWS4J API and which is run on
Oracle BPM engine. The available message to be
input in the BPEL process is converted into the
required format using data mediation service.
However, if the available message has more than
one candidate element, the best one is selected by
using a context-based ranking algorithm. The
ontologies in the system is handled using Jena and
uses matching or mapping techniques for handling
the multiple ontologies involved. This technique is
very flexible in adapting to the new scenario, as it
only needs to adapt the task specification and
discovery rules & preferences while moving to the
new scenario.
WS-GEN
An AI planning based tool, WS-GEN [2] for
automated composition of semantic web services,
which takes as input the description of set of
available services and business requirement is
also available. It supports OWL-S and BPEL4WS
for describing and interacting with the web services
Vol. 25, No. 3, May-June’08
106
respectively. This tool exploits AI planning
approach based on the “Planning as Model
checking” framework [3] and MBP tool [4]. WS-
GEN is composed of five software modules –
OWL2STS, BPEL2STS, COMPOSE, MBP Planner,
and STS2BPEL.The tool firstly describe the existing
web services specified in OWL-S or BPEL4WS into
state transition system using first and second
software modules. Then these described state
transition systems for the existing web services
are used by the COMPOSE module for composition
of goal service. The MBP planner is used to
generate a plan to control the interaction with
external existing services in such a way that the
result is according to the goal service. STS2BPEL
then translate the result described in state transition
system form into BPEL4WS executable process
and also provide information for execution and
deployment of resulting processes.
CLM Formal Model
An AI planning-oriented formal model [5],
Casual Link Matrix (CLM), for functional
composition of the semantic web services has
been used. This model uses a regression based
approach for composition of web services using
Ra4C algorithm and perform composition of web
services by automating the process of chaining of
web services based on their functional description
according to the casual link (a semantic link). The
casual link gives a logical dependency among input
and output parameters of different web services.
The CLM pre-computes all casual links between
web services as an Output-Input matching. Then it
stores all these casual links in order to find the best
web service composition. Out of this, a
semantically well ordered and linked plan of web
services forms the solution of web service
composition.
2.2. Workflow Based
Workflow based service composition consists
of a series of work-items and data dependency
among them in the form of a process model. Here,
firstly the appropriate atomic services are searched
and then these work-items are filled by the
corresponding atomic service and data & control-
flow connections are established between them to
produce the goal service.
I E T E T E C H N I C A L R E V I E W

OWL-S Process Model
An OWL-S process model using workflows [6]
for composition has been proposed. The model
describes the required composite services in the
terms of other constituent services. This model is
based on the DAML-S Virtual Machine Matchmaker
Architecture. All the processes in the environment
are categorized into three classes as Atomic,
Simple, and composite. In this model, the
composition process is defined as a hierarchy of
workflows. The workflows are constructed using
atomic, simple or other composite processes using
various composition constructs like if-then-else,
repeat-until, repeat-while, iterate, split, split+join,
sequence, unordered, choice. The model can be
used reasoning of the possible compositions and
also to control the invocation of services. It also
uses a special application tool WSDL2DAMLS.
Knowledge based Approach
A knowledge based semantic web service
composition approach [7] implemented in a
workflow construction environment has been
proposed which uses domain knowledge for service
composition, selection and instantiation process.
The system generates workflows which can be
executed using a domain-specific direct mapping
mechanism as well as using WSDL-based service
grounding. For generating the workflow
specifications, in addition to the domain knowledge,
it also uses semantically enriched service
descriptions which assist in the process of
discovery which further leads to the workflow
specifications. A framework implementing this
approach consists of a Workflow Construction
Environment, a set of web services, knowledge
bases and ontologies. The framework mainly
emphasis the use of DAML-S for representing the
service descriptions.
Information transformation on I/O
parameters
A composition approach [8] in which services is
composed into workflows has been proposed. In
this approach, the composition into workflows is
based on the information transformation the
workflows undertake in their input/output
Vol. 25, No. 3, May-June’08
107
parameters. The workflow starts by finding all the
services with the input matching with requested
input. Then the services are added into the workflow
with the inputs matching with the outputs of the last
service in the workflow. This process of adding
services to generate a workflow-graph with each
branch representing a workflow continue until no
more matches among the unused services can be
found or the outputs of the last service in the
workflow match with the requested outputs. It is to
note that the each branch holds its own list of
unused services. The process described here is in
forward chaining fashion. However, this approach
also allows composition using backward chaining
fashion. The output here can be conditional as well
as unconditional. In the case unconditional output
is there, both the forward as well as backward
chaining approach proves equally good, but in the
case of conditional output, the backward chaining
approach is usually used.
OntoMat- Service Infrastructure
An OntoMat-Service infrastructure [9] which in
addition to having easy to use user-interface also
provides capability to generate reasonably complex
workflows has been developed. It uses a particular
type of semantic annotations called deep
annotations [10]. The OntoMat-Service browser
provided by it has enhanced features like direct,
manual invocation of an advertised service,
invoking aggregated web services. The OntoMat-
Service system has web services with the service
description using WSDL (Web Service Description
Language). The web services are presented before
the user in the form of a nicely formatted HTML/
XHTML document, which can be seen of the user at
the client side using OntoMat-Service browser.
This browser also uses deep annotations to
highlight the human-understandable items
associated with underlying machine-
understandable semantics. The user at the client
side can not only view the web services but also the
mapping rules. User here selects a set of web
service operations and mapping rules. These
selections are then used by the web service planner
module to compute the possible web service
workflows using pre-conditions and post-conditions
of web services. However, this model is not much
efficient for building the complex workflows.
I E T E T E C H N I C A L R E V I E W

2.3. Ontology Based
Ontology based service composition involves
composing services based upon their ontological
descriptions and relationship between them.
Stack of Ontologies based framework
A framework which can be used for design and
automatic/semiautomatic composition of the
semantic web services using ontologies [11] has
been developed. The composition process here is
based on a stack of ontologies describing different
parts of semantic web services and containing
design rules to be verified by the ontology
instances. The framework consists of mainly three
models- Instance Model, Checking Model (for
checking consistency among the instance models),
and translate model ( for translating ontology
instances into semantic web languages such as
OWL-S). For the composition of the services, the
following steps are performed: designing services
graphically, creation of the instances of all
framework ontologies, checking the design of
service ontologies, and then translating the
instances into OWL-S specifications. This
framework provides composition of semantic web
services at language- independent and knowledge
level. Also for performing the translation of
ontologies and inference procedure, a special
software packages WebODE is used. A graphics
interface packages ODE SWS [12, 13] integrated
with WebODE is used for producing the graphical
design of services.
Composition of WSMO-based ontologies
in IRS-III
Internet Reasoning Service-III (IRS-III), a
framework for the creation, publication,
composition and execution of semantic web
services has been implemented [14]. IRS-III
supports composition of services according to the
Web Service Modeling Ontology (WSMO) ontology
[16], which also takes into account the notion of
goal and mediation. However a graphical software
tool [17] has been developed in Java which supports
IRS-III in dynamic composition by re-commanding
goals according to the context at each step of
composition. This tool also performs orchestration
on the generated compositions.
Vol. 25, No. 3, May-June’08
108
Integration of OWL-S into IRS-III
Another approach of composition of semantic
web services described in OWL-S using IRS-III has
also been proposed [15]. As IRS-III obeys the
notion of goal for describing web services, so the
OWL-S description has to be converted into a
notion that uses notion of goal. So, here, the OWL-
S ontology specifications are firstly mapped to the
WSMO (Web Service Modeling Ontology) ontology
[16] which uses notion of goal, and then these
WSMO ontologies are translated into OCML which
are used for IRS-III. The composition process here
involves composing services dynamically by
capturing only some of the functionalities from
each of the services.
2.4. Agent Based: Functionality and
Methods
In agent based service composition, the
different agents involved in the system represent
the differernt individual services. Then a complete
multi-agent based system can be considered for
composition of semantic web services.
Agent functionality encompasses agent acts
(agent per formatives), platform for agent
communication, and languages. The social settings
and mental states of agent are the two paradigms
which speak of the various activities. Cooperation,
Coordination, and negotiations are acts of social
settings in the multi-agent system. The mental
states of the agents have been enumerated as
belief, knowledge, commitment, capability, and
choice [18]. BDI theory depicts of the belief, desire,
and intention as prime entities to model the behavior
of agent during plan, goal, and action. BDI theory is
concerned about the subjective internal based and
institutional model of an agent act. But there are
certain parameters explicit external and objective
based on the internal or institutional parameters
such as trust, reputation, and reliability. These
parameters are eternally correlated to each other to
the internal states.
Trust: Trust is an ethical and functional issue to
model the behavior of agents during interaction and
committment to coordinate, cooperate, and cotrol
policies between the agents and web services
providers. Researchers in [19] describe the trust in
I E T E T E C H N I C A L R E V I E W

multi-agent systems. In the trade on semantic web,
trust and reliability play very important role. Trust
be transitive, subjective and context dependent.
Trust and reputation are made of underlying beliefs
and are the functions of these beliefs. Integration of
trust and belief into query optimization, trans
patterns as an additional intention for optimization
either as a constraint or as a quantitative trade off.
To determine appropriate organizational policies
infrastructures with a GUI’s for composing,
updating, importing, protecting and analyzing and
then automatically mapping that high levels policy
to suitable informant mechanism and to semantic
and security models that partner organization use.
Negotiation: FIPA Iterated contract Net protocol is
an interaction protocol for negotiation which an
Initiator finds which participants from the parts of
participant would be able to perform the activities.
Initiator and participants are the SRA and SPA
respectively. There are several round in the
contraction, which is obtained by matchmakers
agents. The possible contract is almost the term of
possible contract in which initiator advertises the
activity input and consequently P’s (contractor)
proposals are obtained. In final round of negotiation,
I consider the P’s agrement and the contract deal.
P is a contractor and generates coalition of agents
to perform the task. RaCING(Rational Agent
Coalitions for Intelligent Mediation of Information
Retrieval (http://www.zsu.zp.ua /racing/project )
presents a frame for the development and
deployment of mediator which do the service
composition and mobile age service representation
in a P2P network of service integration platform.
Coordination: The agents are suppoted to work
together in coordination to achive certain goals.
Even the agents are not designed to work in
coordination, they can transfer data among
themselves. When data is presented semantically
which is performed by semantic markup,
coordinating agents perform mapping between their
knowledge in semantic web. This is implemented in
OWL-S or the use of partial mapping. Dialogue
protocol is a layer of control above the performative
language that defines only how agents
communicate where as the dialogue protocols how
agents can communicate. The social commitment
betwewen agent is a binding agreement from one
agent to another by establishing shared
commitments between agents as a social policy to
Vol. 25, No. 3, May-June’08
109
control their interaction.
P2P based Multiagent
A multiagent system [20] which is based on the
Chord P2P network [21] has been proposed for
composition as well as discovery of semantic web
services. The system provides dynamic
composition of services using agents which
cooperatively apply distributed symbolic reasoning.
The semantic web ontology language OWL-S is
used in the system for repsenting the services. For
the composition of of web services, firstly, the
avalibale semantic web services are taken as input
from OWL-S service profile. Then the input
services are transformed into Linear Logic
formulae. Then partial deduction is applied on the
linear logic formulae to get the requested solution.
The final solution is transformed into the OWL-S
service profile and returned to the requester. The
system provides a distributed composition of
semantic web service by applying agent
technologies on structured P2P networks. The
reasoning over the services is performed using
domain ontologies during the partial deduction
process. Also in the case, the solution obtained is
partial and not complete, then this can also be
extended using a Cooperative Problem Solving
Framework to get the complete solution.
Composition Engine
A Composition Engine which uses DAML-S,
scheduling of tasks, workflow planning, execution
process status monitoring, faults handling and
communication with entities like agents and
registries for automated composition has also been
proposed [22]. This engine consists of a set of
modules like Planner, Definer, Scheduler,
Executer, Reasoning and Communication module.
Definer generates new DAML-S specifications from
the individually composed service specifications.
The communication module of the system uses
Java Agent Development Framework (JADE) [23]
for communicating with user agents or other
composition engines. The reasoning module uses a
Java based object oriented modular reasoning
system, JTP (Java Theorem Prover) [24].
Agent Enabled Framework
A framework using agents for intelligent
I E T E T E C H N I C A L R E V I E W

dynamic composition which can cop with changes
in environment affected by service execution flow
has been proposed [25]. In this system, an agent
based middleware layer, as a service mediator, is
required for scalable intelligent dynamic service
composition interpreted as tasks comprising of
varying granularity. It is composed by dynamic
coalitionof service providing agents (SPA) in the
participating task.It basically decomposes the
incoming task on the basis of their local knowledge/
ontology. Based on iterative extended iterative net
negotiation arranged for activity outsourcing to
other SPAs by providing service context relocation.
However there are some of main issues still
unsolved or partially solved as like no common
mechanism for activity outsourcing activity
parameters for adjustment meaning of negotiation
ontologies family, unsufficient methodology for
representation of task /activities /services dynamic
structure at coarse level and task/process
ontologies with fine granularity, non standardization
of measure, assesment and evaluation of human
base parameters such as trust, crediability,
reliability andcapability. In the system , semantic
fact of request task activity service layering activity
context is translated with DAML-S markup
corressponding to service profile; the service is
than invoked via the internet specified by its binding
i.e. grounding in DAML-S description.
Interactive Agents
The agents in semantic web services are used
as clients (requesters), service providers, and
middle agents. The client specifies what they want
from services. Client will need to avoid hard coded
knowledge of the syntax for interacting with
providers. It is to mediate to classes of functionality
similar providers by using information from
published semantic service description. Three main
functions related to composition of semantic web
services in this method are service discovery,
engagement and enactment [26].
Service Discovery: In this process agent
(clients) identifies required sevices to achive its
objectives. There are three steps in the process :
service providers who perform the services,
services requesters seek services that can
accomplished an internal objective, and
matchmaker performs matching between client
requirement and available services from it its
Vol. 25, No. 3, May-June’08
110
providers. In the semantic web, queries are
processed by matchmakers to find appropiate
services among these advertised using semantic
web language descriptions. Abstract capability
descriptions in matchmaking queries is more
effective in trade off mechanism. Clients do
negotiation and filtering, in with discovery which
involves catched revised capability
advertisements.
Service Engagement: Negotiation and
contracts- both the agents (service provider and
requester) are engaged on the agreement on some
terms and coditions and compromised values. The
functional requirment depends on the interaction
capability, in general and in particular on service
request formulation, contract prelimitriaries and
contract negotiation. The negotiation affect the
architetures requirements such as : negotiation
protocols and and services and auditing services.
The service engagement protocols describe
messages exchange between providers and
requesters requesting the agreements. The
equivalent protocols are implemented in FIPA. The
temporal flow and semantic understanding of
negotiations that can occur between two agents are
incorporated in the negotiations committment
protocol.
Enactment: After engagement the entactment
is fact to be in contact and deal on agreement in
space and time (temporal) continum. The functions
are response interpretation, translation
interpretation, execuation, process mediation and
delegation and dynamic service composition. The
middle agent has to follow certain protocols and
ontologies for interacting with user agent as :
process mediation services , process scheduling
and composition services. The interoperativity
would be enhanced by the adaptive components
built up by sharing of abstract models rather than
syntactic and abstract agreements among
developers.
Behavior (BDI) Agent
In the Semantic web, the web pages are marked
up in accordance with standardized conventions in
order to reduce ambiguity and facilitate automated
reasoning. Web Services is not simply information
but behavior which can be viewed as the
fundamental attribute of intelligence. An agent
should have the following attributes as goals,
I E T E T E C H N I C A L R E V I E W

intentions, beliefs, and behavior. Behaviors are the
actions the agent is able to take. The process
model in DAML-S specifies the behavior of the
service [27]. Behavior oriented design is one of the
approaches to model agent behavior consisting of
action, perception and learning. The action of an
agent is supported by the perception composed of
knowledge and beliefs to determine how and when
action should be expressed. The single behavior
module may be determined with actions dependent
on state and sensing action that mention the
accuracy of the state. The BOD modules are
incorporated into hierarchical reactive plans into
the system execution. It includes a specification for
parallel rooted ordered slip–stack Hierarchical
(POSH) reactive plans. The BOD modules contain
encapsulated state provide the overall agent with
perception primitives. BOD has been implemented
in DAML-S.
2.5. Miscellaneous
In this section, we will consider examples for
some other used approaches of semantic web
service composition. We will consider cases for
context based, iterative, BPEL4WS, template
based, and logic based approaches for service
composition.
Context Based
A composition method based on the context of
use of semantic web services has been developed
[28]. This method considers context of the
composition as a base for composition. In this
method the different web services involved are
identified as: composite, web and instance
services. This system has been implemented on
the top of an open and extensible workbench namely
Eclipse. The Eclipse PDE (Plug-in Development
Environment) allows the developed plug-ins to be
integrated with the system. So this system consists
of mainly four plug-ins viz. User Interface, WS-
execution platform, ontology Repository, and help
repository. The composition process in the system
consists of firstly consolidating the context of
services, conciliating contexts, relating services to
contexts, securing contexts, consolidating security
contexts and then conciliating security contexts.
The system defines new language OWL-C for
defining of the context of services. The context
ontologies in the system are defined and processed
Vol. 25, No. 3, May-June’08
111
by using JENA and the OWL-S based ontologies
are processed using Mindswap’s OWL-S APIs. The
user interface of the system is graphical & user
friendly and is implemented with the help of some
commercially available toolkits like JFACE and
SWT (Standard Widget Toolkit).
Iterative Approach
A framework, MoSCoE (Modeling Service
Composition and Execution) [29], based on iterative
approach for service composition has been
proposed, in which the incomplete goal service
specifications are reformulated iteratively for
composition until the desired goal service is
obtained. Services in this framework are modeled
using Symbolic Transition System (STS). So in this
system, all the component services and goal
services are modeled as STS. The system starts
with a choreographer and an abstract STS of goal
service. Then using given component services, a
subset is identified and composed with
choreagrapher to create goal service. However in
the case of failure to realize goal service, it modify
the some specific states and transitions of goal
service STS and thus reformulate the goal
specifiction iteratively until a successful
composition is obtained. This framework also
provide the user with ability to abort the process
when required.
BPEL4WS based
A semantic web composition model based on
BPEL4WS [30] (Business Process Execution
Language for Web Services) has been proposed
which describes web services as business
processes [15]. Model provides a notation for
providing interaction among the web services. The
different service roles in the process model are
treated as partners for providing the integration.
The model [31] works on a bottom-up approach. It
firstly collects all the DAML-S or OWL-S service
profiles into a repository. Then the desired
properties of partner services are defined. The
semantics of the services in repository are
exploited by querying for the partners based on the
descriptions of the partners properties defined.
Then semantic service descriptions are integrated
by querying into BPWS4J engine (An engine which
consumes BPEL4WS and WSDL documents
defining bindings for the BPEL4WS process and its
I E T E T E C H N I C A L R E V I E W

partners and implement some features defined in
BPEL4WS specification).
Template Based
A semantic web service composition approach
based on the Semantic Process Templates (SPT)
has been proposed which uses these templates for
capturing the semantic requirements of the
processes and thus allowing dynamically changing
the services and partners [32]. SPT uses ontologies
for describing the activities requirements in the
templates and thus provide good method of
describing and locating the services. The
ontologies are build and processed using Jena
toolkit and the composition of the semantic web
process templates are done using a METEOR-S
Web Service composition Framework tool i.e.
Process Builder. Generic process templates are
created based on the list of activities and control
flow constructs to link the activities. A WSDL (Web
Service Description Language) editor is used by
the framework for describing the desired processes
in WSDL. The activities are then added to the
process templates opened or created by the
process designer tool. Also, if needed, the control
flow constructs may also be added to the templates.
However activities may also be annotated. Now for
each of the activity some of the services are
discovered, ranked and selected based on some
discovery, matching and Quality of Service (QoS)
criteria. Data flow is maintained between the
selected services and using a process generator
tool which uses WSDL description of processes,
process templates and WSDL description of
existing participating service, the executable
processes are generated. These executable
processes can then be deployed and invoked after
the validation.
Logic Based
A Java based automatic service composition
architecture based on Linear Logic (LL) Theorem
Proving and having graphical user interface has
been introduced [33]. The composite services in
the system are represented using Process Calculus
which is attached to the Linear Logic inference
rules. In the architecture, the services are internally
presented using ExtraLogical axioms and Linear
Logic proofs while externally they are presented
using DAML-S. All the three, DAML-S translator,
Vol. 25, No. 3, May-June’08
112
Linear Logic theorem Prover and Semantic
Reasoner operates together for achieving the goal.
The system have a translator (transformation
between internal and external presentation of web
services), Linear Logic Theorem Prover (check
whether user’s request for service can be
achieved), semantic reasoner (detecting
relationship between concepts), and an Adapter
(transformation between Linear Logic and
Description Logic [34]). For composing the web
services, the user’s request for composite service
as well as description of existing web services are
translated into sequent and extralogical axioms of
LL respectively. Then adaptor requests semantic
reasoner to analyze subtype relations of classes
and properties and covert them into LL axiom forms,
which are send to the LL theorem prover. The LL
theorem prover generates the process calculus of
composite service after checking whether
requested service can be generated or not, which
further is converted to DAML-S service model or
BPEL4WS.
A multilevel Composability Model
Composibility is checked through a set of rules
organized in four levels: Syntactic, Static semantic,
dynamic semantic and qualitative levels [35]. The
web services operations (concepts) are defined by
a meta-data ontology which provides concepts that
are the description of other conceptions. The
concepts (services) are defined by a set of
functional and non-functional attributes. The
functional attributes are syntactic, static semantic
and dynamic semantic. The non functional or
qualitative attributes are time availability and cost.
The syntactic attributes represent the structure of a
service operation such as input and output
parameters that define operation’s messages. The
meaning of operations or its messages is the
semantic attributes which are of two kinds: static
and dynamic.
Horizontal and vertical composition: Horizontal
composition is like a supply chain combination of
operations. For example, a translation of German
to Hindi can be performed by horizontal composition
of translation from German to English and then
from English to Hindi. Vertical composition refers
to the subcontracting a services to another
services. X has a service to perform but it gives it
Y to perform and Y returns it to X after performing
I E T E T E C H N I C A L R E V I E W

the services. Composability degree refers to the
weight assigned to the syntactic and semantic
composability. The weight signifies the importance
of a level or rule. A minimum threshold value of
composability (0 < τ < 1) designates the services
for composability.
Semantic Description of Services: Static
semantics gives various attributes at lowest level
of granularity like serviceability, provider and
consumer types, category and purpose of different
operations. Static semantics for messages consist
of the set of attributes to model the semantics of
message parameters like data type, business role,
unit and language. Dynamic semantics or business
logic of an operation refers to the output expected
after execution of an operation, at the given specific
condition. The business logic is defined by a set of
rules where each rule has the format
(Pre Condition Slkm, Pre Condition ikm)
Rm = ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
(Post Parameters Slkm, Post Condition ikm)
Where Pre Parameters ikm and Post Parameters
ikm are sets of parameters, each parameter is
defined by name, data type, business rule, unit and
language of different services (a kind of service
composition). It is the discretion of the user to
combine the services from the sensor (at different
physical location), or perform the pre-processing
steps and deploy the pattern recognition services
(statistical or syntactic).
Interactive Composition Techniques
A goal oriented, interactive composition
approach, driven by filtering and selection of
services has been developed [36]. This is based on
incremental generation of composition by forward
and backward chaining of services. At each
incremented step, new services are added and
matched to current services requirement, enabling
the filtering of undesired services based on the
user’s decision and context of the required service
profile.
• After filtering the compatibility of the services,
these are delivered as the next step of
composition process.
• Propinquity is determined to assess the
desirable composition.
Vol. 25, No. 3, May-June’08
113
• The input, output, precondition and effect
[IOPE] of a service component enhance the
filtering process.
The semantic annotations of services enable
service composition. Two web services one
language (German to English) translator and
another dictionary (English to German) can be
composed together to a user’s requirement of
German Dictionary. Similarly, another example for
service composition is of sensor data acquisition,
sensor data processing.
Semantic Service Description: It is described
in OWL-S language with three components. Service
profile which describes the services to be
performed by specifying input and output types,
preconditions and effects (IOPE). It is analogous to
yellow page like advertisements in UDDI. The
process model describes the working of a service
either as an atomic process that executes directly
or composite process that is composition of sub
processes. It is similar to business process model
in BPEL4WS.
• The grounding refers to the access and
communication protocol of an agent;
parameters to use in the protocol, and the
serialization technique in the communication.
It is mapping from OWL-S to WSDL.
• All of the OWL’s domain modeling features
can be used to directly structure the OWL-S
service descriptions as well as the concepts
from other ontology.
The OWL-S ontology may consist of top level
class sensor and subclasses as Acoustic sensor,
infrared sensor, and microwave sensor. Service
profiles are associated with the root class i.e.
sensor profile and subclasses with an Acoustic
Sensor profile etc. The extensible service
parameter can be used to define non IOPE
attributes by more specific named classes of
“Service profiles” such as “Nearby acoustic
sensors”. The user can also define complex class
expressions to define their requirements. The
“Grounding” contains the information for executing
services like pointers into WSDL description o
directly invoke.
I E T E T E C H N I C A L R E V I E W
 114

3. TABULAR COMPARISON

TABLE 1: Tabular Comparison of Various service composition methods

Name of Composition Process Reasoners Languages Interface Specific

Method Involved Involved Software
Used
AI Planning Based

Automatic • Convert the available message into Jena Java, BPEL Graphical Oracle
Service required format for BPEL process. User BPM
composition • Select the best one candidate element, interface Engine
[1] if multiple elements are there in available
message.
• Generate executable control flow of
processes by considering the structure of
input & output messages and precondition
& effects of operations.

WS-GEN [2] • Describe web services in State Transition No Specific OWL-S, Graphical MBP tool
system form. Reasoner BPEL4WS user [4]
• Generate plan to control the interaction with interface
existing services.
• Compose services according to goal service.
• Translate the resulting state transition
system goal service into executable
process.

Functionality • Computes casual links between web No Specific OWL-S No specific Ra4C
based services using CLM. Reasoner inteface Algorithm
semantic • Store all casual links. tool
web service • Create semantically ordered and linked
composition plan of web services.
[5]

Workflow based

OWL-S • Construct workflows using atomic, simple or Using OWL-S No specific

WSDL2DA
Process composite processes. implemented inteface MLS tool.
Model [6] • A Hierarchy of workflows defines composite process
process. model itself

Knowledge • It works as a composition advice based on Semantic DAML-S WCI GUI Software
Based two models: Service description and based search provides facilitates agent to
Systems [7] conceptual links between services and engine is basic work flow monitor to
their properties. The KBS approach realized schema construction. service
involves identification of knowledge through for
Contd.....

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 115

intensive tasks. The domain level elicitation reasoner describing composi- process
or automatic acquisition of KW using KW FaCT or a web tion and collect
acquisition method. match service. snapshots
• The representation or modeling of domain maker of states
KW in formal, symbolic structure computing when
form. advice is
• Use of KW format user’s requirement to requested
update and maintain formalized KW.
• KBS framework consists of set of components:
Work flow construction environment, a set of
diverse web services, knowledge bases and
ontologies.

Workflow • Find all services with input matching with No Specific No specific Graphical No specific
based requested input. Reasoner Language User tool
service • Add services in Workflow with inputs matching Interface
composition with outputs of last service in workflow.
[8] • Continue until output matches with the
requested output or no unused service.

OntoMat- • Present the web services having WSDL- No Specific WSDL, Graphical No specific
Service represented descriptions before the user Reasoner HTML, user- tool
System [9] using deep annotations. XHTML interface
• Selection of service operations and mapping
rules are done by user.
• Use the selections to compute web service
workflows.
Ontology Based

Framework • Design services graphically. Using OWL-S Graphical ODE SWS

based on • Create instances of framework ontologies. WebODE User [12,13]
stack of • Check the design of service ontologies. Interface
ontologies • Translate the instances into OWL-S specification.
[11]
Composition • Dynamically compose by re-commanding No Specific WSMO Graphical A special
of WSMO- goals according to the context at each step Reasoner ontology, User software
based SWS of composition. Java Interface tool [17]
in IRS-III • Perform orchestration on the generated
[14] compositions.
Integration • Map OWL-S services to WSMO. No Specific OWL-S, Graphical No specific
of OWL-S • Translate WSMO services into OCML. Reasoner WSMO User tool
into IRS-III • Apply IRS-III. ontology, Interface
[15] OCML

Contd.....

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 116

Miscellaneous
ConWe • Consolidate the context. JENA OWL-S, Graphical JFACE,
Scproto • Conciliate contexts. OWL-C user SWL, and
type [28] – • Relate services to contexts. interface indswap’s
Context • Secure contexts. using OWL-S
based • Consolidate security contexts. commercial APIs.
• Conciliate security contexts. toolkits
MoSCoE • Identify a subset of given component No Specific No specific Graphical STS
[29]- services. Reasoner Language User (Symbolic
Iterative • Compose subset with a choreographer to Interface Transition
approach get goal service. System).
• Reformulate goal specification iteratively
until successful composition.
Adapting • Collect DAML-S or OWL-S service profiles No Specific DAML-S, No specific BPWS4J
BPEL4WS into a repository. Reasoner OWL-S inteface Engine
[15] – • Define properties of partner services.
Using • Query for the partners from services in
BPEL4WS repository.
• Integrate semantic service descriptions by
querying into BPWS4J engine.
SPT based • Create Generic Process templates based Jena WSDL No specific Meteor-S
composition on list of activities. inteface tool,
[32]- • Describe desired processes in WSDL. WSDL
Template • Add activities and control flow constructs Editor.
based to the templates.
• Discover, rank and select the services for
the activities based on some criteria.
• Maintain data flow between the selected
services.
• Generate executable processes.
Logic based • Translate the user’s request composite Using a Java, Graphical DAML-S
service services into sequent of LL. specified DAML-S, user translator,
composition • Translate the description of existing web semantic BPEL4WS interface LL theorem
[33] services into extralogical axioms of LL. reasoner prover.
• Analyze subtype relation of classes and module
properties and convert them into LL axioms. in the
• Send the LL axioms such generated to LL system.
theorem prover.
• Generate process calculus of composite
service.
· • Convert it to DAML-S model or BPEL4WS.

Contd.....

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 117

Multi Level • The different levels perform various No Specific WSDL GUI and No specific
composibilty functions on the basis of rules well Reasoner Web DG tool
[35] organized in each level. manager
• Horizontal and vertical composition. using
• Weightage to different types of composability HTML
levels by level weight vector and rule weight servlet
matrix.
• Operations and messages are static and for
dynamic semantics.
Interactive • Filtering of undesired services based on No Specific OWL-S, Graphical No specific
composition user’s decision. Reasoner WSDL User tool
[36] • Determination of propinquity to assess Interface
composition.
• Use IOPE to enhance filtering process.
• Service composition using semantic
annotations.

TABLE 2: Tabular comparison of agent based service composition methods

Name of Composition Reasoners Languages Interface Agent Specific

Method Process Involved Involved Activity Software
Used
MAS • Input available web services. Using OWL-S Graphical Agent Cooperative
System [20] • Transform them into Linear domain User Cooperation Problem
Logic Formulae. ontologies Interface Solving
• Apply Partial Deduction to in partial Framework.
get requested solution. deduction
process and
agents for
distributed
symbolic
reasoning.
Composition • Generate new DAML-S JTP [22] DAML-S No Agent JADE [23]
Engine [22] specification of services specific Communi-
using Definer module. inteface cation
• Maintain communication
with other agents using
Communication module.
Agent based • Composed by dynamic No Specific DAML-S No Agent No specific
dynamic coalitionof service providing Reasoner specific Communi- tool
service agents (SPA) in the partici- inteface cation,
composition pating task. Negotiation,

Contd.....

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 118

[25] • Decomposes the incoming assessment,

task on the basis of their cooperation.
local knowledge/ontology.

Interactive • Using service discovery, No Specific No specific Graphical Agent No specific

agent [26] agent identifies required Reasoner Language User trust, tool
services to achieve its Interface negotiation
objective.
• Apply service engagement
to engage agents on
agreements on some terms.
• Apply service enactment to
function dynamic service
composition finally.

Behavior • Markup web pages in Using DAML-S No Agent No specific

(BDI) Agent accordance with standardized marking up specific belief, tool
[27] conventions. of the web inteface behavior,
• Specify behavior of service. pages using intentions
• Model agent behavior using standardized
behavior oriented design. conventions

4. OBSERVATIONS languages, implementation languages, reasoners

Tables 1-2 are used for generating the
observations on languages, reasoners and
interfaces as described here. Figures 1-3 presents
our observations on usage of various semantic web
and interface. From Fig 1, observations on
languages involved in the composition methods
says that, OWL-S is the maximally supported (9 out
of 22) semantic web language among the
composition techniques, DAML-S is the second

Fig 1 %age of different language-usages

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W


Fig 2 %age of different reasoners- usages
Fig 3 %age of type of user-interface provided
popular (6 out of 22) in support, however WSDL (4
out of 22), BPEL (3 out of 22) also have average
response in term of support by composition
methods. Java and related tools (3 out of 22) is the
mostly used language used for implementation of
methods. Figure 2, shows that, maximum of
systems have reasoning capability implemented
within them (4 out of 22), Jena is the maximally
used (3 out of 22) reasoner, and FaCT, WebODE,
and JTP is also used for reasoning on average (1
out of 22 each). It is observed, as in Fig 3, mostly
all of service composition systems (12 out of 22)
have graphical interface, so they aims at providing
ease of use; however some of them are using some
commercial toolkits in interface (2 out of 22). Among
the agent based systems, it has been observed that
most of the agents are performing communication
and cooperation activities for performing the service
composition.
Vol. 25, No. 3, May-June’08
119
5. CONCLUSION
This next generation of web i.e. semantic web
is moving towards its materialization. In the paper,
we review some of the popular semantic web
service composition methods. Different categories
like AI planning based, workflow based, ontology
based, agent based, template based, context based
etc. are observed. They are compared in a tabular
form depending upon their different parameters and
taken observations shows that Jena is the
maximally used reasoner, and OWL-S and DAML-S
are the maximally used semantic web languages in
composition. Java and related tools is today a
preferred tool for implementing the systems and
systems are provided with good ease of use having
graphical interface.
REFERENCES
1. Zixin Wu, Ajith Ranabahu, Karthik Gomadam, Amit
P. Sheth & John A. Miller Automatic Semantic Web
Services Composition, www.cs.uga.edu/~jam/
papers/zLSDISpapers/zixin.doc, 2006.
2. M Pistore, P Bertoli, E Cusenza, A Marconi & P
Traverso, WS-GEN: A Tool for the Automated
Composition of Semantic Web Services, ISWC, 2004.
3. F Giunchiglia & P Traverso. Planning as Model
Checking, In Proc 5th European Conference on
Planning (ECP’99), 1999.
4. P Bertoli, A Cimatti, M Pistore, M Roveri & P
Traverso. MBP: a Model Based Planner, In Proc. of
I E T E T E C H N I C A L R E V I E W

ICAI-2001 Workshop on Planning under Uncertainty
and Incomplete Information, Seattle, USA, August
2001.
5. Freddy Lecue & Alain Leger, A formal model for
semantic Web service composition, 5th International
Semantic Web Conference, Athens, Georgia, 2005.
6. Liliana Cabral, John Domingue, Enrico Motta, Terry
Payne, Farshad Hakimpour, Approaches to Semantic
Web Services: An Overview and Comparisons,
Lecture Notes in Computer Science, Springer Berlin
/ Heidelberg, Volume 3053/2004, 2004, pp 225-239.
7. L Chen, N R Shadbolt, C Goble, F Tao, S J Cox, C
Puleston & P R Smart, Towards a Knowledge-based
Approach to Semantic Service Composition, LNCS,
Springer Berlin/ Heidelberg, vol 2870/2003, 2003, pp
319-334.
8. Tor Arne Kvaloy, Erik Rongen, Alfredo Tirado-Ramos
& Peter Sloot, Automatic Composition and Selection
of Semantic Web Services, LNCS, Springer Berlin/
Heidelberg, vol 3470/2005, 2005, pp 184-192.
9. Sudhir Agarwal, Siegfried Handschuh & Steffen
Staab, Annotation, Composition and Invocation of
Semantic Web Services, www.uni-koblenz.de/
~staab/Research/Publications/2004/web-service-
annotation.pdf, 2004.
10. S Handschuh, S Staab & R. Volz. On deep
annotation, In Proceedings of the 12th International
World Wide Web Conference, WWW 2003,
Budapest, Hungary, 2003, ACM Press, 2003.
11. Asuncion Gomez-Perez & Rafael Gonzalez-Cabero,
Manuel Lama, Framework for design and composition
of SWS based on Stack of Ontologies, American
Association for Artificial Intelligence (www.aaai.org),
2004, pp 1-8.
12. O Corcho, M Fernández-López, A Gómez-Pérez &
M Lama, An Environment for Development of
Semantic Web Services, In Proceedings of the IJCAI-
2003Workshop on Ontologies and Distributed
Systems, Acapulco, México. http://CEUR-ORG.com/
vol-71/, 2003, pp 13-20.
13. O Corcho, M Fernández-López, A Gómez-Pérez,
and M Lama, ODE-SWS: A Semantic Web Service
Development Environment, In Proceedings of the
VLDB- 2003 Workshop on Semantic Web and
Databases, Berlin, Germany, 2003, pp 203-216.
14. Domingue, J L Cabral, F Hakimpour, D Sell & E
Motta, IRS-III: A Plateform and Infrastructure for
Creating WSMO-based Semantic Web Services, In:
Proc. of the Workshop on WSMO Implementations
(WIW 2004), 2004.
15. Yasmine Charif & Nicolas Sabouret, An Overview of
Semantic Web Services Composition Approaches,
Electronic Notes in Theoretical Computer Science,
Elsevier Science, 2005, vol 85, no 6, pp 1-8.
Vol. 25, No. 3, May-June’08
120
16. H Lauren, D Roman & U Keller, Web Services
Modeling Ontology – Standard (WSMO-Standard),
http://wsmo.org/2004/d2/v0.2/, 2004.
17. D Sell, F Hakimpour, J Domingue, E Motta & R
Pacheco, Interactive Composition of WSMO-based
Semantic Web Services in IRS-III, in: Proc of the
AKT workshop on Semantic Web Services (AKT-
SWS04), 2004.
18. Y Shoham, Agent-oriented programming, Artificial
Intelligence, Elsevier Science Publishers Ltd, vol 60,
Issue 1, 1993, pp 51-92.
19. S D Ramchurn, D Huynh & N R Jennings, Trust in
multiagent systems, The Knowledge Engineering
Review, vol 19, no 1, pp 1-25.
20. Peep Kungas & Mihhail Matskin, Semantic Web
Service Composition through a P2P-Based Multi-
Agent Environment, Lecture Notes in Computer
Science, UCM, vol 4118, 2006.
21. I Stoica, R Morris, D Karger M F Kaashoek & H
Balakrishnan. Chord, A scalable peer-to-peer lookup
service for internet applications, In Proceedings of
ACM SIGCOMM 2001, San Diego, California, USA,
2001, ACM Press, 2001, pp 149-160.
22. Charlie Abela, Semantic Web Services Composition,
Computer Science Annual Research Workshop,
2003, Malta Council for Science and Technology,
Villa Bighi, Kalkara, 2003.
23. JADE, http://sharon.cselt.it/projects/jade/.
24. JTP, http://www.ksl.stanford.edu/software/JTP/.
25. V Ermolayev, N Keberle, O Kononenko, S Plaksin &
V Terziyan, Towards a framework for agent-enabled
semantic web service composition, International Jl
of web service research, vol X, no X, 2004, pp 1-12.
26. Mark Burstein, Christoph Bussler, Michal Zaremba,
Tim Finin, Michael Huhns, Massimo Paolucci, Amit
Sheth & Stuart Williams, A Semantic Web Services
Architecture, IEEE Computer Society , IEEE Internet
Computing, 2005.
27. J J Bryson, D Martin, S A. McIlraith & L A Stein,
Semantic web services as Behavior Oriented Agents,
www.cs.bath.ac.uk/~jjb/ftp/ieee-daml.pdf, 2001.
28. 1 S Sattanathan1, N C Narendra2 & Z Maamar,
ConWeScprototype - Context-based Semantic Web
Services Composition, ICSOC, 05, 2005.
29. Vasant Honavar, Algorithms & Software for
Interactive Discovery and Composition of Semantic
Web Services, http://www.cs.iastate.edu/~honavar/
ailab/projects/services.html.
30. IBM, Microsoft, SAP, Siebel Systems, Business
Process Execution Language for Web Services
Version 1.1, Technical report, 2003.
I E T E T E C H N I C A L R E V I E W
 121

31. D Mandell & S McIlraith, Adapting BPEL4WS for the
Semantic Web: The Bottom-Up Approach to Web
Service Interoperation, in: Proc. of the 2 nd
International Semantic Web Conference (ISWC2003),
Sanibel Island, Florida, 2003.
32. Kaarthik Sivashanmugam, John A. Miller, Amit P.
Sheth, Kunal Verma, Framework for Semantic Web
Process Composition, International Journal of
Electronic Commerce, Winter 2004-5, vol 9, no 2, pp.
71-106.
33. Jinghai Rao, Peep Kungas, Mihhail Matskin, Logic -
based Web Services Composition: from Service
Description to Process Model, Proceedings of the
IEEE International Conference on Web Services
(ICWS’04), 0-7695-2167-3/04, IEEE, 2004.
34. B N Grosof, I Horrocks, R Volz, & S Decker,
Description logic programs: Combining logic
programs with description logic, In The 12th
International Conference on the World Wide Web
(WWW-2003, Budapest, Hungary, 2003.
35. Brahim Medjahed & Athman Bouguettaya, A
Multilevel Composability Model for Semantic Web
Services, IEEE Transactions on Knowledge and Data
Engineering, vol 17, issue 7, 2005, pp 954-968.
36. E Sirin, B Parsia & J Hendler, Filtering and select-
ing semantic Web services with interactive
composition techniques, IEEE Intelligent Systems,
vol 19, bo 4, 2004, pp 42-49.

Authors
Sandeep Kumar obtained BE in information technology from Haryana University with Gold medal. Presently he is a
research scholar in Computer Engineering Department, IT, BHU, Varanasi. His research interest is in the area of
semantic web.
Address: Department of Computer Engineering, Institute of Technology, Banaras Hindu University, (IT-BHU),
Varanasi 221 005, India.
email:sandeep.garg.cse06@itbhu.ac.in

* * *

R B Mishra is a reader in Computer Engineering Department, IT, BHU, Varanasi. He obtained

BSc (Engg), MTech, PhD He has over 28 years of teaching experience and has published
around 80 research papers and articles.
Address: Department of Computer Engineering, Institute of Technology, Banaras Hindu
University, (IT-BHU), Varanasi 221 005, India.
email: ravibm@bhu.ac.in

Paper No 133-B; Copyright © 2008 by the IETE.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 123

Corner Detection Algorithms for Digital

Images in Last Three Decades
AMBAR DUTTA, AVIJIT KAR AND B N CHATTERJI

ABSTRACT
Corner detection is an important step in many computer vision applications. A large number of corner detection
algorithms were already developed. An exhaustive review of the existing corner detection algorithms is, therefore,
invaluable for the researchers working in this area. In the present literature, we have found a few reviews on this area.
Most reviewers classified corner detectors into two categories – boundary-based and intensity-based. Some reviewers
classified the algorithms into two groups – template-based and geometry-based. Though we follow the first
classification, still we feel that there is a requirement of further subdivision. So, we subdivide each category into
further two subcategories – spatial-domain and transform-domain. In this paper, we have reviewed a total of 114
corner detection algorithms developed from 1977 to 2006, classified them in each of the four categories and found
that most of the works have been done in spatial domain only as compared to transform domain approaches.

1. INTRODUCTION intensity based methods estimate a measure to

Corner detection in images is an important step
in many tasks in machine vision, including scene
analysis, motion and structure from motion
analysis, image registration, image matching, object
recognition etc. A corner is an image point with high
contrast along all the directions. Hence, it is well
distinguished from neighboring points. A corner
detection algorithm must satisfy the following
criteria to be useful for feature point matching:
(i) consistency, (ii) accuracy, and (iii) speed. The
performance of corner detection algorithms is
affected by the attributes, viz., corner angle, corner
arm length, corner adjacency, corner sharpness,
gray level distribution and noise level.
Vision researchers have proposed a
considerable number of corner detection
algorithms. A Rosenfeld et al [1], A Heyden et al
[2], Z Zheng et al [3], C Schmid et al [4], P I
Rockett [5] and F Mokhtarian et al [6, 7] provided
good literature survey on the existing corner
detection algorithms. Corner detection algorithms
can be broadly divided into two classes – boundary
based and intensity based. Boundary based
methods rely on extraction of contours of regions
either by edge detection or by segmenting the
image into regions followed by boundary finding.
These methods, thus, largely depend on a
segmentation process. On the other hand, the
detect corners directly from the gray values of the
original images without a prior segmentation. Each
of these two above categories can further be
subdivided into spatial domain and frequency
domain methods. Spatial domain methods directly
operate on the pixel values of the image. In
transform domain methods, the image is first
transformed to some other domain, which is then
passed through a suitable filter and finally the
filtered information is mapped back to the spatial
domain with the help of an inverse transform
operation.
The remainder of the paper is structured as
follows. In section 2, we discuss different
performance measures of corner detectors. In the
subsequent sections (section 3-6), we present a
literature survey of 114 corner detection algorithms
under different categories of corner detection
algorithms. Finally, we conclude in section 7.
2. PERFORMANCE MEASURES FOR
CORNER DETECTORS
The exact number of corners in the image, the
number of corners truly detected, the number of
corners missed and the number of extra corners
detected play very important role for the
comparison of corner detection algorithms. To
evaluate the performance of corner detection

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 124

Corner Detection Algorithms

Boundary based Intensity based

Spatial Domain Transform Domain Spatial Domain Transform Domain

Fig 1 Classification of corner detection algorithms

algorithms, a few performance measures had
already been proposed in the literature [6, 7, 108].
We have also proposed three performance
measures – Detection Gradient, False Positive
Ratio and False Negative Ratio, comparable with
the existing measures, which are defined below.
| NA – ND | + | NM + NF |
DG = ⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯⎯
NA
NF
FPR = ⎯⎯⎯
NA
NM
FNR = ⎯⎯⎯
NA
where NA, ND, NM and NF denote the total number
of corners present in the image, the number of true
corners detected, the number of missed (false
negative) corners and number of extraneous (false
positive) corners detected in the image,
respectively. In the best case, the value of DG is
zero, which signifies that all the corners are
correctly detected without any missed or false
corners; the same is true for FPR and FNR.
3. BOUNDARY BASED SPATIAL
DOMAIN METHODS
Freeman and Davis [8] and Rutkowski and
Rosenfeld [1] detected corners by using chain-
code values. Medioni and Yasumoto [9] used B-
Splines to develop a technique for corner detection
and curve representation. Beus and Tiu [10]
developed an algorithm based on chain-coded plane
curves that eliminates the detection of spurious
corners using a maximum cut-off value to determine
the length of the forward and backward arms of
each point. Davies [11] proposed corner detector
based on generalized Hough transform. Ogowa [12]
computed a symmetry measure at every point on a
digital curve and then extracted corners at the local
maxima of the measure. Rangarajan, Shah and
Brackle [13] proposed an optimal gray level corner
detector based on Canny’s optimal one-dimensional
edge detector [14]. Rattarangsi and Chin [15]
presented scale-based corner detection algorithm
on planar curves. Mehrotra, Nichani and
Ranganathan [16] described two methods for corner
detection, one was based on the first directional
derivative of Gaussian and the other was based on
the second directional derivative of Gaussian. The
detector also computed corner angle and
orientation. Bell and Pau [17] developed a corner
detector based on Freeman’s chain-code. Liu and
Tsai [18] proposed a method based on the principle
of preserving gray and mass moments. Cooper,
Venkatesh and Kitchen [19] used two different
approaches to detect corners in an image – one, by
using dissimilarity along the contour direction to
detect curves in the image contour, and the other
by estimating image curvature along contour
direction. Orange and Greon [20] proposed
segmentation model for the detection of corners

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W


based on a geometrical model. Xie, Sudhakar and
Zhuang [21] presented a cost minimization
approach to corner detection in which they
associated a corner with different cost factors
capturing desirable characteristics of a corner. Pei
and Horng [22] extracted corners from curvature
local maxima of the shape resulting from the nest
moving average of the original image. Seeger and
Seeger [23] detected corners from a gray-level
image by a real-time parameter-free algorithm.
Sugimoto and Tomita [24] proposed an algorithm
for the detection of various feature points (corner,
inflection and transition). Zhang, Haralick and
Ramesh [25] described a maximum a posteriori
(MAP) probability technique for corner detection.
Pikaz and Dinstein [26] proposed an approach
based on a simple decomposition of the curve into
the minimal number of concave and convex
sections to detect feature points and to smooth
noisy digital curves. Sohn, Alexander, Kim and
Snyder [27] presented a constraint regularization
approach to detect corners that overcome the
problem of determining the unique smoothing factor.
Koplowitz and Plante [28] proposed a scheme for
chain-coded curves by measuring the number of
links to either side of a point that can produce the
largest digital straight line. Ray and Ray [29]
presented a corner detection algorithm using an
iterative Gaussian convolution with constant
window size. Dias, Kassim and Srinivasan [30]
presented an artificial neural network based corner
detection algorithm in a 2-D image. Wang, Wu,
Huang and Wang [31] proposed a modified contour
tracking and efficient corner detection algorithm
using bending value. Lai, Paul and Wu [32]
presented an edge-corner detection algorithm,
called Cellular Vectorization Method. Sheu and Hu
[33] proposed a rotationally invariant two-phase
scheme for corner detection where the candidate
corners are detected first and then these corners
are reinvestigated for the global trend. Arrebola,
Camacho, Bandera and Sandoval developed
techniques which are based on local [34] and
circular [35] histograms of the contour chain code.
Ji and Haralick [36] applied statistical techniques
to detect corners from chain-encoded digital arcs.
Ray and Ray [37] used a discrete scale-space
kernel to detect corners on a digital arc. Tsai [38]
proposed a boundary based corner detection
algorithm by developing two artificial neural
networks, one for detecting corners with high
curvature, and the other for detecting points of
Vol. 25, No. 3, May-June’08
125
tangency and inflection. Zheng and Zhao [39]
implemented a parallel algorithm for detecting
dominant points on multiple digital curves. Shilat,
Werman and Gdalyahu [40] presented a method for
the detection of corners along ridges/troughs and
local minima points. Mokhtarian and Soumela [41]
presented a corner detection algorithm based
curvature scale space representation in which first
the edges are extracted from the original image
using Canny edge detector [14], and then corners
are found from the edge image where there is a
local maxima of absolute curvature. Sohn, Kim and
Alexander [42] presented a mean field annealing
approach to boundary smoothing for curvature
estimation to improve the capability of detecting
corners. Li and Chen [43] described a corner
detection algorithm on planar curves as a fuzzy
classification problem containing three stages –
evaluation, classification and location. Luo, Cross
and Hancock [44] described a corner detection
algorithm based on the topographic analysis of a
vector potential image representation. Tsai, Hou
and Su [45] presented a quantitative measure of
corners based on the smaller eigen value of the
covariance matrix of boundary points over a small
region of support. Guest and Fairhurst [46]
described a clustering approach to corner point
analysis in hand-drawn images. Ludtke, Luo,
Hancock and Wilson [47] proposed a corner
detection algorithm using mixture model of edge
orientation. Oh and Chien [48] described a corner
detection algorithm by combining the generalized
symmetry transform (GST) operator with the
parametric corner equation. Shen and Wang [49]
proposed a fast corner detector using modified
Hough transform. Ray and Pandyan [50] presented
an adaptive corner detector for planar curves. Marji
and Siy [51] proposed an algorithm for detecting
dominant points and polygonal approximation of
digitized closed curves. Wu [52] proposed an
efficient method for dominant point detection using
adaptive bending value. Urdiales, Trazegnies,
Bandera and Sandoval [53] presented a fast
algorithm for corner detection defined at different
scales by estimating the curvature of a contour in a
local adaptive way. Banerjee, Kundu and Mitra [54]
presented a support vector machine based
algorithm for corner detection. Guru, Dinesh and
Nagabhushan [55] presented a fast and efficient
corner detection algorithm by introducing a new
measure “cornerity index” for the quantification of
the prominence of a corner point. Arrebola and
I E T E T E C H N I C A L R E V I E W

Sandoval [56] detected corners by means of the
hierarchical computation of a multi-resolution
structure. Sarfraj, Rasheed and Muzaffer [57]
presented a simple, robust and efficient real-time
corner detection algorithm based on the change of
sign of slope of the curve along the contour. Olague
and Hernandez [58] proposed an accurate and
flexible model-based multi-corner detector. Poyato,
Garcia, Carnicer and Cuevas [59] described an
efficient algorithm for detecting dominant points on
the boundaries of digital planar curves. Sobania
and Evans [60] proposed a morphological corner
detector using paired triangular structuring
element. The detector operated on the boundaries
of a segmented image in a binary format and
detected only interior or concave corners.
Mokhtarian and Mohanna [7] presented a nice
literature survey on the existing corner detection
algorithms, provided two performance measure,
accuracy and consistency, for corner detection
algorithms and gave an enhanced version of original
CSS corner detection algorithm [41], which worked
on multiple scales also.
4. BOUNDARY BASED TRANSFORM
DOMAIN METHODS
Chen, Lee and Sun [61-63] proposed multi-
scale gray-level corner detection algorithms based
on the modulus and orientation information of the
wavelet transform which are used to detect edges
and localize corners respectively. They also
provided a multi-scale corner detection algorithm
based on the wavelet transform of contour
orientation. Kohlmann [64] derived a feature
detection algorithm with 2-D intensity changes
using 2-D Hilbert transform. Quddus and Falmy
[65, 66] proposed a wavelet-based corner detection
algorithm on planar curves. Peng, Zhou and Ding
[67] proposed a boundary-based corner detection
using wavelet transform. Gao, Sattar, Quddus and
Venkateswarlu [68] proposed a multi-scale corner
detection algorithm based on continuous wavelet
transform on contour images. Yeh [69] proposed a
robust, rotation- and scale-invariant wavelet-based
corner detection algorithm on circular arcs by using
the eigen vectors of the covariance matrices. Sun,
Tang and You [70] proposed a wavelet-based corner
detection algorithm by estimating the curvature of a
contour in an adaptive way.
Vol. 25, No. 3, May-June’08
126
5. INTENSITY BASED SPATIAL
DOMAIN METHODS
Moravec [71] gave the concept of “points of
interest” as points where a significantly high
intensity variation occurs in every direction.
Beaudet [72] presented a determinant operator,
which has large values near the corners. Kitchen
and Rosenfeld [73] were the first to apply the
differential operators that consists of first and
second order partial derivatives of the image to
detect corners. They proposed a cornerness
measure based on the product of the gradient
magnitude and the change of the gradient direction
along an edge contour. The local maxima of the
measure isolated corner points. The detector is
very sensitive to noise. Wu and Rosenfeld [74]
detected corner points by a filter projection method.
Zuniga and Haralick [75] proposed a facet model
based corner detector. Paler, Foglein, Illingworth
and Kittler [76] extracted corners from the local
distribution of gray level values. Harris and
Stephens [77] estimated the measure of local
autocorrelation using first-order derivatives that is
suggested by performing an analytic expansion of
the Moravec [71] operator. At each pixel location a
2X2 autocorrelation matrix is computed and if both
the eigen values are large, the pixel is considered
to be a corner. The algorithm is computationally
expensive. Forstner and Gulch [78] used the same
cornerness measure as Harris and Stephens [76],
but their algorithm has higher computational
complexity. Tomasi and Kanade [79] derived the
same equation by analyzing the optical flow
equation presented by Lucas and Kanade [80].
Noble [81] explained the method of estimation of
image curvature by Harris and characterized two-
dimensional surface features. Deriche and
Giraudon [82] detected corners using a scale space
based approach by combining useful properties
from Laplacian and Beaudet’s cornerness measure.
Shi and Tomasi [83] proposed a method for feature
selection, a tracking algorithm based on a model of
affine image changes, and a technique for
monitoring features during tracking. Wang and
Brady [84, 85] presented a simple and accurate
corner detector based on the cornerness
measurement of the total surface curvature. Cui
and Lawrence [86] proposed scale-space
consistent algorithm to detect corners in binary
images based on corner attributes. Lee and Bien
[87] formulated a pattern classification problem to
I E T E T E C H N I C A L R E V I E W

detect gray-level corners in real-time algorithm
using fuzzy logic. Diaz, Domingo and Ayala [88]
detected two-dimensional feature point from a
grayscale image using the application of statistical
techniques. Smith and Brady [89] proposed SUSAN
corner detector using a concept that each image
point is associated with it a local area of similar
brightness. If the brightness of each pixel within a
mask is compared with the brightness of that
mask’s nucleus, then an area of the mask can be
defined which has the same (or similar) brightness
as the nucleus. This area of the mask is known as
the “USAN”, an acronym for “Univalue Segment
Assimilating Nucleus”. The value of USAN gets
smaller on both sides of an edge and becomes even
smaller on each side of a corner. The local minima
of the USAN map represent corners in the image.
Kautsky, Zitova, Flusser and Peters [90, 91]
proposed a two-stage method for the detecting the
feature points in which all possible candidates are
found first and then the desirable number of
resulting significant points is selected among them
by maximizing the weight function. Laganiere [92]
proposed a morphological corner detector using an
asymmetric closing operator. Lin, Chu and Hsueh
[93] also used mathematical morphological
operators for corner detection with simple integer
computation. Stammberger, Michaelis, Reiser and
Englmeier [94] proposed a hierarchical approach to
corner detection in which the whole image is
convolved with only one kernel. Trajkovic and
Hedley [95] proposed a fast corner detection
algorithm using a multigrid approach to reduce the
computational complexity and to improve the
quality of the detected corners. Chabat, Yang and
Hansell [96] used an operator to detect the true
location and orientation of corners. Lv and Zhou
[97] modified the cornerness measure of Kitchen-
Rosenfeld detector [73] based on the perception of
human vision system to make the detector effective
in variable illumination scenes. Zheng, Wang and
Toeh [2] presented a gradient direction corner
detector, derived from the Plessey corner detector,
which is based on the measure of the gradient
module of image gradient direction. Sojka [98]
presented a reliable, robust corner detection
algorithm in digital images. Ruzon and Tomasi [99]
used both a region model based on the distributions
of pixel colors and an edge model for the detection
of corners in textured color images. Basak and
Mahata [100] proposed a connectionist model to
detect corners in binary and gray images.
Vol. 25, No. 3, May-June’08
127
Deschenes and Ziou [101] presented an approach
to detect the line junctions in gray images. Alvarez,
Cuenca and Mazorra [102] proposed a
morphological corner detection algorithm to
estimate corners with sub-pixel accuracy and
tested the detector’s accuracy in the problem of
multiple camera calibration. Wurtz and Laurens
[103] presented a corner detection algorithm in
color images through a multi-scale combination of
end-stopped cortical cells. Telle and Aldon [104]
proposed a interest point detector for color images
based on non-linear filtering of the image. Gao, Yu,
Sattar and Venkateswarlu [105] proposed an
improved Plessey corner detector, worked in scale-
space domain, for gray level images using multi-
scale analysis. Bae, Kweon and Yoo [106] used two
oriented cross operators, COP (crosses as ordered
pair) to extract low-level image features, viz.,
corners. Elias and Laganiere [107] proposed an
approach based on a data structure similar to
pyramid, but of circular levels, to determine the
location and orientation of corners. Golightly and
Jones [108] presented an algorithm for corner
detection and matching for visual tracking of power
line inspection and proposed two performance
measures – detection rate and error rate – for the
corner detection algorithms. Mikolajczyk and
Schmid [109] presented two techniques for corner
detection invariant to scale and affine
transformations. Alkaabi and Deravi [110]
presented a fast corner detection algorithm based
on pruning candidate corners. Zhou, Liut and Cai
[111] improved SUSAN corner detector [89] by
presenting a robust and efficient corner detection
algorithm which is capable of detecting the features
in different contrast images automatically through
self-adjust multi-threshold. Kenney, Zuliani and
Manjunath [112] presented an axiomatic approach
to corner detection. Vincent and Laganiere [113]
proposed a new feature point detector which first
performs a simple segmentation based on the
intensity values found in the vicinity of each
considered point, and then, it tries to fit a simple
wedge corner model to the resulting segmented
area. Cooke and Whatmough [114] proposed two
ways – one by using genetic algorithm and another
by using supervised classification techniques –
towards the application of learning algorithms in
corner detection. Pei and Ding [115] proposed a
corner detection algorithm based on determining
orientations of the adaptive vertical and tangent
axes and observing the variations of brightness
I E T E T E C H N I C A L R E V I E W

along the positive and negative directions of these
axes. Rosten and Drummond [116] used machine
learning for fast and high quality corner detection.
6. INTENSITY BASED TRANSFORM
DOMAIN METHODS
Quddus and Falmy [117] proposed a corner
detection algorithm based on scale interaction
model using Gabor filter suitable for both binary and
gray level images with variable background.
Pedersini, Pozzoli, Sarti and Tubaro [118] proposed
a wavelet-based multi-resolution corner detection
algorithm based on the analysis of multi-scale
Laplacian’s profile. Quddus and Gabbouj [119]
proposed a wavelet-based corner detection
algorithm using singular value decomposition
(SVD). Gao, Sattar and Venkateswarlu [120]
presented a multi-scale corner detection algorithm
on gray images using Gabor wavelets.
7. CONCLUSIONS
In this paper, we provide a literature survey on
existing corner detection algorithms developed in
the last three decades starting from 1977 which
include a total of 114 algorithms. We then classify
these algorithms into two main categories –
boundary-based and intensity-based methods,
which, in turn, are again subdivided into spatial
domain and transform domain methods. After this
classification, we have observed that out of these
114 algorithms, 54 algorithms belong to boundary-
based spatial domain, 10 belong to boundary-based
transform domain, 46 belong to intensity-based
spatial domain and only 4 to intensity-based
transform domain. But since transform domain
methods are intensely used in various applications
in image analysis and processing and
comparatively much less work has been carried out
in transform domain, there is a tremendous scope
of work in the field of corner detection in transform
domain. Moreover, all transform domain methods
discussed in this survey were based on wavelet
transform and since there are many other
transforms available, e.g. Fourier, Hartley, Walsh-
Hadamard, Haar, Slant, Karhunen-Loeve etc, so
efficiency of these transforms may be investigated
and noted. Though the majority of work in this field
has been carried out in the spatial domain, still
there is scope more work in this area. We have also
Vol. 25, No. 3, May-June’08
128
found that most of the work has been carried out on
boundary (binary) and gray-scale images. So, there
is huge scope of work in the field of corner detection
that will directly operate on the color images as
well. In addition, any boundary-based corner
detection algorithm consists of finding boundary
from an image, followed by following and closing
the boundary, which always requires some manual
intervention resulting in high computational time.
7. REFERENCES
1. W S Rutkowski & A Rosenfeld, A comparison of
corner detection techniques for chain-coded curves,
Technique Report TR-623, Computer Science Center,
University of Maryland, 1978.
2. A Heyden & K Rohr, Evaluation of Corner Extraction
Schemes Using Invariance Methods, in: Proc
International Conference on Pattern Recognition, vol
1, Vienna, Austria, pp 895-899, 1996.
3. Z Zheng, H Wang & E K Toeh, Analysis of Gray
Level Corner Detectors, Pattern Recognition Letters,
vol 20, pp 149-162, 1999.
4. C Schmid, R Mohr & C Bauckhage, Evaluation pf
Interest Point Detectors, International Journal of
Computer Vision, vol 37, no 2, pp 151-172, 2000.
5. P I Rockett, Performance Assessment of Feature
Detection Algorithms: A Methodology and Case
Study on Corner Detectors, IEEE Transaction on
Image Processing, vol 12, no 12, pp 1668-1676,
December, 2003.
6. F Mohanna & F Mokhtarian, “Performance Evaluation
of Corner Detection Algorithms under Similarity and
Affine Transforms,” in Proc British Machine Vision
Conference, Manchester, UK, pp 353–362,
September 2001.
7. F Mokhtarian & F Mohanna, Performance evaluation
of corner detectors using consistency and accuracy
measures, Computer Vision and Image
Understanding, vol 102, pp 81- 94, 2006.
8. H Freeman & L S Davis, A Corner Finding Algorithm
for Chain-Code Curves, IEEE Transaction on
Computers, vol 26, pp 297-303, 1977.
9. G Medioni & Y Yasumoto, Corner Detection and
Curve Representation using Cubic B-Splines,
Computer Vision Graphics & Image Processing, vol
39, no 3, pp 267-278, 1987.
10. H L Beus & S S H Tiu, An Improved Corner Detection
Algorithm Based on Chain-Coded Plane Curves,
Pattern Recognition, vol 20, no 3, pp 291-296, 1987.
11. E R Davies, Application of the Generalized Hough
Transform to Corner Detection, in: IEE Proceedings
I E T E T E C H N I C A L R E V I E W

on Computers and Digital Techniques, vol 135, Part
E, no 1, pp 49-54, January 1988.
12. H Ogawa, Corner Detection on Digital Curves Based
on Local Symmetry of the Shape, Pattern
Recognition, vol 22, no 4, pp 351-357, 1989.
13. K Rangarajan, M Shah & D V Brackle, Optimal Corner
Detector, Computer Vision Graphics & Image
Processing, vol 48, pp 230-245, 1989.
14. J F Canny, A Computational Approach to Edge
Detection, IEEE Transaction on Pattern Analysis and
Machine Intelligence, vol 8, no 6, pp 679-698, 1986.
15. A Rattarangsi & R T Chin, Scale-based Detection of
Corners of Planar Curves, IEEE Transaction on
Pattern Analysis and Machine Intelligence, vol 14, pp
430-449, 1992.
16. R Mehrotra, S Nichani & N Ranganathan, Corner
Detection, Pattern Recognition, vol 23, no 11, pp
1223-1233, 1990.
17. B Bell & L F Pau, Contour Tracking and Corner
Detection in a Logic Programming Environment, IEEE
Transaction on Pattern Analysis and Machine
Intelligence, vol 12, no 9, pp 913-917, September
1990.
18. S T Liu & W H Tsai, Moment-Preserving Corner
Detection, Pattern Recognition, vol 23, no 5, pp 441-
460, 1990.
19. J Cooper, S Venkatesh & L Kitchen, Early Jump-out
Corner Detectors, IEEE Transaction on Pattern
Analysis and Machine Intelligence, vol 15, no 8, pp
823-828, August 1993.
20. C M Orange & F C A Greon, Model Based Corner
Detection, in: Proc IEEE Computer Society
Conference on Computer Vision and Pattern
Recognition, New York, NY, USA, pp 690-691, June
1993.
21. X Xie, R Sudhakar and H Zhuang, Corner Detection
by a Cost Minimization Approach, Pattern
Recognition, vol 26, no 8, pp 1235-1243, 1993.
22. S C Pei & J H Horng, Corner Point Detection using
Nest Moving Average, Pattern Recognition, vol 27,
no 11, pp 1533-1537, 1994.
23. U Seeger & R Seeger, Fast Corner Detection in
Gray-level Images, Pattern Recognition Letters, vol
15, pp 669-675, 1994.
24. K Sugiamoto & F Tomita, Boundary Segmentation by
Detection of Corner, Inflection and Transition Points,
in Proc IEEE Workshop on Visualization and Machine
Vision, Seattle, CA, USA, pp 13-17, June 1994.
25. X Zhang, R M Haralick & V Ramesh, Corner
Detection using the MAP Technique, Conference A:
Computer Vision & Image Processing, Proceedings
Vol. 25, No. 3, May-June’08
129
of the 12th IAPR International Conference on Pattern
Recognition, Jerusalem, Israel, vol 1, pp 549-552,
October 1994.
26. A Pikaz & I Dinstein, Using Simple Decomposition
for Smoothing and Feature Point Detection of Noisy
Digital Curves, IEEE Transaction on Pattern Analysis
and Machine Intelligence, vol 16, no 8, pp 808-813,
August 1994.
27. K Sohn, W E Alexander, J H Kim & W E Snyder, A
Constrained Regularization Approach to Robust
Corner Detection, IEEE Transaction On Systems,
Man, and Cybernetics, vol 24, no 5, pp 820-828, May
1994.
28. J Koplowitz & S Plante, Corner Detection for Chain
Coded Curves, Pattern Recognition, vol 28, no 6, pp
843-852, 1995.
29. B K Ray & K S Ray, Corner Detection using Iterative
Gaussian Smoothing with Constant Window Size,
Pattern Recognition, vol 28, no 11, pp 1765-1781,
1995.
30. P G T Dias, A A Kassim & V Srinivasan, A Neural
Network Based Corner Detection Method, in: Proc
IEEE International Conference on Neural Networks,
Perth, WA, Australia, vol 4, pp 2116-2120,
November-December 1995.
31. M J J Wang , W Y Wu, L K Huang & D M Wang,
Corner Detection using Bending Value, Pattern
Recognition Letters, vol 16, pp 575-583, 1995.
32. K K Lai & P S Y Wu, Effective Edge-Corner Detection
Method for Defected Images, in: Proc of 3rd
International Conference on Signal Processing,
Beijing, China, vol 2, pp 1151-1154, October 1996.
33. H T Sheu & W C Hu, A Rotationally Invariant Two-
Phase Scheme for Corner Detection, Pattern
Recognition, vol 29, no 5, pp 819-828, 1996.
34. F Arrebola, A Bandera, P Camacho & F Sandoval,
Corner Detection by Local Histograms of Contour
Chain Code, Electronics Letters, vol 33, no 21, pp
1769-1771, 9th October, 1997.
35. F Arrebola, P Camacho, A Bandera and F Sandoval,
Corner Detection and Curve Representation by
Circular Histograms of Contour Chain Code,
Electronics Letters, vol 35, no 13, pp 1065-1067,
24th June, 1999.
36. Q Ji & R M Haralick, Corner Detection with
Covariance Propagation, in: Proc of Conference on
Computer Vision and Pattern Recognition, San Juan,
Puerto Rico, pp 362-367, June 1997.
37. B K Ray & K S Ray, Scale-Space Analysis and
Corner Detection on Digital Curves using a Discrete
Scale-Space Kernel, Pattern Recognition, vol 30, no
9, pp 1463-1474, 1997.
I E T E T E C H N I C A L R E V I E W

38. D M Tsai, Boundary-Based Corner Detection using
Neural Networks, Pattern Recognition, vol 30, no 1,
pp 85-97, 1997.
39. Z Zheng & D Zhao, Parallel Algorithm for Detecting
Dominant Points on Multiple Digital Curves, Pattern
Recognition, vol 30, no 2, pp 239-244, 1997.
40. E Shilat, M Werman & Y Gdalyahu, Ridge’s Corner
Detection and Correspondence, in: Proc IEEE
Conference on Computer Vision and Pattern
Recognition, San Juan, Puerto Rico, pp 976-981,
June 1997.
41. F Mokhtarian & R Suomela, Robust Image Corner
Detection through Curvature Scale Space, IEEE
Transaction on Pattern Analysis and Machine
Intelligence, vol 20, no 12, pp 1376-1381, December
1998.
42. K Sohn, J H Kim & W E Alexander, A Mean Field
Annealing Approach to Robust Corner Detection,
IEEE Transaction on Systems, Man and Cybernetics
- Part B: Cybernetics, vol 28, no 1, pp 82-90,
February 1998.
43. L Li & W Chen, Corner Detection and Interpretation
on Planar Curves using Fuzzy Reasoning, IEEE
Transaction on Pattern Analysis and Machine
Intelligence, vol 21, no 12, pp 1204-1210, December
1999.
44. B Luo, A.D.J Cross & E.R Hancock, Corner
Detection Via Topographic Analysis of Vector-
Potential, Pattern Recognition Letters, vol 20, pp
635-650, 1999.
45. D M Tsai, H T Hou & H J Su, Boundary-Based
Corner Detection using Eigen Values of Covariance
Matrices, Pattern Recognition Letters, vol 20, pp 31-
40, 1999.
46. R M Guest & M C Fairhurst, A Clustering Approach
to Corner Point Analysis in Hand Drawn Images, in:
Proceedings of the 16th International Conference on
Pattern Recognition, vol 3, pp 940-943, 2002.
47. N Ludtke, B Luo, E Hancock & R C Wilson, Corner
Detection using a Mixture Model of Edge Orientation,
in: Proceedings of the 16th International Conference
on Pattern Recognition, vol 2, pp 574-577, 2002.
48. H H Oh & S I Chien, Exact Corner Location using
Attentional Generalized Symmetry Transform,
Pattern Recognition Letters, vol 23, pp 1361-1372,
2002.
49. F Shen & H Wang, Corner Detection Based on
Modified Hough Transform, Pattern Recognition
Letters, vol 23, pp 1039-1049, 2002.
50. B K Ray & R Pandyan, ACORD – An Adaptive
Corner Detector for Planar Curves, Pattern
Recognition, vol 36, pp 703-708, 2003.
Vol. 25, No. 3, May-June’08
130
51. M Marji & P Siy, A New Algorithm for Dominant
Points Detection and Polygonization of Digital Curves,
Pattern Recognition, vol 36, pp 2239-2251, 2003.
52. W Y Wu, Dominant Point Detection using Adaptive
Bending Value, Image and Vision Computing, vol 21,
pp 517-525, 2003.
53. C Urdiales, C Trazegnies, A Bandera & E Sandoval,
Corner Detection Based on Adaptively Filtered
Curvature Function, Electronics Letters, vol 39 no 5,
pp 426-428, 6th March 2003.
54. M Banerjee, M K Kundu & P Mitra, Corner Detection
using Support Vector Machines, in: Proceedings of
the 17th International Conference on Pattern
Recognition, vol 2, pp 819-822, August 2004.
55. D S Guru, R Dinesh & P Nagabhushan, Boundary
Based Corner Detection and Localization using New
‘Cornerity’ Index: A Robust Approach, in:
Proceedings of the First Canadian Conference on
Computer and Robot Vision, pp 423-427, May 2004.
56. F Arrebola & F Sandoval, Corner Detection and Curve
Segmentation by Multiresolution Chain-Code Linking,
Pattern Recognition, vol 38, pp 1596-1614, 2005.
57. M Sarfraz, A Rasheed, & Z Muzaffar, A Novel Linear
Time Corner Detection Algorithm, in: Proceedings of
the Computer Graphics, Imaging and Vision: New
Trends, pp 191-196, July 2005.
58. G Olague & B Hernandez, A New Accurate and
Flexible Model Based Multi-Corner Detector for
Measurement and Recognition, Pattern Recognition
Letters, vol 26, pp 27-41, 2005.
59. A C Poyato, N L F Garcýa, R M Carnicer & F.J M
Cuevas, Dominant Point Detection: A New Proposal,
Image and Vision Computing, vol 23, pp 1226-1236,
2005.
60. A Sobania & J P O Evans, Morphological Corner
Detector using Paired Triangular Structuring
Elements, Pattern Recognition, vol 38, pp 1087-1098,
2005.
61. J S Lee, Y N Sun & C H Chen, Gray-Level-Based
Corner Detection by using Wavelet Transform, IEEE
TENCON, Beijing, China, pp 970-973, 1993.
62. C H Chen, J S Lee & Y N Sun, Wavelet
Transformation for Gray-Level Corner Detection,
Pattern Recognition, vol 28, no 6, pp 853-861, 1995.
63. J S Lee, Y N Sun & C H Chen, Multiscale Corner
Detection by Wavelet Transform, IEEE Transaction
on Image Processing, vol 4, no 1, pp 100-104,
January 1995.
64. K Kohlmann, Corner Detection in Natural Images
Based on the 2-D Hilbert Transform, Signal
Processing, vol 48, pp 225-234, 1996.
I E T E T E C H N I C A L R E V I E W

65. A Quddus & M M Falmy, An Improved Wavelet-
Based Corner Detection Technique, in: Proc IEEE
International Conference on Acoustics, Speech, and
Signal Processing, Phoenix, AZ, USA, vol 6, pp 3213-
3216, 1999.
66. A Quddus & M M Falmy, Detection of Corners and
Smooth Joins using Wavelet Transform, in: Proc of
the 1999 IEEE International Symposium on Circuits
and Systems, Orlando, FL, USA, vol 3, pp 395-398,
1999.
67. X Peng, C Zhou & M Ding, Corner Detection Method
Based on Wavelet Transform, in: Proc SPIE, vol
4550, pp 319-323, 2001.
68. X Gao, F Sattar, A Quddus & R Venkateswarlu,
Corner Detection of Contour Images using
Continuous Wavelet Transform, ICICS-PCM,
Singapore, pp 724-728, 15-18 December, 2003.
69. C H Yeh, Wavelet-Based Corner Detection using
Eigen Vectors of Covariance Matrices, Pattern
Recognition Letters, vol 24, pp 2797- 2806, 2003.
70. L Sun, Y.Y Tang & X You, Corner Detection for
Object Recognition by using Wavelet Transform,
Electronics Letters, vol 38 no 14, pp 699-701, July
2002
71. H P Moravec, Towards Automatic Visual Obstacle
Avoidance, in: Proc 5th International Joint Conference
of Artificial Intelligence, pp 584, Cambridge,
Massachusetts, 1977.
72. P R Beaudet, Rotationally Invariant Image Operators,
in: Proc International Joint Conference of Pattern
Recognition, pp 579-583, Kyoto, 1978.
73. L Kitchen & A Rosenfeld, Gray Level Corner
Detection, Pattern Recognition Letters, vol 1, no 2,
pp 95-102, 1982.
74. Z O Wu & A Rosenfeld, Filtered Projection as an Aid
to Corner Detection, Pattern Recognition, vol 16, no
31, pp , 1983.
75. O A Zuniga & R M Haralick, Corner Detection using
the Facet Model, in: Proc Conference on Computer
Vision and Pattern Recognition, pp 30-37, 1983.
76. K Paler, J Foglein, J Illingworth & J Kittler, Local
Ordered Gray-Levels as an Aid to Corner Detection,
Pattern Recognition, vol 17, no 5, pp 535-543, 1984.
77. C Harris, and M Stephens, “A Combined Corner and
Edge Detector”, 4th Alvey Vision Conference, pp
147-151, Manchester, UK, 1988.
78. W Forstner & E Gulch, A Fast Operator for Detection
and Precise Location of Distinct Points, Corners and
Centers of Circular Features, ISPRS Inter
Commission Workshop, pp 147-151, June 1987.
79. C Tomasi & T Kanade, Shape and Motion from Image
Streams: A Factorization Method-Part 3, Detection
Vol. 25, No. 3, May-June’08
131
and Tracking of Point Features, Technical Report,
CMU-CS-91-132, 1991.
80. B Lucas & T Kanade, An Iterative Registration
Technique with an Application to Stereo Vision, in:
Proc 7th International Joint Conference of Artificial
Intelligence, vol 2, pp 674-679, 1981.
81. A Noble, Finding comers, Image and Vision
Computing, vol 6, no 2, pp 121-128, 1988.
82. R Deriche & G Giraudon, A Computational Approach
for Corner and Vertex Detection, International Journal
of Computer Vision, vol 10, no 2, pp 101-124, 1993.
83. J Shi & C Tomasi, Good Features to Track, in: Proc
IEEE Conference on Computer Vision and Pattern
Recognition, Seattle, CA, USA, pp 593-600, June
1994.
84. H Wang, and M Brady, A Practical Solution to Corner
Detection, in: Proc 5th International Conference on
Image Processing, Austin, TX, USA, vol 1, pp 919-
923, November 1994.
85. H Wang, and M Brady, Real-Time Corner Detection
Algorithm for Motion Estimation, Image and Vision
Computing, vol 13, no 9, pp 695-703, 1995.
86. Y Cui & P D Lawrence, Detecting Scale-Space
Consistent Corners Based on Corner Attributes,
IEEE International Conference on Systems, Man and
Cybernetics, ‘Intelligent Systems for the 21st
Century’, Vancouver, BC, Canada, vol 4, pp 3549-
3554, 1995.
87. K J Lee & Z Bien, A Gray-Level Corner Detector
using Fuzzy Logic, Pattern Recognition Letters, vol
17, pp 939-950, 1996.
88. M E Dýaz, J Domingo & G Ayala, A Gray-Level 2D
Feature Detector using Circular Statistics, Pattern
Recognition Letters, vol 18, pp 1083-1089, 1997.
89. S M Smith & J M Brady, A New Approach to Low-
Level Image Processing, International Journal of
Computer Vision, vol 23, no 1, pp 45-78, 1997.
90. J Kautsky, B Zitova, J Flusser & G Peters, Feature
Point Detection in Blurred Images, in: Proc
International Conference IVCNZ ’98, Image and Vision
Computing Proceedings (Klette R., Gimelfarb G.,
Kakarala R eds.), University of Auckland, Auckland,
New Zealand, pp 103-108, November 1998.
91. B Zitova, J Kautsky, G Peters & J Flusser, Robust
Detection of Significant Points in Multiframe Images,
Pattern Recognition Letters, vol 20, pp 199-206,
1999.
92. R Laganiere, A Morphological Operator for Corner
Detection, Pattern Recognition, vol 31, no 11, pp
1643-1652, 1998.
93. R S Lin, C H Chu & Y C Hsueh, A Modified
Morphological Corner Detector, Pattern Recognition
Letters, vol 19, pp 279-286, 1998.
I E T E T E C H N I C A L R E V I E W

94. T Stammberger, M Michaelis, M Reiser & K H
Englmeier, A Hierarchical Filter Scheme for Efficient
Corner Detection, Pattern Recognition Letters, vol
19, pp 687-700, 1998.
95. M Trajkovic & M Hedley, Fast Corner Detection,
Image and Vision Computing, vol 16, no 2, pp 75-87,
1998.
96. F Chabat, G Z Yang & D M Hansell, A Corner
Orientation Detector, Image and Vision Computing,
vol 17, pp 761-769, 1999.
97. X Lv & J Zhou, Robust Corner Detection under
Varying Illumination, in: Proc International Conference
on Information Intelligence and Systems, Bethesda,
MD, USA, pp 396-398, 1999.
98. E Sojka, A New Algorithm for Detecting Corners in
Digital Images, in: Proc of the 18th Spring Conference
on Computer Graphics, Budmerice, Slovakia, pp 55-
62, 2002.
99. M A Ruzon & C Tomasi, Corner Detection in
Textured Color Images, in: Proc Seventh IEEE
International Conference on Computer Vision,
Kerkyra, Greece, vol 2, pp 1039-1045, 1999.
100. J Basak & D Mahata, A Connectionist Model for
Corner Detection in Binary and Gray Images, IEEE
Transaction on Neural Networks, vol 11, no 5, pp
1124-1132, September 2000.
101. F Deschenes & D Ziou, Detection of Line Junctions
and Line Terminations Using Curvilinear Features,
Pattern Recognition Letters, vol 21, pp 637-649,
2000.
102. L Alvarez, C Cuenca & L Mazorra, Morphological
Corner Detection Application to Camera Calibration,
in: Proceedings of the IASTED International
Conference Signal Processing, Pattern Recognition
& Applications, Rhodes, Greece, pp 21-26, July 2001.
103. R.P Wurtz & T Lourens, Corner Detection in Color
Images through a Multiscale Combination of End-
Stopped Cortical Cells, Image and Vision Computing,
vol 18, pp 531-541, 2000.
104. B Telle & M J Aldon, Interest Points Detection in
Color Images, in: Proc IARP Workshop on Machine
Vision Applications, Nara (Japan), pp 550-553,
December 11-13, 2002
105. X Gao, Z Yu, F Sattar & R Venkateswarlu, Multi
Scale Corner Detection for Gray Level Images using
Plessey Method, in: Proc 8th International
Conference on Control, Automation, Robotics and
Vision, Kunming, China, pp 363-368, December 2004.
106. S Bae, I S, Kweon & C D Yoo, COP: A New Corner
Detector, Pattern Recognition Letters, vol 23, no 11,
pp 1349-1360, 2002.
107. K Elias & R Laganiere, Cones: A New Approach
Towards Corner Detection, in: Proc of the IEEE
Vol. 25, No. 3, May-June’08
132
Canadian Conference on Electrical & Computer
Engineering, pp 912-916, 2002.
108. I Golightly & D Jones, Corner Detection and Matching
for Visual Tracking during Power Line Inspection,
Image and Vision Computing, vol 21, pp 827-840,
2003.
109. K Mikolajczyk & C Schmid, Scale and Affine Invariant
Interest Point Detectors, International Journal of
Computer Vision, vol 60, no 1, pp 63-86, 2004.
110. S Alkaabi & F Deravi, Candidate Pruning for Fast
Corner Detection, Electronic Letters, vol 40, Issue 1,
pp 18-19, 2004.
111. D Zhou, Y H Liut & X Cai, An Efficient and Robust
Corner Detection Algorithm, in: Proc 5th World
Congress on Intelligent Control and Automation,
Hangzhou P.R China, pp 4020-4024, June 2004.
112. C S Kenney, M Zuliani & B S Manjunath, An Axiomatic
Approach to Corner Detection, in: Proc of the IEEE
Computer Society Conference on Computer Vision
and Pattern Recognition, San Diego, CA, USA, pp
191-197, June 2005.
113. E Vincent & R Laganiere, Detecting and Matching
Feature Points, Journal of Visual Communication and
Image Representation, vol 16, pp 38-54, 2005.
114. T Cooke & R Whatmough, Using Learning Algorithms
to Improve Corner Detection, in: Proc Digital Image
Computing: Technqiues and Applications, pp 371-
378, December 2005.
115. S C Pei & J J Ding, New Corner Detection Algorithm
by Tangent and Vertical Axes and Case Table, in:
Proc IEEE International Conference on Image
Processing, vol 1, pp 365 – 368, September 2005.
116. E Rosten & T Drummond, Machine Learning for High-
Speed Corner Detection, in: Proc European
Cinference on Computer Vision, pp 430-443, May
2006.
117. A Quddus & M M Falmy, Corner Detection using
Gabor-type Filtering, in: Proceedings of the IEEE
International Symposium on Circuits and Systems,
vol 4, Monterey, CA, USA, pp 150-153, June 1998.
118. F Pedersini, E Pozzoli, A Sarti & S Tubaro, Multi-
Resolution Corner Detection, in: Proceedings of the
International Conference on Image Processing, vol
3, Vancouver, BC, Canada, pp 881-884, 2000.
119. A Quddus & M Gabbouj, Wavelet-Based Corner
Detection Algorithm Technique using Optimal Scale,
Pattern Recognition Letters, vol 23, pp 215-220,
2002.
120. X Gao, F Sattar & R Venkateswarlu, Corner
Detection of Gray Level Images using Gabor
Wavelets, in: Proc International Conference on Image
Processing, vol 4, pp 2669-2672, October 2004.
I E T E T E C H N I C A L R E V I E W
 133

Authors
Ambar Dutta born on 3rd December, 1977, did his BSc (Honors) in Mathematics from
Presidency College, Kolkata in 1999 and MCA from Jadavpur University, Kolkata in 2002. He is
working as a Lecturer in the department of Computer Science and Engineering, Birla Institute of
Technology, Mesra, Kolkata Extension Centre. He is pursuing his PhD from Jadavpur
University, Kolkata in the area of image processing (corner detection and matching). His
research interest includes Image Processing, Pattern Recognition, Data Mining and Soft
Computing.
Address: Department of Computer Science and Engineering, Birla Institute of Technology,
Mesra, Kolkata Extension Centre, Southend Conclave, 1582, Rajdanga Main Road,
Kolkata 700 107, India.
email: <adutta@bitmesra.ac.in>
* * *

Avijit Kar did his MSc and PhD in 1980 and 1984 respectively from IIT Kharagpur. He is
currently a professor in the department of Computer Science and Engineering in Jadavpur
University, Kolkata. He has supervised several PhD theses and is actively involved in many R
& D activities and IT related consultancy for Government of India and the private sector. His
research interest includes biomedical imaging as well as SAR imaging. He is also into computer
systems reliability. He is involved in a large number of industry sponsored development
projects.
Address: Department of Computer Science and Engineering, Jadavpur University, Kolkata
700 032, India.
email: <avijit_kar@cse.jdvu.ac.in>
* * *

B N Chatterji born on 10th November, 1942, obtained BTech (Hons) (1965) and PhD (1970) in
Electronics and Electrical Communication Engineering of IIT, Kharagpur. He did Post Doctoral
work at University of Erlangen-Nurenberg, Germany during 1972-73. Worked with Telerad Pvt
Ltd, Bombay (1965), Central Electronics Research Institute, Pilani (1966) and IIT, Kharagpur as
faculty member during 1967-2005. He was Professor during 1980-2005, Head of the Department
during 1987-1991, Dean Academic Affairs during 1994-1997 and Member of Board of Governors
of IIT, Kharagpur during 1998-2000. He has published about 150 journal papers, 200 conference
papers and four books. He was Chairman of four International Conferences and ten National
Conferences. He has coordinated 25 short-term courses and was the chief investigator of 24
Sponsored Projects. He is the Fellow/Life Member/Member of eight Professional Societies. He
has received ten National Awards on the basis of his Academic/Research contributions. His
areas of interests are Pattern Recognition, Image Processing, Signal Processing, Parallel
Processing and Control Systems.
Address: Department of Electronics Communication Engineering, B P Poddar Institute of
Management and Technology, 137, VIP Road, Kolkata 700 052, India.
email: <bnchatterji@gmail.com>

Paper No 138-B; Copyright © 2008 by the IETE.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 135

SPIHT: Highly Efficient Technique for Image

Transmission and Coding
NILKANTH B CHOPADE AND A A GHATOL

ABSTRACT
Uncompressed multimedia data (graphics, audio and video) requires considerable storage and transmission bandwidth.
A fundamental goal of data compression is to reduce the bit rate for transmission or storage while maintaining
acceptable quality. Image coding and compression technique, converts an image that requires low memory storages
space, smaller bandwidth for transmission, high PSNR with acceptable image quality. This paper presents wavelet
based coding algorithm SPIHT to encode and compress an image data. The coding and decoding process is
comparatively fast. The numerical results obtained using MATLAB shows that the output image has high value of
PSNR with good compression ratio for low bit rate.

INTRODUCTION Three types of redundancies can be identified:

In many fields, digitized images are replacing
conventional analog images such as photographs,
X-ray, MRI images. Multimedia data including
graphics & audio requires large memory space,
more transmission bandwidth & large channel
capacity for their transmission. Despite rapid
progress in mass-storage density, processor
speeds, and digital communication system
performance, demand for data storage capacity
and data-transmission bandwidth continues to
outstrip the capabilities of available technologies.
The recent growth of data intensive multimedia-
based web applications have not only sustained the
need for more efficient ways to encode signals and
images but have made compression of such signals
central to storage and communication technology
[1]. It has been estimated that over 80 billion new
digital images are produced yearly. Compression &
coding of these images reduces storage cost,
channel bandwidth & transmission rate [2].
Common characteristics of most of images are that
the neighboring pixels are highly correlated.
Therefore most important task is to find a less
correlated representation of image. The
fundamental components of compression are
reduction of redundancy and irrelevancy.
Redundancy reduction aims at removing duplication
from the image. Irrelevancy reduction omits parts
of the signal that will not be noticed by the signal
receiver namely the human visual system (HVS).
Spatial redundancy, Spectral redundancy and
temporal redundancy. In still image, the
compression is achieved by removing spatial
redundancy and Spectral redundancy [3-5].
1. DISCRETE WAVELET TRANSFORM
Wavelets are the functions that satisfy certain
mathematical requirements and are used in
representing data or other functions. The basic idea
of the wavelet transform is to represent any
arbitrary signal as a superposition of a set of such
wavelets or basis functions. These basis functions
are obtained from a single proto-type wavelet called
the mother wavelet by dilation (scaling) and
translation (shifts). Mathematically DWT using two-
scale relation can be expressed as equation (1).
The two scale relation states that the scaling
function at a certain scale can be expressed in
terms of translated scaling functions at the next
smaller scale [6].
φ (2 j t) = Σ hj+1 (k) φ (2 j+1 t – k) (1)
k
1.1. Discrete Wavelet Transform (DWT)
Applied to Image
In case of discrete wavelet, the image is
decomposed into a discrete set of wavelet
coefficients using an orthogonal set of basis

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 136

functions. These sets are divided into four parts
such as approximation, horizontal details, vertical
details and diagonal details; these components are
called as nodes of a tree as shown in Fig 1 [3].
image component & HH component is the result of
high pass filtering of rows & columns [5].
2 THE PEAK SIGNAL TO NOISE
RATIO (PSNR)

The PSNR metric is a well utilized and industry

LL3 HL3 accepted metric for the objective quantification of
HL2
image compression algorithm performance. The
LH3 HH3
HL1 PSNR is a function of mean square error (MSE).

N–1
LH2 HH2
⎢ ⎢2
MSE = Σ ⎢ xi – x^i ⎢ (2)
i=0 ⎢ ⎢

LH1 HH1 ⎛ M 2 ⎞
PSNR = 10 log10 ⎜ ⎯⎯⎯⎯ ⎟ (3)
⎝ MSE ⎠
Where xi , x^i are the input & reconstructed pixel
values in the image respectively & M is the
maximum peak to peak value in the image (typically
256 for 8 bit image). A good PSNR performance is
Fig 1 Pyramidal structure of 3-level wavelet a prerequisite for any modern compression
decomposition algorithm [7,8].

3. SPIHT METHOD FOR IMAGE COM-

PRESSION

The SPIHT technique is based on a wavelet

Fig 2 Parent offspring dependencies in tree based
organization in wavelet transform
A 2D DWT of an image is obtained by using Low
pass & High pass filters successively shown in
Fig 3. An image component obtained by low pass
filtering of rows & columns is LL image. Low pass
filtering of rows & high pass filtering of columns,
gives LH image component. High pass filtering of
rows & low pass filtering of columns gives LH
transform, and differs from conventional wavelet
compression in encoding the wavelet coefficients.
It uses three principles:
(i) Exploitation of the hierarchical structure of
the wavelet transform, by using a tree-based
organization of the coefficients.
(ii) Partial ordering of the transformed coefficients
by magnitude, with the ordering data not
explicitly transmitted but recalculated by the
decoder.
(iii) Ordered bit plane transmission of refinement
bits for the coefficient values.
This leads to a compressed bitstream in which
the most important coefficients (regardless of
location) are transmitted first, the values of all
coefficients are progressively refined, and the
relationship between coefficients representing the
same location at different scales is fully exploited
for compression efficiency. The partial ordering of
the transform coefficients is a result of comparisons
of coefficient magnitudes to a set of octavely

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W


Fig 3 Subband decomposition of an image
decreasing thresholds, with the initial threshold
being the largest power of 2, which is smaller than
the magnitude of the largest coefficient. At any
time, coefficients with magnitudes larger than the
current threshold are deemed to be significant and
others insignificant. The coefficients are considered
to be organized into trees, as shown in Fig 2.
Normally, most of the image energy is concentrated
in the low frequency components. Consequently,
the variance decreases as we move from the
highest to the lowest levels of the wavelet pyramid.
It has been observed that there is a spatial self-
similarity between levels, and the coefficients are
expected to be magnitude ordered if we move
downward in the pyramid following the same spatial
orientation [7].
This organization will allow us to identify large
subtrees as containing no significant pixels. This
algorithm maintains lists of insignificant sets,
insignificant pixels, and significant pixels, and is
initialized with the list of insignificant pixels being
the nodes in the highest layer and the list of
insignificant sets being the sets of the subtree
descendants of each such node. In a ‘sorting’ pass,
the algorithm works its way down the list of
insignificant pixels first, testing their magnitude
against the current threshold, outputting their
significance, and, when one is significant,
outputting its sign and moving it to the list of
significant pixels. Then, it moves through the list of
insignificant sets, performing the magnitude test to
Vol. 25, No. 3, May-June’08
137
all the coefficients in the current set (which initially
are full subtrees of descendants). When all the
coefficients in a set are insignificant, that fact can
be indicated by outputting only one bit. When a
given set contains a significant pixel, it is partitioned
into subsets (subtrees rooted at the descendants of
the current root) and those in turn are tested for
significance. As before, when significant pixels are
identified, their sign is transmitted and they are
moved to the list of significant pixels. After a pass
has been completed through the lists of insignificant
sets and pixels, a ‘refinement’ pass is made through
the list of significant pixels (not including those just
added in the last sorting pass) and the values of
those coefficients are refined by one bit. After an
entire pass is made, the threshold is decreased by
a factor of two and another sorting pass is initiated.
The output bitstream thus consists of the result
of significance tests and signs and refinement bits
of currently significant coefficients. The location of
the coefficients being refined or classified as
significant is never explicitly transmitted; it is
known implicitly since the encoder and decoder
both share the same algorithm, and since all
branching decisions as the encoder searches the
coefficients are output. Arithmetic coding can be
applied to the output bitstream to further compress
the results of the significance tests, at the expense
of more computation time. The signs and refinement
bits both tend to be 0 or 1 with equal probability, so
there is nothing to gain by compressing them.
I E T E T E C H N I C A L R E V I E W
 138

Proceeding in this manner, the algorithm
transmits approximations of the most important
coefficients (those with largest magnitude) first,
and refines the values of all significant coefficients
one bit at a time [1]. This results in a progressive
transmission, which always selects the most
important information that yields the largest
distortion reduction to transmit next. If the wavelet
transform is unitary, then the Euclidean norm is
preserved and it can be shown that such a

Fig 4 Numerical results for different images using SPIHT

Fig 5 PSNR performance for different image coding algorithms

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 139

Fig 6 Results of the SPIHT algorithm for different Images

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 140

TABLE 1: PSNR and compression ratio values for different Images

Image MRI (256X256) & Lena (512X512) & Cameramen (256X256) Rice (256X256) &
8 bit 8 bit &12 bit 12 bit

Bit Rate PSNR Compression PSNR Compression PSNR Compression PSNR Compression
(Bits / Sec) (dB) Ratio (%) (dB) Ratio (%) (dB) Ratio (%) (dB) Ratio (%)

0.2 33.81 83.28 32.52 80.22 28.84 90.00 30.00 88.45

0.4 37.23 81.16 35.00 79.56 31.52 88.43 31.83 88.19

0.6 40.00 79.34 36.74 78.34 32.18 85,10 32.58 87.23

0.8 42.62 78.88 37.32 74.80 33.65 81.64 32.90 82.60

1.0 44.94 64.65 39.22 68.94 35.48 77.33 34.81 78.34

transmission scheme is the optimal way to
decrease the RMS error in the reconstructed image
[6]. The bitstream, which is generated, is fully
embedded, which means that it can be truncated (or
the compression process stopped) at any point and
the image decompressed and reconstructed. In
fact a single file compressed at a high bit rate (low
compression ratio) can be decompressed at any
smaller bit rate (higher compression ratio) and the
results will be identical to having compressed the
file at the higher ratio to begin with. The algorithm
achieves fully progressive transmission: at any
time the transmission of another byte resulting in
simply further refining the values of one or more
coefficients. Thus, the desired compression ratio
or bit rate can be fully specified in advance in
contrast to JPEG or to the conventional wavelet
approach.
4. NUMERICAL RESULTS
The SPIHT coding/decoding algorithm has been
implemented in MATLAB. It has been tested on
images of different of size & type. The DWT level is
kept equal to 3. The numerical results are presented
in tabular form (Table 1) in terms of PSNR values &
Compression ratio for different bit rate. Figure 5
shows the comparative performance of the
proposed algorithm.
5. CONCLUSION
In this paper wavelet based SPIHT image
coding algorithm has been presented. The designed
MATLAB codes are tested with images of different
size & type. From the results it has been found that
increasing bit rate, PSNR increases & compression
ratio decreases. The results of this coding algorithm
with its embedded code and reduced execution
time are so impressive that it can be used for
standardization in many image compression
systems.
6. REFERENCES
1. A Said & W A Pearlman, Image compression using
the special orientation tree, IEEE Int Symp Circuits
and System, Chicago, pp 279-282, May 1993.
2. A Said & W A Pearlman, An Image Multiresolution
Representation for lossless & lossy Image
compression, IEEE transaction on image processing,
vol 15, pp 1303-1310, Sept 1996.
3. A Manduca & A Said, Wavelet Compression of
medical images with SPIHT, SPIE symposium on
Medical imaging, Cambridge, MA, March 1996.
4. R A Dvorer, B Jawerth & B J Lucier, Image
compression through wavelet transform coding, IEEE
Transactions on Information Theory, vol 38, pp 719-
746, Mar 1992.
5. P N Topiwala, Wavelet Image & Video Compression,
Kluwer Academic publisher 2002.
6. K P Soman & K I Ramchandran, Insight into
wavelets, from theory to practice, PHI, New Delhi
2004.
7. M Vetterli J Kovaccevic, Wavelets & Subband
Coding, Prentice Hall PTR, Englewood cliffs, NJ.
8. Yong Sun, Hui Zhang & Guangshu Hu, Real-time
implementation of a new low-memory SPIHT image
coding algorithm using DSP chip, IEEE Transactions
on Image Processing 11(9), pp 1112-1116, 2002.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 141

Authors
N B Chopade, received MSc (Applied Electronics) & ME (Electronics) degrees from SGB
Amravati University, Amravati in the year 1992 & 1998 respectively. He scored third merit
position in Amravati University in the year 1992. His areas of research are DSP, Image
processing, Wavelets Applications. Currently he is pursuing PhD from SGB Amravati University,
Amravati. He has joined SSGM College of Engineering, Shegaon in 1992 and is currently
^

working as Selection Grade Lecturer in the Department of Electronics and Telecommunication

Engineering. He is a member of I E (India), IETE, BES (India) and ISTE. He has presented
several papers in National, International Conferences / Seminars.

Address: Department of Electronics and Telecommunication Engineering, SSGM College of

Engineering, Shegaon 444 203, India.
email: <nbchopade@gmail.com>
* * *

A A Ghatol, is presently Vice-Chancellor of Dr Babasaheb Ambedkar Technological University,

Lonere-Raigad (M.S). He is also acting as a Chairman, Western Regional Committee, AICTE,
New Delhi. Before joining as Vice-Chancellor, he was Principal/Director at Pune Institute of
^

Engineering and Technology and Principal at Government College of Engineering, Amaravati.

He has completed BE from Nagpur University in year 1971, M Tech and PhD from IIT, Mumbai
in the year 1973 and 1984 respectively. He has been actively involved in the field of Technical
Education as Academician, Researcher, Teacher, Planner and Administrator. He is Vice
President of ISTE, Fellow of IETE, IE (India) and Ex-Member of IEEE. He has guided several
ME and Ph D students in Electronics Engineering discipline

Address: Dr. Babasaheb Ambedkar Technological University, Lonere, Dist Raigad 402 103,
India.
email: <vc_2005@rediffmail.com>

Paper No 139-A; Copyright © 2008 by the IETE.

Vol. 25, No. 3, May-June’08 I E T E T E C H N I C A L R E V I E W

 For Advance Information of Authors
A New System for
On-Line Submission and Review of Articles for IETE Journals

Subject of on-line submission & review of articles for IETE Journals has been under
consideration for a long time. Keeping the present trend of Internet, automation and
computerization at different levels, it was considered prudent and necessary to move from
manual hard copy submission and review system to on-line system. The proposed software
is expected to help authors, Honorary Editors, Reviewers, Editors-in-Chief and IETE HQs
to streamline submission and reviewing process for timely publication of journals.
The procurement of software system has been approved by the Council of IETE and will
be operationalized in the near future by end September 2008. Effective date for system
will be publicised in IETE Journals and website.
The salient features of the proposed system are as follows:-
a) The system will create the website and a separate button to choose the journal from
the list. All the three journals will appear on the page. The authors will choose one of
the journal and upload the manuscript. These will be menu driven and simple.
b) Resource templates based on approved standard would be hosted on IETE website
along with the guidelines to authors for submission of articles on line with domain
address www.ietejournals.org.
c) The chairpersons of the editorial boards would be the Editors-in-Chief for the three
journals, i.e. IETE Journal of Education (JE), IETE Journal of Research (JR) and IETE
Technical Review (TR).
d) Each journal will have area editors from across the world as empanelled by the
respective editor-in-chief. These panels would be periodically reviewed taking into
consideration the performance of the panelists.
e) The concerned Editor-in-Chief will carry out on-line preliminary review for further
processing or out-right rejection with intimation to author. The IETE HQ will keep the
record of entire submission, revision, rejection and acceptance details.
f) After final acceptance by the Editor-in-Chief, an e-mail will be generated automatically
to the Administrator, Publication Section at IETE HQs who will have the access to the
word / pdf document of the final accepted manuscript. The administrator will download
it and carry out all editorial changes before it is given to Press for printing of the journals.
h) Authors are requested not to submit any articles to IETE, neither through e-mail
nor by post, till the on-line system is available, which is expected by end
September 2008.
g) The printed journals will be hosted on IETE website for downloading by readers / authors
and will be available on IETE website.
Any suggestions and feedback are most welcome. Please email to ietend@gmail.com
Registered with the Registrar of Newspapers for India, Delhi under Regn. No. 42814/84

Printed and Published by Brig (Retd) V K Panday for the Institution of Electronics and Telecommunication Engineers,
2, Institutional Area, Lodi Road, New Delhi 110 003 (India) and printed at the Shivam Offset Press, A-12/1, Naraina Indl. Area,
Phase I, New Delhi-110 028 (India). Dy Managing Editor : CDR A P Sharma, IN (Retd) • Copyright © 2008 by the IETE