• Title/Summary/Keyword: Additive Algorithm

Search Result 312, Processing Time 0.028 seconds

Optimization-based Image Watermarking Algorithm Using a Maximum-Likelihood Decoding Scheme in the Complex Wavelet Domain

  • Liu, Jinhua;Rao, Yunbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.452-472
    • /
    • 2019
  • Most existing wavelet-based multiplicative watermarking methods are affected by geometric attacks to a certain extent. A serious limitation of wavelet-based multiplicative watermarking is its sensitivity to rotation, scaling, and translation. In this study, we propose an image watermarking method by using dual-tree complex wavelet transform with a multi-objective optimization approach. We embed the watermark information into an image region with a high entropy value via a multiplicative strategy. The major contribution of this work is that the trade-off between imperceptibility and robustness is simply solved by using the multi-objective optimization approach, which applies the watermark error probability and an image quality metric to establish a multi-objective optimization function. In this manner, the optimal embedding factor obtained by solving the multi-objective function effectively controls watermark strength. For watermark decoding, we adopt a maximum likelihood decision criterion. Finally, we evaluate the performance of the proposed method by conducting simulations on benchmark test images. Experiment results demonstrate the imperceptibility of the proposed method and its robustness against various attacks, including additive white Gaussian noise, JPEG compression, scaling, rotation, and combined attacks.

A Machine Learning Univariate Time series Model for Forecasting COVID-19 Confirmed Cases: A Pilot Study in Botswana

  • Mphale, Ofaletse;Okike, Ezekiel U;Rafifing, Neo
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.225-233
    • /
    • 2022
  • The recent outbreak of corona virus (COVID-19) infectious disease had made its forecasting critical cornerstones in most scientific studies. This study adopts a machine learning based time series model - Auto Regressive Integrated Moving Average (ARIMA) model to forecast COVID-19 confirmed cases in Botswana over 60 days period. Findings of the study show that COVID-19 confirmed cases in Botswana are steadily rising in a steep upward trend with random fluctuations. This trend can also be described effectively using an additive model when scrutinized in Seasonal Trend Decomposition method by Loess. In selecting the best fit ARIMA model, a Grid Search Algorithm was developed with python language and was used to optimize an Akaike Information Criterion (AIC) metric. The best fit ARIMA model was determined at ARIMA (5, 1, 1), which depicted the least AIC score of 3885.091. Results of the study proved that ARIMA model can be useful in generating reliable and volatile forecasts that can used to guide on understanding of the future spread of infectious diseases or pandemics. Most significantly, findings of the study are expected to raise social awareness to disease monitoring institutions and government regulatory bodies where it can be used to support strategic health decisions and initiate policy improvement for better management of the COVID-19 pandemic.

Experimental Analysis of Bankruptcy Prediction with SHAP framework on Polish Companies

  • Tuguldur Enkhtuya;Dae-Ki Kang
    • International journal of advanced smart convergence
    • /
    • v.12 no.1
    • /
    • pp.53-58
    • /
    • 2023
  • With the fast development of artificial intelligence day by day, users are demanding explanations about the results of algorithms and want to know what parameters influence the results. In this paper, we propose a model for bankruptcy prediction with interpretability using the SHAP framework. SHAP (SHAPley Additive exPlanations) is framework that gives a visualized result that can be used for explanation and interpretation of machine learning models. As a result, we can describe which features are important for the result of our deep learning model. SHAP framework Force plot result gives us top features which are mainly reflecting overall model score. Even though Fully Connected Neural Networks are a "black box" model, Shapley values help us to alleviate the "black box" problem. FCNNs perform well with complex dataset with more than 60 financial ratios. Combined with SHAP framework, we create an effective model with understandable interpretation. Bankruptcy is a rare event, then we avoid imbalanced dataset problem with the help of SMOTE. SMOTE is one of the oversampling technique that resulting synthetic samples are generated for the minority class. It uses K-nearest neighbors algorithm for line connecting method in order to producing examples. We expect our model results assist financial analysts who are interested in forecasting bankruptcy prediction of companies in detail.

Machine learning-based probabilistic predictions of shear resistance of welded studs in deck slab ribs transverse to beams

  • Vitaliy V. Degtyarev;Stephen J. Hicks
    • Steel and Composite Structures
    • /
    • v.49 no.1
    • /
    • pp.109-123
    • /
    • 2023
  • Headed studs welded to steel beams and embedded within the concrete of deck slabs are vital components of modern composite floor systems, where safety and economy depend on the accurate predictions of the stud shear resistance. The multitude of existing deck profiles and the complex behavior of studs in deck slab ribs makes developing accurate and reliable mechanical or empirical design models challenging. The paper addresses this issue by presenting a machine learning (ML) model developed from the natural gradient boosting (NGBoost) algorithm capable of producing probabilistic predictions and a database of 464 push-out tests, which is considerably larger than the databases used for developing existing design models. The proposed model outperforms models based on other ML algorithms and existing descriptive equations, including those in EC4 and AISC 360, while offering probabilistic predictions unavailable from other models and producing higher shear resistances for many cases. The present study also showed that the stud shear resistance is insensitive to the concrete elastic modulus, stud welding type, location of slab reinforcement, and other parameters considered important by existing models. The NGBoost model was interpreted by evaluating the feature importance and dependence determined with the SHapley Additive exPlanations (SHAP) method. The model was calibrated via reliability analyses in accordance with the Eurocodes to ensure that its predictions meet the required reliability level and facilitate its use in design. An interactive open-source web application was created and deployed to the cloud to allow for convenient and rapid stud shear resistance predictions with the developed model.

