• Title/Summary/Keyword: 3-Dimension algorithm

Search Result 191, Processing Time 0.032 seconds

A Study on Detection of Lane and Displacement of Obstacle for AGV using Vision System (비전시스템을 이용한 자율주행량의 차선내 차량의 변위 검출에 관한 연구)

  • Lee, Jin-Woo;Choi, Sung-Uk;Lee, Chang-Hoon;Lee, Yung-Jin;Lee, Kwon-Soon
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2202-2205
    • /
    • 2001
  • This paper is composed of two parts. One is image preprocessing part to measure the condition of the lane and vehicle. This finds the information of lines using RGB ratio cutting algorithm, the edge detection and Hough transform. The other obtains the situation of other vehicles using the image processing and viewport. At first, 2 dimension image information derived from vision sensor is interpreted to the 3 dimension information by the angle and position of the CCD camera. Through these processes, if vehicle knows the driving conditions which are lane angle, distance error and real position of other vehicles, we should calculate the reference steering angle by steering controller.

  • PDF

Development of Map Building Algorithm for Mobile Robot by Using RFID (모바일 로봇에서 RFID를 이용한 지도작성 알고리즘 개발)

  • Kim, Si-Seup;Seon, Jeong-An;Kee, Chang-Doo
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.2
    • /
    • pp.133-138
    • /
    • 2011
  • RFID system can be used to improve object recognition, map building and localization for robot area. A novel method of indoor navigation system for a mobile robot is proposed using RFID technology. The mobile robot With a RFID reader and antenna is able to find what obstacles are located where in circumstance and can build the map similar to indoor circumstance by combining RFID information and distance data obtained from sensors. Using the map obtained, the mobile robot can avoid obstacles and finally reach the desired goal by $A^*$ algorithm. 3D map which has the advantage of robot navigation and manipulation is able to be built using z dimension of products. The proposed robot navigation system is proved to apply for SLAM and path planning in unknown circumstance through numerous experiments.

Development of 3 Phase PWM Converter using Analog Hysteresis Current Controller (아날로그 히스테리시스 전류 제어기를 적용한 3상 PWM 컨버터 개발)

  • Lee Young-kook;Noh Chul-won
    • Proceedings of the KIPE Conference
    • /
    • 2001.07a
    • /
    • pp.372-376
    • /
    • 2001
  • Due to several advantages of Pulse Width Modulation(PWM) Converter, such as unity power factor operation, elimination of low-order harmonics and regeneration of motor braking energy to source, the application range of PWM Converter has been rapidly extended in industrial application. Nowadays, vector control algorithm and space vector PWM(SVPWM) method are applied to improve the performances of PWM Converter, but vector control algorithm and SVPWM require to use Microprocessor and other digital devices in hardware, causing costly and somewhat large dimension system. In every practical application of energy conversion equipments, the design and implementation should be carried out considering cost and performance. High performance and low cost is the best choice for energy conversion equipments. So, this paper presents the practical design method and implementation results of 3-phase PWM Converter with analog hysteresis current controller, and verifies the performances of unit power factor operation and energy regeneration operation via experimental results.

  • PDF

Estimation of External Prestressing Tendon Tension Using Sl Technique Based on Evolutionary Algorithm (진화 알고리즘기반의 SI기법을 이용한 외부 프리스트레싱으로 보강된 텐던의 장력 추정)

  • Jang, Han-Teak;Noh, Myung-Hun;Lee, Sang-Youl;Park, Tae-Hyo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2008.04a
    • /
    • pp.156-159
    • /
    • 2008
  • This paper introduces a remained tensile force estimation method using SI technique based on evolutionary algorithm for externally prestressed tendon. This paper applies the differential evolutionary scheme to SI technique. A virtual model test using ABAQUS 3 dimensional frame model has been made for this work The virtual model is added to the tensile force(28.5kN). Two set of frequencies are extracted respectively from the virtual test and the self-coding FEM 2 dimension model. The estimating tendon tension for the FEM model is 28.31kN. It is that the error in the tendon tension is 1% through the differential evolutionary algorithm. The errors between virtual model and the self-coding FEM model are assumed as the model error.

  • PDF

Three-Dimensional Borehole Radar Modeling (3차원 시추공 레이다 모델링)

  • 예병주
    • Economic and Environmental Geology
    • /
    • v.33 no.1
    • /
    • pp.41-50
    • /
    • 2000
  • Geo-radar survey which has the advantage of high-resolution and relatively fast survey has been widely used for engineering and environmental problems. Three-dimensional effects have to be considered in the interpretation of geo-radar for high-resolution. However, there exists a trouble on the analysis of the three dimensional effects. To solve this problem an efficient three dimension numerical modeling algorithm is needed. Numerical radar modeling in three dimensional case requires large memory and long calculating time. In this paper, a finite difference method time domain solution to Maxwell's equations for simulating electromagnetic wave propagation in three dimensional media was developed to make economic algorithm which requires smaller memory and shorter calculating time. And in using boundary condition Liao absorption boundary. The numerical result of cross-hole radar survey for tunnel is compared with real data. The two results are well matched. To prove application to three dimensional analysis, the results with variation of tunnel's incident angle to survey cross-section and the result when the tunnel is parallel to the cross-section were examined. This algorithm is useful in various geo-radar survey and can give basic data to develop dat processing and inversion program.

  • PDF

