• ETRI Journal
• /
• v.32 no.4
• /
• pp.630-633
• /
• 2010

In this letter, we propose a novel polygonal approximation of digital curves that preserve original shapes. The proposed method first detects break points, which have two different consecutive vectors, and sets an initial dominant point set. The approximation is then performed iteratively by deleting a dominant point using a novel distance, which can measure both the distance and the angle acuteness. The experimental results show that the proposed method can preserve original shapes and is appropriate for various shapes, including slab-sided shapes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.56-62
• /
• 1988

For shape description, a fast sequential method for polygonal approximation of chaincoded plane curves which are object boundaries is proposed. The proposed method performs polygonal approximation by use of the distance error from one point to a line, and its performance is enhanced by the smoothed slopes of lines. Furthermore, accumulated distance error and variable distance error threshold are proposed in order to consider and implement the visual characteristics of the human being.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.47-53
• /
• 1990

Polygonal approximation of digital curves is useful for the image analysis or data compression. There are methods of polygonal approximation using cone intersection using cone intersection which have relatively smaller number of break points and are executed in sequential process. Here a method of polygonal approximation is proposed, which is modified from Sklansky and Gonzales' method, and improves the speed by using integer operations.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.61-66
• /
• 1996

In this paper, an efficient contour coding algorithm incorporating polygonal approximation and discrete sine transform is introduced. Contour information is inevitable in content based coding, and polygonal approximation method is widely used to compress the contour information. However polygonal approximation method is not suitable when fine contour is needed. We show that the error signal of polygonal approximation can be efficiently represented using DST, that is, the contour information can be represented accurately with polygons and DST coefficients. With this contour coding scheme, the required bits to represent a contour can be reduced by about 40-50% with virtually no degradation compared to the existing chain coding method.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.559-563
• /
• 2000

In this paper we describe a method for aligning a robot gripper using image information. The region of gripper is represented from HSI color model that has major advantage of brightness independence. In order to extract the feature points for vision based position control, we find the corners of gripper shape using polygonal approximation method which determines the segment size and curvature of each points. We apply the vision based scheme to the task of alignment of gripper to reach the desired position by 2 RGB cameras. Experiments are carried out to exhibit the effectiveness of vision based control using feature points from polygonal approximation of gripper.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1601-1606
• /
• 1991

We present an algorithm to approximate the Voronoi diagrams of 2D objects bounded by algebraic curves. Since the bisector curve for two algebraic curves of degree d can have a very high algebraic degree of 2 * d$^{4}$, it is very difficult to compute the exact algebraic curve equation of Voronoi edge. Thus, we suggest a simple polygonal approximation method. We first approximate each object by a simple polygon and compute a simplified polygonal Voronoi diagram for the approximating polygons. Finally, we approximate each monotone polygonal chain of Voronoi edges with Bezier cubic curve segments using least-square curve fitting.

• Journal of the Korean Mathematical Society
• /
• v.40 no.6
• /
• pp.1075-1083
• /
• 2003

The purpose of this paper is to investigate the piecewise wise polynomial approximation for the curved boundary. We analyze the error of an approximated solution due to this approximation and then compare the approximation errors for the cases of polygonal and piecewise polynomial approximations for the curved boundary. Based on the results of analysis, p-version numerical methods for solving Dirichlet's problems are applied to any smooth curved domain.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.1062-1073
• /
• 2007

Acoustic Target Strength (TS) is a major parameter of the active sonar equation, which indicates the ratio of the radiated intensity from the source to the re-radiated intensity by a target. In developing a TS equation, it is assumed that the radiated pressure is known and the re-radiated intensity is unknown. This research provides a TS equation for polygonal plates, which is applicable to near field acoustics. In this research, Helmholtz-Kirchhoff formula is used as the primary equation for solving the re-radiated pressure field; the primary equation contains a surface (double) integral representation. The double integral representation can be reduced to a closed form, which involves only a line (single) integral representation of the boundary of the surface area by applying Stoke's theorem. Use of such line integral representations can reduce the cost of numerical calculation. Also Kirchhoff approximation is used to solve the surface values such as pressure and particle velocity. Finally, a generalized definition of Sonar Cross Section (SCS) that is applicable to near field is suggested. The TS equation for polygonal plates in near field is developed using the three prescribed statements; the redection to line integral representation, Kirchhoff approximation and a generalized definition of SCS. The equation developed in this research is applicable to near field, and therefore, no approximations are allowed except the Kirchhoff approximation. However, examinations with various types of models for reliability show that the equation has good performance in its applications. To analyze a general shape of model, a submarine type model was selected and successfully analyzed.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.1-7
• /
• 2002

This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1174-1182
• /
• 1999

Recently the shape information of the visual object in the scene is more important, as the completion of the MPEG-4 standard and the progress of the MPEG-7 standard. This paper represents the study of effective coding method of vertices that are used in the polygonal approximation to represent the feature of visual object. In the proposed method, we make the centers of gravity of triangles that are made using the vertices of polygonal approximation and encode them sequentially We can get a coding gain because the centers of the gravity of triangles have narrower dynamic ranges.