(CNMAC 2012)

© All Rights Reserved

1 views

(CNMAC 2012)

© All Rights Reserved

- Study of Natural Class of Intervals Using (-∞, ∞) and (∞, -∞), by W. B. Vasantha Kandasamy, Florentin Smarandache, D. Datta, H. S. Kushwaha, P. A. Jadhav
- Demostraciones de Matrices
- FE Structural Analysis on an Excel
- Matlab Tips
- Zinyama Assignment
- MPSP 2 LINKNET
- jt
- 12695_Introduction to Matlab
- Modul Math Form 5
- MEC321 Fall 2016-17 semester project.docx
- Introduction to Matlab
- Multivariate Data Analysis (3)
- Csca08 Final 2012f
- Syllabus of JEE Mathematics
- Jee Advanced Syllabus 2015 for Maths
- math lesson plan1
- Maths
- Jeeadv Maths Syllabus
- ChE Syllabus
- BootCat: Bootstrapping Corpora and Terms from the Web

You are on page 1of 3

Facultad de Ingenier Universidad Nacional de Asuncin a, o E-mail: ajgiangreco@gmail.com

Christian E. Schaerer

Waldemar Villamayor-Venialbo

Laboratorio de Computacin Cient o ca y Aplicada, Facultad Politcnica, Universidad Nacional de Asuncin e o E-mail: cschaerer@pol.una.py, wvenialbo@pol.una.py

ABSTRACT

1. Introduction Computer vision systems, such as those specialized in the recognition of objects, the retrieval of similar images from a database, and the registration of silhouettes, relies mainly on the comparison of a set of basic characteristics extracted from the target objects. Additionally, the enormous advance in the data storage and image acquisition technologies raises the need for systems that can help humans in the recovering of visual information. In this work we introduce a new shape descriptor technique, the Contour Point-Signature, that makes use of the contour points of a shape. From this descriptor, we establish a method to achieve the best match points between two shapes and can thus have an ane transformation between them. Finally, we dene a new dissimilarity measure between two shapes, which will tell us which is the degree of similarity between them. 2. Contour-Point Signature Given a set of contour points A = {xi Z2 , i = 1, ..., M }, we select N reference points equally spaced. Then, we have the set P = {pi R2 , i = 1, ..., N }. The discrete Contour-Point Signature (CPS) of a point pi P is: fpi (j) := 1 |pi pr(j) |, A r(j) = i, i + 1, . . . , N, 1, 2, . . . , i j = 1, 2, ..., N + 1 (1)

Observation: Notice that a point pi R2 can be represented by a point fpi RN . The CPS has the following properties: Starting point independence, Scale independence, Translation and Rotation independence. 3. Matching Shapes Then, we match the contour points from one shape to the contour points from another shape, using the CPS. This is an assignement problem, and we solve it with a cost matrix. Given two shapes A and B, its reference points P and Q, and, its Contour-Point Signature fi and gi , we dene the cost matrix as: Cij = [d(fi , g(i,j) )]ij (2) where d is a distance in the metric space RN and (i, j) = (i + j 2)mod(N ) + 1.

n

H(j) =

i=1

(3)

This value gives us the correspondence between the points {p1 qj , p2 qj+1 ...} Observation: Notice that the minimization of the equation (3) is equal to nd the smallest sum column. 4. Transformation A one to one ane transformation from P to Q in R2 is: y = T (x) = T x where T is a 3x3 matrix using homogeneous coordinates. The matrix T has the form T = QP where P and Q are N x3 matrices that contains the homogeneous respectively, i.e. 1 p11 p12 1 q11 q12 . . . Q= . . . . . . . P = . . . . . . . . 1 pN 1 pN 2 and P = P t (P P t )1 denotes the pseudo-inverse of P . 5. Dissimilarity Measure We dene a dissimilarity measure as follows: d(P, Q) = dC (P, Q) + dT (P, Q) where dC = H() is the minimum of the cost function and dT = Q T P by the ane transformation. Observation: corresponds to the sum of the matrix elements. 6. Experimental Results To determine the optimal number of sample points N , and the optimal threshold T. We use a training set. We select a certain number of pairs of images from the MPEG-7 database. There are two groups of images, one group is made up of individually dierent images; another group is made up of similar images. The following gures display the distribution of the comparisons under dierent sample points. Each blue(O) point is the distance between similar images and the red(X) one is for the dissimilar images. The optimal N is the smallest number of sample points where the shapes can be distinguished correctly. Usually the optimal N is obtained by experiment. In our experiment we obtain N = 128. Our next experiment involves the MPEG-7 shape silhouette database, specically the Core Experiment CE-Shape-1 part B, which measures performance of similarity-based retrieval. The database consist of 1400 images: 70 shape categories, 20 images per category. The performance is measured using the so-called bullseye test, in which each image is used as a query and one counts the number of correct images in the top matches. We obtain a retrieval rate of 70.72 % using N = 128, = 0.3 and = 0.7.