Development of an AI-based remaining trip time prediction system for nuclear power plants

  • Sang Won Oh;Ji Hun Park;Hye Seon Jo;Man Gyun Na
    • Nuclear Engineering and Technology
    • /
    • v.56 no.8
    • /
    • pp.3167-3179
    • /
    • 2024
  • In abnormal states of nuclear power plants (NPPs), operators undertake mitigation actions to restore a normal state and prevent reactor trips. However, in abnormal states, the NPP condition fluctuates rapidly, which can lead to human error. If human error occurs, the condition of an NPP can deteriorate, leading to reactor trips. Sudden shutdowns, such as reactor trips, can result in the failure of numerous NPP facilities and economic losses. This study develops a remaining trip time (RTT) prediction system as part of an operator support system to reduce possible human errors and improve the safety of NPPs. The RTT prediction system consists of an algorithm that utilizes artificial intelligence (AI) and explainable AI (XAI) methods, such as autoencoders, light gradient-boosting machines, and Shapley additive explanations. AI methods provide diagnostic information about the abnormal states that occur and predict the remaining time until a reactor trip occurs. The XAI method improves the reliability of AI by providing a rationale for RTT prediction results and information on the main variables of the status of NPPs. The RTT prediction system includes an interface that can effectively provide the results of the system.

Tone Quality Improvement Algorithm using Intelligent Estimation of Noise Pattern (잡음 패턴의 지능적 추정을 통한 음질 개선 알고리즘)

  • Seo, Joung-Kook;Cha, Hyung-Tai
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.230-235
    • /
    • 2005
  • In this paper, we propose an algorithm that improves a tone quality of a noisy audio signal in order to enhance a performance of perceptual filter using intelligent estimation of noise pattern from a band degraded by additive noise. The proposed method doesn't use the estimated noise which is obtained from silent range. Instead new estimated noise according to the power of signal and effect of noise variation is considered for each frame. So the noisy audio signal is enhanced by the method which controls a estimation of noise Pattern effectively in a noise corruption band. To show the performance of the proposed algorithm, various input signals which had a different signal-to-noise ratio(SNR) such as $5\cal{dB},\;10\cal{dB},\;15\cal{dB}\;and\;20\cal{dB}$ were used to test the proposed algorithm. we carry out SSNR and NMR of objective measurement and MOS test of subjective measurement. An approximate improvement of $7.4\cal{dB},\;6.8\cal{dB},\;5.7\cal{dB},\;5.1\cal{dB}$ in SSNR and $15.7\cal{dB},\;15.5\cal{dB},\;15.2\cal{dB},\;14.8\cal{dB}$ in NMR is achieved with the input signals, respectively. And we confirm the enhancement of tone quality in terms of mean opinion score(MOS) test which is result of subjective measurement.

Declustering of High-dimensional Data by Cyclic Sliced Partitioning (주기적 편중 분할에 의한 다차원 데이터 디클러스터링)

  • Kim Hak-Cheol;Kim Tae-Wan;Li Ki-Joune
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.596-608
    • /
    • 2004
  • A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

A Heuristic Optimal Path Search Considering Cumulative Transfer Functions (누적환승함수를 고려한 경험적 최적경로탐색 방안)

  • Shin, Seongil;Baek, Nam Cheol;Nam, Doo Hee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.3
    • /
    • pp.60-67
    • /
    • 2016
  • In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers's travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

Long-Term Arrival Time Estimation Model Based on Service Time (버스의 정차시간을 고려한 장기 도착시간 예측 모델)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.297-306
    • /
    • 2017
  • Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

A Historical, Mathematical, Psychological Analysis on Ratio Concept (비 개념에 대한 역사적, 수학적, 심리적 분석)

  • 정은실
    • School Mathematics
    • /
    • v.5 no.4
    • /
    • pp.421-440
    • /
    • 2003
  • It is difficult for the learner to understand completely the ratio concept which forms a basis of proportional reasoning. And proportional reasoning is, on the one hand, the capstone of children's elementary school arithmetic and, the other hand, it is the cornerstone of all that is to follow. But school mathematics has centered on the teachings of algorithm without dealing with its essence and meaning. The purpose of this study is to analyze the essence of ratio concept from multidimensional viewpoint. In addition, this study will show the direction for improvement of ratio concept. For this purpose, I tried to analyze the historical development of ratio concept. Most mathematicians today consider ratio as fraction and, in effect, identify ratios with what mathematicians called the denominations of ratios. But Euclid did not. In line with Euclid's theory, ratio should not have been represented in the same way as fraction, and proportion should not have been represented as equation, but in line with the other's theory they might be. The two theories of ratios were running alongside each other, but the differences between them were not always clearly stated. Ratio can be interpreted as a function of an ordered pair of numbers or magnitude values. A ratio is a numerical expression of how much there is of one quantity in relation to another quantity. So ratio can be interpreted as a binary vector which differentiates between the absolute aspect of a vector -its size- and the comparative aspect-its slope. Analysis on ratio concept shows that its basic structure implies 'proportionality' and it is formalized through transmission from the understanding of the invariance of internal ratio to the understanding of constancy of external ratio. In the study, a fittingness(or comparison) and a covariation were examined as the intuitive origins of proportion and proportional reasoning. These form the basis of the protoquantitative knowledge. The development of sequences of proportional reasoning was examined. The first attempts at quantifying the relationships are usually additive reasoning. Additive reasoning appears as a precursor to proportional reasoning. Preproportions are followed by logical proportions which refer to the understanding of the logical relationships between the four terms of a proportion. Even though developmental psychologists often speak of proportional reasoning as though it were a global ability, other psychologists insist that the evolution of proportional reasoning is characterized by a gradual increase in local competence.

  • PDF