• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.491-499
• /
• 2017

In this study, we proposed a new approach to segment ground and nonground points gained from a 3D laser range sensor. The primary aim of this research was to provide a fast and effective method for ground segmentation. In each frame, we divide the point cloud into small groups. All threshold points and start-ground points in each group are then analyzed. To determine threshold points we depend on three features: gradient, lost threshold points, and abnormalities in the distance between the sensor and a particular threshold point. After a threshold point is determined, a start-ground point is then identified by considering the height difference between two consecutive points. All points from a start-ground point to the next threshold point are ground points. Other points are nonground. This process is then repeated until all points are labelled.

• Fibers and Polymers
• /
• 제6권4호
• /
• pp.348-354
• /
• 2005

These days consumers' various demands are accelerating research on apparel manufacturing system including automatic measurement, pattern generation, and clothing simulation. Accordingly, methods of reconstructing human body from point-clouds measured using a three dimensional scanning device are required for apparel CAD system to support these functions. In particular, we present in this study a human body reconstruction method focused on two issues, which are the decision of the number of control point for each sectional curve with error bound and the local knot removal for reducing the unusual concentration of control points. The approximation of sectional curves with error bounds as an approximation criterion leads all sectional curves to their own particular shapes apart from the number of control points. In addition, the application of the local knot removal to construction of human body sectional curves reduces the unusual concentration of control points effectively. The results may be used to produce an apparel CAD system as an automatic pattern generation system and a clothing simulation system through the low level control of NUBS or NURBS.

• Korean Journal of Mathematics
• /
• 제12권2호
• /
• pp.107-115
• /
• 2004

In this paper, the new subclass denoted by $S_p({\alpha},{\beta},{\xi},{\gamma})$ of $p$-valent holomorphic functions has been introduced and investigate the several properties of the class $S_p({\alpha},{\beta},{\xi},{\gamma})$. In particular we have obtained integral representation for mappings in the class $S_p({\alpha},{\beta},{\xi},{\gamma})$) and determined closed convex hulls and their extreme points of the class $S_p({\alpha},{\beta},{\xi},{\gamma})$.

• Kyungpook Mathematical Journal
• /
• 제51권4호
• /
• pp.435-456
• /
• 2011

The Chebyshev collocation method in [21] to solve stiff initial-value problems is generalized by using arbitrary degrees of interpolation polynomials and arbitrary collocation points. The convergence of this generalized Chebyshev collocation method is shown to be independent of the chosen collocation points. It is observed how the stability region does depend on collocation points. In particular, A-stability is shown by taking the mid points of nodes as collocation points.

• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.95-104
• /
• 1996

하프변환은 영상에서 직선을 검출하는데 유용하고 강력한 기법이다 그러나. 전통적인 하프변환의 확장은 원과 타원을 복구하는데 늦은 속포라 과도한 메모리로 인해 제한되어 왔다. 본 논문은 최소자승법을 이용하여 영상에서 하원을 검출하는 방법을 제안한다. 이 방법은 계산비용과 메모리 요구를 감소시킨다. 타원을 검출할 때 타원의 매개변수를 결정하기 위해서 하프변환의 누적을 이용하지 않고 타원의 기하학적 특징을 포함하는 특별한 점을 선택했다. 타원의 매개변수는 그 특별한 점을 사용한 최소자승법으로 계산된다.

• 문화기술의 융합
• /
• 제4권4호
• /
• pp.355-360
• /
• 2018

전체이미지 속의 부분이미지를 다른 인터넷사이트의 전체이미지 속의 부분이미지와 연결하는 방법을 제안한다. 본 연구를 위해서 네 단계의 부분이미지 생성 방법과 검색 방법을 개발하였다. 전체이미지에서 정보를 제공하기를 원하는 부분이미지만을 오려내는 '이미지 분할' 방법, 오려낸 부분이미지의 가장 바깥 점을 찾는 '이미지 블록생성' 방법, 외곽 점들을 연결하여 가장 유사한 형태의 이미지스탬프로 등록하는 '외곽 점들의 스탬프 변형' 방법 그리고 이미지스탬프와 이미지스탬프를 연결해주는 검색 방법을 개발하였다. 그리고 이미지스탬프를 다양한 방법으로 사용할 수 있는 이미지 검색 UI를 제안하였다.

• Management Science and Financial Engineering
• /
• 제14권2호
• /
• pp.45-66
• /
• 2008

Refuse collection, one of important elements in reverse logistics, is an activity rendering recyclables or wastes and moving them to some points where further treatment is required. Among various decisions in the collection activity, we focus on network design, which is the problem of locating collection points as well as allocating refuses at demand points to collection points while satisfying the capacity restriction at each collection point. Here, the collection point is the place where recyclables or wastes near the point are gathered, and locating the collection points is done by selecting them from a given set of potential sites. The objective is to minimize the sum of fixed costs to open collection points and transportation costs to move refuses from demand points to collection points. An integer programming model is developed to represent the problem mathematically and due to the complexity of the problem, two types of heuristics, one with simultaneous and the others with separate location and allocation, are suggested. Computational experiments were done on test problems up to 500 potential sites, and the results are reported. In particular, some heuristics gave near optimal solutions for small-size test problems, i.e., 2% gaps in average from the optimal solution values.

• Management Science and Financial Engineering
• /
• 제19권2호
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• East Asian mathematical journal
• /
• 제32권5호
• /
• pp.745-765
• /
• 2016

We propose coupled fixed point theorems for maps satisfying contractive conditions involving a rational expression in the setting of partially ordered metric spaces. We also present a result on the existence and uniqueness of coupled fixed points. In particular, it is shown that the results existing in the literature are extend, generalized, unify and improved by using mixed monotone property. Given to support the useability of our results, and to distinguish them from the known ones.

• 한국항만학회지
• /
• 제10권2호
• /
• pp.31-41
• /
• 1996

This paper focuses on the Japannese policies on infrastructure investment. Generally such issue is considered with respect to the three points: the body who is in charge of the development, maintemance and ownership of a particular infrastructure: financial resources required for investment: and the amount of charge imposed on users. These points are closely related to each other, and are essential for the effective supply of infrastructure. Therefore, this paper reviews the case in Japan and get some insight for solving the problem faced by Korea.