• Title/Summary/Keyword: initialization process

Search Result 76, Processing Time 0.021 seconds

Analysis of Weight Distribution of Feedforward Two-Layer Neural Networks and its Application to Weight Initialization (순방향 2층 신경망의 연결강도 분포 특성 분석 및 연결강도 초기화에 적용)

  • Go, Jin-Wook;Park, Mig-Non;Hong, Dae-Sik;Lee, Chul-Hee
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.3
    • /
    • pp.1-12
    • /
    • 2001
  • In this paper, we investigate and analyze weight distribution of feed forward two-layer neural networks with a hidden layer in order to understand and improve time-consuming training process of neural networks. Generally, when a new problem is presented, neural networks have to be trained again without any benefit from the previous training process. In order to address this problem, training process is viewed as finding a solution point in the weight space and the distribution of solution points is analyzed. Then we propose to initialize neural networks using the information of the distribution of the solution points. Experimental results show that the proposed initialization using the weight distribution provides a better performance than the conventional one.

  • PDF

Side scan sonar image super-resolution using an improved initialization structure (향상된 초기화 구조를 이용한 측면주사소나 영상 초해상도 영상복원)

  • Lee, Junyeop;Ku, Bon-hwa;Kim, Wan-Jin;Ko, Hanseok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.2
    • /
    • pp.121-129
    • /
    • 2021
  • This paper deals with a super-resolution that improves the resolution of side scan sonar images using learning-based compressive sensing. Learning-based compressive sensing combined with deep learning and compressive sensing takes a structure of a feed-forward network and parameters are set automatically through learning. In particular, we propose a method that can effectively extract additional information required in the super-resolution process through various initialization methods. Representative experimental results show that the proposed method provides improved performance in terms of Peak Signal-to-Noise Ratio (PSNR) and Structure Similarity Index Measure (SSIM) than conventional methods.

A SNR Estimation Algorithm for Digital Satellite Transponder (디지털 위성트랜스폰더를 위한 SNR 추정 알고리즘)

  • Seo, Kwang-Nam;Choi, Seung-Woon;Kim, Chong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9C
    • /
    • pp.729-734
    • /
    • 2010
  • In the initial stage of the communications between a base station and a satellite transponder, the base station transmits the frequency-sweeping un-modulated up-link carrier within a certain frequency range to acquire the doppler frequency shift and signal power between the base station and the satellite in orbital flight. The satellite transponder acquires and tracks the carrier in order to initialize the communication. To control such initialization process, the satellite receiver should analyze the input carrier signal in various ways. This paper presents an SNR estimation algorithm to control the initialization process. The proposed algorithm converts the input signal into the baseband polar coordinate representation and estimates the SNR via the statistics of the angular signal components as well as the status parameters to control the receiver. The Monte-Carlo simulations shows the validity of the estimation proposed.

Research on User Data Leakage Prevention through Memory Initialization (메모리 초기화를 이용한 사용자 데이터 유출 방지에 관한 연구)

  • Yang, Dae-Yeop;Chung, Man-Hyun;Cho, Jae-Ik;Shon, Tae-Shik;Moon, Jong-Sub
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.71-79
    • /
    • 2012
  • As advances in computer technology, dissemination of smartphones and tablet PCs has increased and digital media has become easily accessible. The performance of computer hardware is improved and the form of hardware is changed, but basically the change in mechanism was not occurred. Typically, the data used in the program is resident in memory during the operation because of the operating system efficiency. So, these data in memory is accessible through the memory dumps or real-time memory analysis. The user's personal information or confidential data may be leaked by exploiting data; thus, the countermeasures should be provided. In this paper, we proposed the method that minimizes user's data leakage through finding the physical memory address of the process using virtual memory address, and initializing memory data of the process.

Exploring process prediction based on deep learning: Focusing on dynamic recurrent neural networks (딥러닝 기반의 프로세스 예측에 관한 연구: 동적 순환신경망을 중심으로)

  • Kim, Jung-Yeon;Yoon, Seok-Joon;Lee, Bo-Kyoung
    • The Journal of Information Systems
    • /
    • v.27 no.4
    • /
    • pp.115-128
    • /
    • 2018
  • Purpose The purpose of this study is to predict future behaviors of business process. Specifically, this study tried to predict the last activities of process instances. It contributes to overcoming the limitations of existing approaches that they do not accurately reflect the actual behavior of business process and it requires a lot of effort and time every time they are applied to specific processes. Design/methodology/approach This study proposed a novel approach based using deep learning in the form of dynamic recurrent neural networks. To improve the accuracy of our prediction model based on the approach, we tried to adopt the latest techniques including new initialization functions(Xavier and He initializations). The proposed approach has been verified using real-life data of a domestic small and medium-sized business. Findings According to the experiment result, our approach achieves better prediction accuracy than the latest approach based on the static recurrent neural networks. It is also proved that much less effort and time are required to predict the behavior of business processes.

