• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.20-33
• /
• 2015

Spectrum sensing is a key component of cognitive radio. The prediction of the primary user status in a low signal-to-noise ratio is an important factor in spectrum sensing. However, because of noise uncertainty, secondary users have difficulty distinguishing between the primary signal and an unauthorized signal when an unauthorized user exists in a cognitive radio network. To resolve the sensitivity to the noise uncertainty problem, we propose an entropy-based spectrum sensing scheme to detect the primary signal accurately in the presence of an unauthorized signal. The proposed spectrum sensing uses the conditional entropy between the primary signal and the unauthorized signal. The ability to detect the primary signal is thus robust against noise uncertainty, which leads to superior sensing performance in a low signal-to-noise ratio. Simulation results show that the proposed spectrum sensing scheme outperforms the conventional entropy-based spectrum sensing schemes in terms of the primary user detection probability.

• Journal of applied mathematics & informatics
• /
• 제35권1_2호
• /
• pp.45-58
• /
• 2017

Recently, Sati and Gupta (2015) proposed two measures of uncertainty based on non-extensive entropy, called the dynamic cumulative residual Tsallis entropy (DCRTE) and the empirical cumulative Tsallis entropy. In the present paper, we extend the definition of DCRTE into the bivariate setup and study its properties in the context of reliability theory. We also define a new class of life distributions based on bivariate DCRTE.

• 한국인터넷방송통신학회논문지
• /
• 제14권6호
• /
• pp.47-54
• /
• 2014

러프집합을 구성하는 식별불가능 관계를 표현하는 정보시스템에서 데이터의 중복이나 비일관성은 피할 수 없기 때문에 속성의 감축은 매우 중요하다. 러프집합이론에 있어서 일관적인 정보시스템과 비일관적인 정보시스템의 속성감축의 차이를 극복하고 자, 본 연구에서는 조건 및 결정속성에 대한 상관분석에 베이지언 사후확률을 적용한 새로운 불확실성 척도와 속성감축 알고리즘을 제안한다. 정보시스템의 불확실성에 대하여 제안된 척도와 기존의 조건부 정보엔트로피 척도를 비교해 본 결과, 정보시스템의 조건속성과 결정속성의 상호정보를 이용하여 속성간의 불확실성을 측정하는데 있어 제안된 방법이 조건부 정보엔트로피에 의한 방법보다 정확성이 있음을 보여준다.

• 한국융합학회논문지
• /
• 제4권2호
• /
• pp.35-41
• /
• 2013

Data management with fuzzy entropy and similarity measure were discussed and verified by applying reliable data selection problem. Calculation of certainty or uncertainty for data, fuzzy entropy and similarity measure are designed and proved. Proposed fuzzy entropy and similarity are considered as dissimilarity measure and similarity measure, and the relation between two measures are explained through graphical illustration.Obtained measures are useful to the application of decision theory and mutual information analysis problem. Extension of data quantification results based on the proposed measures are applicable to the decision making and fuzzy game theory.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권4호
• /
• pp.275-280
• /
• 2010

Verification of efficiency in data management fuzzy entropy and similarity measure were discussed and verified by applying reliable data selection problem and numerical data similarity evaluation. In order to calculate the certainty or uncertainty fuzzy entropy and similarity measure are designed and proved. Designed fuzzy entropy and similarity are considered as dissimilarity measure and similarity measure, and the relation between two measures are explained through graphical illustration. Obtained measures are useful to the application of decision theory and mutual information analysis problem. Extension of data quantification results based on the proposed measures are applicable to the decision making and fuzzy game theory.

• 한국게임학회 논문지
• /
• 제18권1호
• /
• pp.105-114
• /
• 2018

고객 유형 분석에 쓰이는 다양한 데이터 분석 방법은 고객들을 위한 맞춤형 콘텐츠를 기획하고, 보다 편리한 서비스를 제공하기 위하여 고객들의 유형과 특성을 정확히 파악하는 것이 매우 중요하다. 본 논문에서는 정보의 손실을 줄이기 위한 일환으로 정보 엔트로피를 확장하여 속성의 불확실성을 이용한 k-modes 군집분석 알고리즘을 제안한다. 따라서 속성에 대한 유사도의 측정은 두 가지의 측면에서 고려되어진다. 하나는 각 분할의 중심에 대한 각 속성간의 불확실성을 측정하는 것이고, 다른 하나는 각 속성이 가지는 불확실성에 대한 확률적 분포에 대한 불확실성을 측정하는 것이다. 특히 속성내의 불확실성은 속성의 엔트로피를 확률적 정보로 변환하여 불확실성을 측정하기 때문에 최종적인 불확실성은 비확률적인 척도와 확률적인 척도에서 고려되어 진다. 여러 실험과 척도를 통하여 제안한 알고리즘의 정확도가 최적의 초기치를 기반으로 군집분석을 수행한 결과에 준수함을 보인다.

