3 research outputs found
A Bezier curve-based generic shape encoder
Existing Bezier curve based shape description techniques primarily focus upon determining a set of pertinent Control Points (CP) to represent a particular shape contour. While many different approaches have been proposed, none adequately consider domain specific information about the shape contour like its gradualness and sharpness, in the CP generation process which can potentially result in large distortions in the object’s shape representation. This paper introduces a novel Bezier Curve-based Generic Shape Encoder (BCGSE) that partitions an object contour into contiguous segments based upon its cornerity, before generating the CP for each segment using relevant shape curvature information. In addition, while CP encoding has generally been ignored, BCGSE embeds an efficient vertex-based encoding strategy exploiting the latent equidistance between consecutive CP. A nonlinear optimisation technique is also presented to enable the encoder is automatically adapt to bit-rate constraints. The performance of the BCGSE framework has been rigorously tested on a variety of diverse arbitrary shapes from both a distortion and requisite bit-rate perspective, with qualitative and quantitative results corroborating its superiority over existing shape descriptors
Recommended from our members
An Improved Shape Descriptor Using Bezier Curves
Existing shape description techniques using Bezier curves do not adequately consider the domain specific shape information such as the cornerity or gradualness of a shape in the control point generation process. This can lead to large distortion in shape representation even when a large descriptor is used. This paper addresses the issue by introducing a novel improved shape descriptor using Bezier curves (ISDBC) algorithm which divides a shape into segments depending on the cornerity and generates the control points for the segments based on shape information. It also provides an efficient control point encoding strategy which exploits the inherent periodic nature of the distances between consecutive control points. The performance of the ISDBC algorithm has been rigorously tested upon a number of arbitrary shapes, with both quantitative and qualitative results confirming its superiority over existing algorithms