An efficient pattern matching approach using double measures of correlation and rank reduction
by Deep Suman Dev; Himanshu Jaiswal; Dakshina Ranjan Kisku
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 19, No. 1, 2021

Abstract: This paper discusses an efficient pattern matching approach on the use of K-nearest neighbour (K-NN) based rank order reduction and Haar transform in order to detect a pattern in a large scene image. To accomplish the task, scene image is divided into a number of candidate windows and both input pattern and candidate windows are characterised by Haar transform. This characterisation seeks to determine distinctive coefficients known as Haar projection values (HPVs). To obtain more relevant and useful representation of HPVs, rectangle sum is computed and further, sum of absolute (SAD) correlation measure is applied as successive measures between the input pattern and candidate windows. This leads to increase the possibility of finding the object in the scene image before being detected and localised. The proposed pattern matching approach is tested on COIL-100 database and the matching accuracy proves the efficacy of the proposed algorithm.

Online publication date: Wed, 28-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com