• Title/Summary/Keyword: Additive Algorithm

Search Result 308, Processing Time 0.022 seconds

A Study on Mixed Noise Removal using Standard Deviation and Noise Density (표준편차 및 잡음 밀도를 이용한 복합잡음 제거 알고리즘에 관한 연구)

  • Kwon, Se-Ik;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.173-175
    • /
    • 2017
  • With the rapid progress of the digital area has come the increase in demand for multi-media services. Imaging processing as a result is being hailed as a technological field that can offer smart and efficient methods for the processing and analysis of images. In general, noise exist in various types, depending on the cause and form. Some leading examples of noise are AWGN(additive white Gaussian noise), salt and pepper noise and complex noise. This study suggests an algorithm to remove complex noise by using the standard deviation and noise density of the partial mask in order to effectively remove complex noise in images.

  • PDF

Object Contour Tracking using Snake in Stereo Image Sequences (스테레오 영상 시퀀스에서 스네이크를 이용한 객체 윤곽 추적 알고리즘)

  • Shin-Hyoung Kim;Jong-Whan Jang
    • The Journal of Engineering Research
    • /
    • v.6 no.2
    • /
    • pp.109-117
    • /
    • 2004
  • In this paper, we propose an object contour tracking algorithm using snakes in stereo image sequences. The proposed technique is composed of two steps. In the first step, the candidate Snake points are determined from the motion information in 3-D disparity space. In the second step, the energy of Snake function is calculated to check whether the candidate Snake points converge to the edges of the interested objects. The energy of Snake function is calculated from the candidate Snake points using the disparity information obtained by patch matching. The performance of the proposed technique is evaluated by applying it to various sample images. Results prove that the proposed technique can track the edges of objects of interest in the stereo image sequences even in the cases of complicated background images or additive components.

  • PDF

Achievable Rate of Beamforming Dual-hop Multi-antenna Relay Network in the Presence of a Jammer

  • Feng, Guiguo;Guo, Wangmei;Gao, Jingliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3789-3808
    • /
    • 2017
  • This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

Adaptive Blind Equalization Controlled by Linearly Combining CME and Non-CME Errors (CME 오차와 non-CME 오차의 선형 결합에 의해 제어되는 적응 블라인드 등화)

  • Oh, Kil Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.4
    • /
    • pp.3-8
    • /
    • 2015
  • In this paper, we propose a blind equalization algorithm based on the error signal linearly combined a constellation-matched error (CME) and a non-constellation-matched error (non-CME). The new error signal was designed to include the non-CME term for reaching initial convergence and the CME term for improving intersymbol interference (ISI) performance of output signals, and it controls the error terms through a combining factor. By controlling the error terms, it generates an appropriate error signal for equalization process and improves convergence speed and ISI cancellation performance compared to those of conventional algorithms. In the simulation for 64-QAM and 256-QAM signals under the multipath channel and additive noise conditions, the proposed method was superior to CMA and CMA+DD concurrent equalization.

Fusion Techniques Comparison of GeoEye-1 Imagery

  • Kim, Yong-Hyun;Kim, Yong-Il;Kim, Youn-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.25 no.6
    • /
    • pp.517-529
    • /
    • 2009
  • Many satellite image fusion techniques have been developed in order to produce a high resolution multispectral (MS) image by combining a high resolution panchromatic (PAN) image and a low resolution MS image. Heretofore, most high resolution image fusion techniques have used IKONOS and QuickBird images. Recently, GeoEye-1, offering the highest resolution of any commercial imaging system, was launched. In this study, we have experimented with GeoEye-1 images in order to evaluate which fusion algorithms are suitable for these images. This paper presents compares and evaluates the efficiency of five image fusion techniques, the $\grave{a}$ trous algorithm based additive wavelet transformation (AWT) fusion techniques, the Principal Component analysis (PCA) fusion technique, Gram-Schmidt (GS) spectral sharpening, Pansharp, and the Smoothing Filter based Intensity Modulation (SFIM) fusion technique, for the fusion of a GeoEye-1 image. The results of the experiment show that the AWT fusion techniques maintain more spatial detail of the PAN image and spectral information of the MS image than other image fusion techniques. Also, the Pansharp technique maintains information of the original PAN and MS images as well as the AWT fusion technique.

