• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.3
• /
• pp.203-211
• /
• 2014

To raise the industrial competitiveness in the field of ship-building, it is crucially important that the yard should use production facilities and working space effectively. Among the related works, the management of tremendous blocks' number, the limited area of assembly shops and inefficient personnel and facility management still need to be improved in terms of being exposed to a lot of problems. To settle down these conundrums, the various strategies of block arrangement on the assembly floors have been recently presented and in the results, have increasingly began to be utilized in practice. However, it is a wonder that the sampled or approximated block shapes which usually are standardized projections or the geometrically convex contour only have been prevailed until now. In this study, all parts including the panel, stiffeners, outer shells, and all kinds of outfitting equipment are first extracted using the Volume Primitive plug-in module from the ship customized CAD system and then, the presented system constructs a simpler and more compact ship data structure and finally generates the novel projected contours for the block arrangement system using the adaptive concave hull algorithm.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1430-1436
• /
• 2014

We propose an algorithm which detects the touch of the fingertip on a general wall using the shadow information. Nowadays, there is a demand for presentation systems which can perceive the presenter's action so that the presenter can use natural movements without extra interface hardware. One of the most fundamental techniques in this area is the detection of the fingertip and the recognition of the touch of the fingertip on the screen. The proposed algorithm recognizes the touch of the fingertip without using the depth information, and therefore needs no depth or touch sensing devices. The proposed method computes the convex hull points of both the fingertip and the shadow of the fingertip, and then computes the distance between those points to decide whether a touch event has occured. Using the proposed method, it is possible to develop a new projector device which can perceive a fingertip touch on a general wall.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.637-641
• /
• 2007

Airborne LIDAR (Light Detection and Ranging) technology has reached a degree of the required accuracy in mapping professions, and advanced LIDAR systems are becoming increasingly common in the various fields of application. LiDAR data constitute an excellent source of information for reconstructing the Earth's surface due to capability of rapid and dense 3D spatial data acquisition with high accuracy. However, organizing the LIDAR data and extracting information from the data are difficult tasks because LIDAR data are composed of randomly distributed point clouds and do not provide sufficient semantic information. The main reason for this difficulty in processing LIDAR data is that the data provide only irregularly spaced point coordinates without topological and relational information among the points. This study introduces an efficient and robust method for automatic extraction of building footprints using airborne LIDAR data. The proposed method separates ground and non-ground data based on the histogram analysis and then rearranges the building boundary points using convex hull algorithm to extract building footprints. The method was implemented to LIDAR data of the heavily built-up area. Experimental results showed the feasibility and efficiency of the proposed method for automatic producing building layers of the large scale digital maps and 3D building reconstruction.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• Journal of Drive and Control
• /
• v.19 no.3
• /
• pp.16-22
• /
• 2022

Crushers are equipment that crush natural stones, to produce aggregates used at construction sites. As the crusher proceeds, the inner liner becomes worn, causing the size of the aggregate produced to gradually increase. The vision sensor-based aggregate analysis system analyzes the size and distribution of aggregates in production, in real time through image analysis. This study developed an algorithm that can segmentate aggregates in images in real time. using image preprocessing technology combining various filters and morphology techniques, and aggregate region characteristics such as convex hull and concave hull. We applied the developed algorithm to fine aggregate, intermediate aggregate, and thick aggregate images to verify their performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.783-788
• /
• 2003

In this paper, we present a new approach to detect and recognize human face in the image from vision camera equipped on the mobile robot platform. Due to the mobility of camera platform, obtained facial image is small and pose-various. For this condition, new algorithm should cope with these constraints and can detect and recognize face in nearly real time. In detection step, ‘coarse to fine’ detection strategy is used. Firstly, region boundary including face is roughly located by dual ellipse templates of facial color and on this region, the locations of three main facial features- two eyes and mouth-are estimated. For this, simplified facial feature maps using characteristic chrominance are made out and candidate pixels are segmented as eye or mouth pixels group. These candidate facial features are verified whether the length and orientation of feature pairs are suitable for face geometry. In recognition step, pseudo-convex hull area of gray face image is defined which area includes feature triangle connecting two eyes and mouth. And random lattice line set are composed and laid on this convex hull area, and then 2D appearance of this area is represented. From these procedures, facial information of detected face is obtained and face DB images are similarly processed for each person class. Based on facial information of these areas, distance measure of match of lattice lines is calculated and face image is recognized using this measure as a classifier. This proposed detection and recognition algorithms overcome the constraints of previous approach [15], make real-time face detection and recognition possible, and guarantee the correct recognition irregardless of some pose variation of face. The usefulness at mobile robot application is demonstrated.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.1
• /
• pp.202-210
• /
• 2019

