• Title/Summary/Keyword: Entropy value method

Search Result 110, Processing Time 0.023 seconds

Maximum-Entropy Image Enhancement Using Brightness Mean and Variance (영상의 밝기 평균과 분산을 이용한 엔트로피 최대화 영상 향상 기법)

  • Yoo, Ji-Hyun;Ohm, Seong-Yong;Chung, Min-Gyo
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.61-73
    • /
    • 2012
  • This paper proposes a histogram specification based image enhancement method, which uses the brightness mean and variance of an image to maximize the entropy of the image. In our histogram specification step, the Gaussian distribution is used to fit the input histogram as well as produce the target histogram. Specifically, the input histogram is fitted with the Gaussian distribution whose mean and variance are equal to the brightness mean(${\mu}$) and variance(${\sigma}2$) of the input image, respectively; and the target Gaussian distribution also has the mean of the value ${\mu}$, but takes as the variance the value which is determined such that the output image has the maximum entropy. Experimental results show that compared to the existing methods, the proposed method preserves the mean brightness well and generates more natural looking images.

A Study on Generic Unpacking using Entropy Variation Analysis (엔트로피 값 변화 분석을 이용한 실행 압축 해제 방법 연구)

  • Lee, Young-Hoon;Chung, Man-Hyun;Jeong, Hyun-Cheol;Shon, Tae-Shik;Moon, Jong-Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.2
    • /
    • pp.179-188
    • /
    • 2012
  • Packing techniques, one of malicious code detection and analysis avoidance techniques, change code to reduce size and make analysts confused. Therefore, malwares have more time to spread out and it takes longer time to analyze them. Thus, these kind of unpacking techniques have been studied to deal with packed malicious code lately. Packed programs are unpacked during execution. When it is unpacked, the data inside of the packed program are changed. Because of these changes, the entropy value of packed program is changed. After unpacking, there will be no data changes; thus, the entropy value is not changed anymore. Therefore, packed programs could be unpacked finding the unpacking point using this characteristic regardless of packing algorithms. This paper suggests the generic unpacking mechanism using the method estimating the unpacking point through the variation of entropy values.

Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization (영확률 최대화에 근거한 효율적인 적응 알고리듬)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.5
    • /
    • pp.237-243
    • /
    • 2014
  • In this paper, a calculation-efficient method for weight update in the algorithm based on maximization of the zero-error probability (MZEP) is proposed. This method is to utilize the current slope value in calculation of the next slope value, replacing the block processing that requires a summation operation in a sample time period. The simulation results shows that the proposed method yields the same performance as the original MZEP algorithm while significantly reducing the computational time and complexity with no need for a buffer for error samples. Also the proposed algorithm produces faster convergence speed than the algorithm that is based on the error-entropy minimization.

Impact of Ba Substitution on the Magnetocaloric Effect in La1-xBaxMnO3 Manganites

  • Hussain, Imad;Anwar, M.S.;Kim, Eunji;Koo, Bon Heun;Lee, Chan Gyu
    • Korean Journal of Materials Research
    • /
    • v.26 no.11
    • /
    • pp.623-627
    • /
    • 2016
  • $La_{1-x}Ba_xMnO_3$ (x = 0.30, 0.35 and 0.40) samples have been prepared by solid-state reaction method. The X-ray diffraction (XRD) study showed that all the samples crystallized in a rhombohedral structure with an R-3c space group. Variation of the magnetization as a function of the temperature and applied magnetic field was carried out. All the samples revealed ferromagnetic to paramagnetic (FM-PM) phase transition at the Curie temperature $T_C{\sim}342K$. The magnetic entropy change was also studied through examination of the measured magnetic isotherms M(H, T) near $T_C$. The magnetocaloric effect was calculated in terms of the isothermal magnetic entropy change. The maximum entropy change reaches a value of 1.192 J/kgK under a magnetic field change of 2.5T for the $La_{0.6}Ba_{0.4}MnO_3$ composition. The relative cooling power (RCP) is 79.31 J/kg for the same applied magnetic field.

Multi-level thresholding using Entropy-based Weighted FCM Algorithm in Color Image (Entropy 기반의 Weighted FCM 알고리즘을 이용한 컬러 영상 Multi-level thresholding)

  • Oh, Jun-Taek;Kwak, Hyun-Wook;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.73-82
    • /
    • 2005
  • This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

