To the Graduate Council: I am submitting herewith a thesis written by ...

More documents

Recommendations

Info

Chapter 2: Literature Review 92D ShapeContour-basedRegion-basedStructural Global Global StructuralChain CodePolygonB-SplineInvariantsPerimeterCompactnessEccentricityShape SignatureHausdorff DistanceWaveletsScale SpaceAutoregressiveElastic MatchingAreaEuler NumberEccentricityGeometricMomentsZernike momentsFourierDescriptorGrid MethodShape MatrixConvex HullMedial AxisCoreFigure 2.1: Classification of shape description and representation adapted from[Zhang, 2004].
Chapter 2: Literature Review 102.2.2 Contour-Based DescriptionContour-based shape representation techniques extract shape information from theboundary. There are generally two approaches for contour shape modeling: thecontinuous global approach and discrete structural approach. The global approachmakes use of feature vectors derived from the boundary to describe shape. Themeasure of shape similarity is the metric distance between feature vectors. Thediscrete approach to shape analysis represents the shape into a graph or tree ofsegments (primitives). The shape similarity is deduced by string or graph matching.We begin our analysis with the contour-based global shape description methods. Themost commonly used global shape descriptors are surface area, circularity,eccentricity, convexity, bending energy, ratio of principle axis, circular variance andelliptic variance and orientation. These simple descriptors are not suitable standalonedescriptors but are usually used to discriminate shapes with large differences or tofilter false hits. Some of these are also used in combination with the other descriptorsfor shape description. The efficiency of such descriptors is discussed in [Peura andIvarinen, 1997].A few space-domain techniques compute correspondence-based shape measures usingthe point-point match where each point on the boundary is considered to be acontributor to shape. Hausdorff distance is a classical correspondence-based shapematching method, often used to locate objects in an image and measure similaritybetween shapes as discussed in [Huttenlocher, 1992].Given two shapes S 1 = {a 1 , a 2 ,,……. ,a p } and S 2 = {b 1 , b 2 ,,……. ,b p } represented astwo sets of points, the Hausdorff distance is defined asHd(S1,S2) = max(h(S1,S2),h(S2,S1)}, h(S1,S2) = max min|| a − b ||a∈ S1 b∈S 2(2.1)where ||.|| refers to the Euclidean distance.The Hausdorff distance measure is too sensitive to noise and is useful for partialmatching invariant to rotation, scale and translation. Rucklidge improves it with a newmeasure between two datasets using a prohibitively expensive matching procedurethat tackles different orientations, positions and scales [Rucklidge, 1997]. A morerecent but similar kind of approach to shape matching was introduced by the name of“shape contexts” in [Belongie et al., 2002].Shape contexts claim to extract globalfeature at every point reducing the point-point matching into a matrix matching ofcontexts. To extract the shape context at a point p on the boundary, the vectors thatconnect p and each of the other points on the boundary are computed. The length andorientation of these vectors are quantized into a log-space histogram map for that pointp to account for additional sensitivity to neighboring points. These histograms areflattened and concatenated to form the context of the shape as shown in Figure 2.2.
Page 1 and 2: To the Graduate Council:I am submit
Page 3 and 4: Acknowledgementsii“Experience is
Page 5 and 6: Contents1 INTRODUCTION.............
Page 7 and 8: List of TablesviTable 2.1:Qualitati
Page 9 and 10: viiiFigure 5.2: Curvature analysis
Page 11 and 12: Chapter 1: Introduction 21.1 Motiva
Page 13 and 14: Chapter 1: Introduction 41.2 Propos
Page 15 and 16: Chapter 1: Introduction 6We then pe
Page 17: Chapter 2: Literature Review 8Shape
Page 21 and 22: Chapter 2: Literature Review 12Bimb
Page 23 and 24: Chapter 2: Literature Review 14is f
Page 25 and 26: Chapter 2: Literature Review 16foun
Page 27 and 28: Chapter 2: Literature Review 18Kort
Page 29 and 30: Chapter 2: Literature Review 20boun
Page 31 and 32: Chapter 2: Literature Review 22Gots
Page 33 and 34: Chapter 2: Literature Review 24Tabl
Page 35 and 36: Chapter 3: Data Collection and Mode
Page 49 and 50: Chapter 4: Algorithm Overview 404.1
Page 51 and 52: Chapter 4: Algorithm Overview 42Tri
Page 53 and 54: Chapter 4: Algorithm Overview 44whe
Page 55 and 56: Chapter 4: Algorithm Overview 46The
Page 57 and 58: Chapter 4: Algorithm Overview 48of
Page 59 and 60: Chapter 4: Algorithm Overview 50∞
Page 61 and 62: Chapter 4: Algorithm Overview 52The
Page 63 and 64: Chapter 4: Algorithm Overview 54smo
Page 65 and 66: Chapter 4: Algorithm Overview 564.2
Page 67 and 68: Chapter 4: Algorithm Overview 58Wit
Page 69 and 70:
Chapter 5: Analysis and Results 60W
Page 71 and 72:
Chapter 5: Analysis and Results 62S
Page 73 and 74:
Chapter 5: Analysis and Results 64F
Page 75 and 76:
Chapter 5: Analysis and Results 66t
Page 77 and 78:
Chapter 5: Analysis and Results 68A
Page 79 and 80:
Chapter 5: Analysis and Results 705
Page 81 and 82:
Chapter 5: Analysis and Results 72S
Page 83 and 84:
Chapter 5: Analysis and Results 74W
Page 85 and 86:
Chapter 5: Analysis and Results 76C
Page 87 and 88:
Chapter 5: Analysis and Results 78T
Page 89 and 90:
Chapter 5: Analysis and Results 80(
Page 91 and 92:
Chapter 6: Conclusions 82complexity
Page 93 and 94:
Bibliography 84BIBLIOGRAPHY
Page 95 and 96:
Bibliography 86[Biermann, 2001][Bel
Page 97 and 98:
Bibliography 88[Cyr and Kimia, 2001
Page 99 and 100:
Bibliography 90[Gourley, 1998][Gosh
Page 101 and 102:
Bibliography 92[Joshi and Chang, 19
Page 103 and 104:
Bibliography 94[Meyer, 2002][Morse,
Page 105 and 106:
Bibliography 96[Safar et al., 2000]
Page 107 and 108:
Bibliography 98parts,” IEEE Trans
Page 109:
Vita 100VITASreenivas Rangan Sukuma
show all

To the Graduate Council: I am submitting herewith a thesis written by ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?