外文翻译----一种基于嵌入式零树小波算法的鲁棒图像压缩新方法二(编辑修改稿)内容摘要：
ror given by . We would like to know the number of bits correctly received in each of the S streams. Since this quantity is itself a random variable, we use its mean value to characterize the performance of the different algorithms. Because the channel is memoryless, streams terminate independently of each other, but the mean values of their termination points are always the same for a specified . Assuming that the image is pressed to B total bits and that S streams are used, then the probability of receiving k of the B/S bits in each stream correctly is given by BSkBSkkpkk)1(0)1()( (2) which is a valid probability mass function as one can easily verify by summing over all k: In (2), k)1( is the probability that the first k bits are correct while is the probability that the (k + 1)th bit is in error. Note that a separate term conditioned on B/S is necessary to take into account the 3 possibility that all of the bits。阅读剩余 0%
本站所有文章资讯、展示的图片素材等内容均为注册用户上传(部分报媒/平媒内容转载自网络合作媒体)，仅供学习参考。
用户通过本站上传、发布的任何内容的知识产权归属用户或原始著作权人所有。如有侵犯您的版权，请联系我们反馈本站将在三个工作日内改正。