Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.427
Hao Luo, Jeng-Shyang Pan, Zhe-ming Lu
This paper proposes a scheme to hide multiple watermarks in transparencies of visual cryptography. On one hand, the main properties of the traditional visual cryptography are still maintained. On the other hand, not only the encrypted image can be visible when stacking the transparencies, but also two extra watermarks can be extracted with simple computations. The scheme can be applied to hide some affiliated information of the secret image. Experimental results demonstrate the scheme is effective and practical.
{"title":"Hiding Multiple Watermarks in Transparencies of Visual Cryptography","authors":"Hao Luo, Jeng-Shyang Pan, Zhe-ming Lu","doi":"10.1109/IIH-MSP.2007.427","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.427","url":null,"abstract":"This paper proposes a scheme to hide multiple watermarks in transparencies of visual cryptography. On one hand, the main properties of the traditional visual cryptography are still maintained. On the other hand, not only the encrypted image can be visible when stacking the transparencies, but also two extra watermarks can be extracted with simple computations. The scheme can be applied to hide some affiliated information of the secret image. Experimental results demonstrate the scheme is effective and practical.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124403493","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.273
Lien-Fa Lin
While the RNN is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcasting environment. The liner property of wireless broadcast media and power conserving requirement of mobile devices make the problem particularly interesting and challenging. In this paper, the issues involved with organizing location dependent data and answering RNN queries on air are investigated. An efficient data organization, called Jump Rdnn-tree, and the corresponding search algorithms are proposed. Performance of the proposed Jump Rdnn-tree and other traditional indexes (enhanced for wireless broadcast) is evaluated using both uniform and skew data. The results show that Jump Rdnn-tree substantially outperforms the traditional indexes.
{"title":"Search RNN on Broadcast Environment","authors":"Lien-Fa Lin","doi":"10.1109/IIH-MSP.2007.273","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.273","url":null,"abstract":"While the RNN is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcasting environment. The liner property of wireless broadcast media and power conserving requirement of mobile devices make the problem particularly interesting and challenging. In this paper, the issues involved with organizing location dependent data and answering RNN queries on air are investigated. An efficient data organization, called Jump Rdnn-tree, and the corresponding search algorithms are proposed. Performance of the proposed Jump Rdnn-tree and other traditional indexes (enhanced for wireless broadcast) is evaluated using both uniform and skew data. The results show that Jump Rdnn-tree substantially outperforms the traditional indexes.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"16 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821778","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.373
T. Pao, Charles S. Chien, Jun-Heng Yeh, Yu-Te Chen, Yun-Maw Cheng
Emotions play a significant role in decision-making, healthy, perception, human interaction and human intelligence. Automatic recognition of emotion in speech is very desirable because it adds to the human- computer interaction and becomes an important research area in the last years. However, to the best of our knowledge, no works have focused on automatic emotion tracking of continuous Mandarin emotional speech. In this paper, we present an emotion tracking system, by dividing the utterance into several independent segments, each of which contains a single emotional category. Experimental results reveal that the proposed system produces satisfactory results. On our testing database composed of 279 utterances which are obtained by concatenating short sentences, the average accuracy achieves 83% by using weighted D-KNN classifier and LPCC and MFCC features.
{"title":"Continuous Tracking of User Emotion in Mandarin Emotional Speech","authors":"T. Pao, Charles S. Chien, Jun-Heng Yeh, Yu-Te Chen, Yun-Maw Cheng","doi":"10.1109/IIH-MSP.2007.373","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.373","url":null,"abstract":"Emotions play a significant role in decision-making, healthy, perception, human interaction and human intelligence. Automatic recognition of emotion in speech is very desirable because it adds to the human- computer interaction and becomes an important research area in the last years. However, to the best of our knowledge, no works have focused on automatic emotion tracking of continuous Mandarin emotional speech. In this paper, we present an emotion tracking system, by dividing the utterance into several independent segments, each of which contains a single emotional category. Experimental results reveal that the proposed system produces satisfactory results. On our testing database composed of 279 utterances which are obtained by concatenating short sentences, the average accuracy achieves 83% by using weighted D-KNN classifier and LPCC and MFCC features.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127144366","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.331
Jia-Hong Lee, Mei-Yi Wu
An iterative method for designing efficient, simple and high-capacity lossless embedding method for BMP images with a 256-color grayscale palette is presented. The proposed method is based on a palette modification scheme, which can iteratively embed message bits into pixels with the most occurrence gray value in a BMP image. In each iteration, both the overhead of removing an entry color in the palette and the benefit of copying another entry color to replace it are calculated. If the maximal benefit exceeds the minimal overhead, an entry color is replaced. Experimental results and performance comparison with other lossless data hiding schemes are presented to show the effectiveness of the proposed method.
{"title":"An Iterative Method for Lossless Data Embedding in BMP Images","authors":"Jia-Hong Lee, Mei-Yi Wu","doi":"10.1109/IIH-MSP.2007.331","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.331","url":null,"abstract":"An iterative method for designing efficient, simple and high-capacity lossless embedding method for BMP images with a 256-color grayscale palette is presented. The proposed method is based on a palette modification scheme, which can iteratively embed message bits into pixels with the most occurrence gray value in a BMP image. In each iteration, both the overhead of removing an entry color in the palette and the benefit of copying another entry color to replace it are calculated. If the maximal benefit exceeds the minimal overhead, an entry color is replaced. Experimental results and performance comparison with other lossless data hiding schemes are presented to show the effectiveness of the proposed method.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127213125","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.254
Yongqing Ye, Qingge Ji
We present a two-level structure algorithm for real-time path planning of massive crowd. We use the first level algorithm to calculate the global path, and set a provisional target point for each virtual character. Then we use the second level algorithm to calculate the path to the provisional target point for each virtual character. As shown the simulation results, the proposed algorithm can design a collision-free path for every virtual character with a distinct goal in realtime.
{"title":"Real-Time Path Planning of Large-scale Virtual Crowd","authors":"Yongqing Ye, Qingge Ji","doi":"10.1109/IIH-MSP.2007.254","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.254","url":null,"abstract":"We present a two-level structure algorithm for real-time path planning of massive crowd. We use the first level algorithm to calculate the global path, and set a provisional target point for each virtual character. Then we use the second level algorithm to calculate the path to the provisional target point for each virtual character. As shown the simulation results, the proposed algorithm can design a collision-free path for every virtual character with a distinct goal in realtime.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"310 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127490253","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.271
Yuan-Liang Tang, Hui-Tzu Huang
Most data embedding techniques distort the original image as a side effect. To overcome such a problem, reversible data embedding is used to restore the original content after the removal of the embedded data. However, it is assumed that the embedded image is not altered and such a constraint is sometimes considered unnecessary because as long as the image can be restored to an acceptable level, moderate alteration on the embedded image should be allowed. Such a reasoning leads to a new category of techniques called near-reversible data embedding, in which the embedded image is allowed to be manipulated and the image can be restored to some extent that is very close to the original image. In this paper, a novel near-reversible data embedding algorithm is proposed based on projection histogram manipulations. The experimental results demonstrated that proposed algorithm performs very well in terms of embedding capacity, image fidelity, and robustness against common image processing operations.
{"title":"Robust Near-Reversible Data Embedding Using Histogram Projection","authors":"Yuan-Liang Tang, Hui-Tzu Huang","doi":"10.1109/IIH-MSP.2007.271","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.271","url":null,"abstract":"Most data embedding techniques distort the original image as a side effect. To overcome such a problem, reversible data embedding is used to restore the original content after the removal of the embedded data. However, it is assumed that the embedded image is not altered and such a constraint is sometimes considered unnecessary because as long as the image can be restored to an acceptable level, moderate alteration on the embedded image should be allowed. Such a reasoning leads to a new category of techniques called near-reversible data embedding, in which the embedded image is allowed to be manipulated and the image can be restored to some extent that is very close to the original image. In this paper, a novel near-reversible data embedding algorithm is proposed based on projection histogram manipulations. The experimental results demonstrated that proposed algorithm performs very well in terms of embedding capacity, image fidelity, and robustness against common image processing operations.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125023811","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.439
C. Liang, Pai-Cheng Tao, Tsai-Yen Li
Humanoid animation is one of the most common but complicated types of animation. Although more sophisticated animation packages have been developed in recent years, there is no extensible platform allowing researchers to test developed procedures for experimental purposes. In this paper, we present an experimental platform called IMHAP (Intelligent Media Lab's Humanoid Animation Platform) especially for humanoid animation generated with procedural approaches. IMHAP is constructed with a model-view- control (MVC) methodology and features flexibility and extensibility. In addition to present the architecture of the system, we also use a few lower-body motions generated with a procedural approach to demonstrate the use of the system as an experimental testbed for humanoid animation.
{"title":"IMHAP – An Experimental Platform for Humanoid Procedural Animation","authors":"C. Liang, Pai-Cheng Tao, Tsai-Yen Li","doi":"10.1109/IIH-MSP.2007.439","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.439","url":null,"abstract":"Humanoid animation is one of the most common but complicated types of animation. Although more sophisticated animation packages have been developed in recent years, there is no extensible platform allowing researchers to test developed procedures for experimental purposes. In this paper, we present an experimental platform called IMHAP (Intelligent Media Lab's Humanoid Animation Platform) especially for humanoid animation generated with procedural approaches. IMHAP is constructed with a model-view- control (MVC) methodology and features flexibility and extensibility. In addition to present the architecture of the system, we also use a few lower-body motions generated with a procedural approach to demonstrate the use of the system as an experimental testbed for humanoid animation.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125043054","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.396
Kuo-Ching Liu, Hsin-Wei Wang, Hui-Feng Huang
Radio frequency identification (RFID) is being deployed for a wide variety of applications, including supply chain management, inventory, storage, etc. However, RFID systems can have security problems if the tag offers no access control and certificated mechanisms. By utilizing responses from a tag, an adversary may try to obtain the information of the product and trace the user. In 2006, Lee et al. proposed a mutual authentication scheme based on synchronized secret information. They show their scheme offers the most enhanced security feature in RFID mutual authentication to protect a user's privacy and possesses a low computation for tags. However, we will show that Lee et al's scheme is still susceptible to a forgery attack. We also present a simple method to strengthen its security.
{"title":"Enhancement of the Mutual Authentication protocol on RFID Passive Tags","authors":"Kuo-Ching Liu, Hsin-Wei Wang, Hui-Feng Huang","doi":"10.1109/IIH-MSP.2007.396","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.396","url":null,"abstract":"Radio frequency identification (RFID) is being deployed for a wide variety of applications, including supply chain management, inventory, storage, etc. However, RFID systems can have security problems if the tag offers no access control and certificated mechanisms. By utilizing responses from a tag, an adversary may try to obtain the information of the product and trace the user. In 2006, Lee et al. proposed a mutual authentication scheme based on synchronized secret information. They show their scheme offers the most enhanced security feature in RFID mutual authentication to protect a user's privacy and possesses a low computation for tags. However, we will show that Lee et al's scheme is still susceptible to a forgery attack. We also present a simple method to strengthen its security.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125331377","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.275
Chinchen Chang, T. Kieu
Secret sharing schemes and information hiding schemes have been separately developed by many researchers over years. Some researchers have been integrated information hiding technique into their proposed secret sharing scheme with the purpose of hiding shares and authentication. However, the combination of a secret sharing scheme and an information hiding technique with high embedding capacity is not explored by researchers. This paper presents a new secret sharing and information hiding scheme by grayscale images. The proposed scheme embeds a secret image and a secret bit stream into two shadow images. The experimental results show that the proposed scheme achieves very high embedding capacity (i.e. about 3 bits per pixel). Furthermore, after the secret bit stream has been extracted, the secret image can be completely restored pixel by pixel.
{"title":"Secret Sharing and Information Hiding by Shadow Images","authors":"Chinchen Chang, T. Kieu","doi":"10.1109/IIH-MSP.2007.275","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.275","url":null,"abstract":"Secret sharing schemes and information hiding schemes have been separately developed by many researchers over years. Some researchers have been integrated information hiding technique into their proposed secret sharing scheme with the purpose of hiding shares and authentication. However, the combination of a secret sharing scheme and an information hiding technique with high embedding capacity is not explored by researchers. This paper presents a new secret sharing and information hiding scheme by grayscale images. The proposed scheme embeds a secret image and a secret bit stream into two shadow images. The experimental results show that the proposed scheme achieves very high embedding capacity (i.e. about 3 bits per pixel). Furthermore, after the secret bit stream has been extracted, the secret image can be completely restored pixel by pixel.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712972","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.351
Wen-Shiung Chen, Yao-Shan Chiang, Yen-Hsun Chiu
This paper presents a biometric recognition system with fusion of hand geometry and palmprint of a human hand based on wavelet transform and statistical moments. The feature extraction module adopts the gradient direction (i.e., angle) and quadratic spline function of wavelet transform as the discriminating texture features in palmprint, and the statistical moments calculated from hand geometry. The system generates the palmprint feature codes using a binary gray encoding. The recognition rates up to 94.17%, 95.50%, 96.67%, and 98.33%, respectively, using different feature extraction methods may be achieved.
{"title":"Biometric Verification by Fusing Hand Geometry and Palmprint","authors":"Wen-Shiung Chen, Yao-Shan Chiang, Yen-Hsun Chiu","doi":"10.1109/IIH-MSP.2007.351","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.351","url":null,"abstract":"This paper presents a biometric recognition system with fusion of hand geometry and palmprint of a human hand based on wavelet transform and statistical moments. The feature extraction module adopts the gradient direction (i.e., angle) and quadratic spline function of wavelet transform as the discriminating texture features in palmprint, and the statistical moments calculated from hand geometry. The system generates the palmprint feature codes using a binary gray encoding. The recognition rates up to 94.17%, 95.50%, 96.67%, and 98.33%, respectively, using different feature extraction methods may be achieved.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128256461","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
扫码关注我们
求助内容：
应助结果提醒方式：