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}
The resource constrained project scheduling problem (RCPSP) is extended to flexible resource constrained project scheduling problem (FRCPSP) in this paper. Resources are assumed to have certain capabilities demanded by project activities, but not necessarily all of them. Resource capability matrix (RCM) is proposed to represent flexible resources. A multi-agent system composed of resource agent, activity agent, and service agent is put forward as an information infrastructure to support flexible resource constrained project management in a highly distributed environment. The definitions of component agents and the strategies of flexible resource allocation are discussed.
{"title":"A Multi-agent System for the Flexible Resource Constrained Project Scheduling","authors":"Jingjing Liu, Bing Wu","doi":"10.1109/IIH-MSP.2007.33","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.33","url":null,"abstract":"The resource constrained project scheduling problem (RCPSP) is extended to flexible resource constrained project scheduling problem (FRCPSP) in this paper. Resources are assumed to have certain capabilities demanded by project activities, but not necessarily all of them. Resource capability matrix (RCM) is proposed to represent flexible resources. A multi-agent system composed of resource agent, activity agent, and service agent is put forward as an information infrastructure to support flexible resource constrained project management in a highly distributed environment. The definitions of component agents and the strategies of flexible resource allocation are discussed.","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":"115659546","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.279
M. Shirali-Shahreza, M. Shirali-Shahreza
Now we are able to offer numerous softwares for mobile phones after the advances in mobile phone industry. Most of these softwares should be bought in order that we can use them. Some of these softwares are sharewares and after buying them you have to insert an activation code given by the manufacturing company based on your mobile IMEI code in order to activate the software. In this paper a new method is introduced for sending the mobile software activation code by SMS (Short Message Service). In this method the activation code is hidden in an SMS picture message by steganography method and sent to the user. The software extracting the activation code from the picture and compare it with the code which is generated based on the user's mobile phone IMEI code. If the codes are the same, the software is activated. Therefore the security of transferring the activation code is increased and if the SMS message is stolen, nobody can inform the activation code. This project is implemented in J2ME (Java 2 Micro Edition) language and tested on a Nokia N71 mobile phone.
{"title":"Sending Mobile Software Activation Code by SMS Using Steganography","authors":"M. Shirali-Shahreza, M. Shirali-Shahreza","doi":"10.1109/IIH-MSP.2007.279","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.279","url":null,"abstract":"Now we are able to offer numerous softwares for mobile phones after the advances in mobile phone industry. Most of these softwares should be bought in order that we can use them. Some of these softwares are sharewares and after buying them you have to insert an activation code given by the manufacturing company based on your mobile IMEI code in order to activate the software. In this paper a new method is introduced for sending the mobile software activation code by SMS (Short Message Service). In this method the activation code is hidden in an SMS picture message by steganography method and sent to the user. The software extracting the activation code from the picture and compare it with the code which is generated based on the user's mobile phone IMEI code. If the codes are the same, the software is activated. Therefore the security of transferring the activation code is increased and if the SMS message is stolen, nobody can inform the activation code. This project is implemented in J2ME (Java 2 Micro Edition) language and tested on a Nokia N71 mobile phone.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115585540","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.336
Y. Tsai, Hung-Kuo Chu, K. Cheng, Tong-Yee Lee, Chen-Lan Yen
Motion retargeting can be achieved by direct shape deformation transfer but may be visually unrealistic and physically incorrect. The purpose of this study is to include the consideration of physical properties for more realistic target motion synthesis. After partitioning source and target objects into segments, each segment mass and center of mass (COM) position/velocity are estimated. The target animation is generated by minimizing the difference in total linear momentum between source and target. Weighting functions for addressing the importance of segment motion and constraints on unrealistic segment length/velocity are also included. The results show that target movement amplitude and velocity are generally smaller than those of the source animation and with less seemly unrealistic motion. Thus, plausible animation can be generated by the retargeting procedures proposed in this study. The same methods may be applied to a variety of different target models for realistic motion synthesis.
{"title":"Animation Generation and Retargeting Based on Physics Characteristics","authors":"Y. Tsai, Hung-Kuo Chu, K. Cheng, Tong-Yee Lee, Chen-Lan Yen","doi":"10.1109/IIH-MSP.2007.336","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.336","url":null,"abstract":"Motion retargeting can be achieved by direct shape deformation transfer but may be visually unrealistic and physically incorrect. The purpose of this study is to include the consideration of physical properties for more realistic target motion synthesis. After partitioning source and target objects into segments, each segment mass and center of mass (COM) position/velocity are estimated. The target animation is generated by minimizing the difference in total linear momentum between source and target. Weighting functions for addressing the importance of segment motion and constraints on unrealistic segment length/velocity are also included. The results show that target movement amplitude and velocity are generally smaller than those of the source animation and with less seemly unrealistic motion. Thus, plausible animation can be generated by the retargeting procedures proposed in this study. The same methods may be applied to a variety of different target models for realistic motion synthesis.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"117 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":"115590406","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}
The malicious transactions intrusion is the dominant cause that demolishes database system. DBMS is a key part in the security of database system. Enhancing the ability of detecting malicious transactions is very important in DBMS. Based on a detecting approach of malicious transactions in DBMS, an auto-generating approach of legal transactions Profile and generating algorithm are proposed in this paper. Experiment proved that the approach had good performance and accuracy. Intuitionistic Transactions profile was generated. The improved detecting approach of malicious transactions was more automatic and effective, and it had better detection ability.
{"title":"An Auto-Generating Approach of Transactions Profile Graph in Detection of Malicious Transactions","authors":"Jinfu Chen, Yansheng Lu, Xiaodong Xie","doi":"10.1109/IIH-MSP.2007.76","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.76","url":null,"abstract":"The malicious transactions intrusion is the dominant cause that demolishes database system. DBMS is a key part in the security of database system. Enhancing the ability of detecting malicious transactions is very important in DBMS. Based on a detecting approach of malicious transactions in DBMS, an auto-generating approach of legal transactions Profile and generating algorithm are proposed in this paper. Experiment proved that the approach had good performance and accuracy. Intuitionistic Transactions profile was generated. The improved detecting approach of malicious transactions was more automatic and effective, and it had better detection ability.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"20 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":"115070971","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.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}
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.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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：