• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1418-1433
• /
• 2019

In computer graphics, 3D mesh segmentation is a challenging research field. This paper presents a 3D mesh model segmentation algorithm that focuses on removing exterior salient parts from the original 3D mesh model based on prominent feature points and marching plane. To begin with, the proposed approach uses multi-dimensional scaling to extract prominent feature points that reside on the tips of each exterior salient part of a given mesh. Subsequently, a set of planes intersect the 3D mesh; one is the marching plane, which start marching from prominent feature points. Through the marching process, local cross sections between marching plane and 3D mesh are extracted, subsequently, its corresponding area are calculated to represent local volumes of the 3D mesh model. As the boundary region of an exterior salient part generally lies on the location at which the local volume suddenly changes greatly, we can simply cut this location with the marching plane to separate this part from the mesh. We evaluated our algorithm on the Princeton Segmentation Benchmark, and the evaluation results show that our algorithm works well for some categories.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1104-1110
• /
• 2009

3D A/V services are expected to be a representative service of next generation because it can give more realistic feeling by providing dimensions to the 2D images. In terms of transmission part of 3D A/V systems, however, it is difficult to provide these services on real-time in the wireless OFDMA networks because it has to send large amount of traffic. To address this, we proposed a novel scheduling algorithm which separates a 3D traffic into base layer and enhancement layer, and provides different priority to them. From simulation results, we can show that the proposed algorithm can improve QoS.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.79-84
• /
• 1992

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.1
• /
• pp.70-75
• /
• 2005

A 3D solid element mesh generation algorithm was newly developed. 3D surface points of global rectangular coordinates were supplied by a 3D laser scanner. The algorithm is strait forward and simple but it generates mixed solid elements such as hexagonal, pyramid and prism types. Then, the surface triangular or rectangular elements were generated from the solid elements. The key of the algorithm is elimination of elements and 3D adaptive surface smoothing using given 3D surface point data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.361-364
• /
• 2004

This paper describes an automatic 3D models generation algorithm based on 2D silhouette images, using X-ray camera without camera parameters. The algorithm takes a multi steps process approach. First, a series of 2D silhouette images is captured from different directions of object and then converted to binary images. An octree data structure is constructed for voxel-based representation of object. An estimate 3D volume of object can be reconstructed by intersecting voxels and the 2D silhouettes. The marching cube algorithm is applied to get triangle mesh representing of the obtained 3D model for rendering.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1080-1087
• /
• 2009

This paper presents an algorithm to acquire 3D geometric information using a virtual plane method. The method to measure 3D information on the plane is easy, because it's not concerning value on the z-axis. A plane can be made by arbitrary three points in the 3D space, so the algorithm is able to make a number of virtual planes from feature points on the target object. In this case, these geometric relations between the origin of each virtual plane and the origin of the target object coordinates should be expressed as known homogeneous matrices. To include this idea, the algorithm could induce simple matrix formula which is only concerning unknown geometric relation between the origin of target object and the origin of camera coordinates. Therefore, it's more fast and simple than other methods. For achieving the proposed method, a regular pin-hole camera model and a perspective projection matrix which is defined by a geometric relation between each coordinate system is used. In the final part of this paper, we demonstrate the techniques for a variety of applications, including measurements in industrial parts and known patches images.

• Journal of the Korean Society of Visualization
• /
• v.6 no.2
• /
• pp.3-8
• /
• 2008

A new 3D-PTV algorithm(a Volume PTV) based upon a hybrid fitness function has been constructed. A coherency fitness function is introduced using the information of space and time to sort out the correct particle pairs between the two camera images. The measurement system consists of two-high-definition-cameras($1k{\times}1k$), a Nd-Yag laser and a host computer. The developed algorithm has been employed to investigate the flow features of the cylinder wake. The Reynolds numbers with the cylinder diameter(d=10 mm) are 360, 540, 720, 900, 1080 and 1260. Two-dimensional displacements of the particles of each camera's image and neighbouring constraints were introduced to reduce the calculation loads. More than 10,000 instantaneous 3D vectors have been obtained by the constructed algorithm. The constructed algorithm could recover more than $80{\sim}90%$ of the particle numbers in the image condition.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.203-204
• /
• 2007

In this work, we propose a compression algorithm for depth images, which are obtained from multi-view sequences. The proposed algorithm represents a depth image using a 3-D regular triangular mesh and predictively encodes the mesh vertices using a linear prediction scheme. The prediction errors are encoded with a arithmetic coder. Simulation results demonstrate that the proposed algorithm provides better performances than the JPEG2000 lossless coder.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.51-58
• /
• 2004

In this paper, a mesh simplification algorithm is proposed which considers the conservation of the volume of a 3D model. In General, most of mesh simplification algorithm use a distance metric. The distance metric is very efficient to measure geometric error, but it causes volume changes between the original model and the simplified model. In this paper a mesh simplification algorithm which conserves the volume of the original model is suggested. A new vertex resulting from an edge contraction, takes a position which conserves the volume of the 3D model using the proposed algorithm. Although the new algorithm needs more time than the QEM algorithm, it is shown that it conserves the original volumn of the 3D model during the simplification.