• Title/Summary/Keyword: processing operators

Search Result 279, Processing Time 0.027 seconds

Systolic Arrays for Edge Detection of Image Processing (영상처리의 윤곽선 검출을 위한 시스톨릭 배열)

  • Park, Deok-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2222-2232
    • /
    • 1999
  • This paper proposed a Systolic Arrays architecture for computing edge detection on images. It is very difficult to be processed images to real time because of operations of local operators. Local operators for computing edge detection are to be used in many image processing tasks, involve replacing each pixel in an image with a value computed within a local neighborhood of that pixel. Computing such operators at the video rate requires a computing power which is not provided by conventional computer. Through computationally expensive, it is highly regular. Thus, this paper presents a systolic arrays for tasks such as edge detection and laplacian, which are defined in terms of local operators.

  • PDF

An Information Theory-based Approach to Modeling the Information Processing of NPP Operators

  • Kim, Jong-Hyun;Seong, Poong-Hyun
    • Nuclear Engineering and Technology
    • /
    • v.34 no.4
    • /
    • pp.301-313
    • /
    • 2002
  • This paper proposes a quantitative approach to modeling the information processing of NPP operators. The aim of this work is to derive the amount of the information processed during a certain control task. The focus will be on i) developing a model for information processing of NPP operators and ii) quantifying the model. To resolve the problems of the previous approaches based on the information theory, i.e. the problems of single channel approaches, we primarily develop the information processing model having multiple stages, which contains information flows. Then the uncertainty of the information is quantified using the Conant’s model, 3 kind of information theory.

An Integration of Spatial and Temporal Relationship Operators for Spatiotemporal Data (시공간 데이터를 위한 공간 및 시간 관계 연산자의 통합)

  • Lee, Jong-Yeon;Ryu, Geun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.21-31
    • /
    • 1999
  • In this paper we study on an interface connection between spatial operators and temporal operators to support the unified operations for spationtemporal data. The integration development of the spatiotemporal operations will be defined as a common use of spatiotemporal relationship operators by spatiotemporal referencing macros. additionally we propose an integration algorithm of a history operator and temporal relationship operators. Then the proposed system will be implemented on the commercial GIS software and evaluated by examples of spatiotemporal query expressions. Here, our integration of spatial and temporal operators will provide spatiotemporal query expressions with a useful framework.

  • PDF

Differential Operators on a Triangular Mesh and Their Applications (삼각형 메쉬 상에서의 미분 연산자와 그 응용)

  • Baek, Seung-Yeob;Kam, Dong-Uk;Lee, Kunwoo
    • Korean Journal of Computational Design and Engineering
    • /
    • v.20 no.1
    • /
    • pp.44-54
    • /
    • 2015
  • Solving partial differential equations (PDEs) on a manifold setting is frequently faced problem in CAD, CAM and CAE. However, unlikely to a regular grid, solutions for those problems on a triangular mesh are not available in general, as there are no well-established intrinsic differential operators. Considering that a triangular mesh is a powerful tool for representing a highly-complicated geometry, this problem must be tackled for improving the capabilities of many geometry processing algorithms. In this paper, we introduce mathematically well-defined differential operators on a triangular mesh setup, and show some examples of their applications. Through this, it is expected that many CAD/CAM/CAE application will be benefited, as it provides a mathematically rigorous solution for a PDE problem which was not available before.

Development of Alarm Processing Algorithm for SAS (변전소 자동화를 위한 Alarm Processing 방법 개발)

  • Jin, B.G.;Hyun, S.H.;Lee, S.J.
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.161-162
    • /
    • 2006
  • There are many alarms in Substation Automation System because of data types and quantities increasing, so it is very difficult for operators to know the actual situations. In order to help operators easily make decision, some unnecessary alarms should be removed or combined as one. In this paper, alarm processing is using the structure of substation system and the relation of measured data and events to make some rules. Conventional alarm processing just gives data, but proposed alarm processing gives the whole information. In a simulation model system, the data such as voltage, current and CB status are collected by HyperSim and saved in DB, then proposed alarm processing has been testified using those data based on real-time simulation.

  • PDF

