• Title/Summary/Keyword: Entropy model

Search Result 489, Processing Time 0.029 seconds

Optimal Associative Neighborhood Mining using Representative Attribute (대표 속성을 이용한 최적 연관 이웃 마이닝)

  • Jung Kyung-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.4 s.310
    • /
    • pp.50-57
    • /
    • 2006
  • In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.

Design of an Efficient Binary Arithmetic Encoder for H.264/AVC (H.264/AVC를 위한 효율적인 이진 산술 부호화기 설계)

  • Moon, Jeon-Hak;Kim, Yoon-Sup;Lee, Seong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.12
    • /
    • pp.66-72
    • /
    • 2009
  • This paper proposes an efficient binary arithmetic encoder for CABAC which is used one of the entropy coding methods for H.264/AVC. The present binary arithmetic encoding algorithm requires huge complexity of operation and data dependency of each step, which is difficult to be operated in fast. Therefore, renormalization exploits 2-stage pipeline architecture for efficient process of operation, which reduces huge complexity of operation and data dependency. Context model updater is implemented by using a simple expression instead of transIdxMPS table and merging transIdxLPS and rangeTabLPS tables, which decreases hardware size. Arithmetic calculator consists of regular mode, bypass mode and termination mode for appearance probability of binary value. It can operate in maximum speed. The proposed binary arithmetic encoder has 7282 gate counts in 0.18um standard cell library. And input symbol per cycle is about 1.

Function approximation of steam table using the neural networks (신경회로망을 이용한 증기표의 함수근사)

  • Lee, Tae-Hwan;Park, Jin-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.3
    • /
    • pp.459-466
    • /
    • 2006
  • Numerical values of thermodynamic properties such as temperature, pressure, dryness, volume, enthalpy and entropy are required in numerical analysis on evaluating the thermal performance. But the steam table itself cannot be used without modelling. From this point of view the neural network with function approximation characteristics can be an alternative. the multi-layer neural networks were made for saturated vapor region and superheated vapor region separately. For saturated vapor region the neural network consists of one input layer with 1 node, two hidden layers with 10 and 20 nodes each and one output layer with 7 nodes. For superheated vapor region it consists of one input layer with 2 nodes, two hidden layers with 15 and 25 nodes each and one output layer with 3 nodes. The proposed model gives very successful results with ${\pm}0.005%$ of percentage error for temperature, enthalpy and entropy and ${\pm}0.025%$ for pressure and specific volume. From these successful results, it is confirmed that the neural networks could be powerful method in function approximation of the steam table.

A Entropy Coding Method using Temporal and Spatial Correlation on HEVC (HEVC에서 시공간적 상관관계를 이용한 엔트로피 부호화 방법)

  • Kim, Tae-Ryong;Kim, Kyung-Yong;Lee, Han-Soo;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.191-194
    • /
    • 2012
  • The split flag and the skip flag in CU syntax have high correlation on spatial domain as well as temporal domain. This paper suggests a method for enhancing coding efficiency by using not only spatial correlation but also temporal correlation when coding CU information. In the CABAC case, temporal collocated CU information is used for selecting context model of the split flag and the skip flag. In the CAVLC case, current CU information is estimated from temporal collocated CU information then encoded. As a result, a coding efficiency was increased by 0.1%~0.6% in CABAC, 0.1%~0.4% in CAVLC compared with HM 3.0. This method shows better performance on lowdelay condition which uses reference frame close to current frame.

Benign versus Malignant Soft-Tissue Tumors: Differentiation with 3T Magnetic Resonance Image Textural Analysis Including Diffusion-Weighted Imaging

  • Lee, Youngjun;Jee, Won-Hee;Whang, Yoon Sub;Jung, Chan Kwon;Chung, Yang-Guk;Lee, So-Yeon
    • Investigative Magnetic Resonance Imaging
    • /
    • v.25 no.2
    • /
    • pp.118-128
    • /
    • 2021
  • Purpose: To investigate the value of MR textural analysis, including use of diffusion-weighted imaging (DWI) to differentiate malignant from benign soft-tissue tumors on 3T MRI. Materials and Methods: We enrolled 69 patients (25 men, 44 women, ages 18 to 84 years) with pathologically confirmed soft-tissue tumors (29 benign, 40 malignant) who underwent pre-treatment 3T-MRI. We calculated MR texture, including mean, standard deviation (SD), skewness, kurtosis, mean of positive pixels (MPP), and entropy, according to different spatial-scale factors (SSF, 0, 2, 4, 6) on axial T1- and T2-weighted images (T1WI, T2WI), contrast-enhanced T1WI (CE-T1WI), high b-value DWI (800 sec/mm2), and apparent diffusion coefficient (ADC) map. We used the Mann-Whitney U test, logistic regression, and area under the receiver operating characteristic curve (AUC) for statistical analysis. Results: Malignant soft-tissue tumors had significantly lower mean values of DWI, ADC, T2WI and CE-T1WI, MPP of ADC, and CE-T1WI, but significantly higher kurtosis of DWI, T1WI, and CE-T1WI, and entropy of DWI, ADC, and T2WI than did benign tumors (P < 0.050). In multivariate logistic regression, the mean ADC value (SSF, 6) and kurtosis of CE-T1WI (SSF, 4) were independently associated with malignancy (P ≤ 0.009). A multivariate model of MR features worked well for diagnosis of malignant soft-tissue tumors (AUC, 0.909). Conclusion: Accurate diagnosis could be obtained using MR textural analysis with DWI and CE-T1WI in differentiating benign from malignant soft-tissue tumors.

