Pub Date : 2002-04-08DOI: 10.1109/ITCC.2002.1000406
M. Villanova-Oliver, J. Gensel, H. Martin, Christelle Erb
Introduces the notions of mask and multiple format for setting up a progressive access to information in an information system. Masks consist of more or less complete representations of the structure of information while multiple formats correspond to different representations available for multimedia data. We describe how these two notions are integrated into AROM, an object-based knowledge representation system which supports a UML-like formalism, by instantiating a model called PAM (Progressive Access Model). More generally, a progressive and adapted access to information can be given to users of any information system by simply adapting the PAM to the underlying data schema and coupling it with the target data or knowledge base.
{"title":"Mask and multiple format: two notions for a progressive and adapted access to information","authors":"M. Villanova-Oliver, J. Gensel, H. Martin, Christelle Erb","doi":"10.1109/ITCC.2002.1000406","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000406","url":null,"abstract":"Introduces the notions of mask and multiple format for setting up a progressive access to information in an information system. Masks consist of more or less complete representations of the structure of information while multiple formats correspond to different representations available for multimedia data. We describe how these two notions are integrated into AROM, an object-based knowledge representation system which supports a UML-like formalism, by instantiating a model called PAM (Progressive Access Model). More generally, a progressive and adapted access to information can be given to users of any information system by simply adapting the PAM to the underlying data schema and coupling it with the target data or knowledge base.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563037","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000394
K. Taghva, T. Nartker, J. Borsack, A. Condit
In this paper, we report on a series of experiments involving feedback and query expansion. We conclude that query expansion using manually-assigned keywords has no advantage over expansion using terms from the text of the document.
{"title":"Determining the usefulness of manually assigned keywords for a vector space system","authors":"K. Taghva, T. Nartker, J. Borsack, A. Condit","doi":"10.1109/ITCC.2002.1000394","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000394","url":null,"abstract":"In this paper, we report on a series of experiments involving feedback and query expansion. We conclude that query expansion using manually-assigned keywords has no advantage over expansion using terms from the text of the document.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128682832","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000417
Shinsuke Nishida
This paper proposes a non-scanning display digital algorithm for still and moving pictures. This innovative method is independent of display device or camera/transmission hardware configuration limited by the number of scanning lines. The concept is the realization of effective image data transmission to display devices in which the image is converted as digital bit data.
{"title":"Non-scanning display method","authors":"Shinsuke Nishida","doi":"10.1109/ITCC.2002.1000417","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000417","url":null,"abstract":"This paper proposes a non-scanning display digital algorithm for still and moving pictures. This innovative method is independent of display device or camera/transmission hardware configuration limited by the number of scanning lines. The concept is the realization of effective image data transmission to display devices in which the image is converted as digital bit data.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122862037","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000429
H. Stern, O. Hadar, Nir Friedman
This paper presents a new optimal multiplexing scheme for compressed video streams based on a piecewise linear approximation of the accumulative data curve of each stream. A linear programming algorithm is provided, which takes into account different constraints of each client. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. The algorithm takes into account the interaction between the multiplexed streams and the individual streams, and simultaneously finds the optimum total multiplexed schedule and individual stream schedules that minimizes the peak transmission rate. In addition, the algorithm, due to the linear programming formulation, is bounded in polynomial time. The simulation results show a significant reduction in peak rate and rate variability of the aggregated stream, compared to the non-smoothing case. Therefore the proposed scheme allows an increase in the number of simultaneously served video streams.
{"title":"Optimal video stream multiplexing through linear programming","authors":"H. Stern, O. Hadar, Nir Friedman","doi":"10.1109/ITCC.2002.1000429","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000429","url":null,"abstract":"This paper presents a new optimal multiplexing scheme for compressed video streams based on a piecewise linear approximation of the accumulative data curve of each stream. A linear programming algorithm is provided, which takes into account different constraints of each client. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. The algorithm takes into account the interaction between the multiplexed streams and the individual streams, and simultaneously finds the optimum total multiplexed schedule and individual stream schedules that minimizes the peak transmission rate. In addition, the algorithm, due to the linear programming formulation, is bounded in polynomial time. The simulation results show a significant reduction in peak rate and rate variability of the aggregated stream, compared to the non-smoothing case. Therefore the proposed scheme allows an increase in the number of simultaneously served video streams.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165645","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000373
M. Shyu, Hongli Luo, Shu‐Ching Chen
High bandwidth requirements in multimedia transmission make the efficient use of limited network resource a challenging task, especially when multiple clients make their requests to the server simultaneously. We propose a self-adjusted network transmission mechanism for multiple clients. Instead of assigning a fixed bandwidth for each client, the server determines the transmission rate for each client connection according to the buffer packets and playback rate at each client. Transmission rates are adjusted when the total requested bandwidth is larger than the network bandwidth. In addition, the proposed mechanism can minimize the bandwidth allocation and maximize the client buffer utilization. A simulation is performed and the simulation results show that the proposed mechanism can dynamically change the transmission rate for each client to avoid overflow of the client buffer, and achieve the optimal utilization of the limited network resource in multiple client network environments.
{"title":"Self-adjusted network transmission for multimedia data","authors":"M. Shyu, Hongli Luo, Shu‐Ching Chen","doi":"10.1109/ITCC.2002.1000373","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000373","url":null,"abstract":"High bandwidth requirements in multimedia transmission make the efficient use of limited network resource a challenging task, especially when multiple clients make their requests to the server simultaneously. We propose a self-adjusted network transmission mechanism for multiple clients. Instead of assigning a fixed bandwidth for each client, the server determines the transmission rate for each client connection according to the buffer packets and playback rate at each client. Transmission rates are adjusted when the total requested bandwidth is larger than the network bandwidth. In addition, the proposed mechanism can minimize the bandwidth allocation and maximize the client buffer utilization. A simulation is performed and the simulation results show that the proposed mechanism can dynamically change the transmission rate for each client to avoid overflow of the client buffer, and achieve the optimal utilization of the limited network resource in multiple client network environments.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132877134","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000362
S. Aramvith, H. Kortrakulkij, D. Tancharoen, S. Jitapunkul
The scenario of using Automatic Repeat reQuest (ARQ) retransmission for two-way low bit-rate video communications over wireless Rayleigh fading channels is studied. In this kind of channel, the packets inevitably experience errors during deep fades. The retransmissions can be used to re-send such packets. During retransmissions, the video encoder buffer fills up quickly and may cause the rate-control algorithm to skip frames or allocate less number of bits to encode the video frame. To reduce the number of frames skipped and improve bit allocation, we propose a content-based rate-control scheme using simplified block-based segmentation to intelligently allocate more bits to the foreground region. In addition, our proposed scheme also takes into consideration the effects of the video buffer fill-up, an a priori channel model, channel feedback information. The simulation results indicate that our proposed scheme encodes the video sequences with higher quality on the foreground region and much fewer frame skipping as compared to H.263 TMN8.
{"title":"Joint source-channel coding using simplified block-based segmentation and content-based rate-control for wireless video transport","authors":"S. Aramvith, H. Kortrakulkij, D. Tancharoen, S. Jitapunkul","doi":"10.1109/ITCC.2002.1000362","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000362","url":null,"abstract":"The scenario of using Automatic Repeat reQuest (ARQ) retransmission for two-way low bit-rate video communications over wireless Rayleigh fading channels is studied. In this kind of channel, the packets inevitably experience errors during deep fades. The retransmissions can be used to re-send such packets. During retransmissions, the video encoder buffer fills up quickly and may cause the rate-control algorithm to skip frames or allocate less number of bits to encode the video frame. To reduce the number of frames skipped and improve bit allocation, we propose a content-based rate-control scheme using simplified block-based segmentation to intelligently allocate more bits to the foreground region. In addition, our proposed scheme also takes into consideration the effects of the video buffer fill-up, an a priori channel model, channel feedback information. The simulation results indicate that our proposed scheme encodes the video sequences with higher quality on the foreground region and much fewer frame skipping as compared to H.263 TMN8.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122554622","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000352
D. Cai, C. J. Rijsbergen
To extract informative terms through known relevance information for query expansion is an important issue in the design of an effective text retrieval system. Various discriminant functions have been developed as a device for eliciting good terms. In this paper the notion of informativeness of terms is interpreted and discriminant functions are formalised both based on information-theoretic ideas for automatic query expansion. Preliminary results show that the approach adopted in this paper is worthy of continued investigation.
{"title":"Automatic query expansion based on directed divergence","authors":"D. Cai, C. J. Rijsbergen","doi":"10.1109/ITCC.2002.1000352","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000352","url":null,"abstract":"To extract informative terms through known relevance information for query expansion is an important issue in the design of an effective text retrieval system. Various discriminant functions have been developed as a device for eliciting good terms. In this paper the notion of informativeness of terms is interpreted and discriminant functions are formalised both based on information-theoretic ideas for automatic query expansion. Preliminary results show that the approach adopted in this paper is worthy of continued investigation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706647","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000428
V. Lappalainen, T. Hämäläinen
A unified method for optimization of video coding algorithms on general-purpose processors is presented. The method consists of algorithmic, code, compiler, and SIMD (Single Instruction Multiple Data) media Instruction Set Architecture (ISA) optimizations. H.263, H.263+ and emerging H.26L are used as example cases. For the realization of the unified method, the coding elements in all the codecs are analyzed and optimization techniques suitable for one or several of all the coding elements are presented. Results show that a nine-fold improvement can be obtained in H.26L decoding speed in terms of frames per second with video quality equivalent to a non-optimized implementation.
{"title":"Unified method for optimization of several video coding algorithms on general-purpose processors","authors":"V. Lappalainen, T. Hämäläinen","doi":"10.1109/ITCC.2002.1000428","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000428","url":null,"abstract":"A unified method for optimization of video coding algorithms on general-purpose processors is presented. The method consists of algorithmic, code, compiler, and SIMD (Single Instruction Multiple Data) media Instruction Set Architecture (ISA) optimizations. H.263, H.263+ and emerging H.26L are used as example cases. For the realization of the unified method, the coding elements in all the codecs are analyzed and optimization techniques suitable for one or several of all the coding elements are presented. Results show that a nine-fold improvement can be obtained in H.26L decoding speed in terms of frames per second with video quality equivalent to a non-optimized implementation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125574753","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000412
C. Qu, W. Nejdl
KBS Adaptive Hyperbook is a framework designed for modeling, organizing, and maintaining distributed hypermedia resources on the Web with the purpose of supporting Web-based distance education. Since the Hyperbook system is implemented based on a sophisticated meta modeling language (O-Telos), its authoring depends to a great extent on the Hyperbook developers instead of lecturers who have rich teaching experience but generally no knowledge of O-Telos and meta modeling. This has become a notable obstacle to enrich the content of existing Hyperbooks and further construct new Hyperbooks which are applicable to different specialties. In this paper we present a novel approach which can achieve schema-level transformation between O-Telos schema and W3C standard XML schema. By transforming Hyperbook data models, which are originally represented in O-Telos, into XML schemas, we can provide a standalone Hyperbook authoring environment which is able to directly utilize XML-schema-aware XML visual editors as a front-end GUI and enable lecturers to easily accomplish Hyperbook authoring.
KBS Adaptive Hyperbook是一个框架，设计用于建模、组织和维护Web上的分布式超媒体资源，目的是支持基于Web的远程教育。由于Hyperbook系统是基于一种复杂的元建模语言(O-Telos)实现的，它的创作在很大程度上取决于Hyperbook的开发人员，而不是具有丰富教学经验但通常不了解O-Telos和元建模的讲师。这已经成为丰富现有hyperbook内容和进一步构建适用于不同专业的新hyperbook的显著障碍。本文提出了一种在O-Telos模式和W3C标准XML模式之间实现模式级转换的新方法。通过将最初在O-Telos中表示的Hyperbook数据模型转换为XML模式，我们可以提供一个独立的Hyperbook创作环境，该环境能够直接利用支持XML模式的XML可视化编辑器作为前端GUI，并使讲师能够轻松完成Hyperbook创作。
{"title":"Bridging O-telos and XML with XML schema: the authoring environment for KBS Adaptive Hyperbook","authors":"C. Qu, W. Nejdl","doi":"10.1109/ITCC.2002.1000412","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000412","url":null,"abstract":"KBS Adaptive Hyperbook is a framework designed for modeling, organizing, and maintaining distributed hypermedia resources on the Web with the purpose of supporting Web-based distance education. Since the Hyperbook system is implemented based on a sophisticated meta modeling language (O-Telos), its authoring depends to a great extent on the Hyperbook developers instead of lecturers who have rich teaching experience but generally no knowledge of O-Telos and meta modeling. This has become a notable obstacle to enrich the content of existing Hyperbooks and further construct new Hyperbooks which are applicable to different specialties. In this paper we present a novel approach which can achieve schema-level transformation between O-Telos schema and W3C standard XML schema. By transforming Hyperbook data models, which are originally represented in O-Telos, into XML schemas, we can provide a standalone Hyperbook authoring environment which is able to directly utilize XML-schema-aware XML visual editors as a front-end GUI and enable lecturers to easily accomplish Hyperbook authoring.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126605139","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000372
Arijit Bishnu, B. Bhattacharya, M. Kundu, C. A. Murthy, T. Acharya
A new combinatorial characterization of a gray-tone image, called an Euler vector, is proposed. The Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformations of the image. An Euler vector comprises of a 4-tuple, where each element is an integer representing the Euler number of the partial binary image formed by the four most significant bit planes of the gray-tone image. Experimental results demonstrate the robustness of the Euler vector under compression and inclusion of noise followed by filtering. The vector is topologically invariant and can be used for image indexing and retrieval.
{"title":"Euler vector: a combinatorial signature for gray-tone images","authors":"Arijit Bishnu, B. Bhattacharya, M. Kundu, C. A. Murthy, T. Acharya","doi":"10.1109/ITCC.2002.1000372","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000372","url":null,"abstract":"A new combinatorial characterization of a gray-tone image, called an Euler vector, is proposed. The Euler number of a binary image is a well-known topological feature, which remains invariant under translation, rotation, scaling, and rubber-sheet transformations of the image. An Euler vector comprises of a 4-tuple, where each element is an integer representing the Euler number of the partial binary image formed by the four most significant bit planes of the gray-tone image. Experimental results demonstrate the robustness of the Euler vector under compression and inclusion of noise followed by filtering. The vector is topologically invariant and can be used for image indexing and retrieval.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127068022","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
扫码关注我们
求助内容：
应助结果提醒方式：