• Title/Summary/Keyword: convex hull algorithm

Search Result 75, Processing Time 0.028 seconds

Face Detection Algorithm using Color and Convex-Hull Based Region Information

  • Park, Minsick;Park, Chang-Woo;Park, Mignon
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.217-220
    • /
    • 2001
  • The detection of face in color images is important for many multimedia applications. It is the first step for face recognition and ran be used for classifying specific shots. In this paper describes a new method to detect faces in color images based on the skin color and hair color. In the first step of the processing, regions of the human skin color and head color are extracted and those regions are found by their color information. Then we converted binary scale from the image. Then we are connected regions in a binary image by label. In the next step we are found regions of interesting by their region information and some conditions.

  • PDF

Cable layout design of two way prestressed concrete slabs using FEM

  • Khan, Ahmad Ali;Pathak, K.K.;Dindorkar, N.
    • Computers and Concrete
    • /
    • v.11 no.1
    • /
    • pp.75-91
    • /
    • 2013
  • In this paper, a new approach for cable layout design of pre-stressed concrete slabs is presented. To account the cable profile accurately, it is modelled by B-spline. Using the convex hull property of the B-spline, an efficient algorithm has been developed to obtain the cable layout for pre-stressed concrete slabs. For finite element computations, tendon and concrete are modelled by 3 noded bar and 20 noded brick elements respectively. The cable concrete interactions are precisely accounted using vector calculus formulae. Using the proposed technique a two way prestressed concrete slab has been successfully designed considering several design criteria.

Extraction of Sizes and Velocities of Spray Droplets by Optical Imaging Method

  • Choo, Yeonjun;Kang, Boseon
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.7
    • /
    • pp.1236-1245
    • /
    • 2004
  • In this study, an optical imaging method was developed for the measurements of the sizes and velocities of droplets in sprays. Double-exposure single-frame spray images were captured by the imaging system. An image processing program was developed for the measurements of the sizes and positions of individual particles including separation of the overlapped particles and particle tracking and pairing at two time instants. To recognize and separate overlapping particles, the morphological method based on watershed segmentation as well as separation using the perimeter and convex hull of image was used consecutively. Better results in separation were obtained by utilization of both methods especially for the multiple or heavily-overlapped particles. The match probability method was adopted for particle tracking and pairing after identifying the positions of individual particles and it produced good matching results even for large particles like droplets in sprays. Therefore, the developed optical imaging method could provide a reliable way of analyzing the motion and size distribution of droplets produced by various sprays and atomization devices.

Development of Low Cost Autonomous-Driving Delivery Robot System Using SLAM Technology (SLAM 기술을 활용한 저가형 자율주행 배달 로봇 시스템 개발)

  • Donghoon Lee;Jehyun Park;Kyunghoon Jung
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.5
    • /
    • pp.249-257
    • /
    • 2023
  • This paper discusses the increasing need for autonomous delivery robots due to the current growth in the delivery market, rising delivery fees, high costs of hiring delivery personnel, and the need for contactless services. Additionally, the cost of hardware and complex software systems required to build and operate autonomous delivery robots is high. To provide a low-cost alternative to this, this paper proposes a autonomous delivery robot platform using a low-cost sensor combination of 2D LIDAR, depth camera and tracking camera to replace the existing expensive 3D LIDAR. The proposed robot was developed using the RTAB-Map SLAM open source package for 2D mapping and overcomes the limitations of low-cost sensors by using the convex hull algorithm. The paper details the hardware and software configuration of the robot and presents the results of driving experiments. The proposed platform has significant potential for various industries, including the delivery and other industries.

A method for image-based shadow interaction with virtual objects

  • Ha, Hyunwoo;Ko, Kwanghee
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.1
    • /
    • pp.26-37
    • /
    • 2015
  • A lot of researchers have been investigating interactive portable projection systems such as a mini-projector. In addition, in exhibition halls and museums, there is a trend toward using interactive projection systems to make viewing more exciting and impressive. They can also be applied in the field of art, for example, in creating shadow plays. The key idea of the interactive portable projection systems is to recognize the user's gesture in real-time. In this paper, a vision-based shadow gesture recognition method is proposed for interactive projection systems. The gesture recognition method is based on the screen image obtained by a single web camera. The method separates only the shadow area by combining the binary image with an input image using a learning algorithm that isolates the background from the input image. The region of interest is recognized with labeling the shadow of separated regions, and then hand shadows are isolated using the defect, convex hull, and moment of each region. To distinguish hand gestures, Hu's invariant moment method is used. An optical flow algorithm is used for tracking the fingertip. Using this method, a few interactive applications are developed, which are presented in this paper.

