• Title/Summary/Keyword: 엔트로피 생성

Search Result 121, Processing Time 0.024 seconds

Creation of Approximate Rules based on Posterior Probability (사후확률에 기반한 근사 규칙의 생성)

  • Park, In-Kyu;Choi, Gyoo-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.69-74
    • /
    • 2015
  • In this paper the patterns of information system is reduced so that control rules can guarantee fast response of queries in database. Generally an information system includes many kinds of necessary and unnecessary attribute. In particular, inconsistent information system is less likely to acquire the accuracy of response. Hence we are interested in the simple and understandable rules that can represent useful patterns by means of rough entropy and Bayesian posterior probability. We propose an algorithm which can reduce control rules to a minimum without inadequate patterns such that the implication between condition attributes and decision attributes is measured through the framework of rough entropy. Subsequently the validation of the proposed algorithm is showed through test information system of new employees appointment.

An Implementation of Gaze Direction Recognition System using Difference Image Entropy (차영상 엔트로피를 이용한 시선 인식 시스템의 구현)

  • Lee, Kue-Bum;Chung, Dong-Keun;Hong, Kwang-Seok
    • The KIPS Transactions:PartB
    • /
    • v.16B no.2
    • /
    • pp.93-100
    • /
    • 2009
  • In this paper, we propose a Difference Image Entropy based gaze direction recognition system. The Difference Image Entropy is computed by histogram levels using the acquired difference image of current image and reference images or average images that have peak positions from $-255{\sim}+255$ to prevent information omission. There are two methods about the Difference Image Entropy based gaze direction. 1) The first method is to compute the Difference Image Entropy between an input image and average images of 45 images in each location of gaze, and to recognize the directions of user's gaze. 2) The second method is to compute the Difference Image Entropy between an input image and each 45 reference images, and to recognize the directions of user's gaze. The reference image is created by average image of 45 images in each location of gaze after receiving images of 4 directions. In order to evaluate the performance of the proposed system, we conduct comparison experiment with PCA based gaze direction system. The directions of recognition left-top, right-top, left-bottom, right-bottom, and we make an experiment on that, as changing the part of recognition about 45 reference images or average image. The experimental result shows that the recognition rate of Difference Image Entropy is 97.00% and PCA is 95.50%, so the recognition rate of Difference Image Entropy based system is 1.50% higher than PCA based system.

Design of Low Cost H.264/AVC Entropy Coding Unit Using Code Table Pattern Analysis (코드 테이블 패턴 분석을 통한 저비용 H.264/AVC 엔트로피 코딩 유닛 설계)

  • Song, Sehyun;Kim, Kichul
    • Journal of IKEEE
    • /
    • v.17 no.3
    • /
    • pp.352-359
    • /
    • 2013
  • This paper proposes an entropy coding unit for H.264/AVC baseline profile. Entropy coding requires code tables for macroblock encoding. There are patterns in codewords of each code tables. In this paper, the patterns between codewords are analyzed to reduce the hardware cost. The entropy coding unit consists of Exp-Golomb unit and CAVLC unit. The Exp-Golomb unit can process five code types in a single unit. It can perform Exp-Golomb processing using only two adders. While typical CAVLC units use various code tables which require large amounts of resources, the sizes of the tables are reduced to about 40% or less of typical CAVLC units using relationships between table elements in the proposed CAVLC unit. After the Exp-Golomb unit and the CAVLC unit generate code values, the entropy unit uses a small size shifter for bit-stream generation while typical methods are barrel shifters.

Entropy Coding of Hangul Data for Digital Broadcasting (디지털 방송용 한글 데이터의 엔트로피 부호화)

  • 진경식;김충일;황재정
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.73-76
    • /
    • 2000
  • 본 논문은 표준완성형코드를 표준으로 허프만 부호를 생성하기 위해 부호화 효율이 가장 높은 곳에서 예외 부호화를 통해 최적의 허프만 부호를 얻는다. 현재 우리나라의 DTV는 한글문자를 압축하지 않고 전송하는 형태이며, 본격적인 데이터 방송이 시작되면 한글 데이터가 차지하는 전송량으로 인한 심각한 문제가 야기된다. 본 논문에서는 데이터 방송에서 문제가 되는 전송량을 줄이기 위해 한글 전용 최적의 허프만 부호를 생성하여 일련의 해결책을 찾고자 하며 영문 위주인 데이터 압축기술을 한글에 맞게 적용하여 DTV 방송용 한글 전용 압축부호를 만드는데 있다.

  • PDF

A Reexamination on the Influence of Fine-particle between Districts in Seoul from the Perspective of Information Theory (정보이론 관점에서 본 서울시 지역구간의 미세먼지 영향력 재조명)

  • Lee, Jaekoo;Lee, Taehoon;Yoon, Sungroh
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.109-114
    • /
    • 2015
  • This paper presents a computational model on the transfer of airborne fine particles to analyze the similarities and influences among the 25 districts in Seoul by quantifying a time series data collected from each district. The properties of each district are driven with the model of a time series of the fine particle concentrations, and the calculation of edge-based weights are carried out with the transfer entropies between all pairs of the districts. We applied a modularity-based graph clustering technique to detect the communities among the 25 districts. The result indicates the discovered clusters correspond to a high transfer-entropy group among the communities with geographical adjacency or high in-between traffic volumes. We believe that this approach can be further extended to the discovery of significant flows of other indicators causing environmental pollution.

