Curvature for Fourier Heat Transformation Method: A Shape based Object Recognition

Page 1

Studies in System Science (SSS) Volume 2, 2014 www.as‐se.org/sss

Curvature for Fourier Heat Transformation Method: A Shape based Object Recognition M. Radhika Mani1, Dr. G.P.S. Varma2, Dr. Potukichi DM3, Dr. Ch. Satyanarayana*4 1

Pragati Engg. College, Surampalem, A.P., India‐533437

2

SRKR Engg. College, Bhimavaram, A.P., India‐534204

3

JNT University Kakinada, Kakinada, A.P., India‐533003

4

JNT University Kakinada, Kakinada, A.P., India‐533003

1

radhika_madireddy@yahoo.com; 2gpsvarma@yahoo.com; 3potukuchidm@yahoo.com; chsatyanarayana@yahoo.com

*4

Abstract In Shape based Object Recognition processes, heat transformations are widely used. Elegance for the computation of it with Fourier transformation is presented. Generic involvement of Cartesian coordinates for the computation is discussed. A novel method that utilizes the features of curvature of the object in the computation of heat transformation, CFHT is proposed. An invariant feature vector is generated with the help of Fourier transformation. New distance measure is used for the computation of shape similarity. The proposed CFHT method is testified over MPEG CE‐1 set B database. The results and the analysis infer relative efficiency for the present method than those with normal Cartesian coordinate method. Keywords Polar Coordinates; Distance Measure; Heat Kernel; Feature Vector; Fourier Transform

Introduction Shape based methods is widely used in the image processing and pattern recognition process recently [1]. The shape based approach consists of different stages viz., shape representation, shape description and shape toning. The shape representation stage identifies the effective representative points of an object. There are two categories of shape representation methods viz., boundary based and region based methods [2, 3]. Moment Invariants [4], Zernike Moments [5, 6] , Krawtchouk moments [7], Chebyshev moments [8, 9] represent some other types of popular moments used for region based descriptors. However, the region based shape representation methods involves the procedures as the medial axis transform [10, 11, 12], grid method [13], and generic Fourier transform [14] etc. Recently, the inelastic deformations that involved with the shape of an object are described by geodesic geometry [15, 16, 17] , inner distances with dynamic programming [18, 19], Laplacian transforms [20, 21] and heat diffusion [22, 23]. Currently, the heat flow equation [24, 25] is successfully applied in different fields. The diffusion process is tested in a more generalized perspective which can be connected to other analogus processes. Nevertheless, Fourier transformation can efficiently describe [26] the intrinsic features of the given object. Based on the shape representation points, shape signature [26, 27] would be constructed and it can be used as an input to the Fourier transformation to generate the shape characteristic feature vector. In the wake of the necessity (i) to conceive the fineness of shape information mediated by details of curvature information and (ii) overcome the problem of mis coverage finer detail information of sharp bends; the existing heat equation based methods needs a more efficient, but simpler method which includes the curvature of the object. Hence, the authors intend to propose a novel curvature based Fourier Heat Transformation method for Shape based Object Recognition. The paper is organized in 3‐sections. Introduction to heat equation based shape description methods is briefed in Section‐I. The details of methodology implemented presently and the relevance is detailed in section‐II. Results of implementing the novel algorithm designed by curvature approach to the standard databases and their analysis with relevant discussion is presented in Section‐III. Methodology An innovative Curvature based Fourier Heat Transformation (CFHT) method for object recognition process is presently proposed. The proposal consists of 4 successive steps viz., (i) Shape representation with contour (ii) CFHT construction (iii) Shape description by using Fourier Transform and (iv) Shape similarity and ranking, respectively. The first step involves the contour representation of the shape surface. Surface is sampled by a finite number of

91


www.as‐se.org/sss Studies in System Science (SSS) Volume 2, 2014

representation points by Equal Arc Length sampling (EAL) [26] method. Let f(x) be a continuous signal which decays sufficiently fast at infinity so that its Fourier transform exists. Then, the solution to the one‐dimensional heat equation satisfying the initial condition u(x, 0) = f(x) is shown by (1). u ( x, t ) 

 K ( x, y; t ) f ( y)dy (1)



Where, f(y) is the Euclidean distance of a point in polar coordinate and k(x,y;t) is defined by (2) K ( x, y; t ) 

1

 x  y / 4t e     (2) 2

4 t

Where, x and y are representing the Cartesian coordinates of a point and t represents time. In the second step, the proposed CFHT method uses f(y) as the curvature of the object. During the third stage, the Fourier transformation is used to derive the feature vector in the proposed system. The Fourier transformation is shown by (3). FDn

1 N

  - j 2 nt    N  (3)

N 1

 s (t )  e

t 0

In order to improve the quality of proposed method, the proposed signature feature vector is further augmented by global descriptors (GD). The GD feature vector {S, C, A} contains the measures of solidity, circularity and aspect ratio. The last step of object recognition involves shape toning process, which is comprised of the similarity measurement of test object feature vector with that of the training sample feature vector. Generally, distance measures are used to evaluate the similarity. Presently, a new distance measure D is proposed as shown in Equation (4). M

