• 대한조선학회논문집
• /
• 제51권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.

• 콘크리트학회논문집
• /
• 제20권5호
• /
• pp.627-634
• /
• 2008

이 연구에서는 한정된 데이터베이스를 바탕으로 콘크리트 물성 예측 모델을 만들어 최적 배합을 구할 때, 탐색 범위를 한정된 데이터베이스로 제안함으로써 보다 신뢰성 있는 콘크리트 배합을 제시할 수 있는 기법을 제안하였다. 제안한 기법은 각 구성 재료의 가능한 모든 영역을 포함하는 데이터베이스를 구축하지 않고 최적화 과정에서 탐색 범위를 한정된 데이터베이스로 제안함으로써 콘크리트 물성 예측 모델이 신뢰성을 확보할 수 있게 된다. 이 연구에서 이러한 영역을 유효영역으로 정의 하였다. 제안한 기법은 유전자 알고리즘, 인공신경회로망, 그리고 최소 볼록 집합을 이용하여 구현하였으며, 이 방법의 타당성을 검증하기 위하여 주어진 강도 조건을 만족하면서 최저의 가격으로 제조할 수 있는 배합을 찾는 최적화 문제에 적용하였으며 검증 실험을 수행하였다. 실험 결과 데이터베이스의 영역 특성을 반영하는 제안한 기법을 통하여 보다 정확하고 신뢰성 있는 최적 배합을 찾을 수 있음을 확인하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 추계학술대회 논문집
• /
• pp.345-346
• /
• 2009

• 대한조선학회논문집
• /
• 제46권6호
• /
• pp.675-687
• /
• 2009

In general, the forming process of the curved hull plates consists of sub tasks, such as roll bending, line heating, and triangle heating. In order to complement the automated curved hull forming system, it is necessary to develop an algorithm to classify the curved hull plates of a ship into standard shapes with respect to the techniques of forming task, such as the roll bending, the line heating, and the triangle heating. In this paper, the curved hull plates are classified by four standard shapes and the combination of them, or saddle, convex, flat, cylindrical shape, and the combination of them, that are related to the forming tasks necessary to form the shapes. In preprocessing, the Gaussian curvature and the mean curvature at the mid-point of a mesh of modeling surface by Coon's patch are calculated. Then the nearest neighbor method to classify the input plate type is applied. Tests to verify the developed algorithm with sample plates of a real ship data have been performed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• 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.

• 한국정보통신학회논문지
• /
• 제25권12호
• /
• pp.1853-1858
• /
• 2021

오링은 기계 부품들 사이에서 틈을 메워주는 역할을 한다. 지금까지 불량품 선별은 육안 및 수작업으로 수행하여 분류 오류가 자주 발생한다. 따라서 사람의 개입이 없는 카메라 기반의 불량품 분류 시스템이 필요하다. 그러나 카메라 입력 영상에서 배경으로부터 필요 영역을 분리하기 위해 이진화 과정이 필요하다. 본 논문에서는 주변 조명의 변화나 반사 등의 요인으로 인해 단일 임계값 이진화를 적용하기 어려워, 주변 화소 값을 함께 고려한 적응형 이진화 기법을 적용한다. 또한 누락되는 화소 부분을 보완하기 위해 컨벡스 헐 기법도 함께 적용한다. 그리고 분리된 영역에 적용할 학습 모델은 불량 특성이 비선형인 경우에 유리한 잔류 오차 기반의 심층학습 신경망 모델을 적용한다. 실험을 통해 제안하는 시스템이 오링의 불량 판별 자동화에 적용 가능하다는 것을 제시한다.

• Korean Journal of Mathematics
• /
• 제19권4호
• /
• pp.351-365
• /
• 2011

In the present paper we introduce a new subclass of analytic functions in the unit disc defined by convolution $(f_{\mu})^{(-1)}*f(z)$; where $$f_{\mu}=(1-{\mu})z_2F_1(a,b;c;z)+{\mu}z(z_2F_1(a,b;c;z))^{\prime}$$. Several interesting properties of the class and integral preserving properties of the subclasses are also considered.

• 대한수학회보
• /
• 제60권4호
• /
• pp.905-913
• /
• 2023

Suppose that M is a strictly convex hypersurface in the (n + 1)-dimensional Euclidean space 𝔼ⁿ⁺¹ with the origin o in its convex side and with the outward unit normal N. For a fixed point p ∈ M and a positive constant t, we put 𝚽_t the hyperplane parallel to the tangent hyperplane 𝚽 at p and passing through the point q = p - tN(p). We consider the region cut from M by the parallel hyperplane 𝚽_t, and denote by I_p(t) the (n + 1)-dimensional volume of the convex hull of the region and the origin o. Then Schneider's characterization theorem for ellipsoids states that among centrally symmetric, strictly convex and closed surfaces in the 3-dimensional Euclidean space 𝔼³, the ellipsoids are the only ones satisfying I_p(t) = 𝜙(p)t, where 𝜙 is a function defined on M. Recently, the characterization theorem was extended to centrally symmetric, strictly convex and closed hypersurfaces in 𝔼ⁿ⁺¹ satisfying for a constant 𝛽, I_p(t) = 𝜙(p)t^𝛽. In this paper, we study the volume I_p(t) of a strictly convex and complete hypersurface in 𝔼ⁿ⁺¹ with the origin o in its convex side. As a result, first of all we extend the characterization theorem to strictly convex and closed (not necessarily centrally symmetric) hypersurfaces in 𝔼ⁿ⁺¹ satisfying I_p(t) = 𝜙(p)t^𝛽. After that we generalize the characterization theorem to strictly convex and complete (not necessarily closed) hypersurfaces in 𝔼ⁿ⁺¹ satisfying I_p(t) = 𝜙(p)t^𝛽.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제11권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 applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.353-360
• /
• 2002

In this paper we study when a sign pattern matrix A and a sign pattern vector b have the property that the convex hull of the columns of each matrix with sign pattern A contains a vector with sign pattern b. This study generalizes the notion of sign central matrices.