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}
Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.416
T. Chou, K. Yen, N. Pissinou, K. Makki
In this paper, we propose a method to resolve uncertainty problems by incorporating fuzzy clustering technique and Dempster-Shafer theory. Also, the k-nearest neighbors (k-NN) technique is applied to speed up the detection process and C4.5 decision tree algorithm is used to improve the classification accuracy. For verifying the performance of our classifier, DARPA KDD99 intrusion detection evaluation data set is used. We compare the results of our proposed approach with those of k-NN classifier, fuzzy k-NN classifier and evidence-theoretic k-NN classifier. The result indicates that our approach has a better performance than these from the other three classifiers.
{"title":"Fuzzy Belief Reasoning for Intrusion Detection Design","authors":"T. Chou, K. Yen, N. Pissinou, K. Makki","doi":"10.1109/IIH-MSP.2007.416","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.416","url":null,"abstract":"In this paper, we propose a method to resolve uncertainty problems by incorporating fuzzy clustering technique and Dempster-Shafer theory. Also, the k-nearest neighbors (k-NN) technique is applied to speed up the detection process and C4.5 decision tree algorithm is used to improve the classification accuracy. For verifying the performance of our classifier, DARPA KDD99 intrusion detection evaluation data set is used. We compare the results of our proposed approach with those of k-NN classifier, fuzzy k-NN classifier and evidence-theoretic k-NN classifier. The result indicates that our approach has a better performance than these from the other three classifiers.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.393
Ningping Sun, Toru Ayabe, T. Nishizaki
We present an approach to model handwriting like curves with the cubic spline interpolation function. Different from NURBS such as Bezier and B-spline curve modeling, the huge complexity of the traditional spline interpolation have been obstructed and limited the application of spline curve modeling. We propose an efficient local cubic spline interpolation curve modeling algorithm and provide an approach to apply the algorithm to model arbitrary shape built from free form curves.
{"title":"Efficient Spline Interpolation Curve Modeling","authors":"Ningping Sun, Toru Ayabe, T. Nishizaki","doi":"10.1109/IIH-MSP.2007.393","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.393","url":null,"abstract":"We present an approach to model handwriting like curves with the cubic spline interpolation function. Different from NURBS such as Bezier and B-spline curve modeling, the huge complexity of the traditional spline interpolation have been obstructed and limited the application of spline curve modeling. We propose an efficient local cubic spline interpolation curve modeling algorithm and provide an approach to apply the algorithm to model arbitrary shape built from free form curves.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133942065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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.324
Jeng-Wei Lee, Jia-Ming Yang, Chao-Lieh Chen, Y. Kuo
An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-oriented Load- balance Hierarchical Independent Tree (TLHIT) to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also path-disjoint multicast trees where each node serves as an interior node in only one tree and different trees do not contain the same path. Moreover, TLHIT ensures load-balance property by building the multicast trees based on n-ary full tree. It ensures that each node serves almost the same amount of child nodes. Simulation results show that the reliability, efficiency, and load-balance properties of the proposed TLHIT are assured.
{"title":"Video Streaming Using Overlay Multicast Scheme with Efficient and Load-Balance Path Diversity","authors":"Jeng-Wei Lee, Jia-Ming Yang, Chao-Lieh Chen, Y. Kuo","doi":"10.1109/IIH-MSP.2007.324","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.324","url":null,"abstract":"An overlay multicast is proposed to solve the scalability and deployment problems in IP Multicast. We propose a scheme, Topology-oriented Load- balance Hierarchical Independent Tree (TLHIT) to improve the performance of overlay multicast. Compared to traditional methods, the proposed TLHIT constructs not only node-disjoint but also path-disjoint multicast trees where each node serves as an interior node in only one tree and different trees do not contain the same path. Moreover, TLHIT ensures load-balance property by building the multicast trees based on n-ary full tree. It ensures that each node serves almost the same amount of child nodes. Simulation results show that the reliability, efficiency, and load-balance properties of the proposed TLHIT are assured.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116630266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：