Feature Subset Selection Algorithm based on Entropy (엔트로피를 기반으로 한 특징 집합 선택 알고리즘)

  • 홍석미;안종일;정태충
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.2
    • /
    • pp.87-94
    • /
    • 2004
  • The feature subset selection is used as a preprocessing step of a teaming algorithm. If collected data are irrelevant or redundant information, we can improve the performance of learning by removing these data before creating of the learning model. The feature subset selection can also reduce the search space and the storage requirement. This paper proposed a new feature subset selection algorithm that is using the heuristic function based on entropy to evaluate the performance of the abstracted feature subset and feature selection. The ACS algorithm was used as a search method. We could decrease a size of learning model and unnecessary calculating time by reducing the dimension of the feature that was used for learning.

The Slip-Wall Boundary Conditions Effects and the Entropy Characteristics of the Multi-Species GH Solver (다화학종 GH 방정식의 정확성 향상을 위한 벽면 경계조건 연구 및 GH 방정식의 엔트로피 특성 고찰)

  • Ahn, Jae-Wan;Kim, Chong-Am
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.10
    • /
    • pp.947-954
    • /
    • 2009
  • Starting from the Eu's GH(Generalized Hydrodynamic) theory, the multi-species GH numerical solver is developed in this research and its computatyional behaviors are examined for the hypersonic rarefied flow over an axisymmetric body. To improve the accuracy of the developed multi-species GH solver, various slip-wall boundary conditions are tested and the computed results are compared. Additionally, in order to validate the entropy characteristics of the GH equation, the entropy production and entropy generation rates of the GH equation are investigated in the 1-dimensional normal shock structure test at a high Knudsen number.

A application for Image completion with Deep GAN (심층 GAN을 이용한 이미지 완성 어플리케이션)

  • Cho, Sang-Hyun;Kim, Jong-Deug
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.774-777
    • /
    • 2017
  • 사진에는 의도하지 않은 노이즈나 찍는 과정 중에 발생한 실수나 문제로 원치 않게 가려진 부분이 있을 수 있는데, 이미지 완성 어플리케이션은 사용자가 전문적인 프로그램이나 전문가의 도움 없이 노이즈나 가려진 부분을 제거할 수 있도록 하였다. 본 논문에서는 GAN(Generative Adversial Network) 모델에 노이즈가 있는 사진을 입력으로 넣어 노이즈가 제거 된 사진을 생성하도록 하였고, 생성 된 사진과 기존 이미지가 자연스럽게 합성 될 수 있도록 보정을 하여 완성 된 이미지를 출력하는 어플리케이션을 제안한다. GAN 분류 모델의 시그모이드 교차-엔트로피와 생성이미지와 원본이미지간의 평균 제곱 오차를 함께 최소화 하도록 생성 모델을 학습시켰고, 낮은 평균 제곱 오차를 가지는 완성 이미지를 생성 할 수 있었다. 이미지 보정을 통해 생성 된 이미지와 입력 이미지와의 밝기 차이를 해소시켜 좀 더 자연스러운 완성 이미지 결과를 얻을 수 있었다.

Heat Transfer and Pressure Drop of Cross-flow Heat Exchanger on Modules Variation (직교류 열교환기의 모듈수에 따른 열전달 및 압력강하 특성)

  • Kim, Jong-Min;Kim, Jinsu;Yu, Byeonghun;Kum, Sungmin;Lee, Chang-Eon;Lee, Seungro
    • Journal of Energy Engineering
    • /
    • v.22 no.2
    • /
    • pp.120-127
    • /
    • 2013
  • This study investigated the characteristics of heat transfer and pressure drop for cross-flow heat exchanger of premixed combustion system. The premixed burner was in front of a heat exchanger, and the number of heat exchanger modules was changed to investigate the characteristics of NOx and CO emissions with various equivalence ratios. In addition, the effectiveness, entropy generation and pressure drop were calculated by various number of heat exchanger modules and the performance of heat exchanger was analyzed by the exergy loss.

An Algorithm of Score Function Generation using Convolution-FFT in Independent Component Analysis (독립성분분석에서 Convolution-FFT을 이용한 효율적인 점수함수의 생성 알고리즘)

  • Kim Woong-Myung;Lee Hyon-Soo
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.27-34
    • /
    • 2006
  • In this study, we propose this new algorithm that generates score function in ICA(Independent Component Analysis) using entropy theory. To generate score function, estimation of probability density function about original signals are certainly necessary and density function should be differentiated. Therefore, we used kernel density estimation method in order to derive differential equation of score function by original signal. After changing formula to convolution form to increase speed of density estimation, we used FFT algorithm that can calculate convolution faster. Proposed score function generation method reduces the errors, it is density difference of recovered signals and originals signals. In the result of computer simulation, we estimate density function more similar to original signals compared with Extended Infomax and Fixed Point ICA in blind source separation problem and get improved performance at the SNR(Signal to Noise Ratio) between recovered signals and original signal.