eTE TR

i 0

TEi  TRi 6

D(TE , TR )  

i

i

(4)

Where TE represents the test shape feature vector, TR represents the trained shape feature vector and M represents the length of the feature vector. Among various performance measues, the precision and recall are considered to be prevalently adopted measures; Further, they can quantify the similarity measurement. The Precision (P) and Recall (R) measures are defined by: P  R 

x (5) y

x (6) groupsize

where x denotes the true recognition results, y denotes the total recognized result and groupsize denotes the maximum true recognition result. The Average Precision for Low Recall (APLR) denotes the average precision for recalls less than or equal to 50. In the contrary, the Average Precision for High Recall (APHR) represents the average precision for recalls greater than 50. The proposed shape descriptor is compared with the four standard descriptors viz., Angular Radial Transform Descriptor (ARTD) [28], Moment Invariant Descriptor (MID) [28], Zernike Moment Descriptor (ZMD) [29] and Curvature‐Scale‐Space‐Descriptor (CSSD) [29] to estimate the efficiency. The performance for the present curvature based technique is compared with the feature sizes of 35 for ARTD (n<3, m<12), 6 for MID, and 34 for ZMD (order ranges from 2 to 10). But, the CSSD feature size is varied from one image to another, because of the apparent variation in number of the peaks. Results and Discussion The proposed Curvature based Fourier Heat Transformation (CFHT) is applied on the MPEG CE‐1 Set B database [30]. During the first stage, the contour of the object shape is extracted and by using EAL method. The number of representative points is fixed to 128. Then, during the second stage, the CFHT signature is constructed with consideration of the angular or curvature measurement of each of the representative point of the shape. In the third stage, the Fourier transformation is applied on the proposed signature and the first six coefficients is used to form the feature vector of the proposed descriptor. The proposed method feature vector is extended by the GD features. During the final stage, the proposed new distance measure is used for shape similarity and ranking. The proposed

92


Studies in System Science (SSS) Volume 2, 2014 www.as‐se.org/sss

descriptor performance is measured by APLR and APHR values. The performance measure of proposed method is compared to different popular methods by Table‐ 1. From the table 1, it is clear that the CFHT+GD is giving better performance, when compared with other standard descriptors such as ARTD, MID, ZMD, and CSSSD. The CFHT+GD descriptor is found to yield increased performance measure for the APHR than APLR. The trends of Precision‐Recall (PR) for these 5 descriptors evaluated for set B are presented in Figure‐1. Figure‐1 reveals that all the six descriptors are yield considerable enhancement to the precision measure on the Set B database, than especially correspond to the low recalls. However, at high recalls, the present descriptor is found to result for an improved precision measure when compared with other standard descriptors. It is also noticed that the proposed descriptor is found to increase the precision measure marginally at low recalls i.e. for less than or equal to 50. The proposed descriptor has a significant increase in the precision measure at high recalls i.e. for greater than 50. TABLE 1 APLR AND APHR RESULTS OF VARIOUS DESCRIPTORS USING SET B DATABASE.

Descriptor

APHR

APLR

CFHT+GD

83.43

46.04

Average 64.74

ARTD

82.10

45.69

63.90

MID

79.54

44.50

62.02

ZMD

82.56

45.62

64.09

CSSD

78.61

41.81

60.21

FIG. 1 PR GRAPH FOR VARIOUS DESCRIPTORS CORRESPONDING TO SET B DATABASE

For the Set‐B database, the accuracy for the recognized results corresponding to the top 20 images is illustrated in Figure 2. Among various standard descriptors, the ZMD seems to be superior to other descriptors. Hence, it is imperative that the recognition result of proposed descriptor is compared with the ZMD result. The Figure 2(a) illustrates the results corresponding to Teddy18 image from Set Bwhich used as the query image. The Figure 2(b) potrays the recognition result of ZMD and Figure 2(c) provides the recognition result of proposed descriptor. The recognition rate for dissimilar images in recognition result of ZMD is reduced in the recognition result of proposed descriptor.

(a) (b) (c)

FIG. 2 RETRIEVAL RESULTS OF TEDDY18 QUERY IMAGE FROM SET B DATABASE (a) QUERY IMAGE (b) ZMD RECOGNITION RESULTS (c) PROPOSED CFHT+GD RECOGNITION RESULTS.

Conclusion 

A simple Curvature based Fourier Heat Transfer method involving polar coordinate transformation of its surface can be effective tool for the shape representation and its description.

93


www.as‐se.org/sss Studies in System Science (SSS) Volume 2, 2014

Inclusion of angular variables for the object recognition technique enhances the performance.

REFERENCES

[1]

Tangelder J. and Veltkamp R., “A survey of content based 3D shape retrieval methods,” Multimedia Tools and Applications, 39(3), 441–471, 2008.

