• 한국지능시스템학회논문지
• /
• 제15권5호
• /
• pp.521-526
• /
• 2005

모호함의 측도를 위하여 퍼지 엔트로피와 거리측도 그리고 유사측도와의 관계를 이용하여 새로운 퍼지 측도를 제안하였다. 제안된 퍼지 엔트로피는 거리측도를 이용하여 구성된다. 거리측도는 일반적으로 사용되는 해밍 거리를 이용하였다. 또한 집합사이의 유사성을 측정하기 위한 유사측도를 거리 측도를 이용하여 구성하였고, 제안한 퍼지 엔트로피와 유사측도를 증명을 통하여 타당성을 확인하였다.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2007년도 학술발표회 논문집
• /
• pp.178-182
• /
• 2007

In this study, we evaluated current raingauge network of Soyanggang dam region applying spatial-correlation analysis and Entropy theory to recommend an optimized raingauge network. In the process of analysis, correlation distance of raingauge stations is estimated and evaluated via spatial-correlation method and entropy method. From this correlation distances, respective influencing radii of each dataset and each methods is assessed. The result of correlation and entropy analysis has estimated correlation distance of 25.546km and influence radius of 7.206km, deducing a decrease of network density from $224.53km^2$ to $122.47km^2$ which satisfy the recommended minimum densities of $250km^2$ in mountainous regions(WMO, 1994) and an increase of basin coverage from 59.3% to 86.8%. As for the elevation analysis the relative evaluation ratio increased from 0.59(current) to 0.92(optimized) resulting an obvious improvement.

• 한국지능시스템학회논문지
• /
• 제18권2호
• /
• pp.257-261
• /
• 2008

In this Paper we derived fuzzy entropy that is based on similarity measure. Similarity measure represents the degree of similarity between two informations, those informations characteristics are not important. First we construct similarity measure between two informations, and derived entropy functions with obtained similarity measure. Obtained entropy is verified with proof. With the help of one-to-one similarity is also obtained through distance measure, this similarity measure is also proved in our paper.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2004년도 춘계학술대회 학술발표 논문집 제14권 제1호
• /
• pp.349-352
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, we have proposed the fuzzy entropy function and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• 한국지능시스템학회논문지
• /
• 제14권5호
• /
• pp.655-659
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, the fuzzy entropy function is proposed and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• Journal of Information Processing Systems
• /
• 제16권1호
• /
• pp.184-200
• /
• 2020

Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.

• 로봇학회논문지
• /
• 제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.

• Journal of Computing Science and Engineering
• /
• 제4권3호
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• 한국지능시스템학회논문지
• /
• 제12권6호
• /
• pp.583-588
• /
• 2002

Recently, Szmidt and Kacprzyk[Fuzzy Sets and Systems 118(2001) 467-477] proposed a non-probabilistic-type entropy measure for intuitionistic fuzzy sets. Tt is a result of a geometric interpretation of intuitionistic fuzzy sets and uses a ratio of distances between them. They showed that the proposed measure can be defined in terms of the ratio of intuitionistic fuzzy cardinalities: of $F\bigcapF^c and F\bigcupF^c$, while applying the Hamming distances. In this note, while applying the Euclidean distances, it is also shown that the proposed measure can be defined in terms of the ratio of some function of intuitionistic fuzzy cardinalities: of $F\bigcapF^c and F\bigcupF^c$.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1846-1851
• /
• 2003

Approximate optimization has become popular in engineering field such as MDO and Crash analysis which is time consuming. To accomplish efficient approximate optimization, accuracy of approximate model is very important. As surrogate model, Kriging have been widely used approximating highly nonlinear system . Because Kriging employs interpolation method, it is adequate for deterministic computer simulation. Because there are no random errors and measurement errors in deterministic computer simulation, instead of classical DOE ,space filling experiment design which fills uniformly design space should be applied. In this work, various space filling designs such as maximin distance design, maximum entropy design are reviewed. And new design improving maximum entropy design is suggested and compared.