The obstacles modeling is a fundamental and significant issue for path planning and automatic navigation of Unmanned Surface Vehicle (USV). In this study, we propose a novel obstacles modeling method based on high resolution satellite images. It involves two main steps: extraction of obstacle features and construction of convex hulls. To extract the obstacle features, a series of operations such as sea-land segmentation, obstacles details enhancement, and morphological transformations are applied. Furthermore, an efficient algorithm is proposed to mask the obstacles into convex hulls, which mainly includes the cluster analysis of obstacles area and the determination rules of edge points. Experimental results demonstrate that the models achieved by the proposed method and the manual have high similarity. As an application, the model is used to find the optimal path for USV. The study shows that the obstacles modeling method is feasible, and it can be applied to USV path planning.

• Journal of Navigation and Port Research
• /
• v.48 no.3
• /
• pp.164-170
• /
• 2024

The light buoy, a floating structure at sea, is prone to drifting due to external factors such as oceanic weather. This makes it imperative to monitor for any loss or displacement of buoys. In order to address this issue, the Ministry of Oceans and Fisheries aims to issue alerts for buoy displacement by analyzing historical buoy position data to detect patterns. However, periodic lifting inspections, which are conducted every two years, disrupt the buoy's location pattern. As a result, new patterns need to be analyzed after each inspection for location monitoring. In this study, buoy position data from various periods were analyzed using convex hull and distance-based clustering algorithms. In addition, the optimal data collection period was identified in order to accurately recognize buoy location patterns. The findings suggest that a nine-week data collection period established stable location patterns, explaining approximately 89.8% of the variance in location data. These results can improve the management of light buoys based on location patterns and aid in the effective monitoring and early detection of buoy displacement.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.117-128
• /
• 1999

A Simple tree-structured line simplification method, which exactly follows the Douglas-Peucker algorithm, has a strength for its simplification index to be involved into the hierarchical data structures. However, the hierarchy of simplification index, which is the core in a simple tree method, may not be always guaranteed. It is validated that the local property of line features in such global approaches as Douglas-Peucker algorithm is apt to be neglected and the construction of hierarchy with no thought of locality may entangle the hierarchy. This study designed a new approach, CALS(Convex hull Applied Line Simplification), a) to search critical points of line feature with convex hull search technique, b) to construct the hierarchical data structure based on these critical points, c) to simplify the line feature using multiple trees. CALS improved the spatial accuracy as compared with a simple tree method. Especially CALS was excellent in case of line features having the great extent of sinuosity.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.562-564
• /
• 1999

래디오시티 렌더링 시스템에 적합한 모델링을 하는데 있어서 수작업을 비롯한 기존의 여러 방법을 적용해 본 결과, 제작하고자 하는 환경 설정에 많은 어려움을 겪었다. 본 논문은 이러한 문제를 해결하기 위해, 인크리먼털 컨벡스 헐 모델링 기법을 응용하여 시스템을 개발하였다. 이 시스템은 기본 데이터 정보를 입력하면 자동적으로 패치와 엘리먼트가 생성되는 프로그램으로, 물체가 많은 환경이나 곡면을 비교적 쉽고, 고속으로 표현할 수 있었다. 그리고 인크리먼털 컨벡스 헐 알고리즘으로 생성된 환경에, 폼 팩터의 대표적인 세 가지 알고리즘들을 비교.평가 해본 결과 Cubic-Tetrahedron 알고리즘이 가장 효율적이었음을 알 수 있었다.