• Title/Summary/Keyword: synthesis algorithm

Search Result 669, Processing Time 0.029 seconds

Adaptive Sliding Mode Control Synthesis of Maritime Autonomous Surface Ship

  • Lee, Sang-Do;Xu, Xiao;Kim, Hwan-Seong;You, Sam-Sang
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.3
    • /
    • pp.306-312
    • /
    • 2019
  • This paper investigates to design a controller for maritime autonomous surface ship (MASS) by means of adaptive super-twisting algorithm (ASTA). A input-out feedback linearization method is considered for multi-input multi-output (MIMO) system. Sliding Mode Controller (SMC) is suitable for MASS subject to ocean environments due to its robustness against parameter uncertainties and disturbances. However, conventional SMC has inherent disadvantages so-called, chattering phenomenon, which resulted from the high frequency of switching terms. Chattering may cause harmful failure of actuators such as propeller and rudder of ships. The main contribution of this work is to address an appropriate controller for MASS, simultaneously controls surge and yaw motion in severe step inputs. Proposed control mechanism well provides convergence bewildered by external disturbances in the middle of steady-state responses as well as chattering attenuation. Also, the adaptive algorithm is contributed to reducing non-overestimated value of control gains. Control inputs of surge and yaw motion are displayed by smoother curves without excessive control activities of actuators. Finally, no overshoot can be seen in transient responses.

Synthesizing Imperative Programs from Examples (예제로부터 명령형 프로그램을 합성하는 방법)

  • So, Sunbeom;Choi, Tae-Hyoung;Jung, Jun;Oh, Hakjoo
    • Journal of KIISE
    • /
    • v.44 no.9
    • /
    • pp.986-991
    • /
    • 2017
  • In this paper, we present a method for synthesizing imperative programs from input-output examples. Given (1) a set of input-output examples, (2) an incomplete program, and (3) variables and integer constants to be used, the synthesizer outputs a complete program that satisfies all of the given examples. The basic synthesis algorithm enumerates all possible candidate programs until the solution program is found (enumerative search). However, it is too slow for practical use due to the huge search space. To accelerate the search speed, our approach uses code optimization and avoids unnecessary search for the programs that are syntactically different but semantically equivalent. We have evaluated our synthesis algorithm on 20 introductory programming problems, and the results show that our method improves the speed of the basic algorithm by 10x on average.

Design and Implementation of Multiple View Image Synthesis Scheme based on RAM Disk for Real-Time 3D Browsing System (실시간 3D 브라우징 시스템을 위한 램 디스크 기반의 다시점 영상 합성 기법의 설계 및 구현)

  • Sim, Chun-Bo;Lim, Eun-Cheon
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.5
    • /
    • pp.13-23
    • /
    • 2009
  • One of the main purpose of multiple-view image processing technology is support realistic 3D image to device user by using multiple viewpoint display devices and compressed data restoration devices. This paper proposes a multiple view image synthesis scheme based on RAM disk which makes possible to browse 3D images generated by applying effective composing method to real time input stereo images. The proposed scheme first converts input images to binary image. We applies edge detection algorithm such as Sobel algorithm and Prewiit algorithm to find edges used to evaluate disparities from images of 4 multi-cameras. In addition, we make use of time interval between hardware trigger and software trigger to solve the synchronization problem which has stated ambiguously in related studies. We use a unique identifier on each snapshot of images for distributed environment. With respect of performance results, the proposed scheme takes 0.67 sec in each binary array. to transfer entire images which contains left and right side with disparity information for high quality 3D image browsing. We conclude that the proposed scheme is suitable for real time 3D applications.

Factored MLLR Adaptation for HMM-Based Speech Synthesis in Naval-IT Fusion Technology (인자화된 최대 공산선형회귀 적응기법을 적용한 해양IT융합기술을 위한 HMM기반 음성합성 시스템)

  • Sung, June Sig;Hong, Doo Hwa;Jeong, Min A;Lee, Yeonwoo;Lee, Seong Ro;Kim, Nam Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.213-218
    • /
    • 2013
  • One of the most popular approaches to parameter adaptation in hidden Markov model (HMM) based systems is the maximum likelihood linear regression (MLLR) technique. In our previous study, we proposed factored MLLR (FMLLR) where each MLLR parameter is defined as a function of a control vector. We presented a method to train the FMLLR parameters based on a general framework of the expectation-maximization (EM) algorithm. Using the proposed algorithm, supplementary information which cannot be included in the models is effectively reflected in the adaptation process. In this paper, we apply the FMLLR algorithm to a pitch sequence as well as spectrum parameters. In a series of experiments on artificial generation of expressive speech, we evaluate the performance of the FMLLR technique and also compare with other approaches to parameter adaptation in HMM-based speech synthesis.

Hole-filling Algorithm Based on Extrapolating Spatial-Temporal Background Information for View Synthesis in Free Viewpoint Television (자유 시점 TV에서 시점 합성을 위한 시공간적 배경 정보 추정 기반 홀 채움 방식)

  • Kim, Beomsu;Nguyen, Tien-Dat;Hong, Min-cheol
    • Journal of IKEEE
    • /
    • v.20 no.1
    • /
    • pp.31-44
    • /
    • 2016
  • This paper presents a hole-filling algorithm based on extrapolating spatial-temporal background information used in view synthesis for free-viewpoint television. A new background codebook is constructed and updated in order to extract reliable temporal background information. In addition, an estimation of spatial local background values is conducted to discriminate an adaptive boundary between the background region and the foreground region as well as to update the information about the hole region. The holes then are filled by combining the spatial background information and the temporal background information. In addition, an exemplar-based inpainting technique is used to fill the rest of holes, in which a priority function using background-depth information is defined to determine the order in which the holes are filled. The experimental results demonstrated that the proposed algorithm outperformed the other comparative methods about average 0.3-0.6 dB, and that it synthesized satisfactory views regardless of video characteristics and type of hole region.

