• ETRI Journal
• /
• 제32권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.

• 대한전자공학회논문지
• /
• 제25권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.

• 대한전자공학회논문지
• /
• 제27권3호
• /
• pp.47-53
• /
• 1990

곡선의 다각형 근사화 방법은 화상분석 또는 데이타 압축등에 많이 사용된다. 다각형 근사화 방법으로, 적은 break point수를 갖고, Sequential Process로 결과를 얻을 수 있는 Cone intersection 방법이 있다. 여기서는 화소간의 거리가 일정한 디지탈 곡선의 경우, 종래의 cone intersection 방법을 정수계산을 이용하여 속도를 향상시키는 방법을 제안한다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• 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.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• 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년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• 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.

• 대한수학회지
• /
• 제40권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.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 춘계학술대회논문집
• /
• 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.

• 한국컴퓨터그래픽스학회논문지
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제24권6B호
• /
• pp.1174-1182
• /
• 1999

최근 MPEG-4 표준화 작업의 마무리와 MPEG-7 표준화 작업이 활발히 진행됨에 따라 영상내의 물체(object)의 모양 정보 부호화의 중요성이 대두되었다. 본 논문에서는 물체의 특징을 표현하기에 적합한 다각형 근사화 정점을 효율적으로 부호화하는 기법에 대해 연구하였다. 제안한 기법에서는 근사 다각형의 정점들을 이용하여 삼각형의 무게 중심들을 구한 후 순차적으로 부호화한다. 무게 중심들의 분포영역이 좁다는 사실을 이용하여 부호화 효율을 얻을 수 있다.