(4)

1 qN 1 qN 2

Figure 1: Distance between similar images and dierent images 7. Conclusions We present a method for comparing shapes using the Contour-Point Signature. We obtain good results in dierent experiments using the MPEG-7 database. The authors are condent that this work can be improved, an issue that remains to be explored in future works.

References

[1] D. Zhang and G. Lu. Review of shape representation and description techniques. Pattern Recognition, 37(1):119, 2004. [2] M. Yang, K. Kpalma, and J. Ronsin. A survey of shape feature extraction techniques. In Pattern Recognition Techniques, Technology and Applications, chapter 3, pages 4390. I-Tech, 2008 [3] R. C. Veltkamp and L. J. Latecki. Properties and performance of shape similarity measures. In Data Science and Classication, Studies in Classication, Data Analysis, and Knowledge Organization, pages 4756. Springer Berlin Heidelberg, 2006. [4] W. Villamayor-Venialbo, H. Legal-Ayala, and C.E. Schaerer. Contour-Point Signature: A New Descriptor for Matching Rigid Shapes with a Single Closed Contour. In An. do I Congr. de Matematica Aplicada e Computational da Region Sudeste, pages 524526, 2011. [5] W. Villamayor-Venialbo. Matching Shapes using CPSs Ratios. In The Contour-Point Signature: A new descriptor for rigid shape matching. LCCA Technical Report. Appendix B, p. 20, 2010.

- Study of Natural Class of Intervals Using (-∞, ∞) and (∞, -∞), by W. B. Vasantha Kandasamy, Florentin Smarandache, D. Datta, H. S. Kushwaha, P. A. JadhavUploaded byAnonymous 0U9j6BLllB
- Demostraciones de MatricesUploaded byJohn Bayron Pineda Galeano
- FE Structural Analysis on an ExcelUploaded byEAZA83
- Matlab TipsUploaded byJo Lopes
- Zinyama AssignmentUploaded byMassy Kapps
- MPSP 2 LINKNETUploaded bymanan desai
- jtUploaded bymankguch@yahoo.com
- 12695_Introduction to MatlabUploaded bySunita Sapkota
- Modul Math Form 5Uploaded byFujiwara Hafiz Buntai
- MEC321 Fall 2016-17 semester project.docxUploaded byJibran Hassan Ansari
- Introduction to MatlabUploaded byAyoub Moustaouli
- Multivariate Data Analysis (3)Uploaded byAkolgo Paulina
- Csca08 Final 2012fUploaded byexamkiller
- Syllabus of JEE MathematicsUploaded byShivang Agarwal
- Jee Advanced Syllabus 2015 for MathsUploaded byAnshuAgarwal
- math lesson plan1Uploaded byapi-282090717
- MathsUploaded bySankha
- Jeeadv Maths SyllabusUploaded bymajji satish
- ChE SyllabusUploaded byM.A. Monim
- BootCat: Bootstrapping Corpora and Terms from the WebUploaded byEparema Jurema
- Lesson3-1BasicModelofLocality.pdfUploaded byProjectlouis
- Pt 3 Qustion Control SysUploaded byvarathanps
- assign 1Uploaded byspartha_be
- Tutorial 2Uploaded bytheko
- c Language QuestionsUploaded bySagar Karn
- introductionUploaded byAhmadZamahuri
- CBIR by Using Features of Shape and ColorUploaded byRahul Sharma
- Final_en_KU1072_UAS_Sem1_1415_CPP_151214Uploaded byMIqbalRamadhan
- 123352-337792-1-PBUploaded bySameh Lotfy
- Angie Sabogal 212066 50 Phase 1Uploaded byAngie Sabogal

