• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.213-220
• /
• 2018

Face morphing, one of the most powerful image processing techniques that are often used in image processing and computer graphic fields, as it is a technique to change the image progressively and naturally from the original image to the target image. In this paper, we propose a method to generate Delaunay triangles using the facial landmark vertices generated by the Dlib face landmark detector and to implement morphing through warping and cross dissolving of Delaunay triangles between the original image and the target image. In this paper, we generate vertex points for face not manually but automatically, which is the major feature of the face such as eye, eyebrow, nose, and mouth, and is used to generate Delaunay triangles automatically which is the main characteristic of our face morphing method. Simulations show that we can add vertices manually and get more natural morphing results.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.81-90
• /
• 2014

For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.57-64
• /
• 2014

As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

• Journal of Korea Game Society
• /
• v.10 no.6
• /
• pp.137-146
• /
• 2010

According to rapid advent of the smartphone, software technologies which have been used on PCs are being introduced into the smartphone. This paper introduces an implementation of an application software under the Android platform using morphing and warping technology. It composes two face images with morphing technology and also transforms an original face image using warping technology for fun. For this, the image is triangulated by Delaunay Triangulation based on control points which are created by simple LCD touches on the mobile device. The implementation case of this paper will be a good reference for the development of applications like games using morphing and warping technologies over Android platforms.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2015.07a
• /
• pp.36-38
• /
• 2015

전자 해도는 선박의 항해와 관련된 모든 해도 정보를 국제표준에 따라 제작된 전자적 해도로서, 전자 해도에 포함된 등심선은 선박의 가항구역 선정에 사용되어, ECDIS를 이용한 항로계획 업무에 사용되고 있다. 전자해도를 이용한 항로 계획은 안전 등심선, 위험지역과의 근접 정도, 항로표지 혹은 침선과의 근접 정도를 고려하여 계획하기 때문에 정밀한 항해계획이 어려운 경우가 있다. 효율적인 항해계획을 위해서는 가항구역을 정밀히 계산하여 항해할 수 있는 공간을 확보하는 방안이 있다. 현재 안전 등심선으로 경계를 잡고 있는 가항구역에는 수심의 정도를 일정 단위로 편수되어 있다. 등심선 간격은 5m 혹은 10m 등 비교적 큰 넓은 간격으로 구성되는데 이는 수평거리로 수 키로미터의 차이를 보여, 협수로나 경사가 완만한 지역에서는 실 가능 항해구역과 가항구역의 격차가 현저한 경우가 있다. 본 연구에서는 이를 개선하기 위해 등심선보다 조밀한 수심 정보를 이용하는 방안에 대하여 연구하였다. 수심은 등심선보다 세밀한 지형정보가 들어있어, 등심선보다 정밀한 항해 계획을 할 수 있다. 그러나 가항구역은 면으로 구성되는 반면에 수심은 점으로 구성되어 있어, 수심을 들로네 삼각망 알고리즘을 적용하여 면으로 구성하였다. 이를 이용하여 가항구역을 계산함으로써, 실 항해가능 구역과 가항구역의 격차를 최소화하는 방안을 마련하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2196-2204
• /
• 2015

Location-based density information of mobile node could be used well in various, new and expanding areas such as location-based services, internet of things, smart grid technologies, and intelligent building. In general, receiving mobile nodes of a wireless mobile node depend on the maximum communication range of transmitting mobile node. In this paper, efficient computing method for mobile node using Delaunay triangulation is proposed, which is irrespective of mobile node's maximum communication range and reflect relative location in a given situation. Proposed method may be good used to find out the density of network constructed by various max communication range devices as Internet of Things. This method suggested in this paper could work well for location-based services, internet of things, smart grid technologies, and intelligent building.

• Journal of the Korean Geotechnical Society
• /
• v.27 no.11
• /
• pp.83-92
• /
• 2011

The random and heterogeneous pore structure is a significant factor that dominates physical and mechanical behaviors of soils such as fluid flow and geomechanical responses driven by loading. The characterization method using non-destructive testing such as micro X-ray CT technique which has a high resolution with micrometer unit allows to observe internal structure of soils. However, the application has been limited to qualitatively observe 2D and 3D CT images and to obtain the void ratio at macro-scale although the CT images contain enormous information of materials of interests. In this study, we constructed the 3D particle and pore structures based on sequentially taken 2D images of glass beads and quantitatively defined complex pore structure with void cell and void channel. This approach was enabled by implementing image processing techniques that include coordinate transformation, binarization, Delaunay Triangulation, and Euclidean Distance Transform. It was confirmed that the suggested algorithm allows to quantitatively evaluate the distribution of void cells and their connectivity of heterogeneous pore structures for glass beads.