Abstract
Algorithms of classifying and segmenting bit streams with different source content (such as speech, text and image, etc.) and different coding methods (such as ADPCM, (mu) -law, tiff, gif and JPEG, etc.) in a communication channel are investigated. In previous work, we focused on the separation of fixed- and variable-length coded bit streams, and the classification of two variable-length coded bit streams by using Fourier analysis and entropy feature. In this work, we consider the classification of multiple (more than two sources) compressed bit streams by using vector quantization (VQ) and Gaussian mixture modeling (GMM). The performance of the VQ and GMM techniques depend on various parameters such as the size of the codebook, the number of mixtures and the test segment length. It is demonstrated with experiments that both VQ and GMM outperform the single entropy feature. It is also shown that GMM generally outperforms VQ.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
