• Title/Summary/Keyword: convex hull

Search Result 154, Processing Time 0.034 seconds

The forecast of curve shape reforming by variation of B-spline knot vector values (B-스플라인 노트백터 값 변화에 의한 곡선 형상 변화 예측)

  • 김희중;정재현
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.866-871
    • /
    • 1994
  • B-spline curves and surfaces are effective solutions for design and modelling of the freeform models. The control methods of these are using with control points, knot vectors and weight of NURBS. Using control point is easy and resonable for representation of general models. But the movement of control points bring out the reformation of original convex hull. The B-splines with nonuniform knot vector provide good result of the shape modification without convex hull reforming. B-splines are constructed with control points and basis functions. Nonuniform knot vectors effect on the basis functions. And the blending curves describe the prorities of knot vectors. Applying of these, users will forecast of the reformed curves after modifying controllabler primitives.

  • PDF

Multiple Face Segmentation and Tracking Based on Robust Hausdorff Distance Matching

  • Park, Chang-Woo;Kim, Young-Ouk;Sung, Ha-Gyeong;Park, Mignon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.1
    • /
    • pp.87-92
    • /
    • 2003
  • This paper describes a system for tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

Determination of plates with inflection lines for hull plate forming (곡가공을 위한 변곡 곡면의 판정)

  • Kim, Chan Suk;Shin, Jong Gye
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.52 no.5
    • /
    • pp.365-371
    • /
    • 2015
  • Hull plate consists of various types of curved plates and there also exists corresponding processing methods. Typically, curved plates can be divided into convex type and saddle type. Large amount of research has been conducted mainly focusing on application of processing method of convex type, saddle type and hybrid type, but research on determination and processing method application of the most difficult S-shaped curved plate that has inflection lines has not been carried out yet. In this paper, as the fundamental research of appropriate processing method application, a calculation method is proposed to calculate inflection lines on curved plates. In order to calculate inflection lines, normal curvature and information of fabricated curved plates should be utilized. We compare the workability of the fabrication for hull plate using inflection line.

POLYNOMIAL GROWTH HARMONIC MAPS ON COMPLETE RIEMANNIAN MANIFOLDS

  • Lee, Yong-Hah
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.3
    • /
    • pp.521-540
    • /
    • 2004
  • In this paper, we give a sharp estimate on the cardinality of the set generating the convex hull containing the image of harmonic maps with polynomial growth rate on a certain class of manifolds into a Cartan-Hadamard manifold with sectional curvature bounded by two negative constants. We also describe the asymptotic behavior of harmonic maps on a complete Riemannian manifold into a regular ball in terms of massive subsets, in the case when the space of bounded harmonic functions on the manifold is finite dimensional.

On the Convex Hull of Multicuts on a Cycle

  • Lee, Kyung-Sik
    • Management Science and Financial Engineering
    • /
    • v.15 no.2
    • /
    • pp.119-123
    • /
    • 2009
  • The minimum multicut problem on a cycle is to find a multicut on an undirected cycle such that the sum of weights is minimized, which is known to be polynomially solvable. This paper shows that there exists a compact polyhedral description of the set of feasible solutions to the problem whose number of variables and constraints is O($\upsilon\kappa$).

Building Boundary Reconstruction from Airborne Lidar Data by Adaptive Convex Hull Algorithm (적응적 컨벡스헐 알고리즘을 이용한 항공라이다 데이터의 건물 경계 재구성)

  • Lee, Jeong-Ho;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.3
    • /
    • pp.305-312
    • /
    • 2012
  • This paper aims at improving the accuracy and computational efficiency in reconstructing building boundaries from airborne Lidar points. We proposed an adaptive convex hull algorithm, which is a modified version of local convex hull algorithm in three ways. The candidate points for boundary are first selected to improve efficiency depending on their local density. Second, a searching-space is adjusted adaptively, based on raw data structure, to extract boundary points more robustly. Third, distance between two points and their IDs are utilized in detecting the seed points of inner boundary to distinguish between inner yards and inner holes due to errors or occlusions. The practicability of the approach were evaluated on two urban areas where various buildings exist. The proposed method showed less shape-dissimilarity(8.5%) and proved to be two times more efficient than the other method.

Mobile Reader Selection for Improving Precision of Location Estimation in RTLS (위치 측정 정확도 향상을 위한 RTLS의 이동형 리더 선택)

  • Kim, Jam-Je;Son, Sang-Hyun;Choi, Hoon;Baek, Yun-Ju
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.45-49
    • /
    • 2010
  • RTLS (Real Time Locating Systems) are used to track and identify the location of objects in real time. RTLS generally consist of tags, readers and engine etc. and applied in various environments. One problem encountered in RTLS is constraints for setting up readers according to environments. In these challenging environments, it is necessary to develop techniques that can use mobile readers. As mobile reader increase, whole reader increase. And it is necessary to develop technique that can select useful readers. Selected readers including mobile readers take effect performance of RTLS. This paper introduces the technique for selecting good readers using the convex hull algorithm. The result show the good performance which based on tag's location error and reduce the networking overhead.

The ConvexHull using Outline Extration Algorithm in Gray Scale Image (이진 영상에서 ConvexHull을 이용한 윤곽선 추출 알고리즘)

  • Cho, Young-bok;Kim, U-ju;Woo, Sung-hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.162-165
    • /
    • 2017
  • The proposed paper extracts the region of interest from the x-lay input image and compares it with the reference image. The x-ray image has the same shape, but the size, direction and position of the object are photographed differently. In this way, we measure the erection difference of darkness and darkness using the similarity measurement method for the same object. Distance measurement also calculates the distance between two points with vector coordinates (x, y, z) of x-lay data. Experimental results show that the proposed method improves the accuracy of ROI extraction and the reference image matching time is more efficient than the conventional method.

  • PDF

Incremental SVM for Online Product Review Spam Detection (온라인 제품 리뷰 스팸 판별을 위한 점증적 SVM)

  • Ji, Chengzhang;Zhang, Jinhong;Kang, Dae-Ki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.89-93
    • /
    • 2014
  • Reviews are very important for potential consumer' making choices. They are also used by manufacturers to find problems of their products and to collect competitors' business information. But someone write fake reviews to mislead readers to make wrong choices. Therefore detecting fake reviews is an important problem for the E-commerce sites. Support Vector Machines (SVMs) are very important text classification algorithms with excellent performance. In this paper, we propose a new incremental algorithm based on weight and the extension of Karush-Kuhn-Tucker(KKT) conditions and Convex Hull for online Review Spam Detection. Finally, we analyze its performance in theory.

  • PDF

Optimum Concrete Mix-proportion based on Database according to Assessment Model for Effective Region (유효 영역 판별 모델에 따른 데이터베이스 기반 콘크리트 최적 배합 선정)

  • Lee, Bang-Yeon;Kim, Jae-Hong;Kim, Jin-Keun;Yi, Seong-Tae
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2006.11a
    • /
    • pp.909-912
    • /
    • 2006
  • This paper examined the applicability of convex hull, which is defined as the minimal convex polygon including all points, to assessment model for effective region. In order to validate the applicability of the convex hull to assessment model for effective region, a genetic algorithm was adopted as a optimum technique, and an artificial neural network was adopted as a prediction model for material properties. The mix-proportion obtained from the proposed technique is more reasonable than that obtained from previous work.

  • PDF