发布求助
文献互助 智能选刊 最新文献

Proceedings International Conference on Information Technology: Coding and Computing最新文献

筛选
英文 中文
Reliable multicast via satellites 通过卫星进行可靠的多播
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918788
G. Cao, Yiqiong Wu
{"title":"Reliable multicast via satellites","authors":"G. Cao, Yiqiong Wu","doi":"10.1109/ITCC.2001.918788","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918788","url":null,"abstract":"Automatic repeat request (ARQ) is a well-known technique to provide error control. In reliable satellite multicasting, ARQ may reduce system throughput as the number of receivers increases since the satellite has to retransmit a packer until all receivers correctly receive it. This performance degradation might be alleviated substantially by conducting retransmissions through terrestrial paths from the sender to each receiver instead of through the multicast satellite link. However, this approach may not be possible when some receivers do not have terrestrial connections to the sender. Also, a large volume of feedback traffic from the receivers to the sender may cause a feedback implosion at the sender. In this paper, we propose a scalable framework to solve these problems. Our solution enables receivers to form groups to avoid unnecessary retransmissions as long as a correct packet call be found inside the group. Using analytical models, we demonstrate that the proposed solution can significantly improve system throughput.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130357707","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}
引用次数: 10
A novel approach for increasing security and data embedding capacity in images for data hiding applications 在数据隐藏应用中提高图像安全性和数据嵌入能力的一种新方法
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918796
Faisal Alturki, R. Mersereau
{"title":"A novel approach for increasing security and data embedding capacity in images for data hiding applications","authors":"Faisal Alturki, R. Mersereau","doi":"10.1109/ITCC.2001.918796","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918796","url":null,"abstract":"Data hiding in multimedia is the process of secretly embedding information into data sources such as image, video, or audio signals without changing the perceptual quality of the data source. We present a novel blind data hiding technique for hiding information in still images. This technique is based on embedding the information in the transform domain, after decorrelating the samples in the spatial domain. This results in a significant increase in the number of transform coefficients that can be used to transmit the hidden information. The technique is suitable for a variety of data hiding applications such as steganography, data authentication and captioning. The technique achieves a higher and more secure data embedding rate than existing data embedding transform domain techniques developed for these particular applications.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202698","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}
引用次数: 38
A priority-based transmission protocol for congested networks supporting incremental computations 一种基于优先级的传输协议，用于拥塞网络，支持增量计算
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918826
M. Cannataro, Walter Curci, Maurizio Giglio
{"title":"A priority-based transmission protocol for congested networks supporting incremental computations","authors":"M. Cannataro, Walter Curci, Maurizio Giglio","doi":"10.1109/ITCC.2001.918826","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918826","url":null,"abstract":"Many fields of human activity produce data at an increasing rate, that have to be analysed in an effective and timely way, both locally at the data sources and globally, where decisions have to be taken. Very often in distributed applications, delays originate from the limited network bandwidth or temporary network congestions. To cope with these problems and to satisfy the requirements of online interactive applications (timely availability of data whose quality could eventually be reduced), new compression algorithms and transmission protocols that can trade off the exactness of results against their timeliness, have to be developed. This paper presents a priority-based data transmission protocol for sending large volumes of data (data cubes) over congested networks, that allows the incremental implementation of OLAP applications. A wavelet-based lossy compression algorithm that is the core of the transmission protocol is also presented.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115576098","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}
引用次数: 2
Lossless computational reduction of full search algorithm in motion estimation using appropriate matching unit from image localization 基于图像定位的合适匹配单元的运动估计全搜索算法的无损计算缩减
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918837
Jong-Nam Kim, Byung-Ha Ahn
{"title":"Lossless computational reduction of full search algorithm in motion estimation using appropriate matching unit from image localization","authors":"Jong-Nam Kim, Byung-Ha Ahn","doi":"10.1109/ITCC.2001.918837","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918837","url":null,"abstract":"To reduce the amount of computation of the full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without degradation of predicted images as in conventional FS. The computational reduction without any degradation in the predicted image comes from fast removal of impossible motion vectors. We obtain faster removal of inappropriate motion vectors using efficient matching units from the localization of complex area in image data. In this paper, we show three properties in block matching of motion estimation. Experimentally, we reduce unnecessary computations by about 30% with our algorithm compared with the conventional fast matching scan algorithm.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122523466","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}
引用次数: 2
High performance error correcting code of the high-dimensional discrete torus knot 高维离散环面结的高性能纠错代码
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918854
M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi
{"title":"High performance error correcting code of the high-dimensional discrete torus knot","authors":"M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi","doi":"10.1109/ITCC.2001.918854","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918854","url":null,"abstract":"The new high-dimensional torus knot code with respect to its geometrical structure has been studied. The special features of the code are presented. (1) The code block is wound up into a small, compact code ball, so the code passes hardly damaged through the channel of a dense shower of error-making disturbances. (2) The torus knot winding works as block-size interleaving, which distributes the received burst errors randomly in the parity check cycles, so the code exhibits excellent burst error correction capability. (3) Majority logic decoding of each code digit based on the erroneous parity lines can be made up of a high-speed logic circuit thanks to the cyclical properties of the code parity check function. The four-dimensional, size-five 4Dm5-code was burned onto a 50-kilogate, 0.6-micron-order VLSI chip. The code block length and the transmission rate are 625 bits and 0.41, respectively. It was operated at a clock speed of 50 MHz, with a throughput of 6.25 Gbps. Through 100000 block trials, it was proven that the chip can perfectly correct a mean BER of 0.021 for burst and random mixed error situations.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126063647","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}
引用次数: 3
Local maximum likelihood multiuser detection for CDMA communications CDMA通信的局部最大似然多用户检测
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918811
Yi Sun
{"title":"Local maximum likelihood multiuser detection for CDMA communications","authors":"Yi Sun","doi":"10.1109/ITCC.2001.918811","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918811","url":null,"abstract":"The optimum multiuser detector achieves global maximum likelihood and has a complexity growing exponentially with the number of users. We propose the local maximum likelihood (LML) multiuser detectors with an arbitrary neighborhood size. As the neighborhood size is one, two, etc., up to the total number of users, the computational complexity of the LML detector is linear quadratic, etc., up to exponential in the total number of users. Every LML detector is associated with a local minimum error probability defined with the corresponding neighborhood size. A family of local-maximum-likelihood likelihood-ascent-search (LMLAS) detectors is proposed, each of which is shown to be an LML detector. An LMLAS detector monotonically increases likelihood step by step, and thus converges to an LML point in a finite number of search steps with probability one. Following any detector, an LMLAS detector can reduce the error probability of the initial detector to a local minimum or not change it when the initial detector is an LML detector with the same or larger neighborhood size with probability one.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129362573","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}
引用次数: 7
Inverted-space storage organization for persistent data of very high dimensionality 用于非常高维的持久数据的倒置空间存储组织
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918865
R. Orlandic, Byunggu Yu
{"title":"Inverted-space storage organization for persistent data of very high dimensionality","authors":"R. Orlandic, Byunggu Yu","doi":"10.1109/ITCC.2001.918865","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918865","url":null,"abstract":"Contemporary database technology is severely limited in managing the high-dimensional data of many advanced applications, such as multimedia systems and data mining. The main concern of this paper is the well-known performance degradation of multi-dimensional access methods in spaces with many dimensions. The paper proposes an elaborate storage organization, called the inverted space, which can support efficient processing of data in spaces with very high dimensionality. The organization allows system administrators to control the size of spatial indexes and thereby to avoid the negative impact of extremely high data dimensionality on the retrieval performance. In addition, this paper introduces a new point access method designed to address numerous other problems that contemporary retrieval schemes experience in high-dimensional situations. This mechanism is envisioned to serve as the core indexing structure of inverted-space storage organizations.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125082112","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}
引用次数: 1
Adapting information presentation and retrieval through user modelling 通过用户建模调整信息表示和检索
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918829
C. Makris, A. Tsakalidis, B. Vassiliadis, N. Bogonikolos
{"title":"Adapting information presentation and retrieval through user modelling","authors":"C. Makris, A. Tsakalidis, B. Vassiliadis, N. Bogonikolos","doi":"10.1109/ITCC.2001.918829","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918829","url":null,"abstract":"The amount of structured information available in Internet sources is rapidly increasing. This information includes commercial databases on product information and information on e-services forming the so-called e-shops. However, the process of using this information has become more complicated, and can sometimes be tedious for users with different goals, interests, levels of expertise, abilities and preferences. This paper deals with the definition of an architectural framework for intelligent, adaptive and personalised navigation within large hypertext electronic commerce environments.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134482","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}
引用次数: 6
Real-time H.263+ video transmission on 802.11 wireless LANs 实时H.263+视频传输802.11无线局域网
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918777
M. Freytes, C. Rodríguez, C. Marqués
{"title":"Real-time H.263+ video transmission on 802.11 wireless LANs","authors":"M. Freytes, C. Rodríguez, C. Marqués","doi":"10.1109/ITCC.2001.918777","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918777","url":null,"abstract":"Wireless video services in packet-switched environments constitute a significant challenge. While radio channels present limited capacity high error rates and time-varying and asymmetric propagation properties, video applications are bandwidth-killing, error-sensitive and delay-intolerant. This situation forces wireless video systems to dynamically adapt to changes in the network resources. In the recent past there have been some papers investigating video transmission over wireless networks (H. Liu and M. El Zarki, 1997; N. Chan and P.T. Mathiopoulos, 2000), performance of the transfer protocols proposed in the IEEE 802.11 standard (H.S. Chhaya and S. Gupta, 1996; J. Weinmiller et al., 1997), and real time video communications in packet-switched infrastructure networks (P. Bahl, 1998). However, no previous experimental work on video conferencing systems for IEEE 802.11 Ad Hoc WLANs supporting IP multicast extensions has been reported so far. The paper describes Kinesis, an H.263+video transmission system for 802.11 network. Kinesis supports IP multicast extension and implements real time transport protocols to manage synchronization and QoS issues. We focus on the system architecture as a general communication framework for distributed and interactive audiovisual applications. Kinesis has been tested under different working conditions, performing H.263+ video sequences with excellent results.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127325938","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}
引用次数: 17
Combined features of cubic B-spline wavelet moments and Zernike moments for invariant character recognition 三次b样条小波矩与Zernike矩结合特征的不变字符识别
Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI: 10.1109/ITCC.2001.918848
Chao Kan, M. Srinath
{"title":"Combined features of cubic B-spline wavelet moments and Zernike moments for invariant character recognition","authors":"Chao Kan, M. Srinath","doi":"10.1109/ITCC.2001.918848","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918848","url":null,"abstract":"In this paper a new method of combining cubic B-spline wavelet moments (WMs) and Zernike moments (ZMs) into a common feature vector is proposed for invariant pattern classification. By doing so, the ability of ZMs to capture global features and WMs to differentiate between subtle variations in description can be utilized at the same time. Analysis and simulations verify that the new method achieves better performance with respect to classification accuracy than using ZMs or WMs separately. In addition, this new method should also be applicable to other areas of pattern recognition.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132413141","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}
引用次数: 21
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信