• 제목/요약/키워드: Processing step

검색결과 1,686건 처리시간 0.032초

동적 배경에서의 고밀도 광류 기반 이동 객체 검출 (Dense Optical flow based Moving Object Detection at Dynamic Scenes)

  • 임효진;최연규;구엔 칵 쿵;정호열
    • 대한임베디드공학회논문지
    • /
    • 제11권5호
    • /
    • pp.277-285
    • /
    • 2016
  • Moving object detection system has been an emerging research field in various advanced driver assistance systems (ADAS) and surveillance system. In this paper, we propose two optical flow based moving object detection methods at dynamic scenes. Both proposed methods consist of three successive steps; pre-processing, foreground segmentation, and post-processing steps. Two proposed methods have the same pre-processing and post-processing steps, but different foreground segmentation step. Pre-processing calculates mainly optical flow map of which each pixel has the amplitude of motion vector. Dense optical flows are estimated by using Farneback technique, and the amplitude of the motion normalized into the range from 0 to 255 is assigned to each pixel of optical flow map. In the foreground segmentation step, moving object and background are classified by using the optical flow map. Here, we proposed two algorithms. One is Gaussian mixture model (GMM) based background subtraction, which is applied on optical map. Another is adaptive thresholding based foreground segmentation, which classifies each pixel into object and background by updating threshold value column by column. Through the simulations, we show that both optical flow based methods can achieve good enough object detection performances in dynamic scenes.

Criteria for processing response-spectrum-compatible seismic accelerations simulated via spectral representation

  • Zerva, A.;Morikawa, H.;Sawada, S.
    • Earthquakes and Structures
    • /
    • 제3권3_4호
    • /
    • pp.341-363
    • /
    • 2012
  • The spectral representation method is a quick and versatile tool for the generation of spatially variable, response-spectrum-compatible simulations to be used in the nonlinear seismic response evaluation of extended structures, such as bridges. However, just as recorded data, these simulated accelerations require processing, but, unlike recorded data, the reasons for their processing are purely numerical. Hence, the criteria for the processing of acceleration simulations need to be tied to the effect of processing on the structural response. This paper presents a framework for processing acceleration simulations that is based on seismological approaches for processing recorded data, but establishes the corner frequency of the high-pass filter by minimizing the effect of processing on the response of the structural system, for the response evaluation of which the ground motions were generated. The proposed two-step criterion selects the filter corner frequency by considering both the dynamic and the pseudo-static response of the systems. First, it ensures that the linear/nonlinear dynamic structural response induced by the processed simulations captures the characteristics of the system's dynamic response caused by the unprocessed simulations, the frequency content of which is fully compatible with the target response spectrum. Second, it examines the adequacy of the selected estimate for the filter corner frequency by evaluating the pseudo-static response of the system subjected to spatially variable excitations. It is noted that the first step of this two-fold criterion suffices for the establishment of the corner frequency for the processing of acceleration time series generated at a single ground-surface location to be used in the seismic response evaluation of, e.g. a building structure. Furthermore, the concept also applies for the processing of acceleration time series generated by means of any approach that does not provide physical considerations for the selection of the corner frequency of the high-pass filter.

Solving the Discrete Logarithm Problem for Ephemeral Keys in Chang and Chang Password Key Exchange Protocol

  • Padmavathy, R.;Bhagvati, Chakravarthy
    • Journal of Information Processing Systems
    • /
    • 제6권3호
    • /
    • pp.335-346
    • /
    • 2010
  • The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field $Z^*_p of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the precomputed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed precomputation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.

단일 복구조정활동 하에 단계적 퇴화를 가지는 단일기계 생산일정계획 (Single Machine Scheduling Problem with Step-deterioration under A Rate-modifying Activity)

  • 김병수
    • 산업경영시스템학회지
    • /
    • 제37권3호
    • /
    • pp.43-50
    • /
    • 2014
  • In this paper, we deal with a single machine scheduling problems integrating with step deterioration effect and a rate-modifying activity (RMA). The scheduling problem assumes that the machine may have a single RMA and each job has the processing time of a job with deterioration is a step function of the gap between recent RMA and starting time of the job and a deteriorating date that is individual to all jobs. Based on the two scheduling phenomena, we simultaneously determine the schedule of step deteriorating jobs and the position of the RMA to minimize the makespan. To solve the problem, we propose a hybrid typed genetic algorithm compared with conventional GAs.

LED Encapsulation 실리콘의 기포잔류방지를 위한 Step 경화공정 연구 (A multi Step Cure Process to Prevent Residual Bubbles in LED Encapsulation Silicone Resin)

  • 송민재;김흥규;윤길상;김권희
    • 소성∙가공
    • /
    • 제21권2호
    • /
    • pp.101-106
    • /
    • 2012
  • Generally, rapid cure reaction of LED encapsulation silicone resin causes serious defects in cured resin products such as warpage, residual bubbles, and reduced wettablility. In order to prevent residual bubbles in silicone resin, the step cure process was examined in the present paper. Three kinds of step cure processes were applied, and bubble-free phenomenon was observed. Most of the bubbles were removed under $70^{\circ}C$, the minimum temperature for activating cure reaction. In addition, degree of cure(DOC) and temperature distribution were predicted by using FEM analysis of heat transfer. It was concluded that maintaining cure temperature which provide a DOC under 0.5~0.6 effectively reduces residual bubbles.

