• Journal of Korea Multimedia Society
• /
• v.23 no.8
• /
• pp.1019-1029
• /
• 2020

In this paper, we propose a novel knowledge distillation algorithm to create an compressed deep ensemble network coupled with the combined use of local and global features of face images. In order to transfer the capability of high-level recognition performances of the ensemble deep networks to a single deep network, the probability for class prediction, which is the softmax output of the ensemble network, is used as soft target for training a single deep network. By applying the knowledge distillation algorithm, the local feature informations obtained by training the deep ensemble network using facial subregions of the face image as input are transmitted to a single deep network to create a so-called compressed ensemble DCNN. The experimental results demonstrate that our proposed compressed ensemble deep network can maintain the recognition performance of the complex ensemble deep networks and is superior to the recognition performance of a single deep network. In addition, our proposed method can significantly reduce the storage(memory) space and execution time, compared to the conventional ensemble deep networks developed for face recognition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.324-329
• /
• 2005

Dynamic Encoding Algorithm for Searches (DEAS) which is known as a fast and reliable non-gradient optimization method, was proposed [1]. DEAS reaches local or global optimum with binary strings (or binary matrices for multi-dimensional problem) by iterating the two operations; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., 0 or 1), while UDS performs increment or decrement of binary strings in the BSS' result direction with no change of string length. Because the interval of UDS exponentially decreases with increment of bit string length (BSL), DEAS is difficult to escape from local optimum when DEAS falls into local optimum. Therefore, this paper proposes hopping UDS (HUDS) which performs UDS by hopping as many as BSL in the final point of UDS process. HUDS helps to escape from local optimum and enhances a probability searching global optimization. The excellent performance of HUDS will be validated through the well-known benchmark functions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.58-73
• /
• 2014

As is well known, cooperative sensing can significantly improve the sensing accuracy as compared to local sensing in cognitive radio networks (CRNs). However, a large number of cooperative secondary users (SUs) reporting their local detection results to the fusion center (FC) would cause much overhead, such as sensing delay and energy consumption. In this paper, we propose a fast cooperative sensing scheme, called double threshold fusion (DTF), to reduce the sensing overhead while satisfying a given sensing accuracy requirement. In DTF, FC respectively compares the number of successfully received local decisions and that of failed receptions with two different thresholds to make a final decision in each reporting sub-slot during a sensing process, where cooperative SUs sequentially report their local decisions in a selective fashion to reduce the reporting overhead. By jointly considering sequential detection and selective reporting techniques in DTF, the overhead of cooperative sensing can be significantly reduced. Besides, we study the performance optimization problems with different objectives for DTF and develop three optimum fusion rules accordingly. Simulation results reveal that DTF shows evident performance gains over an existing scheme.

• Journal of the Korean Statistical Society
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2000

A spectrum minimizing the frequency-domain Kullback-Leibler information number has been proposed and used to modify a spectrum estimate. Some numerical examples have illustrated the KL spectrum estimate is superior to the initial estimate, i.e., the autocovariances obtained by the inverse Fourier transformation of the KL spectrum estimate are closer to the sample autocovariances of the given observations than those of the initial spectrum estimate. Also, it has been shown that a Gaussian autoregressive process associated with the KL spectrum is the closest in the timedomain Kullback-Leibler sense to a Gaussian white noise process subject to given autocovariance constraints. In this paper a corresponding conditional probability theorem is presented, which gives another rationale to the KL spectrum.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.3
• /
• pp.173-181
• /
• 2012

The size and layout of user interface components need to be optimally designed in terms of reachability, visibility, clearance, and compatibility in order for efficient and effective use of products. The present study develops an ergonomic design method which optimizes the size and layout of user interface components using adaptive genetic algorithm. The developed design method determines a near-optimal design which maximizes the aggregated score of 4 ergonomic design criteria (reachability, visibility, clearance, and compatibility). The adaptive genetic algorithm used in the present study finds a near-optimum by automatically adjusting the key parameter (probability of mutation) of traditional genetic algorithm according to the characteristic of current solutions. Since the adaptive mechanism partially helps to overcome the local optimality problem, the probability of finding the near-optimum has been substantially improved. To evaluate the effectiveness of the developed design method, the present study applied it to the user interface design for a portable wireless communication radio.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.666-670
• /
• 2011

