• Title/Summary/Keyword: and parallel processing

Search Result 2,006, Processing Time 0.03 seconds

A Main Wall Recognition of Architectural Drawings using Dimension Extension Line (치수보조선을 이용한 도면의 주벽인식)

  • Kwon, Young-Bin
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.837-846
    • /
    • 2003
  • This paper deals with plain figures on the architectural drawings of apartment. This kind of architectural drawings consist of main walls represented by two parallel bold lines, symbols (door, window, $\cdots$), dimension line, extension line, and dimensions represent various numerical values and characters. This paper suggests a method for recognizing main wall which is a backbone of apartment in an architectural drawing. In this thesis, the following modules are realized : an efficient image barbarization, a removal of thin lines, a vectorization of detected lines, a region bounding for main walls, a calculation of extension lines, a finding main walls based on extension line, and a field expansion by searching other main walls which are linked with the detected main walls. Although the windows between main walls are not represented as main walls, a detection module for the windows is considered during the recognition period. So the windows are found as a part of main wall. An experimental result on 9 different architectural drawings shows 96.5% recognition of main walls and windows, which is about 5.8% higher than that of Karl Tombre.

Intelligent Tuning Of a PID Controller Using Immune Algorithm (면역 알고리즘을 이용한 PID 제어기의 지능 튜닝)

  • Kim, Dong-Hwa
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.1
    • /
    • pp.8-17
    • /
    • 2002
  • This paper suggests that the immune algorithm can effectively be used in tuning of a PID controller. The artificial immune network always has a new parallel decentralized processing mechanism for various situations, since antibodies communicate to each other among different species of antibodies/B-cells through the stimulation and suppression chains among antibodies that form a large-scaled network. In addition to that, the structure of the network is not fixed, but varies continuously. That is, the artificial immune network flexibly self-organizes according to dynamic changes of external environment (meta-dynamics function). However, up to the present time, models based on the conventional crisp approach have been used to describe dynamic model relationship between antibody and antigen. Therefore, there are some problems with a less flexible result to the external behavior. On the other hand, a number of tuning technologies have been considered for the tuning of a PID controller. As a less common method, the fuzzy and neural network or its combined techniques are applied. However, in the case of the latter, yet, it is not applied in the practical field, in the former, a higher experience and technology is required during tuning procedure. In addition to that, tuning performance cannot be guaranteed with regards to a plant with non-linear characteristics or many kinds of disturbances. Along with these, this paper used immune algorithm in order that a PID controller can be more adaptable controlled against the external condition, including moise or disturbance of plant. Parameters P, I, D encoded in antibody randomly are allocated during selection processes to obtain an optimal gain required for plant. The result of study shows the artificial immune can effectively be used to tune, since it can more fit modes or parameters of the PID controller than that of the conventional tuning methods.

Sharing Error Allowances for the Analysis of Approximation Schemes (근사접근법 분석을 위한 오차허용치의 분배방법)

  • Kim, Joon-Mo;Goo, Eun-Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.1-7
    • /
    • 2009
  • When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

Molecular Dynamics Study of [C10mim][Br] Aggregation (분자동역학을 이용한 [C10mim][Br] 의 응집에 관한 연구)

  • Yoon, Hong-Min;Lee, Joon-Sang
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.36 no.8
    • /
    • pp.873-876
    • /
    • 2012
  • Ionic liquids (ILs) existing in the liquid ion form under standard conditions show a unique properties. 1-10-Alkyl-3-methyl-imidazolium bromide ([C10mim][Br]) is one of the ILs that shows amphiphilic characteristics under specific conditions. This property enables it to function as a surfactant, and therefore, it finds applications in a wide range of areas. In this study, we tried to predict the behavior, especially the aggregation aspect, of [C10mim][Br] in an aqueous solution using molecular dynamics (MD) simulations. The canonical (NVT) ensemble was used to relax the system and trace the trajectory of atoms. Several case studies were simulated and the interaction among [C10mim]+, [Br]-, and water was analyzed using the radial distribution function of each atom. The density distribution function was also used for the structural analysis of the entire system. We used the Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) code for the present MD simulations.

Fatigue Crack Growth Behavior of a Magnesium-Based Composite (마그네슘 금속복합재의 피로균열거동해석)

  • Kim, Doo Hwan;Park, Yong Gul;Kim, Sung Hoon;Han, Suk Kyu
    • Journal of Korean Society of Steel Construction
    • /
    • v.9 no.4 s.33
    • /
    • pp.515-521
    • /
    • 1997
  • The effects of heat treatment and fiber orientation on tensile strength and fatigue behavior were studied in a continuously reinforced. magnesium-based composite Following an earlier TEM investigation, specimens were thermally aged to modified the interfacial zone between the alumina fibers and the magnesium alloy matrix. From the tensile experimental results, the ultimate tensile strength of the aged specimens were lower than that of the as-fabricated due to weak fiber-matrix interfacial strength with chemical reaction during the thermal processing. The fatigue crack growth experiments were conducted with specimens having the fiber orientation normal to the crack growth direction (longitudinal) and also specimens with the fibers oriented parallel to the crack growth direction(transverse). A comparison of the fatigue crack growth behavior indicates that aged longitudinal specimens are more resistant to fatigue crack growth the as-fabricated longitudinal specimens. Conversely, as-fabricated transverse specimens are more resistant to fatigue crack growth than aged transverse specimens.

  • PDF