[2]

Nixon M.S. and Aguado A.S., “Feature Extraction and Image Processing,” Newnes Publishers, first edition, 247‐287, 2002.

[3]

Zhang D., Lu G., “Review of shape representation and description techniques,” Pattern Recognition, 37, 1 – 19, 2004.

[4]

Hu M.K., “Visual Pattern Recognition by Moment Invariants,” IRE Trans. on Information Theory, 8, 179‐187, 1962.

[5]

Teague M.R., “Image Analysis via the General theory of Moments,” Journal of Optical Society of America, 70(8), 920‐930, 1980.

[6]

Kim W.Y., Kim Y.S., “A region based shape descriptor using zernike moments,” Signal Processing: Image Communication, 16, 95‐102, 2000.

[7]

Potocnik B., “Assessment of Region based Moment Invariants for Object Recognition,” 48th International Symposium ELMAR‐2006, 27‐32, 2006.

[8]

Ong S.H., and Lee P.A., “Image Analysis by Tchebichef Moments,” IEEE Transactions on Image Processing, 10(9), 1357‐1364, 2001.

[9]

Mukundan R., “A New Class of Rotational Invariants Using Discrete Orthogonal Moments,” Proceedings of the 6th IASTED Conference on Signal and Image Processing, 80‐84, 2004.

[10] Choi W.P., Lam K.M., Siu W.C., “Extraction of the Euclidean skeleton based on a connectivity criterion,” Pattern Recognition, 36, 721‐729, 2003. [11] Learner B., Guterman H., Dinstein I., Romem Y., “Medial axis transform based features and a neural network for human chromosome classification,” Pattern Recognition 28(11), 1673‐1683, 1995. [12] Goh W.B., “Strategies for shape matching using skeletons,” Computer vision and image understanding, 110, 326‐345, 2008. [13] Lu G., Sajjanhar A., “Region‐based shape representation and similarity measure suitable for content based image retrieval,” Multimedia Systems, 7, 165–174, 1999. [14] Zhang D., Lu G., “Shape‐based image retrieval using generic Fourier descriptor,” Signal Processing: Image Communication, 17, 825–848, 2002. [15] Elad A. and Kimmel R., “Bending invariant representations for surfaces,” In Proc. CVPR, 168–174, 2001. [16] M´emoli F. and Sapiro G., “A theoretical and computational framework for isometry invariant recognition of point cloud data,” Foundations of Computational Mathematics, 5, 313– 346, 2005. [17] Bronstein A. M., Bronstein M. M., and Kimmel R., “Generalized multidimensional scaling: a framework for isometry invariant partial surface matching,” PNAS, 103(5):1168–1172, 2006. [18] Ling H. and Jacobs D., “Using the inner‐distance for classification of articulated shapes,” In Proc. CVPR, 2005. [19] Bronstein A. M., Bronstein M. M., Bruckstein A. M., and Kimmel R., “Analysis of two‐dimensional non‐rigid shapes,” IJCV, 2008. [20] Reuter M., Wolter F.E., and Peinecke N., “Laplace‐spectra as fingerprints for shape matching,” In ACM Symp. Solid and physical modeling, 101–106, 2005. [21] Reuter M., Biasotti S., Giorgi D., Patan`e G., and Spagnuolo M., “Discrete Laplace–Beltrami operators for shape analysis and segmentation,” Computers & Graphics, 33(3):381–390, 2009. [22] Sivic J. and Zisserman A., “Video google: A text retrieval approach to object matching in videos,” In Proc. CVPR, 2003. [23] Coifman R. R. and Lafon S., “Diffusion maps. Applied and Computational Harmonic Analysis,” 21, 5–30, July 2006. [24] Bronstein M.M., Kokkinos I., “Scale invariant heat kernel signatures for non rigid shape recognition,” Proc. CVPR, 2010. [25] P. Jones, M. Maggioni, and R. Schul. Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels. PNAS,

94


Studies in System Science (SSS) Volume 2, 2014 www.as‐se.org/sss

105(6):1803, 2008. [26] Zhang D., Lu G., “A comparative study of curvature scale space and Fourier Descriptors for shape based image retrieval,” Journal of Visual Communication and Image Representation, 14(1), 39‐57, 2003. [27] Ghazal A.E., Basir O., Belkasim S., “Farthest point distance: A new shape signature for Fourier descriptors,” Signal Processing: Image Communication, 24, 572–586, 2009. [28] Zhang G., Ma Z.M., Tong Q., He Y., Zhao T., “Shape Feature Extraction using Fourier Descriptors with brightness in content based Medical image retrieval,” International Conference on Intelligent information hiding and multimedia signal Processing, 2008. [29] Tiagrajah V.J., Razeen A.A.S.M., “An enhanced shape descriptor based on radial distances,” IEEE international conference on signal and image processing applications, 472‐477, 2011. [30] http://homepages.inf.ed.ac.uk/cgi/rbf/CVONLINE/entries.pl?TAG363.

95


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.