• Title/Summary/Keyword: time scale

Search Result 8,025, Processing Time 0.033 seconds

An Approximation of Gaussian Pyramid Top Layer for Simplification of Image Pyramid-based Multi Scale Exposure Fusion Algorithm (이미지 피라미드 기반의 다중 노출 영상 융합기법 단순화를 위한 가우시안 피라미드 최상층 근사화)

  • Hwang, Tae Hun;Kim, Jin Heon
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.10
    • /
    • pp.1160-1167
    • /
    • 2019
  • Because of the dynamic range limitation of digital equipment, it is impossible to obtain dark and bright areas at the same time with one shot. In order to solve this problem, an exposure fusion technique for fusing a plurality of images photographed at different exposure amounts into one is being studied. Among them, Laplacian pyramid decomposition based fusion method can generate natural HDR image by fusing images of various scales. But this requires a lot of computation time. Therefore, in this paper, we propose an approximation technique that achieves similar performance and greatly shortens computation time. The concept of vanishing point image for approximation is introduced, and the validity of the proposed approach is verified by comparing the computation time with the resultant image.

SwiftQ: A Time-Efficient RFID Collision Arbitration Algorithm for Gen2-Based RFID Systems

  • Donghwan Lee;Wonjun Lee
    • Journal of Information Processing Systems
    • /
    • v.20 no.3
    • /
    • pp.307-316
    • /
    • 2024
  • In the realm of large-scale identification deployments, the EPCglobal Class-1 Generation-2 (Gen2) standard serves as a cornerstone, facilitating rapid processing of numerous passive RFID tags. The Q-Algorithm has garnered considerable attention for its potential to markedly enhance the efficiency of Gen2-based RFID systems with minimal adjustments. This paper introduces a groundbreaking iteration of the Q-Algorithm, termed Time-Efficient Q-Algorithm (SwiftQ), specifically designed to push the boundaries of time efficiency within Gen2-based RFID systems. Through exhaustive simulations, our study substantiates that SwiftQ outperforms existing algorithms by a significant margin, demonstrating exceptional expediency that positions it as a formidable contender in the landscape of large-scale identification environments. By prioritizing time efficiency, SwiftQ offers a promising solution to meet the escalating demands of contemporary Internet of Things applications, underscoring its potential to catalyze advancements in RFID technology for diverse industrial and logistical contexts.

Optimal Control of Large-Scale Dynamic Systems using Parallel Processing (병렬처리를 이용한 대규모 동적 시스템의 최적제어)

  • Park, Ki-Hong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.4
    • /
    • pp.403-410
    • /
    • 1999
  • In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

  • PDF

Development of a measuring device for scale accuracy of measuring tapes (줄자눈금정밀도 측정장치 개발에 관한 연구)

  • 이종원;김희식;유형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10a
    • /
    • pp.380-384
    • /
    • 1988
  • An optical device, named "T-MES", to measure the accuracy of printed scale of measuring tapes was developed. It has 11 optical sensors, that are exactly positioned every 100 mm on the 1 m frame. The sensors detect the beginning of the printed part and generate the puleses. The time difference between each signal pulse and the first sensor signal pulse is proportional to the error of printed scale. The measured data are trasmitted through a IEEE-488 interface to a IBM-AT computer and analyzed. The analysis software continuously displays the measured result on the CRT.n the CRT.

  • PDF

ATM Traffic Analysis: Burst Scale Probability Function

  • Kemelmacher, E.Rozenshine
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.876-879
    • /
    • 2002
  • The paper presents the analysis and results of traffic measurements in the 155 Mbit/s real working ATM backbone network. The traffic is described as an ordered sequence of real-time cells. In this paper we analyze two timescales in which some form of a stochastic process is taking place: cell scale and burst scale. We present another way to describe the cell flow in ATM networks by definition the function, designed to be the probability of the burst of length ∫in n sequential slots.

  • PDF

Noninformative Priors for the Common Scale Parameter in the Inverse Gaussian Distributions

  • Kang, Sang-Gil
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.981-992
    • /
    • 2004
  • In this paper, we develop the noninformative priors for the common scale parameter in the inverse gaussian distributions. We developed the first and second order matching priors. Next we revealed that the second order matching prior satisfies a HPD matching criterion. Also we showed that the second order matching prior matches alternative coverage probabilities up to the second order. It turns out that the one-at-a-time reference prior satisfies a second order matching criterion. Some simulation study is performed.

  • PDF

Optimal output feedback design for discrete large scale systems with two time-scale separation properties

  • Jin, Jong-Sam;Kim, Soo-Joong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10b
    • /
    • pp.203-208
    • /
    • 1987
  • Design problem of output feedback controllers for discrete large scale systems using simplified model is investigated. It is shown that neglecting fast modes does not generally guarantee the stability of the closed loop system. In this paper, the design procedure is proposed to stabilize the system by minimizing a quadratic cost function for the simplified model and a measure of stability for the neglected fast model.

  • PDF

Development of Large Scale Programmable Controller : Part I(H/W) (대형 프로그래머블 콘트롤러의 개발 1)

  • 권욱현;김종일;김덕우;정범진;홍진우
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10b
    • /
    • pp.407-412
    • /
    • 1987
  • A large scale programmable controller is developed which adopts a multiprocessor structure. The developed programmable controller consists of the programmer, the system controller, and the input-output unit. The structure and characteristics of the system controller will be described. The PC has a special hardware scheme to solve the Boolean logic instructions of the sequence control programs. The multiprocessor structure and the special hardware enables, the real time operation and the high speed scanning which is prerequisite to the large scale, programmable controller even for many I/O points.

  • PDF

The small scale Voice Dialing System using TMS320C30 (TMS320C30을 이용한 소규모 Voice Dialing 시스템)

  • 이항섭
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1991.06a
    • /
    • pp.58-63
    • /
    • 1991
  • This paper describes development of small scale voice dialing system using TMS320C30. Recognition vocabuliary is used 50 department name within university. In vocabulary below the middle scale, word unit recognition is more practice than phoneme unit or syllable unit recognition. In this paper, we performend recognition and model generation using DMS(Dynamic Multi-Section) and implemeted voice dialing system using TMS320C30. As a result of recognition, we achieved a 98% recognition rate in condition of section 22 and weight 0.6 and recognition time took 4 seconds.

  • PDF

Search for optimal time delays in universal learning network

  • Han, Min;Hirasawa, Kotaro;Ohbayashi, Masanao;Fujita, Hirofumi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.95-98
    • /
    • 1996
  • Universal Learning Network(U.L.N.), which can model and control the large scale complicated systems naturally, consists of nonlinearly operated nodes and multi-branches that may have arbitrary time delays including zero or minus ones. Therefore, U.L.N. can be applied to many kinds of systems which are difficult to be expressed by ordinary first order difference equations with one sampling time delay. It has been already reported that learning algorithm of parameter variables in U.L.N. by forward and backward propagation is useful for modeling, managing and controlling of the large scale complicated systems such as industrial plants, economic, social and life phenomena. But, in the previous learning algorithm of U.L.N., time delays between the nodes were fixed, in other words, criterion function of U.L.N. was improved by adjusting only parameter variables. In this paper, a new learning algorithm is proposed, where not only parameter variables but also time delays between the nodes can be adjusted. Because time delays are integral numbers, adjustment of time delays can be carried out by a kind of random search procedure which executes intensified and diversified search in a single framework.

  • PDF