Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.151
Lei Zhang, Qiuguang Wang, J. Qi
This paper introduces a kind of cancer cells in pleural fluid microscopic images processing and fuzzy recognizing method. We propose a method, which firstly segments the image using the OTSU thresholding method and fuzzy edge detection, then extracts 7 measurement parameters i.e. the area rate of the karyon and cytoplasm, the optic density, the shape factor and else, finally uses fuzzy pattern recognition which is based on establishing 6 membership functions and 4 normative modes to recognize the cancer cells. Experiments show that this system provides valuable suggestions to the diagnosis of cancer.
{"title":"Research Based on Fuzzy Algorithm of Cancer Cells in Pleural Fluid Microscopic Images Recognition","authors":"Lei Zhang, Qiuguang Wang, J. Qi","doi":"10.1109/IIH-MSP.2006.151","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.151","url":null,"abstract":"This paper introduces a kind of cancer cells in pleural fluid microscopic images processing and fuzzy recognizing method. We propose a method, which firstly segments the image using the OTSU thresholding method and fuzzy edge detection, then extracts 7 measurement parameters i.e. the area rate of the karyon and cytoplasm, the optic density, the shape factor and else, finally uses fuzzy pattern recognition which is based on establishing 6 membership functions and 4 normative modes to recognize the cancer cells. Experiments show that this system provides valuable suggestions to the diagnosis of cancer.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"6 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":"130316793","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}
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}
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}
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}
Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.144
Ruogu Yang, Gang Feng, Donghai Li
Reducing bus power consumption has become one of key issues for low power multimedia SoC design. The power which dissipated on interconnected bus includes the self transition power consumption and the coupled transition power consumption between every two signal lines. This paper, firstly propose an on-chip bus power consumption model. Then a heuristic algorithm is proposed to determine a physical order of signal lines in bus to minimize the power consumption on the interconnected bus. Experimental results show that the proposed heuristic algorithm is effective.
{"title":"Power Optimization for Bus on Multimedia SoC","authors":"Ruogu Yang, Gang Feng, Donghai Li","doi":"10.1109/IIH-MSP.2006.144","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.144","url":null,"abstract":"Reducing bus power consumption has become one of key issues for low power multimedia SoC design. The power which dissipated on interconnected bus includes the self transition power consumption and the coupled transition power consumption between every two signal lines. This paper, firstly propose an on-chip bus power consumption model. Then a heuristic algorithm is proposed to determine a physical order of signal lines in bus to minimize the power consumption on the interconnected bus. Experimental results show that the proposed heuristic algorithm is effective.","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":"124116852","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 SVD-based method is developed to classify face images. The experimental results show that the novel method outperforms the existing SVD-based face recognition methods. In addition, we investigate the performances on face recognition of singular values, left and right singular vectors generated from SVD and assess the existing SVD-based face recognition methods. It appears that by compared with singular values and singular vectors, SVD-based reconstruction images are more useful in classifying face images. In practice, through the SVD-based image reconstruction process, we may weaken the side effects on face classification of varying imaging conditions and facial expressions.
{"title":"Comparison Study on SVD-Based Face Classification","authors":"Yong Xu, Ying-nan Zhao","doi":"10.1109/IIH-MSP.2006.75","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.75","url":null,"abstract":"In this paper, a novel SVD-based method is developed to classify face images. The experimental results show that the novel method outperforms the existing SVD-based face recognition methods. In addition, we investigate the performances on face recognition of singular values, left and right singular vectors generated from SVD and assess the existing SVD-based face recognition methods. It appears that by compared with singular values and singular vectors, SVD-based reconstruction images are more useful in classifying face images. In practice, through the SVD-based image reconstruction process, we may weaken the side effects on face classification of varying imaging conditions and facial expressions.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"56 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":"127974637","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}
For instruction decompression, techniques such as single buffering, double buffering and pipelining have been proposed. However, due to jumping penalty, these techniques incur more delays in pipeline or system has to be stopped to refill the cache buffers. A Pipeline with Back-up for Flushing (PBF) technique has been developed that incurs no delay and without stopping due to jumping. However, the first instruction of each basic block should not be compressed and be put in another ROM, and thus the compression ratio should be sacrificed. This paper improves the PBF technique such that a single program ROM needed only. The simulation results for several benchmarks show that the average compression ratio is decreased about 11%, and the hardware cost deceased about 8%.
{"title":"A Single-Stream Pipelined Instruction Decompression System for Embedded Microprocessors","authors":"Y. Jeang, T. Wey, Hung-Yu Wang, Chih-Chung Tai","doi":"10.1109/IIH-MSP.2006.40","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.40","url":null,"abstract":"For instruction decompression, techniques such as single buffering, double buffering and pipelining have been proposed. However, due to jumping penalty, these techniques incur more delays in pipeline or system has to be stopped to refill the cache buffers. A Pipeline with Back-up for Flushing (PBF) technique has been developed that incurs no delay and without stopping due to jumping. However, the first instruction of each basic block should not be compressed and be put in another ROM, and thus the compression ratio should be sacrificed. This paper improves the PBF technique such that a single program ROM needed only. The simulation results for several benchmarks show that the average compression ratio is decreased about 11%, and the hardware cost deceased about 8%.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"39 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":"128001536","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.169
Ku-Lan Kao, C. Ke, C. Shieh
This paper evaluates the video transmission performance of three well-known ad-hoc routing protocols. Due to high mobility and rapid movement characteristics, video transmission over ad-hoc networks is becoming more difficult than simple data transmission. Consequently, finding an efficient way for multimedia communication is becoming an important issue nowadays. We make a complete comparison between the two prominent on-demand reactive routing protocols, DSR and AODV, and the proactive DSDV routing protocol. Our improved simulation tool-set is used with NS-2 and myEvalvid-NT in this simulation, and we adopted the PSNR performance evaluation metric. Results indicate that DSDV is much worse than the other protocols for video transmission, and AODV is the best routing protocol in our simulation.
{"title":"Video Transmission Performance Evaluation of Ad Hoc Routing Protocols","authors":"Ku-Lan Kao, C. Ke, C. Shieh","doi":"10.1109/IIH-MSP.2006.169","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.169","url":null,"abstract":"This paper evaluates the video transmission performance of three well-known ad-hoc routing protocols. Due to high mobility and rapid movement characteristics, video transmission over ad-hoc networks is becoming more difficult than simple data transmission. Consequently, finding an efficient way for multimedia communication is becoming an important issue nowadays. We make a complete comparison between the two prominent on-demand reactive routing protocols, DSR and AODV, and the proactive DSDV routing protocol. Our improved simulation tool-set is used with NS-2 and myEvalvid-NT in this simulation, and we adopted the PSNR performance evaluation metric. Results indicate that DSDV is much worse than the other protocols for video transmission, and AODV is the best routing protocol in our simulation.","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":"121199471","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}
Signal processing is the critical equipment and the guarantee of technology to media gateway, so it is very important to evaluate the signal processing effect of media gateway. In this paper the Correlation Criterion which is based correlation operator on theory and uses correlation coefficient as the index of evaluation is put forward. In this method, the select of standard test signal is the key. The paper introduces the dependence and reason of choosing standard test signal. The cross correlation criterion is a normalized, quantitative, time domain evaluation method.
{"title":"Evaluation of Signal Processing Effect in Media Gateway Based on Cross Correlation","authors":"Hao Wang, Yanying Wang, Jikun Guo, D. Gao","doi":"10.1109/IIH-MSP.2006.96","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.96","url":null,"abstract":"Signal processing is the critical equipment and the guarantee of technology to media gateway, so it is very important to evaluate the signal processing effect of media gateway. In this paper the Correlation Criterion which is based correlation operator on theory and uses correlation coefficient as the index of evaluation is put forward. In this method, the select of standard test signal is the key. The paper introduces the dependence and reason of choosing standard test signal. The cross correlation criterion is a normalized, quantitative, time domain evaluation method.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"131 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":"129138295","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
扫码关注我们
求助内容：
应助结果提醒方式：