Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444843
Wei Wu, N. Wu, Ju Ren, Huayou Su, M. Wen, Chunyuan Zhang
H.264/AVC significantly outperforms the previous video coding standards at the expense of a higher computational complexity. The complexity is even higher when H.264/AVC is used in applications with high bandwidth and high quality like real-time encoding of HD (High-Definition) video. However, the stream architecture such as STORM processor provides a powerful mechanism to achieve high performance in media processing and signal processing. In this paper, we describe a streaming implementation of HD H.264/AVC encoder on STORM processor. Based on the reference code's features, we proposed a suitable streaming method for every major process in H.264/AVC encoder. The experimental results show that our streaming implementation on STORM-SP16 G220 achieves the performance of 30.6 fps (frames per second) for a HDTV 1080P (1920×1080) sequence, satisfying the real-time requirement.
{"title":"A streaming implementation of HD H.264/AVC encoder on STORM processor","authors":"Wei Wu, N. Wu, Ju Ren, Huayou Su, M. Wen, Chunyuan Zhang","doi":"10.1109/MCIT.2010.5444843","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444843","url":null,"abstract":"H.264/AVC significantly outperforms the previous video coding standards at the expense of a higher computational complexity. The complexity is even higher when H.264/AVC is used in applications with high bandwidth and high quality like real-time encoding of HD (High-Definition) video. However, the stream architecture such as STORM processor provides a powerful mechanism to achieve high performance in media processing and signal processing. In this paper, we describe a streaming implementation of HD H.264/AVC encoder on STORM processor. Based on the reference code's features, we proposed a suitable streaming method for every major process in H.264/AVC encoder. The experimental results show that our streaming implementation on STORM-SP16 G220 achieves the performance of 30.6 fps (frames per second) for a HDTV 1080P (1920×1080) sequence, satisfying the real-time requirement.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126174245","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444869
M. Shaqfeh, W. Mesbah, H. Alnuweiri
We consider a multimedia transmission scheme that is based on the combination of layered source coding with successive refinement and on using a broadcast strategy to send the layers over Rayleigh fading channels. We optimize the power allocated to each layer in order to maximize the average user satisfaction defined by a utility function of the total decoded rate. This optimization problem is non-convex, and hence difficult to solve. However, in this paper, we build up on our recently proposed mathematical framework, and we describe, as the main contribution, an efficient algorithm to solve this problem. Using numerical examples, we show that significant gains in the outage probability can be achieved by applying our proposed algorithm.
{"title":"Optimal power allocation for layered multimedia transmission via broadcast over rayleigh fading channels","authors":"M. Shaqfeh, W. Mesbah, H. Alnuweiri","doi":"10.1109/MCIT.2010.5444869","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444869","url":null,"abstract":"We consider a multimedia transmission scheme that is based on the combination of layered source coding with successive refinement and on using a broadcast strategy to send the layers over Rayleigh fading channels. We optimize the power allocated to each layer in order to maximize the average user satisfaction defined by a utility function of the total decoded rate. This optimization problem is non-convex, and hence difficult to solve. However, in this paper, we build up on our recently proposed mathematical framework, and we describe, as the main contribution, an efficient algorithm to solve this problem. Using numerical examples, we show that significant gains in the outage probability can be achieved by applying our proposed algorithm.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128308699","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444871
Vijay R Ayangar, S. Talbar
As watermarking is identified as a major technology to achieve copyright protection, the relevant literature includes several distinct approaches for embedding data into a multimedia element. Because of its growing popularity, the Discrete Wavelet Transform (DWT) is commonly used in recent watermarking schemes. In a DWT-based scheme, the DWT coefficients are modified with the data that represents the watermark. In this paper, we present a scheme based on DWT and Singular Value Decomposition (SVD). After decomposing the cover image into four bands (LL, HL, LH, and HH), we apply the SVD to watermark, and modify DWT coefficients of the cover image with the singular values of the visual watermark. Modification in all frequencies allows the development of a watermarking scheme that is robust to a wide range of attacks.
{"title":"A novel DWT-SVD based watermarking scheme","authors":"Vijay R Ayangar, S. Talbar","doi":"10.1109/MCIT.2010.5444871","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444871","url":null,"abstract":"As watermarking is identified as a major technology to achieve copyright protection, the relevant literature includes several distinct approaches for embedding data into a multimedia element. Because of its growing popularity, the Discrete Wavelet Transform (DWT) is commonly used in recent watermarking schemes. In a DWT-based scheme, the DWT coefficients are modified with the data that represents the watermark. In this paper, we present a scheme based on DWT and Singular Value Decomposition (SVD). After decomposing the cover image into four bands (LL, HL, LH, and HH), we apply the SVD to watermark, and modify DWT coefficients of the cover image with the singular values of the visual watermark. Modification in all frequencies allows the development of a watermarking scheme that is robust to a wide range of attacks.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129540204","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444868
Qilei Bian, W. Ajib
To improve the system performances of wireless ad hoc networks, researchers have proposed many approaches including the use of directional antennas and power control mechanisms. However, most of these works consider only directional transmission, while directional antennas could be used for both transmitting and receiving. Moreover, there is a lack of work that evaluates the impact of power control in heterogeneous ad hoc networks where directional antennas are partially deployed. In this paper, we propose a power controlled directional MAC protocol which enables both directional transmission and reception of all control and data packets. We evaluate our protocol in heterogeneous ad hoc scenario and show how much performance enhancement can be achieved as a result of using both directional antennas and power control.
{"title":"Performance improvement of ad hoc networks using directional antennas and power control","authors":"Qilei Bian, W. Ajib","doi":"10.1109/MCIT.2010.5444868","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444868","url":null,"abstract":"To improve the system performances of wireless ad hoc networks, researchers have proposed many approaches including the use of directional antennas and power control mechanisms. However, most of these works consider only directional transmission, while directional antennas could be used for both transmitting and receiving. Moreover, there is a lack of work that evaluates the impact of power control in heterogeneous ad hoc networks where directional antennas are partially deployed. In this paper, we propose a power controlled directional MAC protocol which enables both directional transmission and reception of all control and data packets. We evaluate our protocol in heterogeneous ad hoc scenario and show how much performance enhancement can be achieved as a result of using both directional antennas and power control.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129413258","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444858
Masaki Kobayashi, K. Kameyama
In content-based image retrieval (CBIR), the apparent color of objects are strongly influenced by the illumination variation, and this may affect retrieval results adversely. In this work, we propose a framework which can find partial object matchings by using illumination invariant local features, and have achieved image retrieval robust to apparent color changes. Additionally, partial similarities to query images such as logos and trademarks under different illumination conditions were sought, and the system's robustness to apparent color changes were verified.
{"title":"Partial image retrieval using SIFT based on illumination invariant features","authors":"Masaki Kobayashi, K. Kameyama","doi":"10.1109/MCIT.2010.5444858","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444858","url":null,"abstract":"In content-based image retrieval (CBIR), the apparent color of objects are strongly influenced by the illumination variation, and this may affect retrieval results adversely. In this work, we propose a framework which can find partial object matchings by using illumination invariant local features, and have achieved image retrieval robust to apparent color changes. Additionally, partial similarities to query images such as logos and trademarks under different illumination conditions were sought, and the system's robustness to apparent color changes were verified.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"19 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114089633","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444844
H. Fleyeh, D. Jomaa, M. Dougherty
This paper presents a new algorithm to segment fingerprint images. The algorithm uses four features, the global mean, the local mean, variance and coherence of the image to achieve the fingerprint segmentation. Based on these features, a rule based system is built to segment the image.
{"title":"Segmentation of low quality fingerprint images","authors":"H. Fleyeh, D. Jomaa, M. Dougherty","doi":"10.1109/MCIT.2010.5444844","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444844","url":null,"abstract":"This paper presents a new algorithm to segment fingerprint images. The algorithm uses four features, the global mean, the local mean, variance and coherence of the image to achieve the fingerprint segmentation. Based on these features, a rule based system is built to segment the image.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124744747","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444845
A. AlSukker, R. Khushaba, A. Al-Ani
Traditional k-NN classifier poses many limitations including that it does not take into account each class distribution, importance of each feature, contribution of each neighbor, and the number of instances for each class. A Differential evolution (DE) optimization technique is utilized to enhance the performance of k-NN through optimizing the metric weights of features, neighbors and classes. Several datasets are used to evaluate the performance of the proposed DE based metrics and to compare it to some k-NN variants from the literature. Practical experiments indicate that in most cases, incorporating DE in k-NN classification can provide more accurate performance.
{"title":"Optimizing the k-NN metric weights using differential evolution","authors":"A. AlSukker, R. Khushaba, A. Al-Ani","doi":"10.1109/MCIT.2010.5444845","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444845","url":null,"abstract":"Traditional k-NN classifier poses many limitations including that it does not take into account each class distribution, importance of each feature, contribution of each neighbor, and the number of instances for each class. A Differential evolution (DE) optimization technique is utilized to enhance the performance of k-NN through optimizing the metric weights of features, neighbors and classes. Several datasets are used to evaluate the performance of the proposed DE based metrics and to compare it to some k-NN variants from the literature. Practical experiments indicate that in most cases, incorporating DE in k-NN classification can provide more accurate performance.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"51 345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126154327","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444852
H. Fleyeh, Taha Khan
This paper addresses the problem of traffic sign recognition in real-time conditions. The algorithm presented in this paper is based on detecting traffic signs in life images and videos using pattern matching of the unknown sign's shape with standard shapes of the traffic signs. The pattern matching algorithm works with shape vertices rather than the whole image. This reduces the computation time which is a crucial factor to fit real-time demands. The algorithm is translation and scaling invariant. It shows high robustness as it is tested with 500 images and several videos and a recognition rate of 97% is achieved.
{"title":"Pattern matching approach towards real-time traffic sign recognition","authors":"H. Fleyeh, Taha Khan","doi":"10.1109/MCIT.2010.5444852","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444852","url":null,"abstract":"This paper addresses the problem of traffic sign recognition in real-time conditions. The algorithm presented in this paper is based on detecting traffic signs in life images and videos using pattern matching of the unknown sign's shape with standard shapes of the traffic signs. The pattern matching algorithm works with shape vertices rather than the whole image. This reduces the computation time which is a crucial factor to fit real-time demands. The algorithm is translation and scaling invariant. It shows high robustness as it is tested with 500 images and several videos and a recognition rate of 97% is achieved.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121088963","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444855
M. Schier, M. Welzl
The growing use of real-time video in wireless networks, where loss rates are high yet bandwidth and CPU power of receivers can be scarce, calls for new methods to maintain good quality when packets are dropped. These methods should ideally only involve the sender and avoid increasing the amount of data sent across the network. We introduce a scheme that satisfies these requirements by selectively retransmitting only the most important packets in case of loss based on the video content at macroblock granularity. In a Linux implementation using the DCCP protocol, we show that our mechanism outperforms content-unaware retransmission strategies such as earliest-first.
{"title":"Content-aware selective reliability for DCCP video streaming","authors":"M. Schier, M. Welzl","doi":"10.1109/MCIT.2010.5444855","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444855","url":null,"abstract":"The growing use of real-time video in wireless networks, where loss rates are high yet bandwidth and CPU power of receivers can be scarce, calls for new methods to maintain good quality when packets are dropped. These methods should ideally only involve the sender and avoid increasing the amount of data sent across the network. We introduce a scheme that satisfies these requirements by selectively retransmitting only the most important packets in case of loss based on the video content at macroblock granularity. In a Linux implementation using the DCCP protocol, we show that our mechanism outperforms content-unaware retransmission strategies such as earliest-first.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133763640","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}
Pub Date : 2010-03-02DOI: 10.1109/MCIT.2010.5444863
D. Vega, G. Din, I. Schieferdecker
The adoption of standards in eHealth domain, such as Health Level 7 (HL7) used for data representation, and Integrating Healthcare Enterprise (IHE) [4] for describing interactions between actors, is an important step in enabling healthcare systems to interoperate with each other. This paper addresses the challenges of interoperability testing of different HL7 based systems and presents a test framework based on TTCN-3 language.
{"title":"Application of TTCN-3 test language to testing information systems in eHealth domain","authors":"D. Vega, G. Din, I. Schieferdecker","doi":"10.1109/MCIT.2010.5444863","DOIUrl":"https://doi.org/10.1109/MCIT.2010.5444863","url":null,"abstract":"The adoption of standards in eHealth domain, such as Health Level 7 (HL7) used for data representation, and Integrating Healthcare Enterprise (IHE) [4] for describing interactions between actors, is an important step in enabling healthcare systems to interoperate with each other. This paper addresses the challenges of interoperability testing of different HL7 based systems and presents a test framework based on TTCN-3 language.","PeriodicalId":285648,"journal":{"name":"2010 International Conference on Multimedia Computing and Information Technology (MCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125051042","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
扫码关注我们
求助内容：
应助结果提醒方式：