Influence on overfitting and reliability due to change in training data

  • Kim, Sung-Hyeock;Oh, Sang-Jin;Yoon, Geun-Young;Jung, Yong-Gyu;Kang, Min-Soo
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.2
    • /
    • pp.82-89
    • /
    • 2017
  • The range of problems that can be handled by the activation of big data and the development of hardware has been rapidly expanded and machine learning such as deep learning has become a very versatile technology. In this paper, mnist data set is used as experimental data, and the Cross Entropy function is used as a loss model for evaluating the efficiency of machine learning, and the value of the loss function in the steepest descent method is We applied the GradientDescentOptimize algorithm to minimize and updated weight and bias via backpropagation. In this way we analyze optimal reliability value corresponding to the number of exercises and optimal reliability value without overfitting. And comparing the overfitting time according to the number of data changes based on the number of training times, when the training frequency was 1110 times, we obtained the result of 92%, which is the optimal reliability value without overfitting.

Structural Characterization of CoCrFeMnNi High Entropy Alloy Oxynitride Thin Film Grown by Sputtering (스퍼터링 방법으로 성장한 코발트크롬철망간니켈 고엔트로피 질산화물 박막의 구조특성)

  • Lee, Jeongkuk;Hong, Soon-Ku
    • Korean Journal of Materials Research
    • /
    • v.28 no.10
    • /
    • pp.595-600
    • /
    • 2018
  • This study investigates the microstructural properties of CoCrFeMnNi high entropy alloy (HEA) oxynitride thin film. The HEA oxynitride thin film is grown by the magnetron sputtering method using nitrogen and oxygen gases. The grown CoCrFeMnNi HEA film shows a microstructure with nanocrystalline regions of 5~20 nm in the amorphous region, which is confirmed by high-resolution transmission electron microscopy (HR-TEM). From the TEM electron diffraction pattern analysis crystal structure is determined to be a face centered cubic (FCC) structure with a lattice constant of 0.491 nm, which is larger than that of CoCrFeMnNi HEA. The HEA oxynitride film shows a single phase in which constituting elements are distributed homogeneously as confirmed by element mapping using a Cs-corrected scanning TEM (STEM). Mechanical properties of the CoCrFeMnNi HEA oxynitride thin film are addressed by a nano indentation method, and a hardness of 8.13 GPa and a Young's modulus of 157.3 GPa are obtained. The observed high hardness value is thought to be the result of hardening due to the nanocrystalline microstructure.

Anomaly Detection Method Using Entropy of Network Traffic Distributions (네트워크 트래픽 분포 엔트로피를 이용한 비정상행위 탐지 방법)

  • Kang Koo-Hong;Oh Jin-Tae;Jang Jong-Soo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.283-294
    • /
    • 2006
  • Hostile network traffic is often different from normal traffic in ways that can be distinguished without knowing the exact nature of the attack. In this paper, we propose a new anomaly detection method using inbound network traffic distributions. For this purpose, we first characterize the traffic of a real campus network by the distributions of IP protocols, packet length, destination IP/port addresses, TTL value, TCP SYN packet, and fragment packet. And then we introduce the concept of entropy to transform the obtained baseline traffic distributions into manageable values. Finally, we can detect the anomalies by the difference of entropies between the current and baseline distributions. In particular, we apply the well-known denial-of-service attacks to a real campus network and show the experimental results.

Network Attack Detection based on Multiple Entropies (다중 엔트로피를 이용한 네트워크 공격 탐지)

  • Kim Min-Taek;Kwon Ki Hoon;Kim Sehun;Choi Young-Woo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.1
    • /
    • pp.71-77
    • /
    • 2006
  • Several network attacks, such as distributed denial of service (DDoS) attack, present a very serious threat to the stability of the internet. The threat posed by network attacks on large networks, such as the internet, demands effective detection method. Therefore, a simple intrusion detection system on large-scale backbone network is needed for the sake of real-time detection, preemption and detection efficiency. In this paper, in order to discriminate attack traffic from legitimate traffic on backbone links, we suggest a relatively simple statistical measure, entropy, which can track value frequency. Den is conspicuous distinction of entropy values between attack traffic and legitimate traffic. Therefore, we can identify what kind of attack it is as well as detecting the attack traffic using entropy value.

HANDLING MISSING VALUES IN FUZZY c-MEANS

  • Miyamoto, Sadaaki;Takata, Osamu;Unayahara, Kazutaka
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.139-142
    • /
    • 1998
  • Missing values in data for fuzzy c-menas clustering is discussed. Two basic methods of fuzzy c-means, i.e., the standard fuzzy c-means and the entropy method are considered and three options of handling missing values are proposed, among which one is to define a new distance between data with missing values, second is to alter a weight in the new distance, and the third is to fill the missing values by an appropriate numbers. Experimental Results are shown.

  • PDF