Graph-based Mixed Heuristics for Effective Planning (효율적인 계획생성을 위한 그래프 기반의 혼합 휴리스틱)

  • Park, Byungjoon;Kim, Wantae;Kim, Hyunsik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.3
    • /
    • pp.27-37
    • /
    • 2021
  • Highly informative heuristics in AI planning can help to a more efficient search a solutions. However, in general, to obtain informative heuristics from planning problem specifications requires a lot of computational effort. To address this problem, we propose a Partial Planning Graph(PPG) and Mixed Heuristics for solving planning problems more efficiently. The PPG is an improved graph to be applied to can find a partial heuristic value for each goal condition from the relaxed planning graph which is a means to get heuristics to solve planning problems. Mixed Heuristics using PPG requires size of each graph is relatively small and less computational effort as a partial plan generated for each goal condition compared to the existing planning graph. Mixed Heuristics using PPG can find partial interactions for each goal conditions in an effective way, then consider them in order to estimate the goal state heuristics. Therefore Mixed Heuristics can not only find interactions for each goal conditions more less computational effort, but also have high accuracy of heuristics than the existing max and additive heuristics. In this paper, we present the PPG and the algorithm for computing Mixed Heuristics, and then explain analysis to accuracy and the efficiency of the Mixed Heuristics.

Noise Reduction Algorithm For The Detection of Fine Ion Signals in Residual Gas Analyzer (잔류가스분석기의 질량 스펙트럼 검출 성능 향상을 위한 잡음제거 알고리즘)

  • Heo, Gyeongyong;Choi, Hun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.102-107
    • /
    • 2019
  • This paper proposes a method to improve the mass spectral detection performance of the residual gas analyzer. By improving the mode estimation method for setting the threshold value and improving the additive noise elimination method, it is possible to detect mass spectrums having low peak values of the threshold level difficult to distinguish from noise. Ion signal blocks for each mass index with noise removed by the improved method are effective for eliminating invalid ion signals based on the linear and quadratic fittings. The mass spectrum can be obtained from the quadratic fitted curves for the reconstructed ion signal block using only the valid ion signals. In addition, the resolution of the mass spectrum can be improved by correcting the error caused by the shift of the spectral peak position. To verify the performance of the proposed method, computer simulations were performed using real ion signals obtained from the residual gas analysis system under development. The simulation results show that the proposed method is valid.

Detection Copy-Move Forgery in Image Via Quaternion Polar Harmonic Transforms

  • Thajeel, Salam A.;Mahmood, Ali Shakir;Humood, Waleed Rasheed;Sulong, Ghazali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.4005-4025
    • /
    • 2019
  • Copy-move forgery (CMF) in digital images is a detrimental tampering of artefacts that requires precise detection and analysis. CMF is performed by copying and pasting a part of an image into other portions of it. Despite several efforts to detect CMF, accurate identification of noise, blur and rotated region-mediated forged image areas is still difficult. A novel algorithm is developed on the basis of quaternion polar complex exponential transform (QPCET) to detect CMF and is conducted involving a few steps. Firstly, the suspicious image is divided into overlapping blocks. Secondly, invariant features for each block are extracted using QPCET. Thirdly, the duplicated image blocks are determined using k-dimensional tree (kd-tree) block matching. Lastly, a new technique is introduced to reduce the flat region-mediated false matches. Experiments are performed on numerous images selected from the CoMoFoD database. MATLAB 2017b is used to employ the proposed method. Metrics such as correct and false detection ratios are utilised to evaluate the performance of the proposed CMF detection method. Experimental results demonstrate the precise and efficient CMF detection capacity of the proposed approach even under image distortion including rotation, scaling, additive noise, blurring, brightness, colour reduction and JPEG compression. Furthermore, our method can solve the false match problem and outperform existing ones in terms of precision and false positive rate. The proposed approach may serve as a basis for accurate digital image forensic investigations.

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.