This paper presents a multiple watermarking scheme for color images by using the concept of visual cryptography, wavelet tree, integer wavelet transform, and YCbCr color model. Experiment results show that all owners will have dual watermark authentication embedded in a protected color image, and the number of ownerships can be increased without re-computing. Applying the proposed four points distinguishing law, the owner's dual watermarks can be extracted more imperceptibly.
{"title":"A Multiple Watermarking Scheme for Color Images","authors":"H. Liao","doi":"10.1109/MUSIC.2012.30","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.30","url":null,"abstract":"This paper presents a multiple watermarking scheme for color images by using the concept of visual cryptography, wavelet tree, integer wavelet transform, and YCbCr color model. Experiment results show that all owners will have dual watermark authentication embedded in a protected color image, and the number of ownerships can be increased without re-computing. Applying the proposed four points distinguishing law, the owner's dual watermarks can be extracted more imperceptibly.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159074","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 describe practical implementation of a framework for development and integration of network-based humanoid robot system. The characteristics of the framework are dynamically to connect, execute and disconnect humanoid robot and service components related to the robot, and to provide simplification process about development of service components and their integration task. In addition, using an error-handling mechanism, the framework is able to recovery the components interrupted by the unexpected error. Also, the stability of the network framework is guaranteed through verification process of developed service components.
{"title":"Implementation of Network Framework for Development and Integration of Network-Based Humanoid Robot System","authors":"Joo-Hyung Kim, Ho-Dong Lee, Gwi-Tae Park, J. Park","doi":"10.1109/MUSIC.2012.51","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.51","url":null,"abstract":"In this paper, we describe practical implementation of a framework for development and integration of network-based humanoid robot system. The characteristics of the framework are dynamically to connect, execute and disconnect humanoid robot and service components related to the robot, and to provide simplification process about development of service components and their integration task. In addition, using an error-handling mechanism, the framework is able to recovery the components interrupted by the unexpected error. Also, the stability of the network framework is guaranteed through verification process of developed service components.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116386171","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}
Yanpeng Ma, Jinshu Su, Chunqing Wu, Xiaofeng Wang, Wanrong Yu, Bao-kang Zhao, Xiaofeng Hu
Satellites can broadcast datagram over a wide area, even to the areas that cannot be well served by the existing terrestrial infrastructures. Therefore, it is a hot research topic about how to multicast datagram over satellites. Low Earth Orbit (LEO) satellites have short round-trip delay and low power consumption, it will be an essential part of future multimedia communication application. In this paper, we proposed a multicast routing for LEO satellite constellation networks with high performance. The algorithm uses the group members' geographic information to route multicast packets, with less memory, computer power and signaling overhead. Through simulation we evaluate the delay and performance of our algorithm.
{"title":"A Source-Based Share-Tree Like Multicast Routing in Satellite Constellation Networks","authors":"Yanpeng Ma, Jinshu Su, Chunqing Wu, Xiaofeng Wang, Wanrong Yu, Bao-kang Zhao, Xiaofeng Hu","doi":"10.1109/MUSIC.2012.49","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.49","url":null,"abstract":"Satellites can broadcast datagram over a wide area, even to the areas that cannot be well served by the existing terrestrial infrastructures. Therefore, it is a hot research topic about how to multicast datagram over satellites. Low Earth Orbit (LEO) satellites have short round-trip delay and low power consumption, it will be an essential part of future multimedia communication application. In this paper, we proposed a multicast routing for LEO satellite constellation networks with high performance. The algorithm uses the group members' geographic information to route multicast packets, with less memory, computer power and signaling overhead. Through simulation we evaluate the delay and performance of our algorithm.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"4 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114127865","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}
Offset assignment (OA) is a highly effective address code optimization technique for embedded processors with limited memory. Modify registers (MRs) concern the offset difference of address code for offset assignment (OA) problems. Address registers (ARs) concern the assignment of program variables for general offset assignment (GOA) problems. This paper proposes a novel MRs and ARs assignment technique for SOA and GOA problems based on specialized DSPs Address Generation Units (AGU) machines. A technique to reduce the number of distinct offset difference so as to reduce the modify register assignment instructions was proposed for SOA and during GOA such that the cost is further reduced. An adjustable ARs assignment technique was proposed to reduce the GOA cost and the number of distinct offset difference during GOA. Our experiments show the reduction of the number of distinct offset difference during GOA can also help to improve the GOA cost.
{"title":"An Adjustable Heuristic for Offset Assignment Problems in Embedded System Design","authors":"Tong-Chai Wang","doi":"10.1109/MUSIC.2012.19","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.19","url":null,"abstract":"Offset assignment (OA) is a highly effective address code optimization technique for embedded processors with limited memory. Modify registers (MRs) concern the offset difference of address code for offset assignment (OA) problems. Address registers (ARs) concern the assignment of program variables for general offset assignment (GOA) problems. This paper proposes a novel MRs and ARs assignment technique for SOA and GOA problems based on specialized DSPs Address Generation Units (AGU) machines. A technique to reduce the number of distinct offset difference so as to reduce the modify register assignment instructions was proposed for SOA and during GOA such that the cost is further reduced. An adjustable ARs assignment technique was proposed to reduce the GOA cost and the number of distinct offset difference during GOA. Our experiments show the reduction of the number of distinct offset difference during GOA can also help to improve the GOA cost.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126980777","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}
Since the number of electric power assets is huge and most of them are expensive, it is a great challenge for power enterprises to know each change of assets when replaced or repaired. Moreover, power asset localization is a growing practice in application, so it is important to acquire the device's current location. Thus, this article proposed a new power asset localization scheme, employing ZigBee technology for networking and high-precision LLA algorithm for positioning. Experimental results show that the scheme achieves high accuracy flexibly and controls equipment status in real time, ensuring the assets' security.
{"title":"An Electric Power Asset Localization Scheme Based on LLA and ZigBee","authors":"Ruixue Li, Jianming Liu, Xiangzhen Li","doi":"10.1109/MUSIC.2012.48","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.48","url":null,"abstract":"Since the number of electric power assets is huge and most of them are expensive, it is a great challenge for power enterprises to know each change of assets when replaced or repaired. Moreover, power asset localization is a growing practice in application, so it is important to acquire the device's current location. Thus, this article proposed a new power asset localization scheme, employing ZigBee technology for networking and high-precision LLA algorithm for positioning. Experimental results show that the scheme achieves high accuracy flexibly and controls equipment status in real time, ensuring the assets' security.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133826283","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 propose a location-based large-scale landmark image recognition scheme for mobile devices such as smart phones. To achieve this goal, we collected landmark images all around the world, which were available on the web. For each landmark, we detected interest points and constructed their feature descriptors using SURF. Next, we performed a statistical analysis on the local features to select representative points among them. Intuitively, the representative points of an object are the interest points that best characterize the object. Similar representative points are merged for filtering and fast matching purposes. These points are indexed using an R-tree based on GPS information. Our scheme is based on client-server architecture. When the user takes a picture of a landmark using a mobile device, the client module on the mobile device extracts the local features from the image and sends them to the server, along with location and other sensor data. For the query, the server searches its index using the location data first to find nearby landmarks and then compares their local features. Matched landmark images are sent back to the client. We implemented a prototype system and performed various experiments. Through experiments, we showed that our scheme achieves reasonable performance.
{"title":"Location-Based Large-Scale Landmark Image Recognition Scheme for Mobile Devices","authors":"Daehoon Kim, Eenjun Hwang, Seungmin Rho","doi":"10.1109/MUSIC.2012.16","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.16","url":null,"abstract":"In this paper, we propose a location-based large-scale landmark image recognition scheme for mobile devices such as smart phones. To achieve this goal, we collected landmark images all around the world, which were available on the web. For each landmark, we detected interest points and constructed their feature descriptors using SURF. Next, we performed a statistical analysis on the local features to select representative points among them. Intuitively, the representative points of an object are the interest points that best characterize the object. Similar representative points are merged for filtering and fast matching purposes. These points are indexed using an R-tree based on GPS information. Our scheme is based on client-server architecture. When the user takes a picture of a landmark using a mobile device, the client module on the mobile device extracts the local features from the image and sends them to the server, along with location and other sensor data. For the query, the server searches its index using the location data first to find nearby landmarks and then compares their local features. Matched landmark images are sent back to the client. We implemented a prototype system and performed various experiments. Through experiments, we showed that our scheme achieves reasonable performance.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720624","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}
Multipath routing has been proved effective in mobile ad-hoc networks (MANETs) for coping with link failures resulting from node mobility. In wireless mesh networks (WMNs) where routers are generally static, the traffic carried by the backup paths may adversely impact other flows and the multicast group itself, because these paths increase the number of transmissions and thus the level of interference and congestion in the network. This impact, however, has not been examined, especially for multicast routing. We present simulation results that quantify the impact of data overhead of multicast multipath routing compared with single-path routing.
{"title":"Data Overhead Impact of Multipath Routing for Multicast in Wireless Mesh Networks","authors":"Yi Zheng, U. T. Nguyen, Hoang Lan Nguyen","doi":"10.1109/MUSIC.2012.34","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.34","url":null,"abstract":"Multipath routing has been proved effective in mobile ad-hoc networks (MANETs) for coping with link failures resulting from node mobility. In wireless mesh networks (WMNs) where routers are generally static, the traffic carried by the backup paths may adversely impact other flows and the multicast group itself, because these paths increase the number of transmissions and thus the level of interference and congestion in the network. This impact, however, has not been examined, especially for multicast routing. We present simulation results that quantify the impact of data overhead of multicast multipath routing compared with single-path routing.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115650128","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}
Proxies can be used as gateways between remote resources and mobile devices to deal with the challenges resulted from disconnections and the limited resources of mobile devices. This paper describes a proxy-based infrastructure that provides proxy services to support mobile device applications. Proxy services can be thought of as a library of functions where the functions execute on a proxy and serve as a bridge between client application on the mobile device and remote services. The infrastructure allows for a dynamic association of a proxy with a mobile device that takes into account the proximity between the mobile device and proxy and the mobility of the client mobile device. Furthermore, proxies are chosen dynamically and the services provided by a proxy are dynamically changing based on the requirements of the clients for a better resource utilization. Several experiments are carried out to evaluate the effectiveness of the proposed infrastructure. The results suggest that the services offered by the proxy can be used for quick recovery after disconnections with only the minimal addition of overhead.
{"title":"A Proxy-Based Mobile Computing Infrastructure","authors":"Azade Khalaj, H. Lutfiyya, M. Perry","doi":"10.1109/MUSIC.2012.12","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.12","url":null,"abstract":"Proxies can be used as gateways between remote resources and mobile devices to deal with the challenges resulted from disconnections and the limited resources of mobile devices. This paper describes a proxy-based infrastructure that provides proxy services to support mobile device applications. Proxy services can be thought of as a library of functions where the functions execute on a proxy and serve as a bridge between client application on the mobile device and remote services. The infrastructure allows for a dynamic association of a proxy with a mobile device that takes into account the proximity between the mobile device and proxy and the mobility of the client mobile device. Furthermore, proxies are chosen dynamically and the services provided by a proxy are dynamically changing based on the requirements of the clients for a better resource utilization. Several experiments are carried out to evaluate the effectiveness of the proposed infrastructure. The results suggest that the services offered by the proxy can be used for quick recovery after disconnections with only the minimal addition of overhead.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121219564","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 proposes an indoor positioning algorithm, WBI based on WiFi Received Signal Strength (RSS) technology in conjunction with trilateration techniques. The WBI algorithm estimates the location using RSS values previously collected from within the area of interest, determine whether it falls within the Min-Max bounding box, corrects for non-line-of-sight propagation effects on positioning errors using Kalman filtering, and finally update the location estimation using Least Square Estimation (LSE). The paper analyzes the complexity of the proposed algorithm and compares its performance against existing algorithms. Furthermore, the proposed WBI algorithm was able to achieve an average accuracy of 2.6 m.
{"title":"Evaluation of WiFi-Based Indoor (WBI) Positioning Algorithm","authors":"Ahed Aboodi, T. Wan","doi":"10.1109/MUSIC.2012.52","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.52","url":null,"abstract":"This paper proposes an indoor positioning algorithm, WBI based on WiFi Received Signal Strength (RSS) technology in conjunction with trilateration techniques. The WBI algorithm estimates the location using RSS values previously collected from within the area of interest, determine whether it falls within the Min-Max bounding box, corrects for non-line-of-sight propagation effects on positioning errors using Kalman filtering, and finally update the location estimation using Least Square Estimation (LSE). The paper analyzes the complexity of the proposed algorithm and compares its performance against existing algorithms. Furthermore, the proposed WBI algorithm was able to achieve an average accuracy of 2.6 m.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126111523","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}
Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.
{"title":"A Privacy-Preserving Biometric Matching Protocol for Iris Codes Verification","authors":"Kok-Seng Wong, M. Kim","doi":"10.1109/MUSIC.2012.28","DOIUrl":"https://doi.org/10.1109/MUSIC.2012.28","url":null,"abstract":"Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026307","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
扫码关注我们
求助内容：
应助结果提醒方式：