Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgentl...Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgently.Among the proposed technologies,zero-watermarking has been favored recently.In order to improve the robustness of the zero-watermarking,a novel robust audio zerowatermarking method based on sparse representation is proposed.The proposed scheme is mainly based on the K-singular value decomposition(K-SVD)algorithm to construct an optimal over complete dictionary from the background audio signal.After that,the orthogonal matching pursuit(OMP)algorithm is used to calculate the sparse coefficient of the segmented test audio and generate the corresponding sparse coefficient matrix.Then,the mean value of absolute sparse coefficients in the sparse matrix of segmented speech is calculated and selected,and then comparing the mean absolute coefficient of segmented speech with the average value of the selected coefficients to realize the embedding of zero-watermarking.Experimental results show that the proposed audio zerowatermarking algorithm based on sparse representation performs effectively in resisting various common attacks.Compared with the baseline works,the proposed method has better robustness.展开更多
In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating posit...In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating positioning accuracy often occupies many bits,the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication chan-nels.This paper studies how to compress data for distributed tracking fusion algorithms.Based on the K-singular value decomposition(K-SVD)algorithm,a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix.Then the least square quantization(LSQ)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.展开更多
基金the National Natural Science Foundation of China(No.62001100)the Fundamental Research Funds for the Central Universities(No.2232019D3-52)Shanghai Sailing Program.(No.19YF1402000).
文摘Behind the prevalence of multimedia technology,digital copyright disputes are becoming increasingly serious.The digital watermarking prevention technique against the copyright infringement needs to be improved urgently.Among the proposed technologies,zero-watermarking has been favored recently.In order to improve the robustness of the zero-watermarking,a novel robust audio zerowatermarking method based on sparse representation is proposed.The proposed scheme is mainly based on the K-singular value decomposition(K-SVD)algorithm to construct an optimal over complete dictionary from the background audio signal.After that,the orthogonal matching pursuit(OMP)algorithm is used to calculate the sparse coefficient of the segmented test audio and generate the corresponding sparse coefficient matrix.Then,the mean value of absolute sparse coefficients in the sparse matrix of segmented speech is calculated and selected,and then comparing the mean absolute coefficient of segmented speech with the average value of the selected coefficients to realize the embedding of zero-watermarking.Experimental results show that the proposed audio zerowatermarking algorithm based on sparse representation performs effectively in resisting various common attacks.Compared with the baseline works,the proposed method has better robustness.
基金supported in part by the National Laboratory of Radar Signal Processing Xidian Univrsity,Xi’an 710071,China。
文摘In distributed radar,most of existing radar networks operate in the tracking fusion mode which combines radar target tracks for a higher positioning accuracy.However,as the filtering covariance matrix indicating positioning accuracy often occupies many bits,the communication cost from local sensors to the fusion is not always sufficiently low for some wireless communication chan-nels.This paper studies how to compress data for distributed tracking fusion algorithms.Based on the K-singular value decomposition(K-SVD)algorithm,a sparse coding algorithm is presented to sparsely represent the filtering covariance matrix.Then the least square quantization(LSQ)algo-rithm is used to quantize the data according to the statistical characteristics of the sparse coeffi-cients.Quantized results are then coded with an arithmetic coding method which can further com-press data.Numerical results indicate that this tracking data compression algorithm drops the com-munication bandwidth to 4%at the cost of a 16%root mean squared error(RMSE)loss.