The study of sound source synthesis IC to realize the virtual engine sound of a car powered by electricity without an engine (엔진 없이 전기로 구동되는 자동차의 가상 엔진 음 구현을 위한 음원합성 IC에 관한 연구)

  • Koo, Jae-Eul;Hong, Jae-Gyu;Song, Young-Woog;Lee, Gi-Chang
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.6
    • /
    • pp.571-577
    • /
    • 2021
  • This study is a study on System On Chip (SOC) that implements virtual engine sound in electric vehicles without engines, and realizes vivid engine sound by combining Adaptive Difference PCM (ADPCM) method and frequency modulation method for satisfaction of driver's needs and safety of pedestrians. In addition, by proposing an electronic sound synthesis algorithm applying Musical Instrument Didital Interface (MIDI), an engine sound synthesis method and a constitutive model of an engine sound generation system are presented. In order to satisfy both drivers and pedestrians, this study uses Controller Area Network (CAN) communication to receive information such as Revolution Per Minute (RPM), vehicle speed, accelerator pedal depressed amount, torque, etc., transmitted according to the driver's driving habits, and then modulates the frequency according to the appropriate preset parameters We implemented an interaction algorithm that accurately reflects the intention of the system and driver by using interpolation for the system, ADPCM algorithm for reducing the amount of information, and MIDI format information for making engine sound easier.

Optimal field synthesis for enhancing the modeling capabilities of reservoir/aquifer fields

  • Jang, Min-Chul;Choe, Jong-Geun
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2003.11a
    • /
    • pp.684-689
    • /
    • 2003
  • One field identified by an inverse method is one of multiple candidate solutions those are independently obtained through a specific estimation technique. While averaging of optimized fields can provide a better description of the spatial feature of an unknown field, it deteriorates the flow and transport characteristics of the optimized fields. As a result, the averaged field is not suited for modeling aquifer performances. Based on genetic algorithm, an optimal field synthesis technique is developed, which combines diversely optimized fields into a refined group of fields. Each field in the population is paired, and a sub-region of each field is exchanged by crossover operation to create a group of synthesized fields of enhanced modeling capability. The population of the fields is evolved till the synthesized fields become sufficiently similar. Applications of the optimal field synthesis to synthetic cases indicate that the objective functions of the fields assessing the modeling capabilities are further reduced after the optimal field synthesis. The identified fields from various inverse techniques may yield a range of modeling results under varied flow situations. The uncertainty is narrowed down through the optimal field synthesis and the associated modeling results converge on that of the reference field. The developed inverse modeling facilitates the construction of a reliable simulation model and hence trustworthy predictions of the future performances.

  • PDF

A scheduling algorithm for conditonal resources sharing consideration (조건부 자원 공유를 고려한 스케쥴링 알고리즘)

  • 인지호;정정화
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.2
    • /
    • pp.196-204
    • /
    • 1996
  • This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

  • PDF

A new template matching algorithm and its ASIC chip implementation (Template matching을 위한 새로운 알고리즘 및 ASIC 칩 구현)

  • 서승완;선우명훈
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.1
    • /
    • pp.15-24
    • /
    • 1998
  • This paper proposes a new template matching algorithm and its chip design. The CC and SAD algorithms require the massive amount of computation. Hence, several algorithms using quantization schemes have been proposed to reduce the amount of computation and its hardware cost. the proposed algorithm called the EMPPM improves at least 22% of the noise margin compared with the MPPM algorithm. In addition, the proposed architecture can reduce the gate count by more than 60% of that used in the SAD algorithm without usig quantization schemes and 28% of the MPPM algorithm. The VHDL models have been simulated by using the CADANCETEX>$^{TM}$ and logic synthesis has been performed by using the SYNOPSYSTEX>$^{TM}$ with $0.6\mu\textrm{m}$ SOG(sea-of-gate) cell library. The implemented chip consists of 35,829 gates, operates at 100 MHz (worst case 53 MHz) and performs the template maching with the speed of 200 Mpixels/sec.

  • PDF

A Study on Adaptive Algorithm Based on Wavelet Transform for Adaptive Noise Canceler Improvement (적응잡음제거기의 성능향상을 위한 웨이브렛 기반 적응알고리즘에 관한 연구)

  • 이채욱;김도형;오신범
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.2
    • /
    • pp.68-73
    • /
    • 2002
  • Many paper about the adaptive algorithm based to LS(Least Square) to improve convergence speed are already presented. In this paper, we propose a wavelet based adaptive algorithm which improves the convergence speed and reduces computational complexity, and adapt two kinds of adaptive noise cancelers using the characteristic of speech signal. We compared the performance of the nosed algorithm with time and frequency domain adaptive algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result the proposed algorithm is suitable for adaptive signal processing area using speech or acoustic signal.

  • PDF