[Symbol: see text]2 Optimized predictive image coding with [Symbol: see text]∞ bound.

In many scientific, medical, and defense applications of image/video compression, an [Symbol: see text]∞ error bound is required. However, pure[Symbol: see text]∞-optimized image coding, colloquially known as near-lossless image coding, is prone to structured errors such as contours and speckles if the bit rate is not sufficiently high; moreover, most of the previous [Symbol: see text]∞-based image coding methods suffer from poor rate control. In contrast, the [Symbol: see text]2 error metric aims for average fidelity and hence preserves the subtlety of smooth waveforms better than the ∞ error metric and it offers fine granularity in rate control, but pure [Symbol: see text]2-based image coding methods (e.

Efficient rate-distortion optimal packetization of embedded bitstreams into independent source packets.

This paper addresses the rate-distortion (R-D) optimal packetization (RDOP) of embedded bitstreams into independent source packets, in order to limit error propagation in transmission of images over packet noisy channels. The input embedded stream is assumed to be an interleaving of K independently decodable basic streams. To form independent source packets, the set of basic streams is partitioned into N groups.

Unequal erasure protection technique for scalable multistreams.

This paper presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multistream UEP (M-UEP), differs from the traditional UEP strategy by: 1) placing separate streams in separate packets to establish independence and 2) using permuted systematic Reed-Solomon codes to enhance the distribution of message symbols amongst the packets. M-UEP improves upon UEP by ensuring that all received source symbols are decoded.

Comments on "optimal erasure protection for scalably compressed video streams with limited retransmission".

In order to prove a key result for their development (Lemma 2), Taubman and Thie need the assumption that the upper boundary of the convex hull of the channel coding probability-redundancy characteristic is sufficiently dense. Since a floor value for the density level for which the claim to hold is not specified, it is not clear whether their lemma applies to practical situations. In this correspondence, we show that the constraint of sufficient density can be removed, and, thus, we validate the conclusion of the lemma for any scenario encountered in practice.

Fast chromosome karyotyping by auction algorithm.

We consider the problem of automated classification of human chromosomes or karyotyping and study discrete optimisation algorithms to solve the problem as one of joint maximum likelihood classification. We demonstrate that the auction algorithm offers a simpler and more efficient solution for chromosome karyotyping than the previously known transportation algorithm, while still guaranteeing global optimality. This improvement in algorithm efficiency is made possible by first casting chromosome karyotyping into a problem of optimal assignment and then exploiting the sparsity of the assignment problem due to the inherent properties of chromosome data.

Globally optimal classification and pairing of human chromosomes.

We investigate globally optimal algorithms for automated classification and pairing of human chromosomes. Even in cases where the cell data are incomplete as often encountered in practice, we can still formulate the problem as a transportation problem, and hence find the globally optimal solution in polynomial time. In addition, we propose a technique of homologue pairing via maximum-weight graph matching.

On multirate optimality of JPEG2000 code stream.

Arguably, the most important and defining feature of the JPEG2000 image compression standard is its R-D optimized code stream of multiple progressive layers. This code stream is an interleaving of many scalable code streams of different sample blocks. In this paper, we reexamine the R-D optimality of JPEG2000 scalable code streams under an expected multirate distortion measure (EMRD), which is defined to be the average distortion weighted by a probability distribution of operational rates in a given range, rather than for one or few fixed rates.