Adaptive Control of CNC Boring Machine by Application of the Variance Perturbation Method (분산 섭동법 에 의한 CNC보오링 머시인 의 적응제어)

  • 이종원
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.8 no.1
    • /
    • pp.65-70
    • /
    • 1984
  • A recursive parameter estimation method is applied to spindle deflection model during boring process. The spindle infeed rate is then determined to preserve the diametral tolerance of bore. This estimation method is further extended to adaptive control by application of the variance perturbation method. The results of computer simulation attest that the proposed method renders the optimal cutting conditions, maintaining the diametral accuracy of bore, regardless of parameter fluctuations. The proposed method necessitating only post-process measurements features that initialization of parameter guess values in simple, a priori knowledge on parameter variations is not needed and the accurate estimation of optimal spindle infeed rate is obtained, even if the parameter estimation may be poor.

Medoid Determination in Deterministic Annealing-based Pairwise Clustering

  • Lee, Kyung-Mi;Lee, Keon-Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.178-183
    • /
    • 2011
  • The deterministic annealing-based clustering algorithm is an EM-based algorithm which behaves like simulated annealing method, yet less sensitive to the initialization of parameters. Pairwise clustering is a kind of clustering technique to perform clustering with inter-entity distance information but not enforcing to have detailed attribute information. The pairwise deterministic annealing-based clustering algorithm repeatedly alternates the steps of estimation of mean-fields and the update of membership degrees of data objects to clusters until termination condition holds. Lacking of attribute value information, pairwise clustering algorithms do not explicitly determine the centroids or medoids of clusters in the course of clustering process or at the end of the process. This paper proposes a method to identify the medoids as the centers of formed clusters for the pairwise deterministic annealing-based clustering algorithm. Experimental results show that the proposed method locate meaningful medoids.

Real-time Object Recognition with Pose Initialization for Large-scale Standalone Mobile Augmented Reality

  • Lee, Suwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4098-4116
    • /
    • 2020
  • Mobile devices such as smartphones are very attractive targets for augmented reality (AR) services, but their limited resources make it difficult to increase the number of objects to be recognized. When the recognition process is scaled to a large number of objects, it typically requires significant computation time and memory. Therefore, most large-scale mobile AR systems rely on a server to outsource recognition process to a high-performance PC, but this limits the scenarios available in the AR services. As a part of realizing large-scale standalone mobile AR, this paper presents a solution to the problem of accuracy, memory, and speed for large-scale object recognition. To this end, we design our own basic feature and realize spatial locality, selective feature extraction, rough pose estimation, and selective feature matching. Experiments are performed to verify the appropriateness of the proposed method for realizing large-scale standalone mobile AR in terms of efficiency and accuracy.

MMSE Based Continuous Turbo Equalizer for MIMO-HARQ Systems (MIMO-HARQ 시스템을 위한 MMSE 기반 연속 터보 등화기)

  • Park, Sangjoon;Choi, Sooyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.10
    • /
    • pp.619-621
    • /
    • 2014
  • In this letter, an MMSE based continuous turbo equalizer is proposed for MIMO-HARQ systems. In the proposed scheme, the soft information from the reception process for the previous transmission is reutilized at the initialization of the reception process for the next transmission to enhance the decoding convergence speed. Simulation results verify that the proposed scheme achieves an improved BLER with a significantly accelerated decoding convergence speed.

Moving Object Tracking Using Active Contour Model (동적 윤곽 모델을 이용한 이동 물체 추적)

  • Han, Kyu-Bum;Baek, Yoon-Su
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.5
    • /
    • pp.697-704
    • /
    • 2003
  • In this paper, the visual tracking system for arbitrary shaped moving object is proposed. The established tracking system can be divided into model based method that needs previous model for target object and image based method that uses image feature. In the model based method, the reliable tracking is possible, but simplification of the shape is necessary and the application is restricted to definite target mod el. On the other hand, in the image based method, the process speed can be increased, but the shape information is lost and the tracking system is sensitive to image noise. The proposed tracking system is composed of the extraction process that recognizes the existence of moving object and tracking process that extracts dynamic characteristics and shape information of the target objects. Specially, active contour model is used to effectively track the object that is undergoing shape change. In initializatio n process of the contour model, the semi-automatic operation can be avoided and the convergence speed of the contour can be increased by the proposed effective initialization method. Also, for the efficient solution of the correspondence problem in multiple objects tracking, the variation function that uses the variation of position structure in image frame and snake energy level is proposed. In order to verify the validity and effectiveness of the proposed tracking system, real time tracking experiment for multiple moving objects is implemented.