1. A Generic Shape Descriptor using Bezier Curves Presenting by – Dr. Manzur Murshed Authors – Ferdous Ahmed Sohel Dr. Gour C. Karmakar Prof. Laurence S. Dooley Gippsland School of Computing and Information Technology Monash University, AUSTRALIA

2. Gippsland School of Computing and IT, Australia2 Presentation Outline 1.Introduction 2.Existing Bezier curve (BC) based shape descriptors 3.Proposed shape descriptor (SDBC) i.Control point determination ii.Control point coding 4.Results & Analysis 5.Conclusion and Future works

3. Gippsland School of Computing and IT, Australia3 Introduction 0101010…….000110 Descriptor Applications of shape description: -Communication: Mobile multimedia communication, low bit rate coding. -Storage and retrieval: Digital library, indexing, digital archiving. -Interactive editing: Cartoons, digital films.

4. Gippsland School of Computing and IT, Australia4 Existing shape descriptor using BC 1.Arabic character descriptor proposed by Sarfraz and Khan. 2.Chinese calligraphic character descriptor using BC proposed by Yang et al. 3.Object shape description using cubic BC by Cinque et al.

5. Gippsland School of Computing and IT, Australia5 Shape description using cubic BC 1.Control point selection: i.The shape is divided into a number of equi-length segments in terms of number of shape points. ii.For each segment – control points are selected at some specific distances. 2.Control point coding: i.Control points are encoded parametrically.

6. Gippsland School of Computing and IT, Australia6 Shape description using cubic BC (Cont.) 1.The descriptor for each segment consists of: i.The coordinate values of the 1st and 4th control point, ii.For the 2nd control point, the magnitude and the gradient of the tangent vector from the 1st control point and iii.For the 3rd control point, the magnitude and the gradient of the tangent vector from the 4th control point.

7. Gippsland School of Computing and IT, Australia7 Limitation 1: Due to the even spacing of the segments and control points – R1 R2 i.Flat regions (e.g., R1) and sharp changing regions (R2) are both getting equal emphasis in control point selection – thus can lead to large distortion even with large number of segments. Shape description using cubic BC (Cont.)

8. Gippsland School of Computing and IT, Australia8 Limitation 2: According to the definition the magnitude and the gradient are all floating point numbers, hence will require larger size of descriptor. Shape description using cubic BC (Cont.) To overcome these limitations SDBC has been proposed

9. Gippsland School of Computing and IT, Australia9 Control Point Calculation 1.Calculation of the set of significant points: i.The set of the least number of shape points that can produce the shape with ZERO distortion. Proposed SDBC 2.Addition of the significant points: i.Reduces the likelihood of losing potential significant points as a control point by considering curvature domain specific information. ii.Inserts supplementary at average distance of the significant points.

10. Gippsland School of Computing and IT, Australia10 3.Union of significant and supplementary points are referred to as approximated boundary points (ABP). i.ABP are used in control point calculation. Proposed SDBC (cont.) Like Cinque et al.’s method, the control points for a segment starting from i th ABP is defined as Where z is the number of ABP in a segment and b the ABP set.

11. Gippsland School of Computing and IT, Australia11  There is a periodic nature in the distance between the control points shown in following figure. 1.If the distance between the first and second control point is l number of ABP. 2.The distance between the 2 nd and 3 rd is 2*l ABP. 3.The distance between the 3 rd and 4 th is l ABP. 4.l, 2*l, l series for each additional segments. Start- ing pointl2*lll2*ll …l2*l First SegmentNext segment…Last Segment Proposed SDBC (cont.) Control point coding

12. Gippsland School of Computing and IT, Australia12 Proposed SDBC (cont.) Dynamic fixed length coding (DFLCC)  A combination of run-length code and chain code.  Encodes the control points differentially.  Direction of the current control point from the previous is encoded by 6-bits.  The distance is the length of the run (for covering l ABP it is L 1 bits and for 2*l it is L 2 bits, clearly L 2 =L 1 +1).

13. Gippsland School of Computing and IT, Australia13 Proposed SDBC (cont.) 4- bit for length of L 1 Start- ing pointDir+ L 1 Dir+ L 2 Dir+ L 1 Dir+ Dir+ L 2 Dir+ L 1 …Dir+ Dir+ L 2 First SegmentNext segment…Last Segment The complete descriptor looks like The starting 4- bits are reserved for the length of L 1, which could be maximum 16-bit number and thus SDBC can encode a segment consisting of up to 4*2 16 shape points.

14. Gippsland School of Computing and IT, Australia14 Results and Analysis Class one – peak distortion in pel Class two – mean squared distortion in pel 2 Results for Fish object shapes with 5 segments Fish 1 Fish 2

15. Gippsland School of Computing and IT, Australia15 FishSR = 5SR = 6SR = 7SR =8 MaxMSMaxMSMaxMSMaxMS 1BC9.5147.06.76.44.15.12.9 SDBC8.110.26.365.83.14.51.8 2BC7.69.17.05.86.04.35.22.8 SDBC66.65.63.55.43.64.81.8 Results and Analysis Distortion measures for different number of segments (units: Max – pel and MS – pel 2 ), SR= Number of segments.

16. Gippsland School of Computing and IT, Australia16 FishSR = 5SR = 6SR = 7SR =8 1 BC240288336384 SDBC165196227258 2 BC240288336384 SDBC165196227258 Results and Analysis Descriptor length in bits  Over 35% descriptor size reduction for each additional segments.  Around 30% overall descriptor size reduction.

17. Gippsland School of Computing and IT, Australia17 Conclusions and Future Works SDBC addresses domain specific shape information. Keeps the distortion lower. The descriptor length is lower.  Consider the loops in shapes and cornerity of the shape at the shape points and divide the shape into segments.  For each segment apply the SDBC algorithm with a modification in the DFLC.

18. Gippsland School of Computing and IT, Australia18