• Title/Summary/Keyword: Algorithm decomposition

Search Result 789, Processing Time 0.03 seconds

Vehicle Face Re-identification Based on Nonnegative Matrix Factorization with Time Difference Constraint

  • Ma, Na;Wen, Tingxin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2098-2114
    • /
    • 2021
  • Light intensity variation is one of the key factors which affect the accuracy of vehicle face re-identification, so in order to improve the robustness of vehicle face features to light intensity variation, a Nonnegative Matrix Factorization model with the constraint of image acquisition time difference is proposed. First, the original features vectors of all pairs of positive samples which are used for training are placed in two original feature matrices respectively, where the same columns of the two matrices represent the same vehicle; Then, the new features obtained after decomposition are divided into stable and variable features proportionally, where the constraints of intra-class similarity and inter-class difference are imposed on the stable feature, and the constraint of image acquisition time difference is imposed on the variable feature; At last, vehicle face matching is achieved through calculating the cosine distance of stable features. Experimental results show that the average False Reject Rate and the average False Accept Rate of the proposed algorithm can be reduced to 0.14 and 0.11 respectively on five different datasets, and even sometimes under the large difference of light intensities, the vehicle face image can be still recognized accurately, which verifies that the extracted features have good robustness to light variation.

Encryption-based Image Steganography Technique for Secure Medical Image Transmission During the COVID-19 Pandemic

  • Alkhliwi, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.83-93
    • /
    • 2021
  • COVID-19 poses a major risk to global health, highlighting the importance of faster and proper diagnosis. To handle the rise in the number of patients and eliminate redundant tests, healthcare information exchange and medical data are transmitted between healthcare centres. Medical data sharing helps speed up patient treatment; consequently, exchanging healthcare data is the requirement of the present era. Since healthcare professionals share data through the internet, security remains a critical challenge, which needs to be addressed. During the COVID-19 pandemic, computed tomography (CT) and X-ray images play a vital part in the diagnosis process, constituting information that needs to be shared among hospitals. Encryption and image steganography techniques can be employed to achieve secure data transmission of COVID-19 images. This study presents a new encryption with the image steganography model for secure data transmission (EIS-SDT) for COVID-19 diagnosis. The EIS-SDT model uses a multilevel discrete wavelet transform for image decomposition and Manta Ray Foraging Optimization algorithm for optimal pixel selection. The EIS-SDT method uses a double logistic chaotic map (DLCM) is employed for secret image encryption. The application of the DLCM-based encryption procedure provides an additional level of security to the image steganography technique. An extensive simulation results analysis ensures the effective performance of the EIS-SDT model and the results are investigated under several evaluation parameters. The outcome indicates that the EIS-SDT model has outperformed the existing methods considerably.

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.

Research on Camouflaged Encryption Scheme Based on Hadamard Matrix and Ghost Imaging Algorithm

  • Leihong, Zhang;Yang, Wang;Hualong, Ye;Runchu, Xu;Dawei, Zhang
    • Current Optics and Photonics
    • /
    • v.5 no.6
    • /
    • pp.686-698
    • /
    • 2021
  • A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

A Domain-independent Dual-image based Robust Reversible Watermarking

  • Guo, Xuejing;Fang, Yixiang;Wang, Junxiang;Zeng, Wenchao;Zhao, Yi;Zhang, Tianzhu;Shi, Yun-Qing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.4024-4041
    • /
    • 2022
  • Robust reversible watermarking has attracted widespread attention in the field of information hiding in recent years. It should not only have robustness against attacks in transmission but also meet the reversibility of distortion-free transmission. According to our best knowledge, the most recent robust reversible watermarking methods adopt a single image as the carrier, which might lead to low efficiency in terms of carrier utilization. To address the issue, a novel dual-image robust reversible watermarking framework is proposed in this paper to effectively utilize the correlation between both carriers (namely dual images) and thus improve the efficiency of carrier utilization. In the dual-image robust reversible watermarking framework, a two-layer robust watermarking mechanism is designed to further improve the algorithm performances, i.e., embedding capacity and robustness. In addition, an optimization model is built to determine the parameters. Finally, the proposed framework is applied in different domains (namely domain-independent), i.e., Slantlet Transform and Singular Value Decomposition domain, and Zernike moments, respectively to demonstrate its effectiveness and generality. Experimental results demonstrate the superiority of the proposed dual-image robust reversible watermarking framework.

