In this paper a hybrid adaptive genetic algorithm is proposed for solving constrained optimization problems. Genetic algorithm proposed here combines adaptive penalty method and smoothing technique in order to make the algorithm not needing parameters tuning and easily escaping from the local optimal solutions. Meanwhile, local line search technique is introduced and a new crossover operator is designed for getting much faster algorithm convergence. If there is no feasible solutions in the current population, finding feasible solutions is prior to finding optimal solution, otherwise the exploitation for global optimal solution based on a certain smoothing function at the best feasible solution in the current population and the exploration for whole search space are processing at the same time. The performance of the algorithm is tested on thirteen benchmark functions in the literature and the results indicate that the algorithm proposed here is robust and effective.
{"title":"A Hybrid Adaptive Evolutionary Algorithm for Constrained Optimization","authors":"Xiang Li, Ximing Liang","doi":"10.1109/IIH-MSP.2007.25","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.25","url":null,"abstract":"In this paper a hybrid adaptive genetic algorithm is proposed for solving constrained optimization problems. Genetic algorithm proposed here combines adaptive penalty method and smoothing technique in order to make the algorithm not needing parameters tuning and easily escaping from the local optimal solutions. Meanwhile, local line search technique is introduced and a new crossover operator is designed for getting much faster algorithm convergence. If there is no feasible solutions in the current population, finding feasible solutions is prior to finding optimal solution, otherwise the exploitation for global optimal solution based on a certain smoothing function at the best feasible solution in the current population and the exploration for whole search space are processing at the same time. The performance of the algorithm is tested on thirteen benchmark functions in the literature and the results indicate that the algorithm proposed here is robust and effective.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"50 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":"127291128","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.404
T. Lu, Daosheng Mu, Minchih Tsai
Morphing is a process of smoothly transforming from one shape into another. In this paper, we present a feature-based method of employing mesh morphing to compute two homeomorphic facial meshes for animating 3D facial expressions in virtual worlds. We divide the method into five steps, including mesh parameterization, feature specification, vertex correspondence, and point interpolation. Relying on sparse sets of user specified feature points, a semi-automatic ripple searching algorithm is proposed to cope with the problem of establishing a one-to-one correspondence between source and target meshes. After the operation of correspondence establishment, we employ Bezier interpolation with four data control points to transform from the source mesh to the target mesh. Finally, three pairs of facial meshes with surface textures are demonstrated to produce a series of facial expressions by using the proposed method.
{"title":"Facial Expressions for 3D Game Applications","authors":"T. Lu, Daosheng Mu, Minchih Tsai","doi":"10.1109/IIH-MSP.2007.404","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.404","url":null,"abstract":"Morphing is a process of smoothly transforming from one shape into another. In this paper, we present a feature-based method of employing mesh morphing to compute two homeomorphic facial meshes for animating 3D facial expressions in virtual worlds. We divide the method into five steps, including mesh parameterization, feature specification, vertex correspondence, and point interpolation. Relying on sparse sets of user specified feature points, a semi-automatic ripple searching algorithm is proposed to cope with the problem of establishing a one-to-one correspondence between source and target meshes. After the operation of correspondence establishment, we employ Bezier interpolation with four data control points to transform from the source mesh to the target mesh. Finally, three pairs of facial meshes with surface textures are demonstrated to produce a series of facial expressions by using the proposed method.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"5 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":"114241476","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.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.422
Yongjin Cho, C.-C. Jay Kuo, Ming Hsieh, Do-Kyoung Kwon
A GOP-based rate control algorithm for hierarchical B-pictures in H.264/SVC is proposed in this work. The problem is firstly formulated as a bit allocation problem among different temporal layers. Due to the dependency of these layers, we propose a Q-selection tree solution framework. The monotonicity property is exploited to prune the Q-selection tree. Then, the rate-distortion (R-D) data is calculated at a selected set of leaf nodes in any admissible Q-selection tree. The R-D data of other leaf nodes are interpolated using the log-linearity property of a local R-D model. It is shown by experiments that the proposed algorithm achieves a significant coding gain improvement at different target bit rates.
{"title":"GOP-based Rate Control for H.264/SVC with Hierarchical B-pictures","authors":"Yongjin Cho, C.-C. Jay Kuo, Ming Hsieh, Do-Kyoung Kwon","doi":"10.1109/IIH-MSP.2007.422","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.422","url":null,"abstract":"A GOP-based rate control algorithm for hierarchical B-pictures in H.264/SVC is proposed in this work. The problem is firstly formulated as a bit allocation problem among different temporal layers. Due to the dependency of these layers, we propose a Q-selection tree solution framework. The monotonicity property is exploited to prune the Q-selection tree. Then, the rate-distortion (R-D) data is calculated at a selected set of leaf nodes in any admissible Q-selection tree. The R-D data of other leaf nodes are interpolated using the log-linearity property of a local R-D model. It is shown by experiments that the proposed algorithm achieves a significant coding gain improvement at different target bit rates.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"301 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":"122795019","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.430
Chin-Feng Lee, Hsing-Ling Chen
In this paper, a novel data hiding scheme based on virtual window partition technique has been proposed to contribute the high payload capacity, low computation overhead and satisfied security. In addition, the proposed scheme has the advantage of stability because the payload capacity depends on a predetermined virtual window size. Some experimental results were performed to show that our proposed method has the superior both in payload and embedding quality in comparison to the data hiding methods based on the exploiting modification direction (EMD) embedding and the binary space partition (BSP) tree. The experimental result shows that our data hiding method based on virtual window partition technique can embed four bits per pixel without incurring any form of perceived distortion.
{"title":"High-Capacity Data Hiding Using Virtual Window Partition","authors":"Chin-Feng Lee, Hsing-Ling Chen","doi":"10.1109/IIH-MSP.2007.430","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.430","url":null,"abstract":"In this paper, a novel data hiding scheme based on virtual window partition technique has been proposed to contribute the high payload capacity, low computation overhead and satisfied security. In addition, the proposed scheme has the advantage of stability because the payload capacity depends on a predetermined virtual window size. Some experimental results were performed to show that our proposed method has the superior both in payload and embedding quality in comparison to the data hiding methods based on the exploiting modification direction (EMD) embedding and the binary space partition (BSP) tree. The experimental result shows that our data hiding method based on virtual window partition technique can embed four bits per pixel without incurring any form of perceived distortion.","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":"131311302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes an architecture integrated with P-mail Deluxe Protocol (PDX) and Multimedia Message Service (MMS) to provide the Interoperability of the multimedia messaging between Personal Handy System and General Packer Radio Service (GPRS) networks. The proposed architecture includes an MMS-P-mail Gateway (MPG), within three messaging services units, i.e., multimedia messaging relay, adaptation and configuration unit. Through the MPG gateway provides bi-directionally seamless routing, protocol conversion, reformatting, and transmission of the multimedia message. The proposed architecture leverage on the integration with PHS and GPRS networks to expand the MMS usage volume. An implementation of the MPG is described in this paper as an illustration of the feasibility of the proposed architecture.
{"title":"An Architecture for the Interoperability of Multimedia Messaging Services between GPRS and PHS Cellular Networks","authors":"W. Hsieh, W. Hsu, Yu-Yuan Hsu","doi":"10.1109/IIH-MSP.2007.75","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.75","url":null,"abstract":"This paper proposes an architecture integrated with P-mail Deluxe Protocol (PDX) and Multimedia Message Service (MMS) to provide the Interoperability of the multimedia messaging between Personal Handy System and General Packer Radio Service (GPRS) networks. The proposed architecture includes an MMS-P-mail Gateway (MPG), within three messaging services units, i.e., multimedia messaging relay, adaptation and configuration unit. Through the MPG gateway provides bi-directionally seamless routing, protocol conversion, reformatting, and transmission of the multimedia message. The proposed architecture leverage on the integration with PHS and GPRS networks to expand the MMS usage volume. An implementation of the MPG is described in this paper as an illustration of the feasibility of the proposed architecture.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"2 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":"130168794","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.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
扫码关注我们
求助内容：
应助结果提醒方式：