A. Castellucci, Giovambattista Ianni, D. Vasile, S. Costa
{"title":"Searching and surfing the Web using a semi-adaptive meta-engine","authors":"A. Castellucci, Giovambattista Ianni, D. Vasile, S. Costa","doi":"10.1109/ITCC.2001.918832","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918832","url":null,"abstract":"Global Search is a World Wide Web agent which integrates and enhances many well-known search techniques in order to improve the quality of information gathered from the usual Web search engines. It features intelligent merging of relevant documents from different search engines, anticipated adaptive exploration and evaluation of links from the current result set, and automated derivation of refined queries based on user relevance feedback.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"32 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":"127618309","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}
{"title":"3-D wavelet video coding with rate-distortion optimizization [optimizization read optimization]","authors":"Pierre Seigneurbieux, Zixiang Xiong","doi":"10.1109/ITCC.2001.918814","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918814","url":null,"abstract":"The paper presents a rate-distortion (R-D) optimized 3D wavelet video coder by extending the concept of space-frequency quantization (SFQ) (Z. Xiong et al., 1997) from 2D to 3D. A lifting-based 3D (1T+2D) wavelet transform is deployed to process one part of the sequence at a time continuously, thus eliminating the boundary effects over GOPs. After 3D SFQ, in which an R-D based spatial-temporal tree-pruning process is used in conjunction with uniform quantization of wavelet coefficients, we apply an efficient progressive 3D entropy coder to further compress the quantized coefficients. Even without motion estimation, the new 3D SFQ video coder outperforms MPEG-4 and other 3D wavelet-based video coders for most sequences at the same bit rate.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"6 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":"128957558","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}
{"title":"A noise-reduction approach to scene segmentation for large video databases","authors":"Wallapak Tavanapong, Junyu Zhou","doi":"10.1109/ITCC.2001.918801","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918801","url":null,"abstract":"Automatic video segmentation is the first and necessary step that structures a video into several smaller and meaningful units for effective browsing and retrieval for large video databases. The effectiveness of this step is, thus, very crucial to the overall performance of a video database management system. We present a novel concept in scene segmentation called noise-reduction scene segmentation. This approach discards irrelevant areas or noise in a video frame from being used in the segmentation process to increase the accuracy of the segmentation. Unlike existing techniques, video frames are first noise-reduced and only relevant information is left for subsequent steps of the segmentation process. Our experimental results indicate that a seamless integration of our simple noise filter to an existing scene segmentation technique offers a non-negligible improvement in the segmentation accuracy (i.e., as much as 59% less falsely detected scenes).","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"1 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":"130312913","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}
{"title":"On-line dynamic bandwidth allocation for VBR video transmission","authors":"Hai Liu, N. Ansari, Y. Shi","doi":"10.1109/ITCC.2001.918821","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918821","url":null,"abstract":"To guarantee quality of service (QoS), the requirements for video transmission, such as delay and cell loss rate (CLR), are very stringent. These constraints are difficult to meet if high network utilization is desired. In this paper, online dynamic bandwidth allocation algorithms, in which the bandwidth is adjusted based on the current frame size, are proposed to improve the bandwidth utilization. When the bandwidth deviation is large enough, a bandwidth re-negotiation process is triggered. Compared with a constant bit-rate (CBR) service, network utilization can be improved significantly for the same CLR. In general, to achieve a very low CLR and high bandwidth utilization, the re-negotiation frequency may become high. Algorithms which have been proven to be effective in reducing the re-negotiation frequency while keeping the bandwidth utilization at a reasonable level are also proposed.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"6 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":"132148429","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}
{"title":"AVP: a highly efficient real-time protocol for multimedia communications on Internet","authors":"Jianyu Dong, Chao He, Yuan F. Zheng","doi":"10.1109/ITCC.2001.918806","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918806","url":null,"abstract":"A new transport protocol called Audio-Video Protocol (AVP) for highly efficient multimedia communications on the Internet is presented in this paper. While providing similar real-time delivery functions of RTP/RTCP AVP adopts a novel audio-based synchronization scheme. This synchronization scheme has two advantages. One is that there is no need to include a timestamp in each transmitted packet so that the AVP header is small for highly efficient transmission. The other is that AVP can achieve lower end-to-end message delay by putting multiple audio frames or mixed audio-video frames in the same AVP packet to reduce the packet rate. Furthermore, AVP provides different QoS by assigning different priority numbers to the packers. Simulation results are presented to show the good performance of AVP in real-time video-audio delivery.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"24 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":"125193778","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}
{"title":"Realizing MPEG-4 streaming over the Internet: a client/server architecture using DMIF","authors":"K. Asrar-Haghighi, Y. P. Fallah, H. Alnuweiri","doi":"10.1109/ITCC.2001.918759","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918759","url":null,"abstract":"The paper presents the implementation of an MPEG-4 Streaming System for the delivery of multiple elementary stream presentations containing audio-visual objects. This system has been tested with the MPEG-4 demonstration software implementation (IMI), but it is in fact a generic platform for multimedia presentation delivery. The signalling and delivery layer of this system implementation conforms to the recommendations made by part 6 of the MPEG-4 standard, Delivery Multimedia Integration Framework (DMIF). We present the issues involved in designing our DMIF-based streaming server and the levels of abstraction required. The system enables interactive media streaming across the Internet through its Data and Control Planes. It also implements a source based rate control system, a Synchronization Layer packetizer and a signalling mechanism.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"222 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":"122406853","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}
{"title":"Constraint database query evaluation with approximation","authors":"P. Veltri","doi":"10.1109/ITCC.2001.918868","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918868","url":null,"abstract":"Considers the problem of solving a large number of simple systems of linear constraints. This problem occurs in the context of constraint databases. The developed methodology is based on a hierarchical evaluation of the constraints, which are first simplified and replaced by approximations. We focus on systems of linear constraints over the reals, which model spatial objects, and we consider both geometric and topological approximations, defined with very simple constraints. We show that these constraints can be used either to solve the initial systems, or at least to filter out unsatisfiable systems. The main contribution of the paper is the development of a set of rewriting rules that allow the transformation of spatial object queries into equivalent ones that make use of the approximation, reducing the query evaluation cost.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"150 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":"115714309","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}
{"title":"Practical capacity of digital watermark as constrained by reliability","authors":"Ryo Sugihara","doi":"10.1109/ITCC.2001.918770","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918770","url":null,"abstract":"The paper presents a theoretic analysis of watermark capacity. First, a simplified watermark scheme is postulated. In the scheme, detection yields a multidimensional vector, in which each dimension is assumed to be i.i.d. (independent and identically distributed) and to follow the Gaussian distribution. The major constraint on the capacity is detected reliability, which is one of the most important measures of the utility of watermarks. The problem is to figure out the maximum amount of information payload with the reliability requirement still satisfied. The reliability is represented by three kinds of error rates: false positive error rate, false negative error rate, and bit error rate. These error rates are formulated under certain assumptions, and the theoretical capacity can be determined by setting the bounds on all of the error rates. Further, experiments were performed to verify the theoretic analysis and it was shown that this approach yields a good estimate of the capacity of a watermark.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"43 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":"116595132","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}
{"title":"Computation and performance trade-offs in motion estimation algorithms","authors":"K. Namuduri, A. Ji","doi":"10.1109/ITCC.2001.918803","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918803","url":null,"abstract":"Real-time video/visual communication applications require trade-offs in terms of processing speed, visual image quality and power consumption. Motion estimation is one of the tasks in video coding that requires significant amount of computation. Block matching motion estimation algorithms such as the three-step search and the diamond search algorithms are being used in video coding schemes as alternatives to full search algorithms. Fast motion estimation algorithms reduce the computational complexity, at the expense of reduced performance. Special purpose fast processors can be employed as an alternative to meet the computational demand. However, the processing speed comes at the expense of higher power consumption. This paper investigates motion estimation algorithms and presents the computational, and performance trade-offs involved in choosing a motion estimation algorithm for video coding applications. Fast motion estimation algorithms often assume monotonic error surface in order to speed up the algorithm. The argument against this assumption is that the search might be trapped in local minima and may result in a noisy motion field. Prediction methods have been suggested in the literature as a solution to avoid these local minima and noisy motion field. The paper also investigates the effects of the monotonic error surface assumption as well as the appropriate choice of initial motion vectors that results in better performance of the motion estimation algorithms.","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":"116602144","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}
{"title":"Developing an adaptive search engine for e-commerce using a Web mining approach","authors":"Chung-Hong Lee, Hsin-Chang Yang","doi":"10.1109/ITCC.2001.918863","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918863","url":null,"abstract":"Discusses current work using an adaptive learning algorithm to dynamically create the content of an e-commerce search engine so that the implicit knowledge extracted by the Web text mining module can be provided in the B2B (business-to-business) portal. In this paper, we develop an algorithmic approach for automatically discovering implicit customer knowledge from the Internet by means of a Web mining method. Using a variation of the automatic thesaurus generation techniques, namely the self-organizing map (SOM) neural net, we have conducted several experiments in a specific domain in which we created a functional thesaurus of numerous supplier- and product-specific terms. Further, we applied such a thesaurus in a topic hierarchy-based text database, as an organized text source of a search engine for a novel B2B e-commerce portal.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"79 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":"128599788","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}