Pub Date : 2013-10-16DOI: 10.1109/IIH-MSP.2013.156
Ce Zhu, Shuai Li
Depth-image-based rendering (DIBR) technique is widely used to synthesize virtual views in many applications including multiview and free viewpoint video systems. In view of disocclusion problem in the view synthesis, the disoccluded regions known as holes in the virtual view need to be dealt with properly to generate a synthesized view of high quality. This paper first investigates the generation of holes in view interpolation and reveals concretely under what conditions the holes will appear. Accordingly a novel hole-filling method is proposed by fully utilizing the occlusion information. The proposed scheme can effectively locate the relevant background pixels including those occluded around the hole and make use of integrated background information in the hole filling. Experimental results show that our proposed approach demonstrates superior performance in terms of visual quality of the synthesized view.
{"title":"A New Perspective on Hole Generation and Filling in DIBR Based View Synthesis","authors":"Ce Zhu, Shuai Li","doi":"10.1109/IIH-MSP.2013.156","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.156","url":null,"abstract":"Depth-image-based rendering (DIBR) technique is widely used to synthesize virtual views in many applications including multiview and free viewpoint video systems. In view of disocclusion problem in the view synthesis, the disoccluded regions known as holes in the virtual view need to be dealt with properly to generate a synthesized view of high quality. This paper first investigates the generation of holes in view interpolation and reveals concretely under what conditions the holes will appear. Accordingly a novel hole-filling method is proposed by fully utilizing the occlusion information. The proposed scheme can effectively locate the relevant background pixels including those occluded around the hole and make use of integrated background information in the hole filling. Experimental results show that our proposed approach demonstrates superior performance in terms of visual quality of the synthesized view.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115223166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes an image encryption method to encrypt a covert image by combining the Arnold transform technique in the space domain and the Hartley transform method in the frequency domain. First, transform a covert image into form eight binary images by decimal value to eight-digit binary operation. Then, transform eight binary images into form eight binary scrambled images by the Arnold transform, respectively. And then, recombine the sequence of the eight binary scrambled matrices into a scrambled matrix with 256 gray levels according to the specific order. Finally, derive an encrypted image from the scrambled image by the Hartley transform. Simulations show that the proposed method has higher image scrambling degree, more security and has robustness against occlusion and salt & pepper noise attacks.
{"title":"Image Encryption Using Arnold Transform Technique and Hartley Transform Domain","authors":"K. Lin","doi":"10.1109/IIH-MSP.2013.30","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.30","url":null,"abstract":"This paper proposes an image encryption method to encrypt a covert image by combining the Arnold transform technique in the space domain and the Hartley transform method in the frequency domain. First, transform a covert image into form eight binary images by decimal value to eight-digit binary operation. Then, transform eight binary images into form eight binary scrambled images by the Arnold transform, respectively. And then, recombine the sequence of the eight binary scrambled matrices into a scrambled matrix with 256 gray levels according to the specific order. Finally, derive an encrypted image from the scrambled image by the Hartley transform. Simulations show that the proposed method has higher image scrambling degree, more security and has robustness against occlusion and salt & pepper noise attacks.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116004724","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}
Xing-Fu Xu, Daoshun Wang, Shundong Li, Ching-Nung Yang
In secret sharing, cheaters may reconstruct and recover the secret by providing faked shares, but the honest participants get no information about it. The anti-cheating secret sharing scheme can detect cheating and identify cheaters, so that it can effectively resist cheating attacks. In this paper, we construct a Cyclic Codes-based (k, n)-block secret sharing scheme against cheating. If there are more than k participants reconstructing the secret, we can detect cheating and identify cheaters. We discuss the relationship between the length of the secret block and the computational complexity, the length of the secret block and the storage space. Also, we give the upper bound of the number of identifiable cheaters. When there are no fewer than k honest participants, we can identify all cheaters.
{"title":"An Anti-cheating Block Secret Sharing Scheme Based on Cyclic Codes","authors":"Xing-Fu Xu, Daoshun Wang, Shundong Li, Ching-Nung Yang","doi":"10.1109/IIH-MSP.2013.99","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.99","url":null,"abstract":"In secret sharing, cheaters may reconstruct and recover the secret by providing faked shares, but the honest participants get no information about it. The anti-cheating secret sharing scheme can detect cheating and identify cheaters, so that it can effectively resist cheating attacks. In this paper, we construct a Cyclic Codes-based (k, n)-block secret sharing scheme against cheating. If there are more than k participants reconstructing the secret, we can detect cheating and identify cheaters. We discuss the relationship between the length of the secret block and the computational complexity, the length of the secret block and the storage space. Also, we give the upper bound of the number of identifiable cheaters. When there are no fewer than k honest participants, we can identify all cheaters.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116539262","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 atomic clock device is complicated, and its operation is influenced by a lot of factors, so the date has certain randomness. Predicting atomic clock data by appropriate algorithm is the important step of atomic clock data processing. This article chooses SVM algorithm to predict clock differences, and processed the real atomic clock data, compared relative error with the prediction results and the results of linear regression algorithm, the prediction algorithm based on SVM is effective.
{"title":"Clock Difference Prediction of Atomic Clock Based on Support Vector Machine","authors":"Wu Wenjuan, Z. Jiangmiao","doi":"10.1109/IIH-MSP.2013.46","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.46","url":null,"abstract":"The atomic clock device is complicated, and its operation is influenced by a lot of factors, so the date has certain randomness. Predicting atomic clock data by appropriate algorithm is the important step of atomic clock data processing. This article chooses SVM algorithm to predict clock differences, and processed the real atomic clock data, compared relative error with the prediction results and the results of linear regression algorithm, the prediction algorithm based on SVM is effective.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122355936","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 : 2013-10-16DOI: 10.1109/IIH-MSP.2013.131
Chuan-Yu Chang, Ching-Fong You, Y. Tsai
Compared with the benign prostate, the malignant prostate has higher peak systolic velocity, lower end diastolic velocity and resistance index. In these blood flow information, the end diastolic velocity is more consistent and significant. In this paper, an automatic prostate cancer detection using blood flow information in power Doppler ultrasonography is proposed. The prostate region was segmented semi-automatically by the active contour model. The average velocity, resistance index and end diastolic velocity obtained from left and right peripheral zone were combined to form a feature vector. Accordingly, a support vector machine is used to classify the prostate as malignant or benign. Experimental results demonstrate the effectiveness of the proposed approach.
{"title":"Automatic Prostate Cancer Detection Using Blood Flow Information in Power Doppler Ultrasonography","authors":"Chuan-Yu Chang, Ching-Fong You, Y. Tsai","doi":"10.1109/IIH-MSP.2013.131","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.131","url":null,"abstract":"Compared with the benign prostate, the malignant prostate has higher peak systolic velocity, lower end diastolic velocity and resistance index. In these blood flow information, the end diastolic velocity is more consistent and significant. In this paper, an automatic prostate cancer detection using blood flow information in power Doppler ultrasonography is proposed. The prostate region was segmented semi-automatically by the active contour model. The average velocity, resistance index and end diastolic velocity obtained from left and right peripheral zone were combined to form a feature vector. Accordingly, a support vector machine is used to classify the prostate as malignant or benign. Experimental results demonstrate the effectiveness of the proposed approach.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122881225","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 : 2013-10-16DOI: 10.1109/IIH-MSP.2013.127
Chuan-Chun Ku, C. Young, Chih-Hung Lin
Active safety is an important feature of a modern vehicle to provide precautions, warnings or compensatory control before the pre-crash stage of vehicle safety. This paper introduces a vision-based automatic system to detect lane changing and car distance, which use a CCD Camera to capture the vehicle and road image on a PAC DSP board. The algorithm uses multiple image features, such as edges, gradient, vehicle symmetry property, and Hough Transform to detect the Vanishing Point. Some experimental results based on real world video images have been presented, these seem to indicate that the algorithm is capable of identifying a front vehicle and estimating its distance from the host vehicle.
{"title":"Vision Assisted Active Safety System for Vehicles on the Highway","authors":"Chuan-Chun Ku, C. Young, Chih-Hung Lin","doi":"10.1109/IIH-MSP.2013.127","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.127","url":null,"abstract":"Active safety is an important feature of a modern vehicle to provide precautions, warnings or compensatory control before the pre-crash stage of vehicle safety. This paper introduces a vision-based automatic system to detect lane changing and car distance, which use a CCD Camera to capture the vehicle and road image on a PAC DSP board. The algorithm uses multiple image features, such as edges, gradient, vehicle symmetry property, and Hough Transform to detect the Vanishing Point. Some experimental results based on real world video images have been presented, these seem to indicate that the algorithm is capable of identifying a front vehicle and estimating its distance from the host vehicle.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129570581","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}
Xiaolin Zhou, Guangmin Sun, Dequn Zhao, Zhimeng Wang, Li Gao, Xiaomeng Wang, Yufeng Jin
An improved image enhancement algorithm based on genetic algorithm has been presented and applied for transmission line image processing in this paper, in which fuzziness is served as the optimization method of the image enhancement procedure. Because the complexity and uncertainty of the image itself, fuzzy theory has been used in the image processing. In this process, the parameters of the transformation function are found by the genetic algorithm. Thus, a new kind of image enhancement method is proposed by combining fuzzy theory with the genetic algorithm. Finally, compared with the traditional image enhancement methods, the method presented in this paper is better in performance.
{"title":"A Fuzzy Enhancement Method for Transmission Line Image Based on Genetic Algorithm","authors":"Xiaolin Zhou, Guangmin Sun, Dequn Zhao, Zhimeng Wang, Li Gao, Xiaomeng Wang, Yufeng Jin","doi":"10.1109/IIH-MSP.2013.64","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.64","url":null,"abstract":"An improved image enhancement algorithm based on genetic algorithm has been presented and applied for transmission line image processing in this paper, in which fuzziness is served as the optimization method of the image enhancement procedure. Because the complexity and uncertainty of the image itself, fuzzy theory has been used in the image processing. In this process, the parameters of the transformation function are found by the genetic algorithm. Thus, a new kind of image enhancement method is proposed by combining fuzzy theory with the genetic algorithm. Finally, compared with the traditional image enhancement methods, the method presented in this paper is better in performance.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129364043","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 : 2013-10-16DOI: 10.1109/IIH-MSP.2013.147
Siren Cai, Xinlu Gui
In this paper, we propose an efficient data hiding scheme based on reference pixel and block selection to further improve the embedding performance of histogram shifting. Specifically, we first divide the original image into non-overlapping blocks of an adjustable size. Then for each block, we assign the median of pixels as the reference pixel and the number of pixels equal to the reference value as the smooth level. In this way, difference histograms for each smooth level can be constructed. We embed the secret data using histogram shifting from the highest level histogram to lower level ones instead of sequential embedding. By this means, our proposed reversible data hiding scheme can adaptively embed data in the smooth blocks and thus improve the marked image quality with a comparable embedding capacity. The experimental results also demonstrate its superiority over some state-of-the-art reversible data hiding works.
{"title":"An Efficient Reversible Data Hiding Scheme Based on Reference Pixel and Block Selection","authors":"Siren Cai, Xinlu Gui","doi":"10.1109/IIH-MSP.2013.147","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.147","url":null,"abstract":"In this paper, we propose an efficient data hiding scheme based on reference pixel and block selection to further improve the embedding performance of histogram shifting. Specifically, we first divide the original image into non-overlapping blocks of an adjustable size. Then for each block, we assign the median of pixels as the reference pixel and the number of pixels equal to the reference value as the smooth level. In this way, difference histograms for each smooth level can be constructed. We embed the secret data using histogram shifting from the highest level histogram to lower level ones instead of sequential embedding. By this means, our proposed reversible data hiding scheme can adaptively embed data in the smooth blocks and thus improve the marked image quality with a comparable embedding capacity. The experimental results also demonstrate its superiority over some state-of-the-art reversible data hiding works.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124172747","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 : 2013-10-16DOI: 10.1109/IIH-MSP.2013.138
Yulong Qiao, Ying Zhao, Xianrui Song
Dynamic texture is an extension of texture to the spatio-temporal domain. The motion property is one of the most important characteristics in dynamic texture analysis. This paper proposes a dynamic texture classification method based on the block-based motion estimation method and the statistical feature matrix. The method makes use of the block-based motion estimation method to estimate the motion vector of the dynamic texture, and constructs the statistical feature matrix by computing the complex covariance and dissimilarity of the motion vectors, which is used to describe the dynamic texture. The classification method is evaluated on two benchmark dynamic texture databases. The experimental results demonstrate the effectiveness of the introduced method.
{"title":"Dynamic Texture Classification Based on Motion Statistical Feature Matrix","authors":"Yulong Qiao, Ying Zhao, Xianrui Song","doi":"10.1109/IIH-MSP.2013.138","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.138","url":null,"abstract":"Dynamic texture is an extension of texture to the spatio-temporal domain. The motion property is one of the most important characteristics in dynamic texture analysis. This paper proposes a dynamic texture classification method based on the block-based motion estimation method and the statistical feature matrix. The method makes use of the block-based motion estimation method to estimate the motion vector of the dynamic texture, and constructs the statistical feature matrix by computing the complex covariance and dissimilarity of the motion vectors, which is used to describe the dynamic texture. The classification method is evaluated on two benchmark dynamic texture databases. The experimental results demonstrate the effectiveness of the introduced method.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348709","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 fault diagnosis for high availability system is required that it detects failure points as quick as possible. Moreover, it can realize the much higher availability, if it detects the point that is more likely to break down while the system operates normally. To meet these requirements, we propose a new algorithm for the immunity-based system diagnosis, which can detect unknown fault modes. The immunity-based system diagnosis has mutual test among sensors in the system. Proposed algorithm has continuous variables of its mutual test results among sensors. The variables are calculated from the deviation from typical relationship among output of sensors. Our experimental results demonstrate that proposed algorithm needs much less number of times of sampling than conventional algorithm for fault detection, and it can detect the sensor that has the largest error in the system while system operates normally.
{"title":"Diagnosis Algorithm of Immunity-Based System with Continuous Variable of Mutual Test Results among Sensors","authors":"K. Wada, T. Toriu, H. Hama","doi":"10.1109/IIH-MSP.2013.70","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2013.70","url":null,"abstract":"The fault diagnosis for high availability system is required that it detects failure points as quick as possible. Moreover, it can realize the much higher availability, if it detects the point that is more likely to break down while the system operates normally. To meet these requirements, we propose a new algorithm for the immunity-based system diagnosis, which can detect unknown fault modes. The immunity-based system diagnosis has mutual test among sensors in the system. Proposed algorithm has continuous variables of its mutual test results among sensors. The variables are calculated from the deviation from typical relationship among output of sensors. Our experimental results demonstrate that proposed algorithm needs much less number of times of sampling than conventional algorithm for fault detection, and it can detect the sensor that has the largest error in the system while system operates normally.","PeriodicalId":105427,"journal":{"name":"2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127757631","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
扫码关注我们
求助内容：
应助结果提醒方式：