An Improved ViBe Algorithm of Moving Target Extraction for Night Infrared Surveillance Video

  • Feng, Zhiqiang;Wang, Xiaogang;Yang, Zhongfan;Guo, Shaojie;Xiong, Xingzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4292-4307
    • /
    • 2021
  • For the research field of night infrared surveillance video, the target imaging in the video is easily affected by the light due to the characteristics of the active infrared camera and the classical ViBe algorithm has some problems for moving target extraction because of background misjudgment, noise interference, ghost shadow and so on. Therefore, an improved ViBe algorithm (I-ViBe) for moving target extraction in night infrared surveillance video is proposed in this paper. Firstly, the video frames are sampled and judged by the degree of light influence, and the video frame is divided into three situations: no light change, small light change, and severe light change. Secondly, the ViBe algorithm is extracted the moving target when there is no light change. The segmentation factor of the ViBe algorithm is adaptively changed to reduce the impact of the light on the ViBe algorithm when the light change is small. The moving target is extracted using the region growing algorithm improved by the image entropy in the differential image of the current frame and the background model when the illumination changes drastically. Based on the results of the simulation, the I-ViBe algorithm proposed has better robustness to the influence of illumination. When extracting moving targets at night the I-ViBe algorithm can make target extraction more accurate and provide more effective data for further night behavior recognition and target tracking.

The Estimation of Shear Stress in Uniform and Nonuniform Flow by the Entropy Concept (엔트로피 개념을 이용한 개수로에서 등류 및 부등류 흐름의 전단응력 산정)

  • Choo, Yeon Moon;Choo, Tai Ho;Yang, Da Un;Kim, Joong Hoon
    • Journal of Wetlands Research
    • /
    • v.19 no.2
    • /
    • pp.202-210
    • /
    • 2017
  • Shear stress is one of the most important mechanical factors used in various fields and is important for the design of artificial channels. Current shear stresses have been used in the past, but there are factors that are difficult to actually measure or calculate, such as bed shear stress and energy slope in the equation used. In particular, the energy slope is a very difficult factor to estimate, and it is difficult to estimate the slope and flow velocity of the boundary layer although the energy slope can be used to obtain the shear stress distribution. In addition, the bed shear stress among the shear stress distribution is very difficult to measure directly, and the research is somewhat slower than the velocity. In this study, we have studied the simple calculation of the average flow velocity and the shear stress distribution using entropy M without reflecting the energy gradient, and we used existing laboratory data to demonstrate the utility of the applied equation. The stress distribution in the graphs was comparatively analyzed. In the case of the uniform flow and the non-uniform flow, the correlation coefficient was almost identical to 0.930-0.998.

Extracting Typical Group Preferences through User-Item Optimization and User Profiles in Collaborative Filtering System (사용자-상품 행렬의 최적화와 협력적 사용자 프로파일을 이용한 그룹의 대표 선호도 추출)

  • Ko Su-Jeong
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.581-591
    • /
    • 2005
  • Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

A Study on the One-Way Distance in the Longitudinal Section Using Probabilistic Theory (확률론적 이론을 이용한 종단면에서의 단방향 이동거리에 관한 연구)

  • Kim, Seong-Ryul;Moon, Ji-Hyun;Jeon, Hae-Sung;Sue, Jong-Chal;Choo, Yeon-Moon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.12
    • /
    • pp.87-96
    • /
    • 2020
  • To use a hydraulic structure effectively, the velocity of a river should be known in detail. In reality, velocity measurements are not conducted sufficiently because of their high cost. The formulae to yield the flux and velocity of the river are commonly called the Manning and Chezy formulae, which are empirical equations applied to uniform flow. This study is based on Chiu (1987)'s paper using entropy theory to solve the limits of the existing velocity formula and distribution and suggests the velocity and distance formula derived from information entropy. The data of a channel having records of a spot's velocity was used to verify the derived formula's utility and showed R2 values of distance and velocity of 0.9993 and 0.8051~0.9483, respectively. The travel distance and velocity of a moving spot following the streamflow were calculated using some flow information, which solves the difficulty in frequent flood measurements when it is needed. This can be used to make a longitudinal section of a river composed of a horizontal distance and elevation. Moreover, GIS makes it possible to obtain accurate information, such as the characteristics of a river. The connection with flow information and GIS model can be used as alarming and expecting flood systems.

Development of Online Machine Learning Model for AHU Supply Air Temperature Prediction using Progressive Sampling and Normalized Mutual Information (점진적 샘플링과 정규 상호정보량을 이용한 온라인 기계학습 공조기 급기온도 예측 모델 개발)

  • Chu, Han-Gyeong;Shin, Han-Sol;Ahn, Ki-Uhn;Ra, Seon-Jung;Park, Cheol Soo
    • Journal of the Architectural Institute of Korea Structure & Construction
    • /
    • v.34 no.6
    • /
    • pp.63-69
    • /
    • 2018
  • The machine learning model can capture the dynamics of building systems with less inputs than the first principle based simulation model. The training data for developing a machine learning model are usually selected in a heuristic manner. In this study, the authors developed a machine learning model which can describe supply air temperature from an AHU in a real office building. For rational reduction of the training data, the progressive sampling method was used. It is found that even though the progressive sampling requires far less training data (n=60) than the offline regular sampling (n=1,799), the MBEs of both models are similar (2.6% vs. 5.4%). In addition, for the update of the machine learning model, the normalized mutual information (NMI) was applied. If the NMI between the simulation output and the measured data is less than 0.2, the model has to be updated. By the use of the NMI, the model can perform better prediction ($5.4%{\rightarrow}1.3%$).