Retrieving Phase from Single Interferogram with Spatial Carrier Frequency by Using Morlet Wavelet

  • Hongxin Zhang;Mengyuan Cui
    • Current Optics and Photonics
    • /
    • v.7 no.5
    • /
    • pp.529-536
    • /
    • 2023
  • The Morlet wavelet transform method is proposed to analyze a single interferogram with spatial carrier frequency that is captured by an optical interferometer. The method can retain low frequency components that contain the phase information of a measured optical surface, and remove high frequency disturbances by wavelet decomposition and reconstruction. The key to retrieving the phases from the low-frequency wavelet components is to extract wavelet ridges by calculating the maximum value of the wavelet transform amplitude. Afterwards, the wrapped phases can be accurately solved by multiple iterative calculations on wavelet ridges. Finally, we can reconstruct the wave-front of the measured optical element by applying two-dimensional discrete cosine transform to those wrapped phases. Morlet wavelet transform does not need to remove the spatial carrier frequency components manually in the processing of interferogram analysis, but the step is necessary in the Fourier transform algorithm. So, the Morlet wavelet simplifies the process of the analysis of interference fringe patterns compared to Fourier transform. Consequently, wavelet transform is more suitable for automated programming analysis of interference fringes and avoiding the introduction of additional errors compared with Fourier transform.

The viterbi decoder implementation with efficient structure for real-time Coded Orthogonal Frequency Division Multiplexing (실시간 COFDM시스템을 위한 효율적인 구조를 갖는 비터비 디코더 설계)

  • Hwang Jong-Hee;Lee Seung-Yerl;Kim Dong-Sun;Chung Duck-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.2 s.332
    • /
    • pp.61-74
    • /
    • 2005
  • Digital Multimedia Broadcasting(DMB) is a reliable multi-service system for reception by mobile and portable receivers. DMB system allows interference-free reception under the conditions of multipath propagation and transmission errors using COFDM modulation scheme, simultaneously, needs powerful channel error's correction ability. Viterbi Decoder for DMB receiver uses punctured convolutional code and needs lots of computations for real-time operation. So, it is desired to design a high speed and low-power hardware scheme for Viterbi decoder. This paper proposes a combined add-compare-select(ACS) and path metric normalization(PMN) unit for computation power. The proposed PMN architecture reduces the problem of the critical path by applying fixed value for selection algorithm due to the comparison tree which has a weak point from structure with the high-speed operation. The proposed ACS uses the decomposition and the pre-computation technique for reducing the complicated degree of the adder, the comparator and multiplexer. According to a simulation result, reduction of area $3.78\%$, power consumption $12.22\%$, maximum gate delay $23.80\%$ occurred from punctured viterbi decoder for DMB system.

Efficient Algorithms for Multicommodity Network Flow Problems Applied to Communications Networks (다품종 네트워크의 효율적인 알고리즘 개발 - 정보통신 네트워크에의 적용 -)

  • 윤석진;장경수
    • The Journal of Information Technology
    • /
    • v.3 no.2
    • /
    • pp.73-85
    • /
    • 2000
  • The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

  • PDF

Grand Average in MEG and Crude Estimation of Anatomical Site (뇌자도에서 전체 평균과 이를 이용한 해부학적 위치 추정)

  • Kwon H.;Kim K.;Kim J. M.;Lee Y. H.;Park Y. K.
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.575-580
    • /
    • 2004
  • In this work, a method is presented to find an anatomical site of a current source crudely in a standard brain using grand average of MEG data. Minimum norm estimation algorithm and truncated singular value decomposition were applied to calculate the distributed sources that can reproduce the measured signals. Grand average over all subjects was obtained from the transformed signals, which would be detected in a standard sensor plane by the obtained distributed current sources. In the simulation study, it was shown that the localized dipole using the grand average is consistent with the mean location of localized dipoles of all subjects within several mm even with large inter-individual differences of sensor positions. This result suggests that the mean location of low level signal source can be estimated as a dipole source in grand average and it was confirmed in the localization of the current source of N100m. when the localized dipole is registered on a standard brain. This result also suggests that the activity region obtained from grand average can be crudely estimated on a standard brain using the source location of the N100m as a reference point.

Subband Sparse Adaptive Filter for Echo Cancellation in Digital Hearing Aid Vent (디지털 보청기 벤트 반향제거를 위한 부밴드 성긴 적응필터)

  • Bae, Hyeonl-Deok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.5
    • /
    • pp.538-542
    • /
    • 2018
  • Echo generated in digital hearing aid vent give rise to user's discomfort. For cancelling feedback echo in vent, it is required to estimate vent impulse response exactly. The vent impulse response has time varying and sparse characteristics. The IPNLMS has been known a useful adaptive algorithm to estimate vent impulse response with these characteristics. In this paper, subband sparse adaptive filter which applying IPNLMS to subband hearing aid structure is proposed to cancel echo of vent by estimating sparse vent impulse response. In the propose method, the decomposition of input signal to subband can pre-whiten each subband signal, so adaptive filter convergence speed can be improved. And the poly phase component decomposition of adaptive filter increases sparsity of each components, and the better echo cancellation can be possible without additional computation. To derive coefficients update equation of the adaptive filter, by defining the cost function based weight NLMS is defined, and the coefficient update equation of each subband is derived. For verifying performances of the adaptive filter, convergence speed, and steady state error by white signal input, and echo cancelling results by real speech input are evaluated by comparing conventional adaptive filters.