Hardware Channel Decoder for Holographic WORM Storage (홀로그래픽 WORM의 하드웨어 채널 디코더)

  • Hwang, Eui-Seok;Yoon, Pil-Sang;Kim, Hak-Sun;Park, Joo-Youn
    • Transactions of the Society of Information Storage Systems
    • /
    • v.1 no.2
    • /
    • pp.155-160
    • /
    • 2005
  • In this paper, the channel decoder promising reliable data retrieving in noisy holographic channel has been developed for holographic WORM(write once read many) system. It covers various DSP(digital signal processing) blocks, such as align mark detector, adaptive channel equalizer, modulation decoder and ECC(error correction code) decoder. The specific schemes of DSP are designed to reduce the effect of noises in holographic WORM(H-WORM) system, particularly in prototype of DAEWOO electronics(DEPROTO). For real time data retrieving, the channel decoder is redesigned for FPGA(field programmable gate array) based hardware, where DSP blocks calculate in parallel sense with memory buffers between blocks and controllers for driving peripherals of FPGA. As an input source of the experiments, MPEG2 TS(transport stream) data was used and recorded to DEPROTO system. During retrieving, the CCD(charge coupled device), capturing device of DEPROTO, detects retrieved images and transmits signals of them to the FPGA of hardware channel decoder. Finally, the output data stream of the channel decoder was transferred to the MPEG decoding board for monitoring video signals. The experimental results showed the error corrected BER(bit error rate) of less than $10^{-9}$, from the raw BER of DEPROTO, about $10^{-3}$. With the developed hardware channel decoder, the real-time video demonstration was possible during the experiments. The operating clock of the FPGA was 60 MHz, of which speed was capable of decoding up to 120 mega channel bits per sec.

  • PDF

A Hardware Implementation of Pyramidal KLT Feature Tracker (계층적 KLT 특징 추적기의 하드웨어 구현)

  • Kim, Hyun-Jin;Kim, Gyeong-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.57-64
    • /
    • 2009
  • This paper presents the hardware implementation of the pyramidal KLT(Kanade-Lucas-Tomasi) feature tracker. Because of its high computational complexity, it is not easy to implement a real-time KLT feature tracker using general-purpose processors. A hardware implementation of the pyramidal KLT feature tracker using FPGA(Field Programmable Gate Array) is described in this paper with emphasis on 1) adaptive adjustment of threshold in feature extraction under diverse lighting conditions, and 2) modification of the tracking algorithm to accomodate parallel processing and to overcome memory constraints such as capacity and bandwidth limitation. The effectiveness of the implementation was evaluated over ones produced by its software implementation. The throughput of the FPGA-based tracker was 30 frames/sec for video images with size of $720{\times}480$.

Real-time Eye Contact System Using a Kinect Depth Camera for Realistic Telepresence (Kinect 깊이 카메라를 이용한 실감 원격 영상회의의 시선 맞춤 시스템)

  • Lee, Sang-Beom;Ho, Yo-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4C
    • /
    • pp.277-282
    • /
    • 2012
  • In this paper, we present a real-time eye contact system for realistic telepresence using a Kinect depth camera. In order to generate the eye contact image, we capture a pair of color and depth video. Then, the foreground single user is separated from the background. Since the raw depth data includes several types of noises, we perform a joint bilateral filtering method. We apply the discontinuity-adaptive depth filter to the filtered depth map to reduce the disocclusion area. From the color image and the preprocessed depth map, we construct a user mesh model at the virtual viewpoint. The entire system is implemented through GPU-based parallel programming for real-time processing. Experimental results have shown that the proposed eye contact system is efficient in realizing eye contact, providing the realistic telepresence.

A Study on a Lossless Compression Scheme for Cloud Point Data of the Target Construction (목표 구조물에 대한 점군데이터의 무손실 압축 기법에 관한 연구)

  • Bang, Min-Suk;Yun, Kee-Bang;Kim, Ki-Doo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.33-41
    • /
    • 2011
  • In this paper, we propose a lossless compression scheme for cloud point data of the target construction by using doubleness and decreasing useless information of cloud point data. We use Hough transform to find the horizontal angle between construction and terrestrial LIDAR. This angle is used for the rotation of the cloud point data. The cloud point data can be parallel to x-axis, then y-axis doubleness is increased. Therefore, the cloud point data can be more compressed. In addition, we apply two methods to decrease the number of cloud point data for useless information of them. One is decimation of the cloud point data, the other is to extract the range of y-coordinates of target construction, and then extract the cloud point data existing in the range only. The experimental result shows the performance of proposed scheme. To compress the data, we use only the position information without additional information. Therefore, this scheme can increase processing speed of the compression algorithm.

Distributed Mean Field Genetic Algorithm for Channel Routing (채널배선 문제에 대한 분산 평균장 유전자 알고리즘)

  • Hong, Chul-Eui
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.287-295
    • /
    • 2010
  • In this paper, we introduce a novel approach to optimization algorithm which is a distributed Mean field Genetic algorithm (MGA) implemented in MPI(Message Passing Interface) environments. Distributed MGA is a hybrid algorithm of Mean Field Annealing(MFA) and Simulated annealing-like Genetic Algorithm(SGA). The proposed distributed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. The proposed distributed MGA is applied to the channel routing problem, which is an important issue in the automatic layout design of VLSI circuits. Our experimental results show that the composition of heuristic methods improves the performance over GA alone in terms of mean execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential algorithm while it achieves almost linear speedup as the problem size increases.