Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.267
Chiang-Lung Liu, D. Lou, Chien-Chung Lee
The general difference expansion method uses reversible integer transform to embed information into a digital image and perfectly restores the original image after removing the hidden data. In multilayer embedding applications, the operation of difference expansion may seriously degrade the visual quality of the embedded image. In this paper, we propose a reduced difference expansion method to solve this problem. Theoretically, in the worst case, the proposed method gains 6-dB improvement in visual quality of the embedded image compared with the general difference expansion method. Therefore, the proposed method is suitable for multilayer data embedding.
{"title":"Reversible Data Embedding Using Reduced Difference Expansion","authors":"Chiang-Lung Liu, D. Lou, Chien-Chung Lee","doi":"10.1109/IIH-MSP.2007.267","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.267","url":null,"abstract":"The general difference expansion method uses reversible integer transform to embed information into a digital image and perfectly restores the original image after removing the hidden data. In multilayer embedding applications, the operation of difference expansion may seriously degrade the visual quality of the embedded image. In this paper, we propose a reduced difference expansion method to solve this problem. Theoretically, in the worst case, the proposed method gains 6-dB improvement in visual quality of the embedded image compared with the general difference expansion method. Therefore, the proposed method is suitable for multilayer data embedding.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"49 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":"130910513","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}
Secret messages can be embedded in a webpage by switching the uppercase-lowercase states of letters in tags. In this paper, a novel steganalytic approach called Tag-Mismatch analysis for detection of hidden information embedded in tags is presented. In order to guarantee reasonable false positive and false negative, the approach is firstly trained on a set of 4,100 webpages to determine the decision threshold. It is shown that the length of embedded secret messages can be estimated with relatively high precision and the resulting detection algorithm is simple and fast. The experimental results show that the detection rate is larger than 85%, as the embedded rate is larger than 0.3%.
{"title":"Detection of Hidden Information in Tags of Webpage Based on Tag-Mismatch","authors":"Huajun Huang, Xingming Sun, Guang Sun, Junwei Huang","doi":"10.1109/IIH-MSP.2007.382","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.382","url":null,"abstract":"Secret messages can be embedded in a webpage by switching the uppercase-lowercase states of letters in tags. In this paper, a novel steganalytic approach called Tag-Mismatch analysis for detection of hidden information embedded in tags is presented. In order to guarantee reasonable false positive and false negative, the approach is firstly trained on a set of 4,100 webpages to determine the decision threshold. It is shown that the length of embedded secret messages can be estimated with relatively high precision and the resulting detection algorithm is simple and fast. The experimental results show that the detection rate is larger than 85%, as the embedded rate is larger than 0.3%.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"1 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":"130487151","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.285
Weitao Zheng, Zihua Zhang, Ting Liao, Tuanjie Zhao, Yong Ma
In swimming competition, a rational disposition of physical strength is seen as a major factor in deciding the final outcome. Among various items in swimming competition, the issue of physical distribution over the 400 m race has aroused the most extensive controversy. In this paper, concerning the achievements of elite athletes home and abroad in 400 m freestyle swimming race, the principle of variation coefficient in statistics has been adopted and calculation is conducted in regard to the newly-defined speed coefficient. The features and disciplines in the tactics application of those top athletes are analyzed from a new angle about the adoption of phase speed pattern. It is hopeful that this paper could provide some valuable suggestions about the puzzle of physical distribution over the swimming competitions for swimming coaches in the process of their instruction.
{"title":"Study on the Division Tactics of Top Swimming Athletes Home and Abroad in the 400m Freestyle Swimming Race","authors":"Weitao Zheng, Zihua Zhang, Ting Liao, Tuanjie Zhao, Yong Ma","doi":"10.1109/IIH-MSP.2007.285","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.285","url":null,"abstract":"In swimming competition, a rational disposition of physical strength is seen as a major factor in deciding the final outcome. Among various items in swimming competition, the issue of physical distribution over the 400 m race has aroused the most extensive controversy. In this paper, concerning the achievements of elite athletes home and abroad in 400 m freestyle swimming race, the principle of variation coefficient in statistics has been adopted and calculation is conducted in regard to the newly-defined speed coefficient. The features and disciplines in the tactics application of those top athletes are analyzed from a new angle about the adoption of phase speed pattern. It is hopeful that this paper could provide some valuable suggestions about the puzzle of physical distribution over the swimming competitions for swimming coaches in the process of their instruction.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"27 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":"125344804","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.411
Jiadong Ren, Ke Li
Frequent pattern mining is fundamental to many important data mining tasks. Many researchers had presented many mining methods in static database. Due to many special characters of data stream, those methods fail to be used in dynamic environment. We develop a novel method mining frequent items from data stream based on sliding window model. We use some compact data structures which make uses of the limited space efficiently. The proposed method is an approximate algorithm, it can eliminate the influence of old data to mined result. And the mined results are kept in a heap. This data structure is seldom used in other methods, and the mined results can be inquired by top-k.
{"title":"Find Recent Frequent Items with Sliding Windows in Data Streams","authors":"Jiadong Ren, Ke Li","doi":"10.1109/IIH-MSP.2007.411","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.411","url":null,"abstract":"Frequent pattern mining is fundamental to many important data mining tasks. Many researchers had presented many mining methods in static database. Due to many special characters of data stream, those methods fail to be used in dynamic environment. We develop a novel method mining frequent items from data stream based on sliding window model. We use some compact data structures which make uses of the limited space efficiently. The proposed method is an approximate algorithm, it can eliminate the influence of old data to mined result. And the mined results are kept in a heap. This data structure is seldom used in other methods, and the mined results can be inquired by top-k.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"11 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":"125481715","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.371
Yuhua Jiao, Yubo Tian, Qiong Li, X. Niu
This paper proposes a method to extract speech features for content integrity verification of G. 729 coded speech, which could minimize the computation cost and reduce the sizes of the features. Experiments results show that the method is robust to common operations in speech transmission such as recompression, volume changing, re-sampling and transcoding, and also does well in tamper detection for its ability to distinguish content preserving operations from malicious modifications.
{"title":"Content Integrity Verification for G.729 Coded Speech","authors":"Yuhua Jiao, Yubo Tian, Qiong Li, X. Niu","doi":"10.1109/IIH-MSP.2007.371","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.371","url":null,"abstract":"This paper proposes a method to extract speech features for content integrity verification of G. 729 coded speech, which could minimize the computation cost and reduce the sizes of the features. Experiments results show that the method is robust to common operations in speech transmission such as recompression, volume changing, re-sampling and transcoding, and also does well in tamper detection for its ability to distinguish content preserving operations from malicious modifications.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"26 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":"126683793","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.368
T. Pao, Wen-Yuan Liao, Yu-Te Chen, Jun-Heng Yeh, Yun-Maw Cheng, Charles S. Chien
Automatic recognition of emotions in speech aims at building classifiers for classifying emotions in test emotional speech. This paper presents an emotion recognition system to compare several classifiers from clean and noisy speech. Five emotions, including anger, happiness, sadness, neutral and boredom, from Mandarin emotional speech are investigated. The classifiers studied include KNN WCAP GMM HMM and W-DKNN. Feature selection with KNN was also included to compress acoustic features before classifying the emotional states of clean and noisy speech. Experimental results show that the proposed W-DKNN outperformed at every SNR speech among the three KNN-based classifiers and achieved highest accuracy from clean speech to 20dB noisy speech when compared with all the classifiers.
{"title":"Comparison of Several Classifiers for Emotion Recognition from Noisy Mandarin Speech","authors":"T. Pao, Wen-Yuan Liao, Yu-Te Chen, Jun-Heng Yeh, Yun-Maw Cheng, Charles S. Chien","doi":"10.1109/IIH-MSP.2007.368","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.368","url":null,"abstract":"Automatic recognition of emotions in speech aims at building classifiers for classifying emotions in test emotional speech. This paper presents an emotion recognition system to compare several classifiers from clean and noisy speech. Five emotions, including anger, happiness, sadness, neutral and boredom, from Mandarin emotional speech are investigated. The classifiers studied include KNN WCAP GMM HMM and W-DKNN. Feature selection with KNN was also included to compress acoustic features before classifying the emotional states of clean and noisy speech. Experimental results show that the proposed W-DKNN outperformed at every SNR speech among the three KNN-based classifiers and achieved highest accuracy from clean speech to 20dB noisy speech when compared with all the classifiers.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"4 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":"121404353","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}
We have developed a rule-based system, which is called Chinese question answering system for reading comprehension (Cqarc). This paper systematically introduces and discusses key techniques in the Cqarc, describes the processing mechanism of the Cqarc, presents processing strategies and methods in the Cqarc. Cqarc uses heuristic rules to look for lexical and semantic clues in the question and the story. Finally we have tested Cqarc on Chinese reading comprehension corpus (CRCC). Overall, Cqarc found the correct sentence 42% of the time, which is encouraging given the simplicity of its rules. To the best of our knowledge, this is the first work that reports that the use of a rule-based approach achieves satisfying results on answering questions for Chinese reading comprehension tests.
{"title":"A Rule-based Chinese Question Answering System for Reading Comprehension Tests","authors":"Xiaoyan Hao, Xiaoming Chang, Kaiying Liu","doi":"10.1109/IIH-MSP.2007.59","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.59","url":null,"abstract":"We have developed a rule-based system, which is called Chinese question answering system for reading comprehension (Cqarc). This paper systematically introduces and discusses key techniques in the Cqarc, describes the processing mechanism of the Cqarc, presents processing strategies and methods in the Cqarc. Cqarc uses heuristic rules to look for lexical and semantic clues in the question and the story. Finally we have tested Cqarc on Chinese reading comprehension corpus (CRCC). Overall, Cqarc found the correct sentence 42% of the time, which is encouraging given the simplicity of its rules. To the best of our knowledge, this is the first work that reports that the use of a rule-based approach achieves satisfying results on answering questions for Chinese reading comprehension tests.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"829 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":"126060361","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 presents a new password authentication and key-exchange protocol suitable for three-party without a server public key and exchanging keys over an untrusted network. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak password phrases to be used safely. It also offers perfect forward secrecy, which protects past sessions and passwords against future compromises. Finally, user passwords are stored in a form that is not plaintext-equivalent to the password itself, so an attacker who captures the password database cannot use it directly to compromise security and gain immediate access to the host. Furthermore, the authentication server can't get any information for the session key between the two users and the mutual authentication will carry through between the server and the two users. The proposed protocol's security, simplicity, and speed make it ideal for a wide range of real-world applications in which secure password authentication is required.
{"title":"A Method for Making Three-Party Password-Based Key Exchange Resilient to Server Compromise","authors":"Zhu Hongfeng, Liu Tianhua, Liu Jie, Chang Guiran","doi":"10.1109/IIH-MSP.2007.29","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.29","url":null,"abstract":"This paper presents a new password authentication and key-exchange protocol suitable for three-party without a server public key and exchanging keys over an untrusted network. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak password phrases to be used safely. It also offers perfect forward secrecy, which protects past sessions and passwords against future compromises. Finally, user passwords are stored in a form that is not plaintext-equivalent to the password itself, so an attacker who captures the password database cannot use it directly to compromise security and gain immediate access to the host. Furthermore, the authentication server can't get any information for the session key between the two users and the mutual authentication will carry through between the server and the two users. The proposed protocol's security, simplicity, and speed make it ideal for a wide range of real-world applications in which secure password authentication is required.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"28 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911884","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.248
Xue-mei Yang, Yenwei Chen, M. Ito, I. Nishikawa
In this paper, a detailed analysis about the structure of O-glycosylated protein has been done by calculating the positional probability functions (PPFs) and principal components. We found that the content of proline , serine , threonine and alanine in O-glycosylated protein is higher than those in nonglycosylated protein. Furthermore, we also found that the serine near N or C terminus was easily glycosylated and the threonine near N terminus is easily glycosylated. The prediction was also done as a classification problem. The test protein sequence is projected to the common subspace and then by calculating the distance between the projection and each class center, the test protein sequence can be assigned into the "nearest" class. The prediction accuracy is about 60%-100%.
{"title":"Principal Component Analysis of O-linked Glycosylation Sites in Protein Sequence","authors":"Xue-mei Yang, Yenwei Chen, M. Ito, I. Nishikawa","doi":"10.1109/IIH-MSP.2007.248","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.248","url":null,"abstract":"In this paper, a detailed analysis about the structure of O-glycosylated protein has been done by calculating the positional probability functions (PPFs) and principal components. We found that the content of proline , serine , threonine and alanine in O-glycosylated protein is higher than those in nonglycosylated protein. Furthermore, we also found that the serine near N or C terminus was easily glycosylated and the threonine near N terminus is easily glycosylated. The prediction was also done as a classification problem. The test protein sequence is projected to the common subspace and then by calculating the distance between the projection and each class center, the test protein sequence can be assigned into the \"nearest\" class. The prediction accuracy is about 60%-100%.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"53 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923131","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.390
Sin-Yu Chen, J. Hsieh
This paper presents a novel edge labeling scheme for detecting lanes from videos in real time. Firstly, pairs of edge pixels with different edge types are grouped using the labeling technique. Then, different lane hypotheses can be generated for lane modeling. Then, a lane geometrical constraint is derived from the pinhole camera geometry for filtering out impossible lane hypotheses. Since the constraint is invariant to shadows and lighting changes, each desired lane can be robustly detected even though different occlusions and shadows are included in the analyzed scenes. After filtering, a kernel-based modeling technique is then proposed for modeling different lane properties. With the modeling, different lanes can be effectively detected and tracked even though they are fragmented into pieces of segments or occluded by shadows. The proposed scheme works very well to analyze lane conditions with night vision. With the lane information, different dangerous driving behaviors like lane departure can be directly analyzed from road scenes. Experimental results show that the proposed scheme is powerful in lane detection. The average accuracy rate of vehicle detection is 95%.
{"title":"Edge-based Lane Change Detection and its Application to Suspicious Driving Behavior Analysis","authors":"Sin-Yu Chen, J. Hsieh","doi":"10.1109/IIH-MSP.2007.390","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.390","url":null,"abstract":"This paper presents a novel edge labeling scheme for detecting lanes from videos in real time. Firstly, pairs of edge pixels with different edge types are grouped using the labeling technique. Then, different lane hypotheses can be generated for lane modeling. Then, a lane geometrical constraint is derived from the pinhole camera geometry for filtering out impossible lane hypotheses. Since the constraint is invariant to shadows and lighting changes, each desired lane can be robustly detected even though different occlusions and shadows are included in the analyzed scenes. After filtering, a kernel-based modeling technique is then proposed for modeling different lane properties. With the modeling, different lanes can be effectively detected and tracked even though they are fragmented into pieces of segments or occluded by shadows. The proposed scheme works very well to analyze lane conditions with night vision. With the lane information, different dangerous driving behaviors like lane departure can be directly analyzed from road scenes. Experimental results show that the proposed scheme is powerful in lane detection. The average accuracy rate of vehicle detection is 95%.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"146 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":"116050497","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
扫码关注我们
求助内容：
应助结果提醒方式：