• International Journal of Contents
• /
• 제10권1호
• /
• pp.18-22
• /
• 2014

Hidden nodes have a key role in the information processing of feed-forward neural networks in which inputs are processed through a series of weighted sums and nonlinear activation functions. In order to understand the role of hidden nodes, we must analyze the effect of the nonlinear activation functions on the weighted sums to hidden nodes. In this paper, we focus on the effect of nonlinear functions in a viewpoint of information theory. Under the assumption that the nonlinear activation function can be approximated piece-wise linearly, we prove that the entropy of weighted sums to hidden nodes decreases after piece-wise linear functions. Therefore, we argue that the nonlinear activation function decreases the uncertainty among hidden nodes. Furthermore, the more the hidden nodes are saturated, the more the entropy of hidden nodes decreases. Based on this result, we can say that, after successful training of feed-forward neural networks, hidden nodes tend not to be in linear regions but to be in saturated regions of activation function with the effect of uncertainty reduction.

• 로봇학회논문지
• /
• 제19권1호
• /
• pp.98-105
• /
• 2024

This paper proposes a new approach with a distance-based regularization to the entropy applied to the NBV (Next-Best-View) selection with NeRF (Neural Radiance Fields). 3D reconstruction requires images from various viewpoints, and selecting where to capture these images is a highly complex problem. In a recent work, image acquisition was derived using NeRF's ray-based uncertainty. While this work was effective for evaluating candidate viewpoints at fixed distances from a camera to an object, it is limited when dealing with a range of candidate viewpoints at various distances, because it tends to favor selecting viewpoints at closer distances. Acquiring images from nearby viewpoints is beneficial for capturing surface details. However, with the limited number of images, its image selection is less overlapped and less frequently observed, so its reconstructed result is sensitive to noise and contains undesired artifacts. We propose a method that incorporates distance-based regularization into entropy, allowing us to acquire images at distances conducive to capturing both surface details without undesired noise and artifacts. Our experiments with synthetic images demonstrated that NeRF models with the proposed distance and entropy-based criteria achieved around 50 percent fewer reconstruction errors than the recent work.

• 한국인터넷방송통신학회논문지
• /
• 제14권2호
• /
• pp.107-113
• /
• 2014

러프집합에서 식별불능의 관계와 근사공간의 개념을 이용해서 의사결정표로부터 최적화된 정보를 유도하게 된다. 그러나 일반적으로 결정표에서 데이터의 중복이나 비일관성은 피할 수 없기 때문에 속성의 중요성은 지식의 감축에서 매우 중요한 개념이다. 속성의 중요성에 대한 대수학적인 정의는 도메인중의 완전한 부분집합에 대한 해당 속성이 주는 영향을 고려하는 것이고, 정보이론적인 정의는 도메인 중의 불완전한 부분집합에 대한 해당 속성이 주는 영향을 고려하는 것이다. 따라서 속성 중요성은 정보이론적인 관점의 정의와 대수학인 관점의 정의가 분명하게 차이가 있다. 본 논문에서는 정보시스템의 조건속성과 결정속성에 포함될 수 있는 정보를 최적화하기 위한 정보이론적인 척도로써 러프집합을 이용한 조건부 정보엔트로피를 제안하고 그 효용성을 보인다.

• 한국IT서비스학회지
• /
• 제1권1호
• /
• pp.45-55
• /
• 2002

This paper suggests a new approach to IT project management based on a regular project meeting results to consider the recent project environment. The greater part of recent IT projects are related to e-business transformation. Transforming to e-business is a new problem very different from those they have been worked, in several point of views. Under e-business era, therefore any IT project is being implemented in more complex, dynamic and uncertain environment than traditional. That is, project leaders must consider more factors to control projects including resources, quality, risks, and technologies, and human resources. The project organizations and software corporations thus need to develop and establish new concepts or methodologies to manage e-business projects. In this point of view, an entropy model in this study is introduced for estimating and managing the uncertainty in project control using multi-attributes of project meeting. This paper proposes a new frame work based on entropy model using project meeting results to consider eIT project environment with a small pilot study.