Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.146
Chinchen Chang, J. Chuang
Progressive image transmission is often used in low bandwidth communications or in limited bandwidth environments. When a user browses an image on a website, the web server first sends a low quality image to the receiver and then gradually improves the image quality by subsequent transmissions .Because the image size becomes larger and larger, it is essential to develop a flexible and efficient technique to help users quickly browse or retrieve images on a website. For this reason, using significant features along with a prediction technique for progressive image transmission is proposed in this paper. In our method, significant features of an image need to be extracted first. Next, these features, according to their priority, are sent to the receiver. For reducing the encoding cost of the transmitted data, three approaches, sampling, quantization, and linear regression prediction, are also presented.
{"title":"Progressive Image Transmission Using Significant Features and Linear Regression Prediction","authors":"Chinchen Chang, J. Chuang","doi":"10.1109/IIH-MSP.2006.146","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.146","url":null,"abstract":"Progressive image transmission is often used in low bandwidth communications or in limited bandwidth environments. When a user browses an image on a website, the web server first sends a low quality image to the receiver and then gradually improves the image quality by subsequent transmissions .Because the image size becomes larger and larger, it is essential to develop a flexible and efficient technique to help users quickly browse or retrieve images on a website. For this reason, using significant features along with a prediction technique for progressive image transmission is proposed in this paper. In our method, significant features of an image need to be extracted first. Next, these features, according to their priority, are sent to the receiver. For reducing the encoding cost of the transmitted data, three approaches, sampling, quantization, and linear regression prediction, are also presented.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121791689","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 : 2006-12-18DOI: 10.1109/IIH-MSP.2006.111
Chun-Chieh Tseng, Mao-Fu Lai, Por-Song Lee
In today¿s competitive passive components market, the quality and delivery time of products are the key factors to survive. The traditional quality control process is performed by human experts, which is slow and error prone. In recent years, automatic inspection becomes a mainstream and many works have been published. However, the industry still demands a faster and more accurate inspection method. In this paper, a novel image inspection algorithm to detect defects of Multilayer Ceramic Capacitor (MLCC) is proposed. A testing system is developed and integrated into a production line. In our experiment, the proposed algorithm is proved to be very effective. The inspection system speeds up the testing process 2.5 times as well as increases the yield rate considerably.
{"title":"Image Inspection System for Defect Detection of Multilayer Ceramic Capacitors","authors":"Chun-Chieh Tseng, Mao-Fu Lai, Por-Song Lee","doi":"10.1109/IIH-MSP.2006.111","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.111","url":null,"abstract":"In today¿s competitive passive components market, the quality and delivery time of products are the key factors to survive. The traditional quality control process is performed by human experts, which is slow and error prone. In recent years, automatic inspection becomes a mainstream and many works have been published. However, the industry still demands a faster and more accurate inspection method. In this paper, a novel image inspection algorithm to detect defects of Multilayer Ceramic Capacitor (MLCC) is proposed. A testing system is developed and integrated into a production line. In our experiment, the proposed algorithm is proved to be very effective. The inspection system speeds up the testing process 2.5 times as well as increases the yield rate considerably.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821164","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}
A novel progressive estimation scheme is proposed to detect moving targets in infrared video sequences in this work. The proposed algorithm does not place constraints on camera motions nor requires rigid backgrounds. The complexity of the algorithm is low so that it can be performed in real time. Computational results of the algorithm applied to a real-world infrared video sequence are given to demonstrate its superior detection performance.
{"title":"Automatic Real-Time Moving Target Detection from Infrared Video","authors":"Shahryar Karimi-Ashtiani, C.-C. Jay Kuo","doi":"10.1109/IIH-MSP.2006.64","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.64","url":null,"abstract":"A novel progressive estimation scheme is proposed to detect moving targets in infrared video sequences in this work. The proposed algorithm does not place constraints on camera motions nor requires rigid backgrounds. The complexity of the algorithm is low so that it can be performed in real time. Computational results of the algorithm applied to a real-world infrared video sequence are given to demonstrate its superior detection performance.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133888053","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}
In this paper, a novel watermarking algorithm is proposed in Contourlet domain with ICA (independent component analysis). Contourlet transform is adopted in watermarking embedding scheme. In contrast to the wavelet transform, a kind of contour segment base are adopted to approach singular curve, and a flexible multiresolution, local, and directional expansion of an image is obtained. Watermarking image is embedded into the most distinct subband in order to obtain robustness. ICA processing is adopted in watermarking detected scheme. The watermarking can be correctly detected by no care about the attack type and attack parameter which the watermarked image would be suffered. To prove the validity of our approach, we give experimental results, our algorithm is robust to JPEG compression and noise attack, and especially robust to geometry attack, filter and image processing.
{"title":"A Novel Watermarking Scheme in Contourlet Domain Based on Independent Component Analysis","authors":"Zhao Xu, Ke Wang, Xiao-hua Qiao","doi":"10.1109/IIH-MSP.2006.34","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.34","url":null,"abstract":"In this paper, a novel watermarking algorithm is proposed in Contourlet domain with ICA (independent component analysis). Contourlet transform is adopted in watermarking embedding scheme. In contrast to the wavelet transform, a kind of contour segment base are adopted to approach singular curve, and a flexible multiresolution, local, and directional expansion of an image is obtained. Watermarking image is embedded into the most distinct subband in order to obtain robustness. ICA processing is adopted in watermarking detected scheme. The watermarking can be correctly detected by no care about the attack type and attack parameter which the watermarked image would be suffered. To prove the validity of our approach, we give experimental results, our algorithm is robust to JPEG compression and noise attack, and especially robust to geometry attack, filter and image processing.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116047284","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 novel method of blind image watermarking in contourlet domain. We have used spread spectrum technique for additive watermark embedding. A correlation detector is used to detect the embedded pseudorandom sequence. The binary logo thus retrieved proves authenticity of the image. The similarity of the retrieved binary logo with the original embedded logo is veriJied using correlation technique. Post processing of the retrieved logo gives better visual effects, further aiding threshold selection for detection. We have verijied the robustness of the proposed method against dzrerent attacks including StirMark attack. The proposed method is compared with a wavelet based blind technique and the results prove that contourlet based technique gives better robustness, under similar embedding conditions.
{"title":"Blind Watermarking in Contourlet Domain with Improved Detection","authors":"M. Jayalakshmi, S. Merchant, U. Desai","doi":"10.1109/IIH-MSP.2006.65","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.65","url":null,"abstract":"This paper presents a novel method of blind image watermarking in contourlet domain. We have used spread spectrum technique for additive watermark embedding. A correlation detector is used to detect the embedded pseudorandom sequence. The binary logo thus retrieved proves authenticity of the image. The similarity of the retrieved binary logo with the original embedded logo is veriJied using correlation technique. Post processing of the retrieved logo gives better visual effects, further aiding threshold selection for detection. We have verijied the robustness of the proposed method against dzrerent attacks including StirMark attack. The proposed method is compared with a wavelet based blind technique and the results prove that contourlet based technique gives better robustness, under similar embedding conditions.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123460157","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}
In this paper a new two-dimensional map is proposed. It is a process of stretch-and-fold. Firstly a square image is divide two parts according diagonal. Secondly each part of image is stretch respectively and joins a line. Lastly the line is fold over to a new square image of same size. The map divides into the left map and the right map. The process shuffles the positions of image pixels. Comparing the prevalent twodimensional map, Cat map and Baker map, the new map has simple formulation, big keys space which is fit for image encryption. An image encryption scheme based on the map is developed. The numbers of the left map and the right map are used as the key. The deciphering process is opposite using the same keys. The results of simulation show that it can be used in real-time image encryption applications.
{"title":"An Image Encryption Approach Based on a New Two-Dimensional Map","authors":"F. Huang, Yong Feng","doi":"10.1109/IIH-MSP.2006.49","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.49","url":null,"abstract":"In this paper a new two-dimensional map is proposed. It is a process of stretch-and-fold. Firstly a square image is divide two parts according diagonal. Secondly each part of image is stretch respectively and joins a line. Lastly the line is fold over to a new square image of same size. The map divides into the left map and the right map. The process shuffles the positions of image pixels. Comparing the prevalent twodimensional map, Cat map and Baker map, the new map has simple formulation, big keys space which is fit for image encryption. An image encryption scheme based on the map is developed. The numbers of the left map and the right map are used as the key. The deciphering process is opposite using the same keys. The results of simulation show that it can be used in real-time image encryption applications.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125151916","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 a new algorithm for scrambling digital image based on the cat chaotic mapping. We disorder the pixel coordinates of the digital image through using a cat chaotic mapping, and then perform exclusive OR operation between certain pixel value of the digital image and a chaotic value. The experiment results have shown that the new diffusion technique proposed in this paper is very effective to uniform the statistical characteristics of the encrypted graph, and the efficiency of this method is very high.
{"title":"A Novel Algorithm for Scrambling Digital Image Based on Cat Chaotic Mapping","authors":"Liehuang Zhu, Wenzhuo Li, L. Liao, Hong Li","doi":"10.1109/IIH-MSP.2006.25","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.25","url":null,"abstract":"This paper proposes a new algorithm for scrambling digital image based on the cat chaotic mapping. We disorder the pixel coordinates of the digital image through using a cat chaotic mapping, and then perform exclusive OR operation between certain pixel value of the digital image and a chaotic value. The experiment results have shown that the new diffusion technique proposed in this paper is very effective to uniform the statistical characteristics of the encrypted graph, and the efficiency of this method is very high.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884389","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}
In this paper, an adaptive blind watermarking algorithm is proposed, which presents a new method of block classification based on the characteristic of visual masking of HVS (human visual system) model, including energy and variance. According to the new classification method, classify image blocks and select quantization pedometers adaptively to embed the watermark into DC component. At the same time, because of the shortage of watermark intensity only embedded into DC components, the algorithm presents that the same watermark is embedded into mid-frequency subbands by changing the order of these coefficients under invisibility. This is a blind watermarking algorithm, the watermark can be extracted without the original picture needed. Experimental results and attacks analysis show that the proposed algorithm is effective and robust to common image processing and some geometric attacks, such as JPEG lossy compression, scaling, additive noise, rotation, histogram equilibrium, contrast adjusting, brightness adjusting, filtering and so on.
{"title":"A Robust Watermarking Algorithm Adopting Double Embedding","authors":"Xiao-hua Qiao, Shuxun Wang, Quanxiu Wen, Zhao Xu","doi":"10.1109/IIH-MSP.2006.38","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.38","url":null,"abstract":"In this paper, an adaptive blind watermarking algorithm is proposed, which presents a new method of block classification based on the characteristic of visual masking of HVS (human visual system) model, including energy and variance. According to the new classification method, classify image blocks and select quantization pedometers adaptively to embed the watermark into DC component. At the same time, because of the shortage of watermark intensity only embedded into DC components, the algorithm presents that the same watermark is embedded into mid-frequency subbands by changing the order of these coefficients under invisibility. This is a blind watermarking algorithm, the watermark can be extracted without the original picture needed. Experimental results and attacks analysis show that the proposed algorithm is effective and robust to common image processing and some geometric attacks, such as JPEG lossy compression, scaling, additive noise, rotation, histogram equilibrium, contrast adjusting, brightness adjusting, filtering and so on.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126921054","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}
Multimedia Home Platform (MHP) is a standard to enable versatile applications of a DVB program. In this paper, we design and implement a simplified MHP video and graphics subsystem. The Xilinx ML310 is chosen as the hardware platform to implement our design. The execution environment consists of an embedded Linux, a frame-buffer based X server, and a Java ME Personal Basis Profile (J2ME PBP) run-time. To implement the MHP video functionality, we incorporate the FFmpeg libraries and the JavaTV JMF Lite to provide the demultiplexing and rendering operations of an MPEG-2 video. In addition, our major efforts are put on the video and graphics integration. The J2ME PBP reference software is heavily modified to optimally compose the video objects and the AWT graphics components in an MHP-compliant way. The application examples show that our proposed system is able to provide the AWT graphics and the JMF video presentation services, including normal presentation, arbitrary clipping, scaling and positioning of an MPEG-2 video.
多媒体家庭平台(MHP)是实现DVB程序多用途应用的标准。在本文中，我们设计并实现了一个简化的MHP视频和图形子系统。本设计选用Xilinx ML310作为硬件平台来实现。执行环境由嵌入式Linux、基于帧缓冲区的X服务器和Java ME Personal Basis Profile (J2ME PBP)运行时组成。为了实现MHP视频功能，我们结合了FFmpeg库和JavaTV JMF Lite来提供MPEG-2视频的解复用和呈现操作。此外，我们的主要努力放在视频和图形集成。对J2ME PBP参考软件进行了大量修改，以便以符合mhp的方式最佳地组合视频对象和AWT图形组件。应用实例表明，该系统能够提供AWT图形和JMF视频显示服务，包括MPEG-2视频的正常显示、任意剪辑、缩放和定位。
{"title":"Design and Implementation of an MHP Video and Graphics Subsystem on Xilinx ML310 Platform","authors":"Min-Hong Chen, Feng-Cheng Chang, H. Hang","doi":"10.1109/IIH-MSP.2006.80","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.80","url":null,"abstract":"Multimedia Home Platform (MHP) is a standard to enable versatile applications of a DVB program. In this paper, we design and implement a simplified MHP video and graphics subsystem. The Xilinx ML310 is chosen as the hardware platform to implement our design. The execution environment consists of an embedded Linux, a frame-buffer based X server, and a Java ME Personal Basis Profile (J2ME PBP) run-time. To implement the MHP video functionality, we incorporate the FFmpeg libraries and the JavaTV JMF Lite to provide the demultiplexing and rendering operations of an MPEG-2 video. In addition, our major efforts are put on the video and graphics integration. The J2ME PBP reference software is heavily modified to optimally compose the video objects and the AWT graphics components in an MHP-compliant way. The application examples show that our proposed system is able to provide the AWT graphics and the JMF video presentation services, including normal presentation, arbitrary clipping, scaling and positioning of an MPEG-2 video.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126469370","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 : 2006-12-18DOI: 10.1109/IIH-MSP.2006.117
Pasquale Cataldi, Miquel Pedros Shatarski, Marco Grangetto, E. Magli
Digital fountains have changed the standard transmission paradigm. A digital fountain can encode and transmit an unlimited number of data packets until every user gets enough information to guarantee correct decoding. Multimedia broadcasting, emerging peer-to-peer applications are only two examples of many other scenarios where digital fountains can be successfully applied. In this paper practical implementation issues of two class of digital fountain codes, namely LT and Raptor codes, are analyzed. Moreover, the performance in terms of coding and decoding complexity is measured experimentally.
{"title":"Implementation and Performance Evaluation of LT and Raptor Codes for Multimedia Applications","authors":"Pasquale Cataldi, Miquel Pedros Shatarski, Marco Grangetto, E. Magli","doi":"10.1109/IIH-MSP.2006.117","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.117","url":null,"abstract":"Digital fountains have changed the standard transmission paradigm. A digital fountain can encode and transmit an unlimited number of data packets until every user gets enough information to guarantee correct decoding. Multimedia broadcasting, emerging peer-to-peer applications are only two examples of many other scenarios where digital fountains can be successfully applied. In this paper practical implementation issues of two class of digital fountain codes, namely LT and Raptor codes, are analyzed. Moreover, the performance in terms of coding and decoding complexity is measured experimentally.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127527809","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
扫码关注我们
求助内容：
应助结果提醒方式：