Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.291
T. George, N. Malmurugan
In this paper, we present a fast architecture of realtime CAVLC decoder (CAVLD) implemented in a FPGA. The real-time performance is achieved by exploring the pipelining possibilities between the sub- modules and multi sub-symbol decoding. The implemented fast CAVLD architecture, when integrated with H264 decoder was capable of parsing at 30 fps for 1080 p streams for an encoded bit stream at a bit rate of 200 Mbps to achieve the real-time performance, while the clock is operated at 74.25 MHz. The result numbers of ALUs are 3266 and the critical path is within 10.5 ns.
{"title":"The Architecture of Fast H.264 CAVLC Decoder and its FPGA Implementation","authors":"T. George, N. Malmurugan","doi":"10.1109/IIH-MSP.2007.291","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.291","url":null,"abstract":"In this paper, we present a fast architecture of realtime CAVLC decoder (CAVLD) implemented in a FPGA. The real-time performance is achieved by exploring the pipelining possibilities between the sub- modules and multi sub-symbol decoding. The implemented fast CAVLD architecture, when integrated with H264 decoder was capable of parsing at 30 fps for 1080 p streams for an encoded bit stream at a bit rate of 200 Mbps to achieve the real-time performance, while the clock is operated at 74.25 MHz. The result numbers of ALUs are 3266 and the critical path is within 10.5 ns.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"51 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":"121790312","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.292
Chunhe Song, Hai Zhao, Wei Cai, Haohua Zhang, Ming Zhao, Wei Gao, Xuanjie Ning, Xudong Han, Peng Zhu, Jie Gao, Tianyu Qi, Hongyan Gong
This paper presents a distance-guided particle swarm optimizer with dynamic mutation (PSODM). Two characteristics are proposed in the PSODM: distance-guided and dynamic mutation. The goal of these characteristics is to overcome premature convergence of the swarm and accelerating the convergence velocity. With distance-guided operation, some particles too intense can be separated, while with dynamic mutation operation, the particles mutated can find a better position more easily by effectively using the foregone experience. The PSODM is compared to other four types of improved PSO, and the experimental results show that the PSODM performances better on a six-function test suite with different dimensions.
{"title":"The Distance-Guided Particle Swarm Optimizer with Dynamic Mutation","authors":"Chunhe Song, Hai Zhao, Wei Cai, Haohua Zhang, Ming Zhao, Wei Gao, Xuanjie Ning, Xudong Han, Peng Zhu, Jie Gao, Tianyu Qi, Hongyan Gong","doi":"10.1109/IIH-MSP.2007.292","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.292","url":null,"abstract":"This paper presents a distance-guided particle swarm optimizer with dynamic mutation (PSODM). Two characteristics are proposed in the PSODM: distance-guided and dynamic mutation. The goal of these characteristics is to overcome premature convergence of the swarm and accelerating the convergence velocity. With distance-guided operation, some particles too intense can be separated, while with dynamic mutation operation, the particles mutated can find a better position more easily by effectively using the foregone experience. The PSODM is compared to other four types of improved PSO, and the experimental results show that the PSODM performances better on a six-function test suite with different dimensions.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"16 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":"121124282","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.325
W. Fang
We proposed in this paper a brand new type of visual cryptography (VC), namely, the VC in reversible style. For any two given secret images, two corresponding transparencies S1 and S2, also known as shares, can be produced. Both transparencies look noisy. However, if we stack the front views of both transparencies, then the first secret image is unveiled. On the other hand, if we stack the front view of S1 with the back view (the turn-over) of S2, then the second secret image is unveiled.
{"title":"Visual Cryptography in reversible style","authors":"W. Fang","doi":"10.1109/IIH-MSP.2007.325","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.325","url":null,"abstract":"We proposed in this paper a brand new type of visual cryptography (VC), namely, the VC in reversible style. For any two given secret images, two corresponding transparencies S1 and S2, also known as shares, can be produced. Both transparencies look noisy. However, if we stack the front views of both transparencies, then the first secret image is unveiled. On the other hand, if we stack the front view of S1 with the back view (the turn-over) of S2, then the second secret image is unveiled.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"67 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":"127215742","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.216
Chan-Sheng Kuo, T. Hong, Chuen-Lung Chen
In this paper, we have proposed a GP-based knowledge-integration framework that automatically combines multiple rule sets into one integrated knowledge base. The proposed framework consists of three phases: knowledge collection and translation, knowledge integration, and knowledge output. Two new genetic operators, abridgement and compromise, are designed in the proposed approach. Experimental results from diagnosis of breast cancer also show the feasibility of the proposed algorithm.
{"title":"Integrating Multiple Knowledge Sources by Genetic Programming","authors":"Chan-Sheng Kuo, T. Hong, Chuen-Lung Chen","doi":"10.1109/IIH-MSP.2007.216","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.216","url":null,"abstract":"In this paper, we have proposed a GP-based knowledge-integration framework that automatically combines multiple rule sets into one integrated knowledge base. The proposed framework consists of three phases: knowledge collection and translation, knowledge integration, and knowledge output. Two new genetic operators, abridgement and compromise, are designed in the proposed approach. Experimental results from diagnosis of breast cancer also show the feasibility of the proposed algorithm.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"75 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":"127803109","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.334
Cheng-Hsing Yang, Shiuh-Jeng Wang, C. Weng
This paper shows that a steganographic scheme based on Wu et al. 's pixel-value differencing (PVD) and least-significant-bit (LSB) replacement method is too conformable to the LSB approach. Their PVD+LSB method can embed secret data larger than the PVD method, however, it is detectable by Fridrich et al. 's method but PVD method is not. Some of the shortcomings of the PVD+LSB method are shown in this paper. At the same time, some techniques are proposed for improving the image quality of the PVD+LSB method without sacrificing the capacity. All proposed techniques are demonstrated by experimental results.
{"title":"Analyses of Pixel-Value-Differencing Schemes with LSB Replacement in Stegonagraphy","authors":"Cheng-Hsing Yang, Shiuh-Jeng Wang, C. Weng","doi":"10.1109/IIH-MSP.2007.334","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.334","url":null,"abstract":"This paper shows that a steganographic scheme based on Wu et al. 's pixel-value differencing (PVD) and least-significant-bit (LSB) replacement method is too conformable to the LSB approach. Their PVD+LSB method can embed secret data larger than the PVD method, however, it is detectable by Fridrich et al. 's method but PVD method is not. Some of the shortcomings of the PVD+LSB method are shown in this paper. At the same time, some techniques are proposed for improving the image quality of the PVD+LSB method without sacrificing the capacity. All proposed techniques are demonstrated by experimental results.","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":"127422851","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.324
Jeng-Wei Lee, Jia-Ming Yang, Chao-Lieh Chen, Y. Kuo
An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-oriented Load- balance Hierarchical Independent Tree (TLHIT) to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also path-disjoint multicast trees where each node serves as an interior node in only one tree and different trees do not contain the same path. Moreover, TLHIT ensures load-balance property by building the multicast trees based on n-ary full tree. It ensures that each node serves almost the same amount of child nodes. Simulation results show that the reliability, efficiency, and load-balance properties of the proposed TLHIT are assured.
{"title":"Video Streaming Using Overlay Multicast Scheme with Efficient and Load-Balance Path Diversity","authors":"Jeng-Wei Lee, Jia-Ming Yang, Chao-Lieh Chen, Y. Kuo","doi":"10.1109/IIH-MSP.2007.324","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.324","url":null,"abstract":"An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-oriented Load- balance Hierarchical Independent Tree (TLHIT) to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also path-disjoint multicast trees where each node serves as an interior node in only one tree and different trees do not contain the same path. Moreover, TLHIT ensures load-balance property by building the multicast trees based on n-ary full tree. It ensures that each node serves almost the same amount of child nodes. Simulation results show that the reliability, efficiency, and load-balance properties of the proposed TLHIT are assured.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"34 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":"116630266","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.403
Yuan-Kai Wang, Chun-Hao Huang
Extracting stable features from face images is very important for automatic recognition of facial expression. In this paper, we apply a face feature extraction approach, namely discriminative common vectors, for the recognition of the six expressions including happy, sad, angry, disgust, fear and surprise. By applying discriminative common vector, we can reduce the dimensionality of image feature and classify them in a lower dimension. Then we use HMM as our classifier to find the time series information of the feature vector projected by common vector. Experimental results on the Cohn-Kanade database demonstrate the validity and efficiency of our approach.
{"title":"Facial Expression Recognition with Discriminative Common Vector","authors":"Yuan-Kai Wang, Chun-Hao Huang","doi":"10.1109/IIH-MSP.2007.403","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.403","url":null,"abstract":"Extracting stable features from face images is very important for automatic recognition of facial expression. In this paper, we apply a face feature extraction approach, namely discriminative common vectors, for the recognition of the six expressions including happy, sad, angry, disgust, fear and surprise. By applying discriminative common vector, we can reduce the dimensionality of image feature and classify them in a lower dimension. Then we use HMM as our classifier to find the time series information of the feature vector projected by common vector. Experimental results on the Cohn-Kanade database demonstrate the validity and efficiency of our approach.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"35 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":"131407468","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.416
T. Chou, K. Yen, N. Pissinou, K. Makki
In this paper, we propose a method to resolve uncertainty problems by incorporating fuzzy clustering technique and Dempster-Shafer theory. Also, the k-nearest neighbors (k-NN) technique is applied to speed up the detection process and C4.5 decision tree algorithm is used to improve the classification accuracy. For verifying the performance of our classifier, DARPA KDD99 intrusion detection evaluation data set is used. We compare the results of our proposed approach with those of k-NN classifier, fuzzy k-NN classifier and evidence-theoretic k-NN classifier. The result indicates that our approach has a better performance than these from the other three classifiers.
{"title":"Fuzzy Belief Reasoning for Intrusion Detection Design","authors":"T. Chou, K. Yen, N. Pissinou, K. Makki","doi":"10.1109/IIH-MSP.2007.416","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.416","url":null,"abstract":"In this paper, we propose a method to resolve uncertainty problems by incorporating fuzzy clustering technique and Dempster-Shafer theory. Also, the k-nearest neighbors (k-NN) technique is applied to speed up the detection process and C4.5 decision tree algorithm is used to improve the classification accuracy. For verifying the performance of our classifier, DARPA KDD99 intrusion detection evaluation data set is used. We compare the results of our proposed approach with those of k-NN classifier, fuzzy k-NN classifier and evidence-theoretic k-NN classifier. The result indicates that our approach has a better performance than these from the other three classifiers.","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":"131565455","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.393
Ningping Sun, Toru Ayabe, T. Nishizaki
We present an approach to model handwriting like curves with the cubic spline interpolation function. Different from NURBS such as Bezier and B-spline curve modeling, the huge complexity of the traditional spline interpolation have been obstructed and limited the application of spline curve modeling. We propose an efficient local cubic spline interpolation curve modeling algorithm and provide an approach to apply the algorithm to model arbitrary shape built from free form curves.
{"title":"Efficient Spline Interpolation Curve Modeling","authors":"Ningping Sun, Toru Ayabe, T. Nishizaki","doi":"10.1109/IIH-MSP.2007.393","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.393","url":null,"abstract":"We present an approach to model handwriting like curves with the cubic spline interpolation function. Different from NURBS such as Bezier and B-spline curve modeling, the huge complexity of the traditional spline interpolation have been obstructed and limited the application of spline curve modeling. We propose an efficient local cubic spline interpolation curve modeling algorithm and provide an approach to apply the algorithm to model arbitrary shape built from free form curves.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"7 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":"133942065","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.436
Zhen Sun, Zhe-ming Lu, Hai Jin
This paper presents a framework for effective image retrieval by employing long-term memory learning together with short time relevance feedback. Considering the fuzzy characteristic of the human's semantic knowledge, the proposed retrieval framework is associated with a novel matrix named fuzzy semantic relevance matrix (FSRM), which is used for remembering the semantic information obtained from user-provided interactions. Experimental results demonstrate the effectiveness of the proposed scheme.
{"title":"Image Retrieval with Long-Term Memory Learning and Short-Time Relevance Feedback","authors":"Zhen Sun, Zhe-ming Lu, Hai Jin","doi":"10.1109/IIH-MSP.2007.436","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.436","url":null,"abstract":"This paper presents a framework for effective image retrieval by employing long-term memory learning together with short time relevance feedback. Considering the fuzzy characteristic of the human's semantic knowledge, the proposed retrieval framework is associated with a novel matrix named fuzzy semantic relevance matrix (FSRM), which is used for remembering the semantic information obtained from user-provided interactions. Experimental results demonstrate the effectiveness of the proposed scheme.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"1 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":"113932653","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
扫码关注我们
求助内容：
应助结果提醒方式：