- Standish & Williams - Orbital Ephemerides of the Sun, Moon, And Planets (as XSChap8)Uploaded byThomas Tessenow
- Time conversions and time formatUploaded byWaldemarVillamayor-Venialbo
- HP 49G vs CASIO CFX-9970 FeaturesUploaded byWaldemarVillamayor-Venialbo
- Memento of Useful Tips and Tricks for HP50gUploaded byMateus Corato Zanarella
- Roberts Edge DetectorUploaded byNaser Mahmoudi
- hp28s.pdfUploaded byWaldemarVillamayor-Venialbo
- RPN Calculates FasterUploaded byWaldemarVillamayor-Venialbo
- HP 50g Graphing CalculatorUploaded byJeff Pratt
- HP 50g Overview DatasheetUploaded byWaldemarVillamayor-Venialbo
- HP 48GII DatasheetUploaded byWaldemarVillamayor-Venialbo
- Watchmakers and Jewelers Practical Handbook 1892Uploaded byjimmy_wood
- espenakf.pdfUploaded byWaldemarVillamayor-Venialbo
- MultipleLuminanceLayeringLLRGBUsingPhotoshop.PDFUploaded byWaldemarVillamayor-Venialbo
- FAM HandOut HowDoYouIdentifyUploaded byWaldemarVillamayor-Venialbo
- 72e7e5208e71f756b2Uploaded byWaldemarVillamayor-Venialbo
- Maria MorevnaUploaded byWaldemarVillamayor-Venialbo
- 10.1.1.3.433Uploaded byWaldemarVillamayor-Venialbo
- 10.1.1.52.835Uploaded byWaldemarVillamayor-Venialbo
- 13Uploaded byWaldemarVillamayor-Venialbo
- JPV00genUploaded byWaldemarVillamayor-Venialbo
- primesieves-19990826Uploaded byWaldemarVillamayor-Venialbo
- Encrypted Oli Go MorphicUploaded byWaldemarVillamayor-Venialbo
- iasj1Uploaded byWaldemarVillamayor-Venialbo
- Farid03 ReprintUploaded byWaldemarVillamayor-Venialbo
- Anthony 6Uploaded byWaldemarVillamayor-Venialbo
- Anthony 5Uploaded byWaldemarVillamayor-Venialbo

- IT6005-Digital Image ProcessingUploaded bySathiya Ravi P
- Becker and Scholl (2008) - VWALBPUploaded byVatan Saini
- Chapter 4 Discrete Fourier TransformUploaded byMuhd Hafizuddin
- נושאים בתק"מ- תרגיל כיתה 8 | Queueing Theory 2Uploaded byRon
- Ste41912 Ch18 Se FinalUploaded byrogerio pinheiro
- CodeUploaded byIshaku Balami
- (les05)-linkedlistshashtables(1)Uploaded byhanvwb
- Lab 8 Stata VersionUploaded byAndrew Shapiro
- It Object Exercise 2Uploaded byCpE Lab
- Brain Tumor Detection Using Artificial Neural Network Fuzzy Inference System (ANFIS)Uploaded byATS
- John is 6 Years Older Than His Brothe...Uploaded bybilal_kaimkhani
- Fuzzy Logic, A Practical ApproachUploaded byapi-3723333
- RungeUploaded byIka Novitasari
- Chapter 8 Manual OgataUploaded byKalim Ullah
- Interior search algorithm(ISA)Uploaded byfagi2
- Programmin_lab_final.pdfUploaded byuditagarwal1997
- Examples SheikUploaded bySheik Mohammed
- GPG - encryption & signingUploaded byopenid_1FLLsijK
- Introduction to Neural Networks by Ingrid RusselUploaded byraidenbr
- PyBrain SlidesUploaded byPablo Loste Ramos
- 2.5.6. Uncertainty Budgets and Sensitivity CoefficientsUploaded bytomychalil
- 456tgdfUploaded byshaheerdurrani
- Math211 Practice Exam Final DraftUploaded byAngela Zhang
- FinalUploaded bytesfaye
- Text Independent Speaker Identification Using VQUploaded bySuman Paul Choudhury
- NN Basics Tutorial 2004Uploaded bydunerto
- 22.Water Mark Technique - CopyUploaded bySai Kiran Vemula
- Optimization of Volume-Delay FunctionsUploaded bygiancar
- GameTheoryNajjar.pdfUploaded byMotasim_m
- An Introduction to Digital Filters.pdfUploaded byOtman Chakkor

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.