Automated Areal Feature Matching in Different Spatial Data-sets (이종의 공간 데이터 셋의 면 객체 자동 매칭 방법)

  • Kim, Ji Young;Lee, Jae Bin
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.89-98
    • /
    • 2016
  • In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

Hand Region Tracking and Fingertip Detection based on Depth Image (깊이 영상 기반 손 영역 추적 및 손 끝점 검출)

  • Joo, Sung-Il;Weon, Sun-Hee;Choi, Hyung-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.8
    • /
    • pp.65-75
    • /
    • 2013
  • This paper proposes a method of tracking the hand region and detecting the fingertip using only depth images. In order to eliminate the influence of lighting conditions and obtain information quickly and stably, this paper proposes a tracking method that relies only on depth information, as well as a method of using region growing to identify errors that can occur during the tracking process and a method of detecting the fingertip that can be applied for the recognition of various gestures. First, the closest point of approach is identified through the process of transferring the center point in order to locate the tracking point, and the region is grown from that point to detect the hand region and boundary line. Next, the ratio of the invalid boundary, obtained by means of region growing, is used to calculate the validity of the tracking region and thereby judge whether the tracking is normal. If tracking is normal, the contour line is extracted from the detected hand region and the curvature and RANSAC and Convex-Hull are used to detect the fingertip. Lastly, quantitative and qualitative analyses are performed to verify the performance in various situations and prove the efficiency of the proposed algorithm for tracking and detecting the fingertip.

A Study on Implementation of a Robot Vision System for Recogniton of complex 2-D Objects (복잡한 2차원 물체 인식용 로봇 시각장치의 구현에 관한 연구)

  • Kim, Ho-Seong;Kim, Yeong-Seok;Byeon, Jeung-Nam
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.1
    • /
    • pp.53-60
    • /
    • 1985
  • A computer vision system for robot is developed which can recognize a variety of two dimensional complex objects in gray level noisy scenes. the system is also capable of determining the position and orientation of the objects for robotlc manipulation. The hardware of the vision system is developed and a new edge tracking technique is also proposed. The linked edges are approximated to sample line drawing by split and merge algorithm. The system extracts many features from line drawing and constructs relational structure by the concave and convex hull of objects. In matching process, the input obhects are compared with the objects database which is formed by learning ability. Thelearning process is so simple that the system is very flexible. Several examples arc shown to demonstrate the usefulness of this system.

  • PDF

Development of a Dike Line Selection Method Using Multispectral Orthoimages and Topographic LiDAR Data Taken in the Nakdong River Basins

  • Choung, Yun Jae
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.3
    • /
    • pp.155-161
    • /
    • 2015
  • Dike lines are important features for describing the detailed shapes of dikes and for detecting topographic changes on dike surfaces. Historically, dike lines have been generated using only the LiDAR data. This paper proposes a new methodology for selecting an appropriate dike line on various dike surfaces using the topographic LiDAR data and multispectral orthoimages taken in the Nakdong River basins. The fi rst baselines were generated from the given LiDAR data using the modified convex hull algorithm and smoothing spline function, and the second baselines were generated from the given orthoimages by the Canny operator. Next, one baseline was selected among the two baselines at 10m intervals by comparing their elevations, and the selected baseline at 10m interval was defined as the dike line segment. Finally, the selected dike line segments were connected to construct the 3D dike lines. The statistical results show that the dike lines generated using both the LiDAR data and multispectral orthoimages had the improved horizontal and vertical accuracies than the dike lines generated only using the LiDAR data on the various dike surfaces.

A Border Line-Based Pruning Scheme for Shortest Path Computations

  • Park, Jin-Kyu;Moon, Dae-Jin;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.939-955
    • /
    • 2010
  • With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.