The real-time speech hiding is to hide the secret speech into a cover speech in real-time communication systems. By hiding one secret speech into the cover speech, we can get a stego speech, which sounds meaningful and indistinguishable from the original cover speech. Therefore, even if the attackers catch the audio packets on Internet, they would not notice that there is another speech hidden inside it. In this paper, we propose a scheme for speech hiding in a real-time communication system such as voice over Internet Protocol (VoIP). We propose a novel design of real-time speech hiding for G.711 codec, which is widely supported by almost every VoIP device. Experimental results show that the processing time for the proposed algorithm takes only 0.257 ms, which is suitable for real-time VoIP applications.
{"title":"Information Hiding in Real-Time VoIP Streams","authors":"Chung-Yi Wang, Quincy Wu","doi":"10.1109/ISM.2007.33","DOIUrl":"https://doi.org/10.1109/ISM.2007.33","url":null,"abstract":"The real-time speech hiding is to hide the secret speech into a cover speech in real-time communication systems. By hiding one secret speech into the cover speech, we can get a stego speech, which sounds meaningful and indistinguishable from the original cover speech. Therefore, even if the attackers catch the audio packets on Internet, they would not notice that there is another speech hidden inside it. In this paper, we propose a scheme for speech hiding in a real-time communication system such as voice over Internet Protocol (VoIP). We propose a novel design of real-time speech hiding for G.711 codec, which is widely supported by almost every VoIP device. Experimental results show that the processing time for the proposed algorithm takes only 0.257 ms, which is suitable for real-time VoIP applications.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132553874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate issues associated with the transporting of multimedia streams across wireless sensor networks. We developed a prototype wireless sensor device that is capable of streaming video data through its wireless interface. Our experiments results showed that wireless sensor networks perform poorly with existing networking stack for such applications due to long delivery path and small transmission buffer sizes on the relaying nodes. The effect of a poor link often propagates backwards upstream and causes unnecessary data retransmission. To overcome these problems, we proposed a pipelined transmission scheme with a novel flow control method that monitors local buffer levels. A secondary buffer scheme is also used to reduce the retransmission overhead caused by node failure. Simulation results show that the proposed scheme significantly increase the network efficiency. We also propose a novel stochastic route discovery algorithm for multiple video stream in wireless sensor networks. Our method uses a probing stage where possible routes are explored and their delivery performance recorded. The data collected during the probing stage are used to select the final routes.
{"title":"Supporting Video Data in Wireless Sensor Networks","authors":"Ju Wang, M. Masilela, Jonathan C. L. Liu","doi":"10.1109/ISM.2007.42","DOIUrl":"https://doi.org/10.1109/ISM.2007.42","url":null,"abstract":"In this paper, we investigate issues associated with the transporting of multimedia streams across wireless sensor networks. We developed a prototype wireless sensor device that is capable of streaming video data through its wireless interface. Our experiments results showed that wireless sensor networks perform poorly with existing networking stack for such applications due to long delivery path and small transmission buffer sizes on the relaying nodes. The effect of a poor link often propagates backwards upstream and causes unnecessary data retransmission. To overcome these problems, we proposed a pipelined transmission scheme with a novel flow control method that monitors local buffer levels. A secondary buffer scheme is also used to reduce the retransmission overhead caused by node failure. Simulation results show that the proposed scheme significantly increase the network efficiency. We also propose a novel stochastic route discovery algorithm for multiple video stream in wireless sensor networks. Our method uses a probing stage where possible routes are explored and their delivery performance recorded. The data collected during the probing stage are used to select the final routes.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vector quantization (VQ) is a simple and widely used compression technology in many applications. For image compression, VQ provides both a fixed compression ratio and maintains acceptable distortion. However, the performance of VQ still can be improved in terms of the image quality of compressed images and codebook size used for encoding and decoding. In this paper, a new VQ-like image compression method is proposed to improve the performance of traditional VQ by using locally adaptive coding concept. The experimental results confirm that the image quality of the compressed image offered by the proposed method is higher than 30 dB on average, and the number of codewords used in our codebook is less than that required by traditional VQ.
{"title":"A New Image Compression Scheme Based on Locally Adaptive Coding","authors":"Chinchen Chang, Yung-Chen Chou, Chia-Chen Lin","doi":"10.1109/ISM.2007.49","DOIUrl":"https://doi.org/10.1109/ISM.2007.49","url":null,"abstract":"Vector quantization (VQ) is a simple and widely used compression technology in many applications. For image compression, VQ provides both a fixed compression ratio and maintains acceptable distortion. However, the performance of VQ still can be improved in terms of the image quality of compressed images and codebook size used for encoding and decoding. In this paper, a new VQ-like image compression method is proposed to improve the performance of traditional VQ by using locally adaptive coding concept. The experimental results confirm that the image quality of the compressed image offered by the proposed method is higher than 30 dB on average, and the number of codewords used in our codebook is less than that required by traditional VQ.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114643694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wavelet coding has been shown to be better than discrete cosine transform (DCT) in image/video processing. Moreover, it has the feature of scalability, which is involved in modern video standards. This work presents novel algorithms, namely 2-D symmetric mask-based discrete wavelet transform (SMDWT), to improve the critical issue of the 2-D lifting-based discrete wavelet transform (LDWT), and then obtains the benefit of low latency, high-speed operation, and low temporal memory. The SMDWT also has the advantages of high-performance embedded periodic extension boundary treatment, reduced complexity, regular signal coding, short critical path, reduced latency time, and independent subband coding processing. Moreover, the 2-D lifting-based DWT performance can also be easily improved by exploiting appropriate parallel method inherently in SMDWT. Comparing with the normal 2-D 5/3 integer lifting-based DWT the proposed method significantly improves lifting-based latency and complexity in 2-D DWT without degradation in image quality. The algorithm can be applied to real-time image/video applications, such as JPEG2000, MPEG-4 still texture object decoding, and wavelet-based Scalable Video Coding (SVC).
{"title":"Complexity Reduction and Fast Algorithm for 2-D Integer Discrete Wavelet Transform Using Symmetric Mask-Based Scheme","authors":"Chih-Hsien Hsia, Jing-Ming Guo, Jen-Shiun Chiang","doi":"10.1109/ISM.2007.27","DOIUrl":"https://doi.org/10.1109/ISM.2007.27","url":null,"abstract":"Wavelet coding has been shown to be better than discrete cosine transform (DCT) in image/video processing. Moreover, it has the feature of scalability, which is involved in modern video standards. This work presents novel algorithms, namely 2-D symmetric mask-based discrete wavelet transform (SMDWT), to improve the critical issue of the 2-D lifting-based discrete wavelet transform (LDWT), and then obtains the benefit of low latency, high-speed operation, and low temporal memory. The SMDWT also has the advantages of high-performance embedded periodic extension boundary treatment, reduced complexity, regular signal coding, short critical path, reduced latency time, and independent subband coding processing. Moreover, the 2-D lifting-based DWT performance can also be easily improved by exploiting appropriate parallel method inherently in SMDWT. Comparing with the normal 2-D 5/3 integer lifting-based DWT the proposed method significantly improves lifting-based latency and complexity in 2-D DWT without degradation in image quality. The algorithm can be applied to real-time image/video applications, such as JPEG2000, MPEG-4 still texture object decoding, and wavelet-based Scalable Video Coding (SVC).","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Feature aggregation is a critical technique in content- based image retrieval systems that employ multiple visual features to characterize image content. In this paper, the p-norm is introduced to feature aggregation that provides a framework to unify various previous feature aggregation schemes such as linear combination, Euclidean distance, Boolean logic and decision fusion schemes in which previous schemes are instances. Some insights of the mechanism of how various aggregation schemes work are discussed through the effects of model parameters in the unified framework. Experiments show that performances vary over feature aggregation schemes that necessitates an unified framework in order to optimize the retrieval performance according to individual queries and user query concept. Revealing experimental results conducted with IAPR TC-12 ImageCLEF2006 benchmark collection that contains over 20,000 photographic images are presented and discussed.
{"title":"An Unified Framework Based on p-Norm for Feature Aggregation in Content-Based Image Retrieval","authors":"Jun Zhang, Lei Ye","doi":"10.1109/ISM.2007.22","DOIUrl":"https://doi.org/10.1109/ISM.2007.22","url":null,"abstract":"Feature aggregation is a critical technique in content- based image retrieval systems that employ multiple visual features to characterize image content. In this paper, the p-norm is introduced to feature aggregation that provides a framework to unify various previous feature aggregation schemes such as linear combination, Euclidean distance, Boolean logic and decision fusion schemes in which previous schemes are instances. Some insights of the mechanism of how various aggregation schemes work are discussed through the effects of model parameters in the unified framework. Experiments show that performances vary over feature aggregation schemes that necessitates an unified framework in order to optimize the retrieval performance according to individual queries and user query concept. Revealing experimental results conducted with IAPR TC-12 ImageCLEF2006 benchmark collection that contains over 20,000 photographic images are presented and discussed.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120993850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Internet evolution has been requiring the development of new technology to support multimedia transmission such as images, database access, audio and video in realtime. Such development needs new services and supports like the voice over IP (VoIP) which has a main motivation in the low cost communication and management. VoIP systems have motivated this work which proposes an adaptive audio quantizer named IQ (intervalar quantizer) to reduce the data dimensionality and consequently the entropy, what allows better audio compression. This quantizer is adaptive because it has an error tolerance parameter which can be varied according to the available network bandwidth, allowing to adapt communication. After transmitting, the audio is improved by using a filter with complex poles in the Z plan. This filter attenuates non-important frequencies, privileging the sensitive ones to human audition. Results confirm that IQ and the filter offer good quality (measured using the mean opinion score metrics) and compress ratio.
{"title":"An Adaptive Audio Quantizer for Voip Systems","authors":"Ricardo Bertagna, R. Mello, L. Yang","doi":"10.1109/ISM.2007.32","DOIUrl":"https://doi.org/10.1109/ISM.2007.32","url":null,"abstract":"The Internet evolution has been requiring the development of new technology to support multimedia transmission such as images, database access, audio and video in realtime. Such development needs new services and supports like the voice over IP (VoIP) which has a main motivation in the low cost communication and management. VoIP systems have motivated this work which proposes an adaptive audio quantizer named IQ (intervalar quantizer) to reduce the data dimensionality and consequently the entropy, what allows better audio compression. This quantizer is adaptive because it has an error tolerance parameter which can be varied according to the available network bandwidth, allowing to adapt communication. After transmitting, the audio is improved by using a filter with complex poles in the Z plan. This filter attenuates non-important frequencies, privileging the sensitive ones to human audition. Results confirm that IQ and the filter offer good quality (measured using the mean opinion score metrics) and compress ratio.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mobility especially the flexibility given to us by the mobile phone is the future of computing as we know it. No longer are we restricted to sitting at a desk in front of a powerful desktop machine. Mobile technology of today allows users to work, learn and play no matter where they may be. Wireless technology is becoming more and more a standard feature of computing, so much so that it is expected that approximately two billion Bluetooth enabled devices will have been produced by the end of 2007. This paper examines how Bluetooth application development may be simplified for the programmer by use of the mobile message passing interface (MMPI). It explores a selection of application areas that can benefit from this simplified means of wireless inter-device communication, including: compute intensive tasks, mobile learning and multi-player gaming.
{"title":"Multiuser Mobile Multimedia","authors":"D. Doolan, S. Tabirca, L. Yang","doi":"10.1109/ISM.2007.34","DOIUrl":"https://doi.org/10.1109/ISM.2007.34","url":null,"abstract":"Mobility especially the flexibility given to us by the mobile phone is the future of computing as we know it. No longer are we restricted to sitting at a desk in front of a powerful desktop machine. Mobile technology of today allows users to work, learn and play no matter where they may be. Wireless technology is becoming more and more a standard feature of computing, so much so that it is expected that approximately two billion Bluetooth enabled devices will have been produced by the end of 2007. This paper examines how Bluetooth application development may be simplified for the programmer by use of the mobile message passing interface (MMPI). It explores a selection of application areas that can benefit from this simplified means of wireless inter-device communication, including: compute intensive tasks, mobile learning and multi-player gaming.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130080622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a open-source system for low- latency video streaming on PDAs, specifically addressing mobile video surveillance requirements. The system is based on H.264 and suitably modified to obtain the best trade-off between image quality and video fluidity, working also at very limited bandwidths. Moreover, the used controls allow to keep the number of lost frames very low. A large set of experiments and comparisons have been carried out and the achieved results demonstrate the efficacy and efficiency of our system.
{"title":"An Open Source Architecture for Low-Latency Video Streaming on PDAs","authors":"Giovanni Gualdi, A. Prati, R. Cucchiara","doi":"10.1109/ISM.2007.25","DOIUrl":"https://doi.org/10.1109/ISM.2007.25","url":null,"abstract":"This paper presents a open-source system for low- latency video streaming on PDAs, specifically addressing mobile video surveillance requirements. The system is based on H.264 and suitably modified to obtain the best trade-off between image quality and video fluidity, working also at very limited bandwidths. Moreover, the used controls allow to keep the number of lost frames very low. A large set of experiments and comparisons have been carried out and the achieved results demonstrate the efficacy and efficiency of our system.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125780198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The H.264 standard applies several powerful coding methods to obtain high compression efficiency. However, it requires a lot of computation especially in variable block-size motion estimation. To reduce the motion estimation redundancy more effectively, an adaptive early termination algorithm is proposed in this paper. The proposed algorithm dynamically changes the thresholds for different coding modes according to video content. With the proposed method, many zero motion blocks can be predicted, the corresponding motion estimation can stop early, and the remaining computation can be omitted. Simulation results show that the proposed method can averagely reduce the entire coding time up to 14.38% and the motion estimation time up to 21.82% at the price of negligible coding loss.
{"title":"Adaptive Early Termination for Fast H.264 Video Coding","authors":"Chung-Yen Su, Shu-Li Chang","doi":"10.1109/ISM.2007.14","DOIUrl":"https://doi.org/10.1109/ISM.2007.14","url":null,"abstract":"The H.264 standard applies several powerful coding methods to obtain high compression efficiency. However, it requires a lot of computation especially in variable block-size motion estimation. To reduce the motion estimation redundancy more effectively, an adaptive early termination algorithm is proposed in this paper. The proposed algorithm dynamically changes the thresholds for different coding modes according to video content. With the proposed method, many zero motion blocks can be predicted, the corresponding motion estimation can stop early, and the remaining computation can be omitted. Simulation results show that the proposed method can averagely reduce the entire coding time up to 14.38% and the motion estimation time up to 21.82% at the price of negligible coding loss.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127141597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiangjian He, Jianmin Li, Yan Chen, Qiang Wu, W. Jia
Local binary pattern (LBP) was designed and has been widely used for efficient texture classification. LBP provides a simple and effective way to represent texture patterns. Uniform LBPs play an important role for LBP-based pattern/object recognition as they include majority of LBPs. On the other hand, Human detection based on Mahalanobis distance map (MDM) recognizes appearance of human based on geometrical structure. Each MDM shows a clear texture pattern that can be classified using LBPs. In this paper, we compute LBPs of MDMs on a hexagonal structure. The circular pixel arrangement in hexagonal structure results in higher accuracy for LBP representation than on square structure. Chi-square as a measure is used for human detection based on uniform LBPs obtained. We show that our method using LBPs built on MDMs has a higher human detection rate and a lower false positive rate compared to the method merely based on MDMs. We will also show using experimental results that LBPs on hexagonal structure lead to more robust human classification.
{"title":"Local Binary Patterns for Human Detection on Hexagonal Structure","authors":"Xiangjian He, Jianmin Li, Yan Chen, Qiang Wu, W. Jia","doi":"10.1109/ISM.2007.19","DOIUrl":"https://doi.org/10.1109/ISM.2007.19","url":null,"abstract":"Local binary pattern (LBP) was designed and has been widely used for efficient texture classification. LBP provides a simple and effective way to represent texture patterns. Uniform LBPs play an important role for LBP-based pattern/object recognition as they include majority of LBPs. On the other hand, Human detection based on Mahalanobis distance map (MDM) recognizes appearance of human based on geometrical structure. Each MDM shows a clear texture pattern that can be classified using LBPs. In this paper, we compute LBPs of MDMs on a hexagonal structure. The circular pixel arrangement in hexagonal structure results in higher accuracy for LBP representation than on square structure. Chi-square as a measure is used for human detection based on uniform LBPs obtained. We show that our method using LBPs built on MDMs has a higher human detection rate and a lower false positive rate compared to the method merely based on MDMs. We will also show using experimental results that LBPs on hexagonal structure lead to more robust human classification.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115734920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：