In this paper, we propose a stable active contour based tracking method which utilizes the bimodal segmentation technique to obtain a background color diminished image frame. The proposed method overcomes the drawback of the Mansouri model which is liable to fall into a local minimum state when colors appear in the background that are similar to the target colors. The Mansouri model has been a foundation for active contour based tracking methods, since it is derived from a probability based interpretation. By stabilizing the model with the proposed speed function, the proposed model opens the way to extend probability based active contour tracking for practical applications.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2002.03a
• /
• pp.220-227
• /
• 2002

This study introduces the fragility analysis method for the safety evaluation of reinforced concrete pier subject to earthquake. Damage probability is calculated instead of the failure probability from definition of the damage state in the fragility curve. Not only the damage model determined by the response of structure subject to earthquake, but also the plastic-damage model which can represent the local damage is applied to fragility analysis. The evaluation method of damage state by damage variable in global structure is defined by this procedure. This study introduces the fragility analysis method considering the features of nonlinear time history behavior of reinforced concrete element and the plastic behavior of materials. At last, This study gives one of the approach method for seismic margin evaluation with the result of fragility analysis to design seismic load.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.3
• /
• pp.69-78
• /
• 1996

This paper presetns an iterative relaxation method for stereo matching using matching probability and compatibility coefficients between disparities. Stereo matching can be considered as the labeling problem of assigning unique matches to feature points of image an relaxation labelin gis an iterative procedure which reduces local ambiguities and achieves global consistency. the relation between disparities is determined from highly reliable matches in initial matching and quantitatively expressed in temrs of compatibility coefficient. The matching results of neighbor pixels support center pixel through compatibility coefficients and update its matching probability. The proposed adaptive method reduces the degradtons on the discontinuities of disparity areas and obtains fast convergence.

• Nuclear Engineering and Technology
• /
• v.52 no.3
• /
• pp.477-484
• /
• 2020

The control rod drive mechanism needs to be debugged after reactor fresh fuel loading. It is of great importance to monitor the subcriticality of this process accurately. A modified method was applied to the subcriticality monitoring process, in which only a single control rod cluster was fully withdrawn from the core. In order to correct the error in the results obtained by Neutron Source Multiplication Method, which is based on one point reactor model, Monte Carlo neutron transport code was employed to calculate the fission neutron distribution, the iterated fission probability and the neutron flux in the neutron detector. This article analyzed the effect of a coarse mesh and a fine mesh to tally fission neutron distributions, the iterated fission probability distributions and to calculate correction factors. The subcriticality before and after modification is compared with the subcriticality calculated by MCNP code. The modified results turn out to be closer to calculation. It's feasible to implement the modified NSM method in large local reactivity addition process using Monte Carlo code based on 3D model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2750-2767
• /
• 1996

In this papr, a new lossless compression method is presented based on the Binary Adaptive Arithmetic Coder(BAAC). A simple unbalanced binary tree is created by recursively dividing the BAAC unit interval into two probability sub-inervals. On the tree the More Probable Predicted Value(MPPV) and Less Probable Predicated Value(LPPV) estimated by local statistics of the image pixels are arranged in decreasing order. The BAAC or Huffman coder is thus applied to the branches of the tree. The proposed method allows the coder be directly applied to the full bit-plane medical image without a decomposition of the full bit-planes into a series of binary bit-planes. The use of the full bit model template improves the compresion ratio. In addition, a fast computation for adjusting the interval is possible since a simple arithmetic operation based on probability interval estimation state machine is used for interval sub-division within the BAAC unit interval.