• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.073 seconds

A Fundamental Study for Creating 3D CG Animation of an Assembly Work

  • Yamanaka, Hiroki;Matsumoto, Toshiyuki;Shinoda, Shinji;Niwa, Akira
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.2
    • /
    • pp.188-195
    • /
    • 2012
  • This paper presents a new mode of expressing a 3D assembly work for creating a 3D CG animation without judgment by human from minimal required information. In the field of manufacturing, there are favorable movements in the utilization of 3D CAD for 3D simulation to shorten lead time for product development and pre-production. But simulating an assembly work has troubles to need huge quantity of manually input data. This paper discusses what minimal necessary information for creating 3D CG animations of assembly works is, focusing on the features of assembly works. Furthermore, a new mode of expressing a 3D assembly work is proposed as "state/change transition diagrams" (SCTD), which express arbitrary scenes in an assembly work as "state" and describe a sequential assembly work with "state" and "change", and the outline of its stepwise generation algorithm is also described. SCTD can be converted to a 3D CG animation of an assembly work without judgment by human. This paper focuses on the creating 3D CG animation of assembly works which workers use only their both hands.

Memory Reduction Method of DIT-based IFFT Bit-Reversal (DIT 기반 IFFT의 Bit-Reversal 메모리 감소 기법)

  • Kim, Jun-Ho;Piao, Zheyan;Cho, Kyung-Ju;Chung, Jin-Gyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.66-73
    • /
    • 2015
  • IFFT is one of the key components in OFDM-based communication systems. In this paper, we propose a new memory efficient IFFT design method for OFDM-based communication systems, based on a mapping of three IFFT input signals which consist of modulated data, pilot and null signals. The proposed method focuses on reducing the memory size in the bit-reversal block which requires the largest number of memory cells in IFFT architectures. To reduce the memory size, we propose a selection mapping method based on decimation-in-time (DIT) algorithm. It is shown that the proposed method achieves a memory reduction of about 50% compared to conventional methods.

Nonlinear Acoustic Echo Suppressor based on Volterra Filter using Least Squares (Least Squares 기반의 Volterra Filter를 이용한 비선형 반향신호 억제기)

  • Park, Jihwan;Lee, Bong-Ki;Chang, Joon-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.12
    • /
    • pp.205-209
    • /
    • 2013
  • A conventional acoustic echo suppressor (AES) considering only room impulse response between a loudspeaker and a microphone eliminates acoustic echo from the microphone input. However, in a nonlinear acoustic echo environment, the conventional AES degraded because of a nonlinearity of the loudspeaker. In this paper, we adopt AES based on the frequency-domain second-order Volterra filter using Least Square method. For comparing performances, we conduct objective tests including Echo Return Loss Enhancement (ERLE) and Speech Attenuation (SA). The proposed algorithm shows better performance than the conventional in both linear and nonlinear acoustic echo environments.

A Custom Code Generation Technique for ASIPs from High-level Language (고급 언어에서 ASIP을 위한 전용 부호 생성 기술 연구)

  • Alam, S.M. Shamsul;Choi, Goangseog
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.31-43
    • /
    • 2015
  • In this paper, we discuss a code generation technique for custom transport triggered architecture (TTA) from a high-level language structure. This methodology is implemented by using TTA-based Co-design Environment (TCE) tool. The results show how the scheduler exploits instruction level parallelism in the custom target architecture and source program. Thus, the scheduler generates parallel TTA instructions using lower cycle counts than the sequential scheduling algorithm. Moreover, we take Tensilica tool to make a comparison with TCE. Because of the efficiency of TTA, TCE takes less execution cycles compared to Tensilica configurations. Finally, this paper shows that it requires only 7 cycles to generate the parallel TTA instruction set for implementing Cyclic Redundancy Check (CRC) applications as an input design, and presents the code generation technique to move complexity from the processor software to hardware architecture. This method can be applicable lots of channel Codecs like CRC and source Codecs like High Efficiency Video Coding (HEVC).

Texture-based Hatching for Color Image and Video

  • Yang, Hee-Kyung;Min, Kyung-Ha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.763-781
    • /
    • 2011
  • We present a texture-based hatching technique for color images and video. Whereas existing approaches produce monochrome hatching effects in considering of triangular mesh models by applying strokes of uniform size, our scheme produces color hatching effects from photographs and video using strokes with a range of sizes. We use a Delaunay triangulation to create a mesh of triangles with sizes that reflect the structure of an input image. At each vertex of this triangulation, the flow of the image is analyzed and a hatching texture is then created with the same alignment, based on real pencil strokes. This texture is given a modified version of a color sampled from the image, and then it is used to fill all the triangles adjoining the vertex. The three hatching textures that accumulate in each triangle are averaged and the result of this process across all the triangles forms the output image. We can also add a paper texture effect and enhance feature lines in the image. Our algorithm can also be applied to video. The results are visually pleasing hatching effects similar to those seen in color pencil drawings and oil paintings.