A Clustering Algorithm Using the Ordered Weight of Self-Organizing Feature Maps (자기조직화 신경망의 정렬된 연결강도를 이용한 클러스터링 알고리즘)

  • Lee Jong-Sup;Kang Maing-Kyu
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.41-51
    • /
    • 2006
  • Clustering is to group similar objects into clusters. Until now there are a lot of approaches using Self-Organizing feature Maps (SOFMS) But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of c output-layer nodes, if they want to make c clusters. This approach has problems to classify elaboratively. This Paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We un find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. The proposed algorithm was tested on well-known IRIS data and TSPLIB. The results of this computational study demonstrate the superiority of the proposed algorithm.

A Study and Implementation of the Heuristic Autonesting Algorithm in the 2 Dimension Space (2차원 공간에서의 휴리스틱 배치 알고리즘 및 구현에 관한 연구)

  • 양성모;임성국;고석호;김현정;한관희
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.3
    • /
    • pp.259-268
    • /
    • 1999
  • In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

  • PDF

Fairness CSMA/CA MAC Protocol for VLC Networks

  • Huynh, Vu Van;Jang, Yeong-Min
    • International journal of advanced smart convergence
    • /
    • v.1 no.1
    • /
    • pp.14-18
    • /
    • 2012
  • This paper presents a fair MAC protocol based on the CSMA/CA algorithm in visible light communication (VLC) networks. The problem of bandwidth sharing among differentiated priority in VLC networks can be solved by using number of backoff time and backoff exponent parameters with AIFS. The proposed algorithm can achieve fair allocation of the bandwidth resource among differentiated priority. The two dimension Markov chain is assisted for analyzing the proposed mechanism about throughput and delay metrics. Numerical results show that our proposed algorithm improves the fairness among different traffic flows.

전자총 히터(electron gun heater) 자동검사를 위한 머신비젼 알고리즘

  • 김인수;이문규
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.3
    • /
    • pp.58-67
    • /
    • 2000
  • Electron gun heaters are used to heat a cathode in video(TV) monitors. Major defects of the electron gun heaters include dimensional inaccuracy and pollution with dirty materials. In this paper, to save the labor and time being taken to inspect the heaters, a machine vision system is considered. For the system, a new algorithm is developed to measure the 9 different dimensions of each heater and to detect polluted defects. The algorithm consists of three stages. In the first stage, the center of the heater image is obtained and then its boundary detection is performed. For the efficient boundary detection, a mask called the sum mask is used. In the second stage of the algorithm, a set of fiducial points are determined on the boundary image. Finally, using the fiducial points specified dimensions are measured and the amount of polluted area is computed in the third stage. The performance of the algorithm is evaluated for a set of real specimens. The results indicate that measurements obtained by the algorithm satisfy the tolerance limits fur most of the dimensions and the algorithm detects the polluted defects successfully.

  • PDF

Study on Dimension Reduction algorithm for unsupervised clustering of the DMR's RF-fingerprinting features (무선단말기 RF-fingerprinting 특징의 비지도 클러스터링을 위한 차원축소 알고리즘 연구)

  • Young-Giu Jung;Hak-Chul Shin;Sun-Phil Nah
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.83-89
    • /
    • 2023
  • The clustering technique using RF fingerprint extracts the characteristic signature of the transmitters which are embedded in the transmission waveforms. The output of the RF-Fingerprint feature extraction algorithm for clustering identical DMR(Digital Mobile Radios) is a high-dimensional feature, typically consisting of 512 or more dimensions. While such high-dimensional features may be effective for the classifiers, they are not suitable to be used as inputs for the clustering algorithms. Therefore, this paper proposes a dimension reduction algorithm that effectively reduces the dimensionality of the multidimensional RF-Fingerprint features while maintaining the fingerprinting characteristics of the DMRs. Additionally, it proposes a clustering algorithm that can effectively cluster the reduced dimensions. The proposed clustering algorithm reduces the multi-dimensional RF-Fingerprint features using t-SNE, based on KL Divergence, and performs clustering using Density Peaks Clustering (DPC). The performance analysis of the DMR clustering algorithm uses a dataset of 3000 samples collected from 10 Motorola XiR and 10 Wintech N-Series DMRs. The results of the RF-Fingerprinting-based clustering algorithm showed the formation of 20 clusters, and all performance metrics including Homogeneity, Completeness, and V-measure, demonstrated a performance of 99.4%.