• 대한전자공학회논문지SP
• /
• 제41권3호
• /
• pp.121-127
• /
• 2004

This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2006년도 추계 학술대회논문집
• /
• pp.57-60
• /
• 2006

This paper presents an assessment of vertex-centered and cell-centered finite-volume methods on unstructured meshes. The results indicate that the vertex-centered method is more reliable than the cell-centered method.

• 방송공학회논문지
• /
• 제2권2호
• /
• pp.94-104
• /
• 1997

본 논문에서는 1차원 정점의 선택 및 부호화와 정점 재배열을 이용하는 정점기반 이진 모양정보 부호화기를 제안한다. 기존의 물체 적응형 정점 부호화 방식과는 달리, 제안 방식에서는 추출된 정점들을 특성이 서로 다른 1차원 정점과 2차원 정점으로 분리한다. 1차원 정점은 제안된 부호화 방식을 2차원 정점은 정점 재배열과 물체 적응형 정점 부호화 방식을 이용하여 수신단에 전송한다. 모의 실험 결과는 제안된 방식이 기존의 방식에 비해, 재현 오차의 변화 없이 부호화 비트 수를 최대 12% 감소시키며, 부호화 이득이 모양정보 특성에 의존함을 보여준다.

• 대한전자공학회논문지SP
• /
• 제40권1호
• /
• pp.114-123
• /
• 2003

본 논문에서는 영상 객체 (object) 의 모양 정보를 효율적으로 부호화 하는 기법을 제안한다. 다각 근사화 기법은 손실 부호화 기법으로써 객체의 모양을 근사화 하는데 가장 널리 사용되고 있다. 제안된 기법은 최대 허용 오차를 만족하면서 정점을 선택할 때 기존의 순환 정점 선택 (IRM: iterated refinement method) 이나 순차적 정점 선택 (PVS: progressive vertex selection) 보다 적은 수의 정점을 선택함으로써 비트량을 줄인다. 기존의 순차적인 정점 선택 기법을 기반으로 하여 새로운 정점 선택 조건을 제안하여 비트량-왜곡면에서 우수한 성능을 가지는 부호화기를 구현하였다. 실험 결과에서 제안된 기법이 기존의 정점 선택 기법들에 비해 우수한 성능을 나타냄을 알 수 있다.

• 한국통신학회논문지
• /
• 제25권7A호
• /
• pp.1017-1027
• /
• 2000

본 논문에서는 정점기반 모양정보 부호화 효율 향상을 위한 새로운 정점의 위치 정보 부호화 방법을 제안한다. 정점들을 일정한 화소열에 위치시키고, 일정한 길이의 블록으로 나누어 정점을 포함하는 블록사이의 상대거리를 가변길이 부호화 한다. 블록 사이의 상대 거리에 대한 확률 분포를 분석하고, 확률 분포가 정점의 수와 블록 수의 비유에만 의존한다는 것을 증명한다. 부호와 효율과 구현상의 복잡도를 고려한 비율을 결정하고 그 비율의 확률 분포에 맞는 허프만 부호 표를 구성한다. 입력된 영상은 그 비율에 따라 블록의 길이가 결정되며, 허프만 부호 표를 사용하여 블록 사이의 상대 거리를 가변길이 부호화 한다. 제안된 부호화 방법은 정점의 수가 많은 영상에서 부호화 효율이 좋아진다.

• 한국정밀공학회지
• /
• 제22권9호
• /
• pp.202-211
• /
• 2005

This paper introduces and illustrates the results of a new method fer offsetting triangular mesh by moving all vertices along the multiple normal vectors of a vertex. The multiple normal vectors of a vertex are set the same as the normal vectors of the faces surrounding the vertex, while the two vectors with the smallest difference are joined repeatedly until the difference is smaller than allowance. Offsetting with the multiple normal vectors of a vertex does not create a gap or overlap at the smooth edges, thereby making the mesh size uniform and the computation time short. In addition, this offsetting method is accurate at the sharp edges because the vertices are moved to the normal directions of faces and joined by the blend surface. The method is also useful for rapid prototyping and tool path generation if the triangular mesh is tessellated part of the solid models with curved surfaces and sharp edges. The suggested method and previous methods are implemented on a PC using C++ and illustrated using an OpenGL library.

• International Journal of Contents
• /
• 제3권4호
• /
• pp.15-21
• /
• 2007

Image morphing deals with the metamorphosis of one image into another. The field morphing depends on the manual work for most of the process, where a user has to designate the control lines. It takes time and requires skills to have fine quality results. It is an object of this paper to propose a method capable of realizing the semi-automation of field morphing using adaptive vertex correspondence based on image segmentation. The adaptive vertex correspondence process efficiently generates a pair of control lines by adaptively selecting reference partial contours based on the number of vertices that are included in the partial contour of the source morphing object and in the partial contour of the destination morphing object, in the pair of the partial contour designated by external control points through user input. The proposed method generates visually fluid morphs and warps with an easy-to-use interface. According to the proposed method, a user can shorten the time to set control lines and even an unskilled user can obtain natural morphing results as he or she designates a small number of external control points.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.

• 전기의세계
• /
• 제30권5호
• /
• pp.297-305
• /
• 1981

The problem of finding shortest paths between every pair of points in a network is solved employing and optimal network decomposition in which the network is decomposed into a number of subnetworks minimizing the number of cut-set between them while each subnetwork is constrained by a size limit. Shortest path computations are performed on individual subnetworks, and the solutions are recomposed to obtain the solution of the original network. The method when applied to large scale networks significantly reduces core requirement and computation time. This is demonstrated by developing a computer program based on the method and applying it to 30-vertex, 160-vertex, and 273-vertex networks.

• 대한수학회논문집
• /
• 제32권2호
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.