围绕网络流媒体技术以及嵌入式环境的特点,为保障流媒体的服务质量,研究了基于客户端的缓冲区控制策略,以及具有流量控制机制的流媒体网络通信技术。在探讨嵌入式视频点播系统架构基础上,提出了利用平均传输速率、时延抖动、解码速率和辅助系数这四个参数进行网络缓冲区长度估算的简化算法;并提出在客户端按照数据的重要性或优先级的不同来实施主动抛弃策略;该系统也针对服务器端引入了流量控制算法。结果表明,应用上述策略明显节约了缓存,并且实现了流量控制功能,改善了系统的服务质量(Quality of Service,QoS)。
In this paper a blind image watermarking that can resist to rotation, scaling and translation （RST） attacks is proposed. Based on the spread spectrum, the watermark is modulated before embedding. The logpolar mapped discrete fourier transform （LPM-DFT） magnitude of a disk, a part of the origin image, constitutes the RST-invariant domain, where the origin of the LPM is the center of the disk and the sampling rates of the LPM are constant. After the middle frequency band of LPM-DFT magnitude, namely the watermark-embedding domain, is grouped according to the watermark length, the watermark is embedded by adjusting the difference between the two sub-region energy in each group. To improve the imperceptibility, the watermark-embedding domain is shuffled before embedding and the watermark is not embedded directly into the watermark-embedding domain. In watermark detection procedure, neither the original image nor any knowledge about the distortions is required. Experimental results show that the proposed scheme is very robust against RST distortion and common image processing attacks.
A real-time watermarking scheme with high robustness and security has been proposed based on modulating the log-scaling magnitudes of DCT coefficients, which is most suitable for JPEG images and MPEG streams. The watermark bit is encoded as the sign of the difference between the individual log-scaling magnitude of a group-region and the average one of all group-regions. The log-scaling magnitude can be modulated by modifying the low and middle frequency DCT coefficients imperceptibly. The robustness of scheme is not only dependent on those largest coefficients, but also on the other coefficients with the same proportion. It can embed 512 bits into an image with a size of 512×512, which can satisfy the payload requirement of most video watermarking applications. Moreover, the watermark embedding process only requires one-sixth of the time consumed during normal playing of video, and the watermark detection only requires one-twelfth of that, which can meet the real-time requirements of most video watermarking ap- plications. Furthermore, the experimental results show that the presented scheme is transparent and robust to significant valumetric distortions （including additive noise, low-pass filtering, Iossy compression and valumetric scaling） and a part of geometric distortions. It performs much better than the EMW algorithm in resisting all kinds of distortions except Gaussian noise with a larger deviation.
