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.329
J. Yih, Yuan-Horng Lin
The purpose of this study is to provide an integrated method of fuzzy approach for individualized concept structure analysis. This method integrates algorithm of fuzzy logic model of perception (FLMP) and interpretive structural modeling (ISM). The combined algorithm could analyze the individualized concepts structure based on comparisons with expert. The authors provide the empirical data analysis of concepts on using MATLAB for university students. The results show that students with different response patterns and total score own varied concept structures. Based on the findings and results, some suggestions and recommendations for future research are provided.
{"title":"An Integration of Fuzzy theory and ISM for Concept Structure Analysis with Application of Learning MATLAB","authors":"J. Yih, Yuan-Horng Lin","doi":"10.1109/IIH-MSP.2007.329","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.329","url":null,"abstract":"The purpose of this study is to provide an integrated method of fuzzy approach for individualized concept structure analysis. This method integrates algorithm of fuzzy logic model of perception (FLMP) and interpretive structural modeling (ISM). The combined algorithm could analyze the individualized concepts structure based on comparisons with expert. The authors provide the empirical data analysis of concepts on using MATLAB for university students. The results show that students with different response patterns and total score own varied concept structures. Based on the findings and results, some suggestions and recommendations for future research are provided.","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":"116758800","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 method of face and eyes locating and tracking in a video sequence based on haar-like feature and face skin color. This method first extracts the haar-like feature of face and utilize adaboost algorithm to detect face in image. Then a appropriate skin-model is employed to dispose and locate the eyes based on the geometrical model. Finally the face and eyes tracking in the video sequence is achieved. Testing with a general PC camera in the laboratory environment shows that the method provides high precision and speed.
{"title":"Eyes Tracking in a Video Sequence Based-On Haar-like Features and Skin Color","authors":"Q. Han, Qiong Li, Xiongdong Huang, Tong Zhou, X. Niu","doi":"10.1109/IIH-MSP.2007.401","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.401","url":null,"abstract":"This paper presents a method of face and eyes locating and tracking in a video sequence based on haar-like feature and face skin color. This method first extracts the haar-like feature of face and utilize adaboost algorithm to detect face in image. Then a appropriate skin-model is employed to dispose and locate the eyes based on the geometrical model. Finally the face and eyes tracking in the video sequence is achieved. Testing with a general PC camera in the laboratory environment shows that the method provides high precision and speed.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"29 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":"116046921","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.363
N. Mustafa, N. Isa, M. Y. Mashor, N. Othman
ThinPrepreg monolayer cytology was introduced to overcome the limitations of conventional Pap smear test for screening of cervical cancer. The cytological features in ThinPrepreg images could be improved if unwanted background information and poor contrast could be eliminated. This study proposes a contrast enhancement technique, which is only applied on the cervical cell of interest. The proposed technique is divided into two stages. Firstly, the cervical cells of interest will be selected using the modified seed based region growing algorithm. Then, the contrast of cervical cell of interest in the ThinPrepreg will be enhanced by using three contrast enhancement algorithms. The cervical cell of interest will be applied with linear contrast algorithm and the proposed nonlinear algorithms namely non-linear bright and nonlinear dark contrast to enhance the contrast of the ThinPrepreg images. The results show that the proposed technique improves the image quality. Hence, the resultant image would be rendered more useful for further analysis by pathologists.
{"title":"Colour Contrast Enhancement on Preselected Cervical Cell for ThinPrep® Images","authors":"N. Mustafa, N. Isa, M. Y. Mashor, N. Othman","doi":"10.1109/IIH-MSP.2007.363","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.363","url":null,"abstract":"ThinPrepreg monolayer cytology was introduced to overcome the limitations of conventional Pap smear test for screening of cervical cancer. The cytological features in ThinPrepreg images could be improved if unwanted background information and poor contrast could be eliminated. This study proposes a contrast enhancement technique, which is only applied on the cervical cell of interest. The proposed technique is divided into two stages. Firstly, the cervical cells of interest will be selected using the modified seed based region growing algorithm. Then, the contrast of cervical cell of interest in the ThinPrepreg will be enhanced by using three contrast enhancement algorithms. The cervical cell of interest will be applied with linear contrast algorithm and the proposed nonlinear algorithms namely non-linear bright and nonlinear dark contrast to enhance the contrast of the ThinPrepreg images. The results show that the proposed technique improves the image quality. Hence, the resultant image would be rendered more useful for further analysis by pathologists.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"134 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":"123436225","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.319
Mingzhang Zuo, Ling-yun Yi, Gan-nian Zhang
This article has discussed three knowledge management technologies which can be used to develop reflective learning. This paper will explore the definition of reflective learning. The components related to the process of reflective learning are discussed in six areas: (1) self-examination (2) estimate if it is effective, (3) give birth to questions (4) analyze the difficulties and the gaps, (5) Give strategies, and (6) evaluate if it is effective. Based on the components, the following analyzes and demonstrates how and why they are relevant to each other. A model is provided to illustrate using three knowledge management technologies to develop reflective learning. Finally, an example is given to indicate the strategies applied to answer specific practical problem.
{"title":"Using Knowledge Management Technologies to Develop Reflective Learning","authors":"Mingzhang Zuo, Ling-yun Yi, Gan-nian Zhang","doi":"10.1109/IIH-MSP.2007.319","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.319","url":null,"abstract":"This article has discussed three knowledge management technologies which can be used to develop reflective learning. This paper will explore the definition of reflective learning. The components related to the process of reflective learning are discussed in six areas: (1) self-examination (2) estimate if it is effective, (3) give birth to questions (4) analyze the difficulties and the gaps, (5) Give strategies, and (6) evaluate if it is effective. Based on the components, the following analyzes and demonstrates how and why they are relevant to each other. A model is provided to illustrate using three knowledge management technologies to develop reflective learning. Finally, an example is given to indicate the strategies applied to answer specific practical problem.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"91 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":"123695146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To overcome premature searching by standard particle swarm optimization (PSO) algorithm for the large lost in population diversity, the measure of population diversity and its calculation are given, and an adaptive PSO with dynamically changing inertia weight is proposed. Simulation results show that the adaptive PSO not only effectively alleviates the problem of premature convergence, but also has fast convergence speed for balancing the trade-off between exploration and exploitation.
{"title":"A Modified Particle Swarm Optimization Algorithm with Dynamic Adaptive","authors":"Yang Bo, Zhang Ding-xue, Liao Rui-quan","doi":"10.1109/IIH-MSP.2007.32","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.32","url":null,"abstract":"To overcome premature searching by standard particle swarm optimization (PSO) algorithm for the large lost in population diversity, the measure of population diversity and its calculation are given, and an adaptive PSO with dynamically changing inertia weight is proposed. Simulation results show that the adaptive PSO not only effectively alleviates the problem of premature convergence, but also has fast convergence speed for balancing the trade-off between exploration and exploitation.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"90 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":"124859462","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}
Digital contents are easy to be pirated and to be distributed in today's Internet. Digital right management is an important topic to squash pop music pirates. In this paper, we will introduce the data hiding platform "MP3Stego" for MP3 files and we propose a "fingerprinting with error correcting coding" (FPecc) method on MP3Stego to increase robustness for its weakness. Through analytical results, the proposed method shows obvious improvement to prevent attacks.
{"title":"A Robust Audio Fingerprinting Scheme for MP3 Copyright","authors":"Che-Jen Hsieh, Jung-Shian Li, Cheng-Fu Hung","doi":"10.1109/IIH-MSP.2007.57","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.57","url":null,"abstract":"Digital contents are easy to be pirated and to be distributed in today's Internet. Digital right management is an important topic to squash pop music pirates. In this paper, we will introduce the data hiding platform \"MP3Stego\" for MP3 files and we propose a \"fingerprinting with error correcting coding\" (FPecc) method on MP3Stego to increase robustness for its weakness. Through analytical results, the proposed method shows obvious improvement to prevent attacks.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"675 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":"121995572","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.274
Chang-Chu Chen, Chinchen Chang
Secret image sharing is a technique for protecting image by splitting secret image into many shadow images that are transmitted and stored separately. In the scheme proposed in this paper, each pixel of secret image is encrypted using quadratic residues, and the cipher text is split into two bytes which are shared into two shadow images. According to the restriction of grey level images, we design two methods, namely lossy method and lossless method. The lossy method maintains the size of shadow images and the experimental results show that this method achieves high PSNR values. The lossless method enlarges shadow images to hold the overflow information. Furthermore, with quadratic residues, it is difficult to find square roots modulo a composite number, so the proposed scheme achieves image transmission secrecy.
{"title":"Secret Image Sharing Using Quadratic Residues","authors":"Chang-Chu Chen, Chinchen Chang","doi":"10.1109/IIH-MSP.2007.274","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.274","url":null,"abstract":"Secret image sharing is a technique for protecting image by splitting secret image into many shadow images that are transmitted and stored separately. In the scheme proposed in this paper, each pixel of secret image is encrypted using quadratic residues, and the cipher text is split into two bytes which are shared into two shadow images. According to the restriction of grey level images, we design two methods, namely lossy method and lossless method. The lossy method maintains the size of shadow images and the experimental results show that this method achieves high PSNR values. The lossless method enlarges shadow images to hold the overflow information. Furthermore, with quadratic residues, it is difficult to find square roots modulo a composite number, so the proposed scheme achieves image transmission secrecy.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"94 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":"124245759","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.432
A. Kunisa
This paper presents a new metadata embedding framework for multimedia content where the metadata and its related information are registered in a database. A watermarking method based on the framework computes the metadata that provides content with the smallest perceptual artifact by way of extracting the metadata from the original unwatermarked content. This can reduce the watermark power at the embedding because the content itself naturally contains the metadata. In the case that the extracted metadata has already been registered in the database, several bits in the metadata are inverted so as to avoid the double metadata registration and also detect it with probability higher than the other unregistered metadata.
{"title":"Host-Cooperative Metadata Embedding Framework","authors":"A. Kunisa","doi":"10.1109/IIH-MSP.2007.432","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.432","url":null,"abstract":"This paper presents a new metadata embedding framework for multimedia content where the metadata and its related information are registered in a database. A watermarking method based on the framework computes the metadata that provides content with the smallest perceptual artifact by way of extracting the metadata from the original unwatermarked content. This can reduce the watermark power at the embedding because the content itself naturally contains the metadata. In the case that the extracted metadata has already been registered in the database, several bits in the metadata are inverted so as to avoid the double metadata registration and also detect it with probability higher than the other unregistered metadata.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"71 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":"126254679","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
扫码关注我们
求助内容：
应助结果提醒方式：