{"title":"Adaptive Scheduling Based on Quality of Service in Heterogeneous Environments","authors":"Ching-Hsien Hsu, Tai-Lung Chen","doi":"10.1109/MUE.2010.5575084","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575084","url":null,"abstract":"With the emergence of grid and cloud technologies, the problem of scheduling tasks in heterogeneous distributed systems has been arousing attention. In this paper, we present two scheduling techniques for optimizing overall execution time and minimizing resource usage cost. To evaluate the effectiveness of the proposed techniques, we have implemented both techniques along with the QoS Min-Min scheduling algorithm. The experimental results show that the proposed techniques provide noticeable improvements.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585613","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}
{"title":"Mobile Museum Guidance Using Relational Multi-Image Classification","authors":"Erich Bruns, O. Bimber","doi":"10.1109/MUE.2010.5575082","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575082","url":null,"abstract":"In this paper we present a multi-image classification technique for mobile phones that is supported by relational reasoning. Users capture a sequence of images employing a simple near-far camera movement. After classifying distinct keyframes using a nearest-neighbor approach the corresponding database images are only considered for a majority voting if they exhibit similar near-far inter-image relations to the captured keyframes. In the context of PhoneGuide, our adaptive mobile museum guidance system, a user study revealed that our multi-image classification technique leads to significantly higher classification rates than single image classification. Furthermore, when using near-far image relations, less keyframes are sufficient for classification. This increases the overall classification speed of our approach by up to 35%.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122634479","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}
{"title":"Reversible Watermarking Based on Hierarchical Rectangle Block Division","authors":"Yih-Chuan Lin, Tzung-Shian Li","doi":"10.1109/MUE.2010.5575076","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575076","url":null,"abstract":"This paper is to provide a low complexity reversible watermarking algorithm that can keep a high image quality after embedding message. This algorithm improves the traditional histogram shifting method to get more embedding capacity. The idea behind the proposed algorithm is to recursively divide original image into several non-overlapped blocks of pixels and hides secret message separately into individual blocks using traditional histogram shifting method. Using the recursive division scheme, the algorithm can easily find a suitable non-overlapped partition of the image to significantly increase embedding capacity. Experimental results reveal that the proposed method can indeed provide larger embedding capacity than the traditional histogram shifting method while maintaining a high visual quality that is comparable to the traditional one without recursive block division.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122670918","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}
{"title":"The Original Similarity Extraction Mechanism for Digital Content Copyright Protection in UCC Service Environment","authors":"Eun-Gyeom Jang, Byoung-Soo Koh","doi":"10.1109/MUE.2010.5575060","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575060","url":null,"abstract":"In this paper, we proposed a mechanism that prevents indiscreet use of digital contents, verifies created content's copyrights to provide services to granted user and protects digital contents by law by authenticating the original digital content whenever an infringement of copyright occurs in UCC environments. The proposed mechanism uses specific information and features of contents as copyrights authentication information without additional information. Also, provides the fact of violation by inferring the modification of the original digital contents. That means this mechanism infers same or similar value from the contents; fraudulent use of content, modification of content color, modification of content format, modification of content resolution and illegal use of frame not principal key frame. In that point, we found that the inferred value from the content differed according to features of content modification.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553533","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}
{"title":"Dynamic Community Composing Model in Ubiquitous Computing Environment","authors":"Keonsoo Lee, Seungmin Rho, Minkoo Kim","doi":"10.1109/MUE.2010.5575052","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575052","url":null,"abstract":"One of the most important objects in IT is to enhance the convenience of human-beings. The ubiquitous computing environment, where user can access any networks without time and space restriction, is a result of aggregation of the latest technologies to provide human-beings various capabilities. In this paper, the dynamic community composing model is proposed. The role of this model is to compose a community according to a user's request. When a problem has happened and a single human cannot handle it, a group of humans need to cooperate. This group is called a community and the proposed model shows the way of composing this group which can solve the problem efficiently. For the efficiency of community, this model works based on the participants' social network, each participant's ability which is needed for resolving the problem, and the current situation of each participant. With this model, a single human can resolve a complex problem with the help of other humans using ubiquitous computing technology","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130427842","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}
{"title":"A Restorative Image Authentication Scheme with Discrimination of Tampers on Image or Watermark","authors":"Ke Ke, Tao Zhao, Ou Li","doi":"10.1109/MUE.2010.5575077","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575077","url":null,"abstract":"Most image authentication schemes in the literature are either vulnerable to vector quantization (VQ) counterfeiting attacks or sacrifice localization accuracy to improve the security. Only a few algorithms exist to take the recovery of the tampered areas into account. This motivates us to develop a novel authentication scheme for the accurate tamper localization and restoration of the tampered areas. In particular, the host image will firstly be divided into blocks, the recovery watermark of each block is embedded into another distant block selected by a key, and the localization watermark of each block is embedded into itself. During generating the localization watermarks, the sliding window is used to put resistance against VQ attack. It is the dual watermarks that can distinguish tampering watermark from that of image. Theoretical analysis and experimental results demonstrate that the watermarked image has higher quality, and what's more the position of tampered areas can be located correctly. Additionally, it can restore the tampered region effectively.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508535","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}
{"title":"Enhanced SAITD Cost Function for H.264/AVC Intra 4×4 Mode Decision","authors":"Liping Wang, L. Po, Shenyuan Li, K. Ng","doi":"10.1109/MUE.2010.5575100","DOIUrl":"https://doi.org/10.1109/MUE.2010.5575100","url":null,"abstract":"In this paper, an enhanced sum of absolute integer transform difference (ESAITD) cost function with rate predictor \"sum of non-zero coefficient frequencies\" from CAVLC-based rate estimation is proposed for Intra_4x4 mode decision in H.264/AVC. This rate predictor is using simple but significant parameter to approximate the total encoded bitrate accurately. Experimental results show that ESAITD achieves much better rate-distortion (RD) performance than sum of absolute Hadamard transform difference (SATD) cost function. It also outperforms sum of absolute integer transform difference (SAITD) cost function in medium and high bitrate. Overall, ESAITD can encode the sequences with high quality.","PeriodicalId":338911,"journal":{"name":"2010 4th International Conference on Multimedia and Ubiquitous Engineering","volume":"396 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116255693","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}