• Title/Summary/Keyword: Particular Points

Search Result 677, Processing Time 0.023 seconds

A Fast Ground Segmentation Method for 3D Point Cloud

  • Chu, Phuong;Cho, Seoungjae;Sim, Sungdae;Kwak, Kiho;Cho, Kyungeun
    • Journal of Information Processing Systems
    • /
    • v.13 no.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.

The NURBS Human Body Modeling Using Local Knot Removal

  • Jo, Joon-Woo;Han, Sung-Soo
    • Fibers and Polymers
    • /
    • v.6 no.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.

ON CLOSED CONVEX HULLS AND THEIR EXTREME POINTS

  • Lee, S.K.;Khairnar, S.M.
    • Korean Journal of Mathematics
    • /
    • v.12 no.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})$.

  • PDF

A Chebyshev Collocation Method for Stiff Initial Value Problems and Its Stability

  • Kim, Sang-Dong;Kwon, Jong-Kyum;Piao, Xiangfan;Kim, Phil-Su
    • Kyungpook Mathematical Journal
    • /
    • v.51 no.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.

Detection of Ellipses using Least Square Method (최소자승법을 이용한 타원의 검출)

  • 이주용;서요한;이웅기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.1 no.1
    • /
    • pp.95-104
    • /
    • 1996
  • The Hough transform Is a robust technique Which Is useful in defecting straight lines in an picture. However, the extension of the conventional Hough transform to recover circles and ellipses has been limited by slow speed and excessive memory .This paper presents a method of detecting ellipses from the Image by using Least Square Method. This method Is reduced calculation cost and memory requirement .When detecting ellipse. Instead of obtaining accumulation of Hough transform for determination of ellipse parameters. particular points containing geometric properties of ellipse are selected. Parameters of the ellipse are calculated by Least Square Method using those particular points.

  • PDF

The Suggestion of Particular Area Image Search Method (부분 영역 이미지 검색 방법의 제안)

  • Kim, Sungkon
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.355-360
    • /
    • 2018
  • We propose a method to connect partial image in whole image to partial image in whole image of other internet site. For this study, we have developed four partial image generation methods and retrieval methods. A method of 'image segmentation' that cuts out only partial images that want to provide information from the whole image, a method of 'creating an image block' that finds outermost points of a cut-out partial image, a method of 'Stamp transformation of outer points', which connects outer points and registers them as the most similar image stamp, and a retrieval method that connects image stamps with other image stamps are developed. We suggested a image search UI that can use image stamps in various ways.

Heuristic Algorithms for Capacitated Collection Network Design in Reverse Logistics

  • Kim, Ji-Su;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.14 no.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.

Designing Refuse Collection Networks under Capacity and Maximum Allowable Distance Constraints

  • Kim, Ji-Su;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.19 no.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.

COUPLED FIXED POINTS FOR MIXED g-MONOTONE UNDER RATIONAL CONTRACTIVE EXPRESSIONS IN PARTIALLY ORDERED METRIC SPACES

  • Nashine, Hemant Kumar;Gupta, Anita
    • East Asian mathematical journal
    • /
    • v.32 no.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.

A Study on Logistics Infrastructure Policies in Japan (일본의 물류 인프라 정책에 관한 연구)

  • Han, J. G.
    • Journal of Korean Port Research
    • /
    • v.10 no.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.

  • PDF