Halftone image is a binary image that preserves the visual quality from the original continuous-tone image, and is used everywhere for printing and output documents. In this paper, a modified error-diffusion halftoning scheme is proposed that the error is diffused dynamically according to the magnitude of gradient and the proposed impact functions. From this adjustment, the proposed scheme can enhance the edges and preserve the smooth regions. The experiments demonstrate the performance of the proposed scheme with different settings of the impact functions. Also from the testing procedures, the settings of the impact function can automatic obtained from the distribution of gradient.
{"title":"An Edge Enhanced Technique for Digital Halftoning Using Error Diffusion","authors":"J. Feng, I. Lin, Y. Chu","doi":"10.1109/IIH-MSP.2007.77","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.77","url":null,"abstract":"Halftone image is a binary image that preserves the visual quality from the original continuous-tone image, and is used everywhere for printing and output documents. In this paper, a modified error-diffusion halftoning scheme is proposed that the error is diffused dynamically according to the magnitude of gradient and the proposed impact functions. From this adjustment, the proposed scheme can enhance the edges and preserve the smooth regions. The experiments demonstrate the performance of the proposed scheme with different settings of the impact functions. Also from the testing procedures, the settings of the impact function can automatic obtained from the distribution of gradient.","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":"116222511","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.222
Sue-Chen Hsueh, Ming-Yen Lin, Kun-Lin Lu
Association rules can be used for service recommendations for digital home applications. Negative associations, which mean the missing of item-sets may imply the appearance of certain item-sets, highlight the implications of the missing item-sets. Many studies have shown that negative associations are as important as the traditional positive ones in practice. The recommendation can be more personalized with the addition of more generalized association rules comprising both positive and negative association rules. In this paper, an algorithm based on the FP-growth framework is proposed to mine the generalized rules. In contrast to previous discovery of negative association rules using the apriori-like approaches, the proposed algorithm efficiently mines the rules and outperforms the apriori-based approach. The algorithm also scales up linearly with the increase of the database size.
{"title":"Mining Generalized Association Rules for Service Recommendations for Digital Home Applications","authors":"Sue-Chen Hsueh, Ming-Yen Lin, Kun-Lin Lu","doi":"10.1109/IIH-MSP.2007.222","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.222","url":null,"abstract":"Association rules can be used for service recommendations for digital home applications. Negative associations, which mean the missing of item-sets may imply the appearance of certain item-sets, highlight the implications of the missing item-sets. Many studies have shown that negative associations are as important as the traditional positive ones in practice. The recommendation can be more personalized with the addition of more generalized association rules comprising both positive and negative association rules. In this paper, an algorithm based on the FP-growth framework is proposed to mine the generalized rules. In contrast to previous discovery of negative association rules using the apriori-like approaches, the proposed algorithm efficiently mines the rules and outperforms the apriori-based approach. The algorithm also scales up linearly with the increase of the database size.","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":"116527333","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.358
Liang-Hwei Lee, S. Shyue, Ming Huang
Generally, automatic building corner or linear feature extraction from urban area aerial imagery is based on traditional computer vision corner or edge detection techniques. However, challenges and difficulties remained due to the complex characteristic of objects in urban images. Visually, the linear features in airborne LiDAR are much more distinct than those in aerial imagery, however, common criticisms arising from the low horizontal accuracy of LiDAR data. To overcome these difficulties, this study proposes a building corner extraction algorithm based on information fusion technology by integrating aerial imagery and airborne LiDAR data. According to experiment results, the proposed method can obtain the distinct building corners not only with the characteristics of uniform spatial distributed pattern based on Voronoi graph theory, but also with the shape, length, and height constrained conditions derived from LiDAR linear features. The proposed algorithm resolves the heterogeneous remote sensing data registration difficulties between LiDAR data and raw aerial imagery.
{"title":"Building Corner Feature Extraction Based on Fusion Technique with Airborne LiDAR Data and Aerial Imagery","authors":"Liang-Hwei Lee, S. Shyue, Ming Huang","doi":"10.1109/IIH-MSP.2007.358","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.358","url":null,"abstract":"Generally, automatic building corner or linear feature extraction from urban area aerial imagery is based on traditional computer vision corner or edge detection techniques. However, challenges and difficulties remained due to the complex characteristic of objects in urban images. Visually, the linear features in airborne LiDAR are much more distinct than those in aerial imagery, however, common criticisms arising from the low horizontal accuracy of LiDAR data. To overcome these difficulties, this study proposes a building corner extraction algorithm based on information fusion technology by integrating aerial imagery and airborne LiDAR data. According to experiment results, the proposed method can obtain the distinct building corners not only with the characteristics of uniform spatial distributed pattern based on Voronoi graph theory, but also with the shape, length, and height constrained conditions derived from LiDAR linear features. The proposed algorithm resolves the heterogeneous remote sensing data registration difficulties between LiDAR data and raw aerial imagery.","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":"133519585","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.224
Puu-An Juang, Ming-Ni Wu
We present a preliminary design and experimental results of a phase discontinuity relaxation method for MRI (magnetic resonance imaging) phase images. Our method utilizes a wavelet transform algorithm with zero-padding technique. The method is capable of solving the ambiguity problem in MRI phase image by removing the discontinuous borders. The key idea of the wavelet transform algorithm is to process the given MRI phase data by operating frequency domain relaxation in coarse grids and then transferring the intermediate result into finer grids. In this paper we investigate the possibility of employing this approach for phase image based-MRI application. We also evaluate and compare these processed images with the original ones. The application of the proposed method for removing discontinuous border is demonstrated by examples.
{"title":"MRI Brain Phase Image Unwrapping Process by Wavelet Zero-Padding Technique","authors":"Puu-An Juang, Ming-Ni Wu","doi":"10.1109/IIH-MSP.2007.224","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.224","url":null,"abstract":"We present a preliminary design and experimental results of a phase discontinuity relaxation method for MRI (magnetic resonance imaging) phase images. Our method utilizes a wavelet transform algorithm with zero-padding technique. The method is capable of solving the ambiguity problem in MRI phase image by removing the discontinuous borders. The key idea of the wavelet transform algorithm is to process the given MRI phase data by operating frequency domain relaxation in coarse grids and then transferring the intermediate result into finer grids. In this paper we investigate the possibility of employing this approach for phase image based-MRI application. We also evaluate and compare these processed images with the original ones. The application of the proposed method for removing discontinuous border is demonstrated by examples.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"78 1-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":"134230614","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.259
WenHua Dai, Cuizhen Jiao, Tingting He
As K-means clustering algorithm is sensitive to the choice of the initial cluster centers and it's difficult to determine the cluster number, we proposed a K-means clustering method based on parallel genetic algorithm. In the method, we adopted a new strategy of variable-length chromosome encoding and randomly chose initial clustering centers to form chromosomes among samples. Combining the efficiency of K-means algorithm with the global optimization ability of parallel genetic algorithm, the local optimal solution was avoided and the optimum number and optimum result of cluster were obtained by means of heredity, mutation in the community, and parallel evolution, intermarriage among communities. Experiments indicated that this algorithm was efficient and accurate.
{"title":"Research of K-means Clustering Method Based on Parallel Genetic Algorithm","authors":"WenHua Dai, Cuizhen Jiao, Tingting He","doi":"10.1109/IIH-MSP.2007.259","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.259","url":null,"abstract":"As K-means clustering algorithm is sensitive to the choice of the initial cluster centers and it's difficult to determine the cluster number, we proposed a K-means clustering method based on parallel genetic algorithm. In the method, we adopted a new strategy of variable-length chromosome encoding and randomly chose initial clustering centers to form chromosomes among samples. Combining the efficiency of K-means algorithm with the global optimization ability of parallel genetic algorithm, the local optimal solution was avoided and the optimum number and optimum result of cluster were obtained by means of heredity, mutation in the community, and parallel evolution, intermarriage among communities. Experiments indicated that this algorithm was efficient and accurate.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"118 3 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":"134334773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose an effective data hiding method based on the EMD embedding scheme proposed by Zhang et al. in order to enhance the embedding capacity. The main idea of our proposed scheme is to convert secret binary messages into a sequence of digits in an 8-ary notational system. Each secret digit is embedded into two cover pixels by modifying the least significant bits (LSBs). As the experimental results show, the embedding bit-rate of our scheme is 1.5 times better than the EMD embedding scheme. In a word, we propose a high-quality and high-capacity data hiding method that can ensure the stego-image quality and security.
{"title":"A Steganographic Method with High Embedding Capacity by Improving Exploiting Modification Direction","authors":"Chin-Feng Lee, Yi-Ren Wang, Chinchen Chang","doi":"10.1109/IIH-MSP.2007.62","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.62","url":null,"abstract":"We propose an effective data hiding method based on the EMD embedding scheme proposed by Zhang et al. in order to enhance the embedding capacity. The main idea of our proposed scheme is to convert secret binary messages into a sequence of digits in an 8-ary notational system. Each secret digit is embedded into two cover pixels by modifying the least significant bits (LSBs). As the experimental results show, the embedding bit-rate of our scheme is 1.5 times better than the EMD embedding scheme. In a word, we propose a high-quality and high-capacity data hiding method that can ensure the stego-image quality and security.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"95 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":"133832440","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.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 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：