Partition-based Operator Sharing Scheme for Spatio-temporal Data Stream Processing (시공간 데이터 스트림 처리를 위한 영역 기반의 연산자 공유 기법)

  • Chung, Weon-Il;Kim, Young-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5042-5048
    • /
    • 2010
  • In ubiquitous environments, many continuous query processing techniques make use of operator network and sharing methods on continuous data stream generated from various sensors. Since similar continuous queries with the location information intensively occur in specific regions, we suggest a new operator sharing method based on grid partition for the spatial continuous query processing for location-based applications. Due to the proposed method shares moving objects by the given grid cell without sharing spatial operators individually, our approach can not only share spatial operators including similar conditions, but also increase the query processing performance and the utilization of memory by reducing the frequency of use of spatial operators.

Rejection of Impulsive Noise and Baseline Wandering Using Morphological Operators (형태연산자를 이용한 심전도신호에 있어서의 임펄시브 노이즈와 기저선의 흔들림의 제거)

  • Kim, Chang-Jae;Nam, Seung-Woo;Shin, Gun-Soo;Lee, Myoung-Ho
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1990 no.11
    • /
    • pp.110-113
    • /
    • 1990
  • A new approach to impulsive noise rejection and background normalization of digitized electrocardiogram signals is presented using mathematical morphological operators that incoporate the shape information of a signal. A brief introduction to these nonlinear signal processing operators, as well as detailed description of the new algorithm, is presented. Empirical results show that the new algorithm has good performance in impulsive noise rejection and background normalization.

  • PDF

Modified GOMS-Model for Mobile Computing (모바일 작업을 위한 수정된 GOMS-model에 대한 연구)

  • Lee, Suk-Jae;Myung, Ro-Hae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.2
    • /
    • pp.85-93
    • /
    • 2009
  • GOMS model is a cognitive modeling method of human performance based on Goal, Operators, Methods, Selection rules. GOMS model was originally designed for desktop environment so that it is difficult for GOMS model to be implemented into the mobile environment. In addition, GOMS model would be inaccurate because the original GOMS model was based on serial processing, excluding one of most important human information processing characteristics, parallel processing. Therefore this study was designed to propose a modified GOMS model including mobile computing and parallel processing. In order to encompass mobile environment, an operator of 'look for' was divided into 'visual move to' and 'recognize' whereas 'point to' and 'click' were combined into 'tab.' The results showed that newly introduced operators were necessary to estimate more accurate mobile computing behaviors. In conclusion, modified-GOMS model could predict human performance more accurately than the original GOMS model in the mobile computing environment.

PartitionTuner: An operator scheduler for deep-learning compilers supporting multiple heterogeneous processing units

  • Misun Yu;Yongin Kwon;Jemin Lee;Jeman Park;Junmo Park;Taeho Kim
    • ETRI Journal
    • /
    • v.45 no.2
    • /
    • pp.318-328
    • /
    • 2023
  • Recently, embedded systems, such as mobile platforms, have multiple processing units that can operate in parallel, such as centralized processing units (CPUs) and neural processing units (NPUs). We can use deep-learning compilers to generate machine code optimized for these embedded systems from a deep neural network (DNN). However, the deep-learning compilers proposed so far generate codes that sequentially execute DNN operators on a single processing unit or parallel codes for graphic processing units (GPUs). In this study, we propose PartitionTuner, an operator scheduler for deep-learning compilers that supports multiple heterogeneous PUs including CPUs and NPUs. PartitionTuner can generate an operator-scheduling plan that uses all available PUs simultaneously to minimize overall DNN inference time. Operator scheduling is based on the analysis of DNN architecture and the performance profiles of individual and group operators measured on heterogeneous processing units. By the experiments for seven DNNs, PartitionTuner generates scheduling plans that perform 5.03% better than a static type-based operator-scheduling technique for SqueezeNet. In addition, PartitionTuner outperforms recent profiling-based operator-scheduling techniques for ResNet50, ResNet18, and SqueezeNet by 7.18%, 5.36%, and 2.73%, respectively.

The Construction of Universal Mulitple Processing Unit based on De Bruijn Graph

  • Park, Chun-Myoung;Song, Hong-Bok
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.959-962
    • /
    • 2002
  • This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on De Bruijn Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the De Bruijn graph using properties of graph. Secondly we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU is capable of constructing the De Bruijn geraph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

  • PDF