Pub Date : 2000-03-27DOI: 10.1109/ITCC.2000.844261
R. Hasimoto-Beltrán, A. Khokhar
We address the problem of transmitting JPEG compressed image over a lossy network. We introduce a combination of block level triangular interleaving scheme (TRII), and variable and selective forward error correction scheme (VS-FEC) to make the transmitted data more resilient while using the network bandwidth more efficiently in the presence of bursty losses. Our results show that TRII barely affects the final compression ratio of the transmitted image (on the average just 4% below JPEG), while considerably increases its resilience to errors. Also, in the presence of losses, a new scheme is introduced to dynamically add a variable FEC to avoid retransmission of the lost data. A small amount of FEC overhead was needed (4%, versus 10%-15% in constant FEC) to be at least 90% sure on the average that the protected information will not be damaged during transmission.
{"title":"Dynamic adaptive forward error control framework for image transmission over lossy networks","authors":"R. Hasimoto-Beltrán, A. Khokhar","doi":"10.1109/ITCC.2000.844261","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844261","url":null,"abstract":"We address the problem of transmitting JPEG compressed image over a lossy network. We introduce a combination of block level triangular interleaving scheme (TRII), and variable and selective forward error correction scheme (VS-FEC) to make the transmitted data more resilient while using the network bandwidth more efficiently in the presence of bursty losses. Our results show that TRII barely affects the final compression ratio of the transmitted image (on the average just 4% below JPEG), while considerably increases its resilience to errors. Also, in the presence of losses, a new scheme is introduced to dynamically add a variable FEC to avoid retransmission of the lost data. A small amount of FEC overhead was needed (4%, versus 10%-15% in constant FEC) to be at least 90% sure on the average that the protected information will not be damaged during transmission.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114551187","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844263
M. Salah, R. Raines, M. Temple, T. G. Bailey
The key to the efficient operation of turbo codes is the interleaver design. With proper design, the pairing of low-weight sequences to the input of the encoders can be avoided. Circular shift interleavers can be used to ensure that the minimum distance due to weight-2 input sequences grows roughly as /spl radic/2N, where N is the block length. We generalized the mapping function of the circular shift interleaver to be suitable for both equal and unequal error protections. Also, we present the results of a unique examination of the behavior of the general circular shift interleaver for equal and unequal error protections using turbo code with short frames.
{"title":"A general interleaver for equal and unequal error protections of turbo codes with short frames","authors":"M. Salah, R. Raines, M. Temple, T. G. Bailey","doi":"10.1109/ITCC.2000.844263","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844263","url":null,"abstract":"The key to the efficient operation of turbo codes is the interleaver design. With proper design, the pairing of low-weight sequences to the input of the encoders can be avoided. Circular shift interleavers can be used to ensure that the minimum distance due to weight-2 input sequences grows roughly as /spl radic/2N, where N is the block length. We generalized the mapping function of the circular shift interleaver to be suitable for both equal and unequal error protections. Also, we present the results of a unique examination of the behavior of the general circular shift interleaver for equal and unequal error protections using turbo code with short frames.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129074922","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844218
M. Kholief, S. Shen, K. Maly
Data streams are a very important source of information for both researchers and ordinary users. Data streams might be video or audio streams or might be a stream of sensor readings, satellite images, etc. Saving data streams in digital libraries add the advantages of using digital libraries from archival, preservation, administration, access control, etc. to this information. For this specific type of digital libraries, event based retrieval provides an alternative, yet very natural way of retrieving information. People tend to remember or search by a specific event that happened in the stream better than by the time at which this event happened. The authors describe the organization and services of a prototype digital library system that contains streamed data and enables event based retrieval from them. They present a preliminary formal definition of data streams and events. They also show some possible applications of this system and conclude by presenting the ongoing and future extensions to the research.
{"title":"Event-based retrieval from digital libraries containing streamed data","authors":"M. Kholief, S. Shen, K. Maly","doi":"10.1109/ITCC.2000.844218","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844218","url":null,"abstract":"Data streams are a very important source of information for both researchers and ordinary users. Data streams might be video or audio streams or might be a stream of sensor readings, satellite images, etc. Saving data streams in digital libraries add the advantages of using digital libraries from archival, preservation, administration, access control, etc. to this information. For this specific type of digital libraries, event based retrieval provides an alternative, yet very natural way of retrieving information. People tend to remember or search by a specific event that happened in the stream better than by the time at which this event happened. The authors describe the organization and services of a prototype digital library system that contains streamed data and enables event based retrieval from them. They present a preliminary formal definition of data streams and events. They also show some possible applications of this system and conclude by presenting the ongoing and future extensions to the research.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1987 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130723875","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844198
K. Wiatr, P. Russek
The issues of video coding based on exceptionally suitable for SHD format Shapiro (1993) EZW (embedded zero wavelet) algorithm is discussed. The main aspect is a possibility of building a real time system which is able to process the algorithm. Thus a dedicated architecture for the purpose is considered. The method presented is based on the EZW method modified such a way to simplify the hardware architecture dedicated for its execution. Such a simplification allows one to use FPGA technology as a target platform for the system. The MISD (multiple instruction-stream single data-stream) architecture is proposed as a solution of the problem. The architecture is characterised by high speed execution of the EZW algorithm. Simplicity and performance classify the algorithm for implementation in high capacity programmable FPGA structures. The paper is the authors contribution in the world's development of custom computing machines (CCM).
{"title":"Embedded zero wavelet coefficient coding method for FPGA implementation of video codec in real-time systems","authors":"K. Wiatr, P. Russek","doi":"10.1109/ITCC.2000.844198","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844198","url":null,"abstract":"The issues of video coding based on exceptionally suitable for SHD format Shapiro (1993) EZW (embedded zero wavelet) algorithm is discussed. The main aspect is a possibility of building a real time system which is able to process the algorithm. Thus a dedicated architecture for the purpose is considered. The method presented is based on the EZW method modified such a way to simplify the hardware architecture dedicated for its execution. Such a simplification allows one to use FPGA technology as a target platform for the system. The MISD (multiple instruction-stream single data-stream) architecture is proposed as a solution of the problem. The architecture is characterised by high speed execution of the EZW algorithm. Simplicity and performance classify the algorithm for implementation in high capacity programmable FPGA structures. The paper is the authors contribution in the world's development of custom computing machines (CCM).","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130797105","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844183
P. Wu
In this paper, we propose a method of regional search for fractal image compression and decompression. In this method, the search for fractal codes is carried out in a region of the image instead of over the whole image. Because the area surrounding a partitioned block has a high probability of being similar to the block, the use of regional search to find the fractal codes results in sharply reduced compression times and with only minor increases in the compression ratio, as compared to conventional methods. By using a 128/spl times/128 search region, we can compress a 1024/spl times/1024 Lena image on a Pentium II-300 PC in 2.8 seconds, obtaining results of high visual quality, with a compression ratio of 87 and a PSNR of 36.67. By comparison conventional fractal image compression requires 176 seconds, has a compression ratio of 84 and has a PSNR of 39.68. Moreover, if we reduce the search regions to 32/spl times/32 and accept a slightly more basic level of visual quality, the compression time is 1.0 second, the compression ratio is 91 and the PNSR is 33.98.
{"title":"Fast fractal image compression","authors":"P. Wu","doi":"10.1109/ITCC.2000.844183","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844183","url":null,"abstract":"In this paper, we propose a method of regional search for fractal image compression and decompression. In this method, the search for fractal codes is carried out in a region of the image instead of over the whole image. Because the area surrounding a partitioned block has a high probability of being similar to the block, the use of regional search to find the fractal codes results in sharply reduced compression times and with only minor increases in the compression ratio, as compared to conventional methods. By using a 128/spl times/128 search region, we can compress a 1024/spl times/1024 Lena image on a Pentium II-300 PC in 2.8 seconds, obtaining results of high visual quality, with a compression ratio of 87 and a PSNR of 36.67. By comparison conventional fractal image compression requires 176 seconds, has a compression ratio of 84 and has a PSNR of 39.68. Moreover, if we reduce the search regions to 32/spl times/32 and accept a slightly more basic level of visual quality, the compression time is 1.0 second, the compression ratio is 91 and the PNSR is 33.98.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116203660","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844185
B. Mobasseri
Spatial watermarks are simple and quick to embed but vulnerable to intentional attacks or benign transformation such as compression. Watermarking of compressed video is often performed in the compressed domain. In this paper we show that by exploiting the inherent processing gain of direct sequence spread spectrum, it is possible to embed a watermark in raw video and still recover it from an MPEG decoder.
{"title":"A spatial digital video watermark that survives MPEG","authors":"B. Mobasseri","doi":"10.1109/ITCC.2000.844185","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844185","url":null,"abstract":"Spatial watermarks are simple and quick to embed but vulnerable to intentional attacks or benign transformation such as compression. Watermarking of compressed video is often performed in the compressed domain. In this paper we show that by exploiting the inherent processing gain of direct sequence spread spectrum, it is possible to embed a watermark in raw video and still recover it from an MPEG decoder.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127399422","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844279
Chi-Hung Chi
Global sharing and distribution of information on the Internet result in a great demand for efficient multi-lingual text compression for Web servers and proxy implementations. Current text compressors such as Huffman coding, Lempel-Ziv (LZ) variants, and LZ-Huffman cascading fail to perform efficiently because of the mis-matched character sampling size and the large character set of multilingual languages. Our previous research has shown that a better compression ratio can be obtained by re-adjusting the character sampling rate. We investigate the cascading of LZ variants to Huffman coding for multilingual documents. Two basic approaches, static and dynamic dictionaries, are proposed. Techniques for reducing the dictionary overhead are also suggested. Based on our multi-lingual corpus, our adaptive cascading scheme can perform better than the well-known cascading compressor, gzip, by an average of about 20%.
{"title":"Multi-lingual cascading text compressors for WWW","authors":"Chi-Hung Chi","doi":"10.1109/ITCC.2000.844279","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844279","url":null,"abstract":"Global sharing and distribution of information on the Internet result in a great demand for efficient multi-lingual text compression for Web servers and proxy implementations. Current text compressors such as Huffman coding, Lempel-Ziv (LZ) variants, and LZ-Huffman cascading fail to perform efficiently because of the mis-matched character sampling size and the large character set of multilingual languages. Our previous research has shown that a better compression ratio can be obtained by re-adjusting the character sampling rate. We investigate the cascading of LZ variants to Huffman coding for multilingual documents. Two basic approaches, static and dynamic dictionaries, are proposed. Techniques for reducing the dictionary overhead are also suggested. Based on our multi-lingual corpus, our adaptive cascading scheme can perform better than the well-known cascading compressor, gzip, by an average of about 20%.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126361586","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844195
J. Domingo-Ferrer, J. Herrera-Joancomartí
This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to decide mark location and magnitude; the proposed algorithm supports multiple marking. The properties of dual binary Hamming codes are exploited to obtain a fingerprinting scheme secure against collusion of two buyers. The fingerprinting construction proposed here is simpler than previous collusion-secure proposals.
{"title":"Simple collusion-secure fingerprinting schemes for images","authors":"J. Domingo-Ferrer, J. Herrera-Joancomartí","doi":"10.1109/ITCC.2000.844195","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844195","url":null,"abstract":"This paper describes a robust watermarking algorithm and a collusion-secure fingerprinting scheme based on it. Watermarking robustness is obtained by using the JPEG algorithm to decide mark location and magnitude; the proposed algorithm supports multiple marking. The properties of dual binary Hamming codes are exploited to obtain a fingerprinting scheme secure against collusion of two buyers. The fingerprinting construction proposed here is simpler than previous collusion-secure proposals.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"97 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113971447","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844175
I. Cox, Matthew L. Miller, J. Bloom
We describe a number of applications of digital watermarking and we examine the common properties of robustness, tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to be applied.
{"title":"Watermarking applications and their properties","authors":"I. Cox, Matthew L. Miller, J. Bloom","doi":"10.1109/ITCC.2000.844175","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844175","url":null,"abstract":"We describe a number of applications of digital watermarking and we examine the common properties of robustness, tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to be applied.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121601862","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 : 2000-03-27DOI: 10.1109/ITCC.2000.844245
S. Varada, D. Shilonie
The management of memory resources is critical to the preservation of system integrity in a data communications system. The memory resources appear in various forms in a target system; examples include objects such as connection management data structures, data or control flow request descriptors, buffers and their descriptors. The critical part of resource management is to free-up or recycle the allocated memory resources when no longer needed with a scope that encompasses all user and system components in the target system. The challenge is to perform the resource management in a way that preserves the system integrity. This paper discusses resource management in an experimental communications system.
{"title":"Resource management in communications systems","authors":"S. Varada, D. Shilonie","doi":"10.1109/ITCC.2000.844245","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844245","url":null,"abstract":"The management of memory resources is critical to the preservation of system integrity in a data communications system. The memory resources appear in various forms in a target system; examples include objects such as connection management data structures, data or control flow request descriptors, buffers and their descriptors. The critical part of resource management is to free-up or recycle the allocated memory resources when no longer needed with a scope that encompasses all user and system components in the target system. The challenge is to perform the resource management in a way that preserves the system integrity. This paper discusses resource management in an experimental communications system.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131201354","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
扫码关注我们
求助内容：
应助结果提醒方式：