CFP last date
20 January 2025
Reseach Article

Article:Development of Correspondence Algorithm for Illumination Varying Dynamic Image Sequence using Symbolic Data Analysis: A Novel Approach

by Y P Gowramma, C N RaviKumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 13
Year of Publication: 2010
Authors: Y P Gowramma, C N RaviKumar
10.5120/1335-1782

Y P Gowramma, C N RaviKumar . Article:Development of Correspondence Algorithm for Illumination Varying Dynamic Image Sequence using Symbolic Data Analysis: A Novel Approach. International Journal of Computer Applications. 7, 13 ( October 2010), 1-6. DOI=10.5120/1335-1782

@article{ 10.5120/1335-1782,
author = { Y P Gowramma, C N RaviKumar },
title = { Article:Development of Correspondence Algorithm for Illumination Varying Dynamic Image Sequence using Symbolic Data Analysis: A Novel Approach },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 7 },
number = { 13 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume7/number13/1335-1782/ },
doi = { 10.5120/1335-1782 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:56:10.234590+05:30
%A Y P Gowramma
%A C N RaviKumar
%T Article:Development of Correspondence Algorithm for Illumination Varying Dynamic Image Sequence using Symbolic Data Analysis: A Novel Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 7
%N 13
%P 1-6
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a novel symbolic data analysis based correspondence algorithm to identify the correspondence of illumination varying multiple object image sequence for the dynamic image analysis. The correspondence is the matching of the similar data sets or entities or the features such as the region based global features, points, corners, edges between a set of images. The Correspondence of illumination varying multispectral, temporal multiple objects using symbolic data analysis of objects in the dynamic images is a highly challenging problem. The determining Correspondence of features is a high dimensional NP-hard problem, because of their exhaustive search for the features in the sequence of image frames. The current algorithm works on the basis of successive frame difference based segmentation. The minimum boundary rectangle constructed for segmented moving object region. Mean of the rectangle is considered as one of the numeric feature. Next the sequence converted to binary sequence based on the threshold and 8-connectivity of perimeter is another non numeric feature. Finally establish the correspondence using canonical symbolic data analysis. This work proposes the rectangular correspondence window, generated dynamically which depends on the size and the number of objects in the current frame. Here we have considered mean of minimum boundary rectangle and perimeter of the segmented region as the features. The experiment is conducted with single object in the scene and multiple objects in the scene of illumination varying, noisy image sequence. This experiment is carried out on the binary, gray and RGB color dynamic image sequence. This correspondence algorithm is especially suitable for tracking in indoor images illuminated by unconstrained multiple light sources, objects in the varying illumination environment, noisy image sequence, video surveillance and slow moving dynamic image sequence for indoor scenes of the constant background.

References
  1. Helko Hirschmuller and Daniel,“ Evaluation of Stereo Matching Costs on Images with Radiometric Differences”,IEEE on Pattn.Analysis and Machine Inttegence,pp 1582-1598,vol.31,no.9,September 2009
  2. SomaBiswas, Gaurav Aggarwal, Ramma Chellappa, ”Robust Estimation of Albedo for Illumination-Invariant Matching and Shape Recovery” ”,IEEE on Pattn.Analysis and Machine Inttegence,pp 884-899,vol.31,no.5,May 2009
  3. Rangarajan .K and Shait.M., 1991, establishing the motion correspondence ,Conference Vision Graphics Image processing 54,1,56-73.
  4. Sethi .I.and Jian .R. 1987 ,Finding trajectories of feature points in a monocular image sequences,IEEE transactions on Pattern Analysis and Mach.Intell 9,1,56-73.
  5. Salari .V and Sethi I.K.1990 ,Feature point correspondence in the presence of occlusion ,IEEE Trans. Patt.Analysis.Mach.Intell.,12,1,87-91.
  6. Veenman.c.,Reinders.M. and Backer.E.2001.Resolving motion correspondence for denly moving points,IEEE Trans.Patt.Analysis Mach.Intelli,23,1,54-72
  7. K. Chidananda Gowda, E. Diday, “Unsupervised learning through symbolic clustering”, Pattern Recognition Letters, Vol.12, pp. 259-264,1991.
  8. Gowda.K.C and E.Diday(1991). Symbolic clustering using a new dissimilarity measure.Pattern Recognition 24(6).
  9. Diday.E. (1993). Data to knowledge, boolean, probabilistic, possibilist and belief objects for symbolic data analysis. Tutorial at IV conf.IFCS.
  10. K.Chidananda Gowda and E.Diday,”Symbolic clustering using a new similarity measure”, IEEE Trans. On systems man and cybernetics, Vol. 22, No.2,March-April 1992.
Index Terms

Computer Science
Information Sciences

Keywords

Successive Frame Difference Symbolic data Analysis Threshold Based Binary Conversion Logical Image Minimum boundary rectangle 8-Connectivity based Perimeter Canonical Symbolic Correspondence