Two-Step Eulerian 기법에 기반 한 충돌 해석의 병렬처리 및 병렬효율 평가 (Parallel Procedure and Evaluation of Parallel Performance of Impact Simulation Based on Two-Step Eulerian Scheme)

  • 김승조;이민형;백승훈
    • 대한기계학회논문집A
    • /
    • 제30권10호
    • /
    • pp.1320-1327
    • /
    • 2006
  • Parallel procedure and performance of two-step Eulerian code have not been reported sufficiently yet even though it was developed and utilized widely in the impact simulation. In this study, parallel strategy of two-step Eulerian code was proposed and described in detail. The performance was evaluated in the self-made linux cluster computer. Compared with commercial code, a relatively good performance is achieved. Through the performance evaluation of each computation stage, remap is turned out to be the most time consuming part among the other part such as FE processing, communication, time marching etc.

STEP을 이용한 유한요소해석 정보모델 구축 (Information Modeling for Finite Element Analysis Using STEP)

  • 최영;조성욱;권기억
    • 한국CDE학회논문집
    • /
    • 제3권1호
    • /
    • pp.48-56
    • /
    • 1998
  • Finite element analysis is very important in the design and analysis of mechanical engineering. The process of FEA encompasses shape modeling, mesh generation, matrix solving and post-processing. Some of these processes can be tightly integrated with the current software architectures and data sharing mode. However, complete integration of all the FEA process itself and the integration to the manufacturing processes is almost impossible in the current practice. The barriers to this problem are inconsistent data format and the enterprise-wise software integration technology. In this research, the information model based on STEP AP209 was chosen for handling finite element analysis data. The international standard for the FEA data can bridge the gap between design, analysis and manufacturing processes. The STEP-based FEA system can be further tightly integrated to the distributed software and database environment using CORBA technology. The prototype FEA system DICESS is implemented to verify the proposed concepts.

  • PDF

가변환경에 적합한 새로운 가변 적응 계수에 관한 연구 (New variable adaptive coefficient algorithm for variable circumstances)

  • 오신범;이채욱
    • 한국산업정보학회논문지
    • /
    • 제4권3호
    • /
    • pp.79-88
    • /
    • 1999
  • 적응 신호처리 분야에서 LMS(Least Mean Square)알고리즘은 그 식의 간편함과 구현의 용이함으로 가장 널리 이용되고 있다. 대부분의 LMS 알고리즘은 수렴비를 조절하는 적응계수를 일정한 값으로 정하는데, 이는 안전성과 속도사이에서 트레이드오프가 존재한다. 이러한 단점을 해결하고 성능을 개선하기 위하여 가변 LMS(VLMS: Variable LMS)가 발표되었다. 그러나 기존에 발표된 알고리즘들은 급격한 환경변화에 적응하지 못하고 발산하는 경우도 있으며 수렴속도에 문제가 있다. 본 논문에서는 기존의 적응계수의 특성을 일부 변형시킴으로서 계산량을 줄이고, 급격한 환경변화에서도 수렴하도록 하는 새로운 알고리즘을 제안하였다. 제안한 적응계수의 성능 확인을 위하여 시스템 식별 및 잡음 제거 시스템에 적용하여 기존의 알고리즘들과 비교하였다.

  • PDF

자동화 항만에서의 게이트 구조물 및 최적 운영방식 설계 (Optimized design for gate complex and operation method of automated port)

  • 홍동희;정태충
    • 정보처리학회논문지A
    • /
    • 제10A권5호
    • /
    • pp.513-518
    • /
    • 2003
  • 세계항만의 컨테이너 물동량은 2011년까지 연평균 8.8%로 꾸준히 증가할 것으로 예상하고 잇으며, 기존 항만 시설로는 이러한 추세를 충족시키 수 없기 때문에 시설 확충은 필연적이다. 그리고 항만에서 발생되는 비용이 전체 물동량에 발생되는 비용의 30%를 차지하고 있기 때문에 세계 주요항만에서는 점차 높아지는 인건비와 부족한 노동력 문제를 해결하고 토지 이용과 작업 능률을 극대화하기 위한 항만 시설의 자동화에 노력을 기울이고 있다. 특히, 항만시설 중에서도 화물이 발생되고 소멸되는 장소로서 정보의 시작점과 종착점이 되는 게이트의 자동화가 무엇보다도 중요한 이슈로 대두되고 있다. 본 연구에서는 항마의 게이트를 최적으로 자동화하는데 적합한 설계 방안을 제시하고자 한다. 먼저 게이트의 적정 규모를 산정하고, 1단계 게이트와 2단계 게이트 운영방식을 비교하며, 최적의 게이트 자동화 운영 방식을 설계한다.

GO언어를 이용한 대용량 데이터 리스트의 동시성 처리 비교 (Concurrency processing comparison of large data list using GO language)

  • 이요셉;임영환
    • 문화기술의 융합
    • /
    • 제8권2호
    • /
    • pp.361-366
    • /
    • 2022
  • 대용량 데이터를 처리 하는 방식은 여러 가지가 있다. 처리 방법에 따라서 대용량 데이터 리스트를 만드는데 처리속도가 많은 차이를 두고 있다. 대표적으로 대용량 데이터 리스트를 만들기 위해서 대용량 데이터를 정규화 된 쿼리로 만들고 만들어 낸 쿼리의 결과를 List Map 담아두고 출력 가능한 형태로 변환 한다. 이러한 과정은 단계별로 처리 속도가 저하되는 원인으로 발생된다. 만들어 낸 쿼리의 결과를 List Map으로 담는 과정에서 데이터의 형태별로 저장되는 형식 다르기 때문에 처리속도의 차이가 나타난다. GO언의 동시성 처리를 통해서 기존에 처리속도의 차이가 발생되던 문제를 해결하고자 한다. 즉 GO언의 동시성 처리 결과가 기존의 List Map에 담는 형식과 동시성을 사용하여 처리하는 방식의 대용량 데이터 리스트 처리 방식이 얼마나 차이가 나고 어떠한 방식으로 진행되는지를 제공하여 보다 빠른 처리를 할 수 있도록 비교 한다.