Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.165
C. Jin, Yu Fu, Feng Tao
In this paper we propose a conceptual framework for relational database based on secret sharing technology. We offer a technique to break the main secret into multiple parts and hide them individually in a relational database. The Lagrange Interpolating Polynomial method is used to recover the shared secret. The (k, n) threshold scheme is used to decide the minimum number of parts required to recover the secret data completely. Through deep data analysis, experimental results show how the proposed scheme can offer robust mechanism to protect data loss especially for the tuples deleting.
{"title":"The Watermarking Model for Relational Database Based on Watermarking Sharing","authors":"C. Jin, Yu Fu, Feng Tao","doi":"10.1109/IIH-MSP.2006.165","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.165","url":null,"abstract":"In this paper we propose a conceptual framework for relational database based on secret sharing technology. We offer a technique to break the main secret into multiple parts and hide them individually in a relational database. The Lagrange Interpolating Polynomial method is used to recover the shared secret. The (k, n) threshold scheme is used to decide the minimum number of parts required to recover the secret data completely. Through deep data analysis, experimental results show how the proposed scheme can offer robust mechanism to protect data loss especially for the tuples deleting.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170893","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 : 2006-12-18DOI: 10.1109/IIH-MSP.2006.137
Jinfei Wu, DongXing Qin, Hongping Yu
The optimal motion planning problem of mobile robot system with nonholonomic constraints amounts to the optimal control problem of nonlinear system. The kinematic and dynamic equations of the mobile robot can be set up according mechanical and control theory. After stepping into the problem, some shortcomings in choosing the specific genetic operator for the current used Genetic Algorithm (abbreviated as GA) have turned up. In this paper, a new method of mobile robot path planning based on the Ameliorated Genetic Algorithm (abbreviated as AGA) is presented. Compared with GA, the ameliorated one can improve system¿s motion precision with specific crossover operator of AGA operations. The effectiveness of the optimal motion planning problem of mobile robot system is demonstrated by the numerical simulation. And AGA has also been proven to have good convergence, higher operative speed and improved accuracy.
{"title":"Nonholonomic Motion Planning of Mobile Robot with Ameliorated Genetic Algorithm","authors":"Jinfei Wu, DongXing Qin, Hongping Yu","doi":"10.1109/IIH-MSP.2006.137","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.137","url":null,"abstract":"The optimal motion planning problem of mobile robot system with nonholonomic constraints amounts to the optimal control problem of nonlinear system. The kinematic and dynamic equations of the mobile robot can be set up according mechanical and control theory. After stepping into the problem, some shortcomings in choosing the specific genetic operator for the current used Genetic Algorithm (abbreviated as GA) have turned up. In this paper, a new method of mobile robot path planning based on the Ameliorated Genetic Algorithm (abbreviated as AGA) is presented. Compared with GA, the ameliorated one can improve system¿s motion precision with specific crossover operator of AGA operations. The effectiveness of the optimal motion planning problem of mobile robot system is demonstrated by the numerical simulation. And AGA has also been proven to have good convergence, higher operative speed and improved accuracy.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129922926","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 : 2006-12-18DOI: 10.1109/IIH-MSP.2006.156
T. Nakashima
The scale-invariant burstiness or self-similarity has been found in real network. Relation between self-similarity and network and/or system parameter is mainly discussed in the context of application layer, and this self-similarity is caused by the file size of Web servers or the duration of user sessions. In addition, self-similar burstiness has been characterized by the transport layer protocol. Traffic dynamics, however, are mainly generated by physical conditions such as the resource restrainment. In this paper, we have investigated self-similar property for TCP traffic under the bandwidth restrainment to make the network parameter vary using the network simulator. After analyzing the simulated results, following properties were extracted. Firstly, the packet loss rate at the boundary of releasing the restriction of bottleneck bandwidth suddenly drops from 10% to 1%. Secondly, estimated Hurst parameter depicts unstable fluctuation at over 4% packet loss rate, with linear slope at under 4% packet loss rate.
{"title":"Self-Similar Property for TCP Traffic under the Bottleneck Bandwidth Restrainment","authors":"T. Nakashima","doi":"10.1109/IIH-MSP.2006.156","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.156","url":null,"abstract":"The scale-invariant burstiness or self-similarity has been found in real network. Relation between self-similarity and network and/or system parameter is mainly discussed in the context of application layer, and this self-similarity is caused by the file size of Web servers or the duration of user sessions. In addition, self-similar burstiness has been characterized by the transport layer protocol. Traffic dynamics, however, are mainly generated by physical conditions such as the resource restrainment. In this paper, we have investigated self-similar property for TCP traffic under the bandwidth restrainment to make the network parameter vary using the network simulator. After analyzing the simulated results, following properties were extracted. Firstly, the packet loss rate at the boundary of releasing the restriction of bottleneck bandwidth suddenly drops from 10% to 1%. Secondly, estimated Hurst parameter depicts unstable fluctuation at over 4% packet loss rate, with linear slope at under 4% packet loss rate.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130630957","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}
To detect the theft of natural language text effectively, we present a novel scheme to derive birthmark from the text. Since birthmark is a unique and native characteristic of every text, a text with the same birthmark of another can be easily suspected of a copy. Ideally, birthmark should satisfy two properties: (a) credibility - independent texts must be distinguished by completely different birthmarks, and (b) resilience - birthmark should be tolerant against meaningpreserving attacks. To evaluate the effectiveness of the proposed birthmark, we conduct two experiments. The first one shows that birthmark successfully distinguishes non-copied files. In the second one, it shows that birthmark has quite good a tolerance against meaning-preserving attacks.
{"title":"Detecting the Theft of Natural Language Text Using Birthmark","authors":"Jianlong Yang, Jianmin Wang, Deyi Li","doi":"10.1109/IIH-MSP.2006.85","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.85","url":null,"abstract":"To detect the theft of natural language text effectively, we present a novel scheme to derive birthmark from the text. Since birthmark is a unique and native characteristic of every text, a text with the same birthmark of another can be easily suspected of a copy. Ideally, birthmark should satisfy two properties: (a) credibility - independent texts must be distinguished by completely different birthmarks, and (b) resilience - birthmark should be tolerant against meaningpreserving attacks. To evaluate the effectiveness of the proposed birthmark, we conduct two experiments. The first one shows that birthmark successfully distinguishes non-copied files. In the second one, it shows that birthmark has quite good a tolerance against meaning-preserving attacks.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130244724","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, a new scheme of hiding multiple secret images into the same cover image is proposed based on the orthogonal chaotic sequences and wavelet transform. Firstly, the secret images are spreaded spectrum with orthogonal pseudo-random chaotic sequences into the spreaded spectrum signals, where chaotic sequences are filtered according to their self-correlation and mutual-correlation characteristics, and they are also utilized as the keys while recovering the secret images because of their sensitivity to the initial values. Then, the secret images can be embedded into the same cover image in wavelet domain simultaneously because all the spreaded secret images are orthogonal. Different from the traditional methods, this method can not only be better in terms of imperceptibility, security and robustness, but also improve the information hidden capacity of a cover image. The experimental results show that the proposed method is able to achieve robustness, imperceptibility and authenticity in image hiding.
{"title":"A Novel Large Capacity Image Hiding Method Based on the Orthogonal Chaotic Sequences","authors":"Yaqin Zhao, Nan Zhao, Guanghui Ren, Bo Zhang","doi":"10.1109/IIH-MSP.2006.29","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.29","url":null,"abstract":"In this paper, a new scheme of hiding multiple secret images into the same cover image is proposed based on the orthogonal chaotic sequences and wavelet transform. Firstly, the secret images are spreaded spectrum with orthogonal pseudo-random chaotic sequences into the spreaded spectrum signals, where chaotic sequences are filtered according to their self-correlation and mutual-correlation characteristics, and they are also utilized as the keys while recovering the secret images because of their sensitivity to the initial values. Then, the secret images can be embedded into the same cover image in wavelet domain simultaneously because all the spreaded secret images are orthogonal. Different from the traditional methods, this method can not only be better in terms of imperceptibility, security and robustness, but also improve the information hidden capacity of a cover image. The experimental results show that the proposed method is able to achieve robustness, imperceptibility and authenticity in image hiding.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303764","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}
Chuan-Feng Lin, Jeng-Shyang Pan, Chin-Shiuh Shieh, Peng Shi
The traditional information hiding schemes embed the information into the image, audio and video etc, for the purposes of copyright protection, authentication, and authorized access control etc. In this paper, we propose to embed the data into the physical layer of the baseband Orthogonal Frequency Division Multiplexing (OFDM) wireless networks. We test the information hiding scheme in an additive white Gaussian noise (AWGN) channel. The experimental results indicate that when the number of carriers is limited and the channel SNR is high enough, the proposed information hiding scheme can work effectively, while the OFDM system can also work well as it used to be.
{"title":"An Information Hiding Scheme for OFDM Wireless Networks","authors":"Chuan-Feng Lin, Jeng-Shyang Pan, Chin-Shiuh Shieh, Peng Shi","doi":"10.1109/IIH-MSP.2006.54","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.54","url":null,"abstract":"The traditional information hiding schemes embed the information into the image, audio and video etc, for the purposes of copyright protection, authentication, and authorized access control etc. In this paper, we propose to embed the data into the physical layer of the baseband Orthogonal Frequency Division Multiplexing (OFDM) wireless networks. We test the information hiding scheme in an additive white Gaussian noise (AWGN) channel. The experimental results indicate that when the number of carriers is limited and the channel SNR is high enough, the proposed information hiding scheme can work effectively, while the OFDM system can also work well as it used to be.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123319915","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, a framework for automatic atomic human action segmentation in continuous action sequences is proposed A star figure enclosed by a bounding convex polygon is used to effectively and uniquely represent the extremities of the silhouette of a human body. Thus, human actions are recorded as a sequence of the starJigure 's parameters, which is then used for action modeling. To model human actions in a compact manner while characterizing their spatiotemporal distributions, star $@re parameters are represented by Gaussian mixture models (GMM). Experiments to evaluate the performance of the proposed framework show that it can segment continuous human actions in an eficient and effective manner.
{"title":"Atomic Human Action Segmentation Using a Spatio-Temporal Probabilistic Framework","authors":"Duan-Yu Chen, S. Shih, H. Liao","doi":"10.1109/IIH-MSP.2006.59","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.59","url":null,"abstract":"In this paper, a framework for automatic atomic human action segmentation in continuous action sequences is proposed A star figure enclosed by a bounding convex polygon is used to effectively and uniquely represent the extremities of the silhouette of a human body. Thus, human actions are recorded as a sequence of the starJigure 's parameters, which is then used for action modeling. To model human actions in a compact manner while characterizing their spatiotemporal distributions, star $@re parameters are represented by Gaussian mixture models (GMM). Experiments to evaluate the performance of the proposed framework show that it can segment continuous human actions in an eficient and effective manner.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123363625","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 : 2006-12-18DOI: 10.1109/IIH-MSP.2006.138
Chung-Chuan Wang, Chinchen Chang, J. Jan, Jieh-Shan Yeh
This paper presents two concise novel steganographic schemes of strings comparing and formats converting based on the Row-Major Mapping Relation (RMMR). In general, the number of concealed secret bits( m) is far smaller than that of available host bits(n). Based on the property, we proved that if n underline{underline > } 2^m -1, the alteration rates of our proposed schemes are independent of n, and the alteration rates are close to m-1 when m is large. Even in the worst case that the amount of the secret bits is equal to that of the host bits and over half of the host bits are altered, our proposed scheme based on the Row-Major Mapping Relation with complement (RMMRwC) can decrease the alteration rate. From practical analyses and theoretical inductions, all results show that our novel schemes have advantages over steganography.
{"title":"Novel Steganographic Schemes Based on Row-Major Mapping Relation","authors":"Chung-Chuan Wang, Chinchen Chang, J. Jan, Jieh-Shan Yeh","doi":"10.1109/IIH-MSP.2006.138","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.138","url":null,"abstract":"This paper presents two concise novel steganographic schemes of strings comparing and formats converting based on the Row-Major Mapping Relation (RMMR). In general, the number of concealed secret bits( m) is far smaller than that of available host bits(n). Based on the property, we proved that if n underline{underline > } 2^m -1, the alteration rates of our proposed schemes are independent of n, and the alteration rates are close to m-1 when m is large. Even in the worst case that the amount of the secret bits is equal to that of the host bits and over half of the host bits are altered, our proposed scheme based on the Row-Major Mapping Relation with complement (RMMRwC) can decrease the alteration rate. From practical analyses and theoretical inductions, all results show that our novel schemes have advantages over steganography.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126044612","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 visual quality of the extracted watermark is an important criterion when judging the power of watermarking scheme to protect the ownership of an image. The extracted watermark is usually damaged by the rounding operations that come in during the transformation between spatial and frequency domains. A solution for reducing the damage is not to use the rounding operations but rather some other criteria to guide each pixel value calculation through either carrying or truncation. In this article, we propose a heuristic method to enhance the quality of the extracted watermark. The image is divided into nonoverlapping blocks, and the reference coefficient data are used to modify the pixel values. Extensive experimental results show our proposed method can easily reduce the damage to the extracted watermark.
{"title":"A Heuristic Method for Extracting Enhanced Watermarks from Digital Images","authors":"Chinchen Chang, Yung-Chen Chang, Jau-Ji Shen","doi":"10.1109/IIH-MSP.2006.13","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.13","url":null,"abstract":"The visual quality of the extracted watermark is an important criterion when judging the power of watermarking scheme to protect the ownership of an image. The extracted watermark is usually damaged by the rounding operations that come in during the transformation between spatial and frequency domains. A solution for reducing the damage is not to use the rounding operations but rather some other criteria to guide each pixel value calculation through either carrying or truncation. In this article, we propose a heuristic method to enhance the quality of the extracted watermark. The image is divided into nonoverlapping blocks, and the reference coefficient data are used to modify the pixel values. Extensive experimental results show our proposed method can easily reduce the damage to the extracted watermark.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115314758","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}
Most existing watermarking protocols deal with the copyright protection as a transaction between the seller and the buyer. However, these protocols don.t appropriately resolve the copyright problem of copyright authority, copyrighter, ICP and customer. To address this issue, a new watermarking protocol proposed in this article uses three watermarks in structure. By introducing the CA, the signature and the timestamp, the protocol sets up a hiberarchy of digital copyright authorities to protect rights, defends ambiguity attacks and collusive attacks, and resolves the non-repudiation problem and CS overload problem. Because ICP and customer cannot remove the watermark from watermarked digital content, and neither the copyrighter nor the ICP can fabricate piracy, the proposed protocol can trace piracy. With the proxy signature, the digital content transaction without the Third party is performed in which there are only two participants, the seller and the buyer.
{"title":"A New Watermarking Protocol of Copyright Protection","authors":"Ru Zhang, Xiaohui Yu, Linna Zhou, Hong-peng Li","doi":"10.1109/IIH-MSP.2006.23","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.23","url":null,"abstract":"Most existing watermarking protocols deal with the copyright protection as a transaction between the seller and the buyer. However, these protocols don.t appropriately resolve the copyright problem of copyright authority, copyrighter, ICP and customer. To address this issue, a new watermarking protocol proposed in this article uses three watermarks in structure. By introducing the CA, the signature and the timestamp, the protocol sets up a hiberarchy of digital copyright authorities to protect rights, defends ambiguity attacks and collusive attacks, and resolves the non-repudiation problem and CS overload problem. Because ICP and customer cannot remove the watermark from watermarked digital content, and neither the copyrighter nor the ICP can fabricate piracy, the proposed protocol can trace piracy. With the proxy signature, the digital content transaction without the Third party is performed in which there are only two participants, the seller and the buyer.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121205331","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
扫码关注我们
求助内容：
应助结果提醒方式：