Iterative Channel Estimation for MIMO-OFDM System in Fast Time-Varying Channels

  • Yang, Lihua;Yang, Longxiang;Liang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4240-4258
    • /
    • 2016
  • A practical iterative channel estimation technique is proposed for the multiple-input-multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system in the high-speed mobile environment, such as high speed railway scenario. In the iterative algorithm, the Kalman filter and data detection are jointed to estimate the time-varying channel, where the detection error is considered as part of the noise in the Kalman recursion in each iteration to reduce the effect of the detection error propagation. Moreover, the employed Kalman filter is from the canonical state space model, which does not include the parameters of the autoregressive (AR) model, so the proposed method does not need to estimate the parameters of AR model, whose accuracy affects the convergence speed. Simulation results show that the proposed method is robust to the fast time-varying channel, and it can obtain more gains compared with the available methods.

Classification of Premature Ventricular Contraction using Error Back-Propagation

  • Jeon, Eunkwang;Jung, Bong-Keun;Nam, Yunyoung;Lee, HwaMin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.988-1001
    • /
    • 2018
  • Arrhythmia has recently emerged as one of the major causes of death in Koreans. Premature Ventricular Contraction (PVC) is the most common arrhythmia that can be found in clinical practice, and it may be a precursor to dangerous arrhythmias, such as paroxysmal insomnia, ventricular fibrillation, and coronary artery disease. Therefore, we need for a method that can detect an abnormal heart beat and diagnose arrhythmia early. We extracted the features corresponding to the QRS pattern from the subject's ECG signal and classify the premature ventricular contraction waveform using the features. We modified the weighting and bias values based on the error back-propagation algorithm through learning data. We classify the normal signal and the premature ventricular contraction signal through the modified weights and deflection values. MIT-BIH arrhythmia data sets were used for performance tests. We used RR interval, QS interval, QR amplitude and RS amplitude features. And the hidden layer with two nodes is composed of two layers to form a total three layers (input layer 0, output layer 3).

Parallel Bayesian Network Learning For Inferring Gene Regulatory Networks

  • Kim, Young-Hoon;Lee, Do-Heon
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.202-205
    • /
    • 2005
  • Cell phenotypes are determined by the concerted activity of thousands of genes and their products. This activity is coordinated by a complex network that regulates the expression of genes. Understanding this organization is crucial to elucidate cellular activities, and many researches have tried to construct gene regulatory networks from mRNA expression data which are nowadays the most available and have a lot of information for cellular processes. Several computational tools, such as Boolean network, Qualitative network, Bayesian network, and so on, have been applied to infer these networks. Among them, Bayesian networks that we chose as the inference tool have been often used in this field recently due to their well-established theoretical foundation and statistical robustness. However, the relative insufficiency of experiments with respect to the number of genes leads to many false positive inferences. To alleviate this problem, we had developed the algorithm of MONET(MOdularized NETwork learning), which is a new method for inferring modularized gene networks by utilizing two complementary sources of information: biological annotations and gene expression. Afterward, we have packaged and improved MONET by combining dispersed functional blocks, extending species which can be inputted in this system, reducing the time complexities by improving algorithms, and simplifying input/output formats and parameters so that it can be utilized in actual fields. In this paper, we present the architecture of MONET system that we have improved.

  • PDF

A study on Moving OBstacle Avoidance for an Intelligent Vehicle Using Fuzzy Controller (퍼지 제어기를 이용한 지능형 차량의 이동장애물 회피에 관한 연구)

  • Kim, Hun-Mo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.2
    • /
    • pp.155-163
    • /
    • 2000
  • This paper presents a path planning method of the sensor based intelligent vehicle using fuzzy logic controller for avoidance of moving obstacles in unknown environments. Generally it is too difficult and complicated to control intelligent vehicle properly by recognizing unknown terrain with sensors because the great amount of imprecise and ambiguous information has to be considered. In this respect a fuzzy logic can manage such the enormous information in a quite efficient manner. Furthermore it is necessary to use the relative velocity to consider the mobility of obstacles, In order to avoid moving obstacles we must deliberate not only vehicle's relative speed toward obstacles but also self-determined acceleration and steering for the satisfaction of avoidance efficiency. In this study all the primary factors mentioned before are used as the input elements of fuzzy controllers and output signals to control velocity and steering angle of the vehicle. The main purpose of this study is to develop fuzzy controllers for avoiding collision with moving obstacles when they approach the vehicle travelling with straight line and for returning to original trajectory. The ability are and effectiveness of the proposed algorithm are demonstrated by simulations and experiments.

  • PDF

Theory Refinements in Knowledge-based Artificial Neural Networks by Adding Hidden Nodes (지식기반신경망에서 은닉노드삽입을 이용한 영역이론정련화)

  • Sim, Dong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1773-1780
    • /
    • 1996
  • KBANN (knowledge-based artificial neural network) combining the symbolic approach and the numerical approach has been shown to be more effective than other machine learning models. However KBANN doesn't have the theory refinement ability because the topology of network can't be altered dynamically. Although TopGen was proposed to extend the ability of KABNN in this respect, it also had some defects due to the link-ing of hidden nodes to input nodes and the use of beam search. The algorithm which could solve this TopGen's defects, by adding the hidden nodes linked to next layer nodes and using hill-climbing search with backtracking, is designed.

  • PDF