Pub Date : 2002-04-08DOI: 10.1109/ITCC.2002.1000419
A. Grigoryan, E. Regentova
A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.
{"title":"A new method of optimal coding","authors":"A. Grigoryan, E. Regentova","doi":"10.1109/ITCC.2002.1000419","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000419","url":null,"abstract":"A new technique for optimally encoding a given source, statistical properties of which are described by the first-order model is introduced. The calculation of a minimum length of codewords is based on the consecutive redistribution of the self- information of symbols in accordance with their probabilities at each stage of the encoding. The proposed method performs equally well for an arbitrary order of symbol probabilities. While codewords are generated by a separate combinatorial procedure, the overall computational cost of the proposed method is lower than that for the Huffman code.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"11 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":"131212250","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.1000356
Christopher C. Yang, Hsinchun Chen, K. Hong
A category map developed based on Kohonen's self-organizing map has been proven to be a promising browsing tool for solving the information overload problem of the World Wide Web. The SOM algorithm automatically compresses and transforms a complex information space into a two-dimensional graphical representation. Such graphical representation provides a user-friendly interface for users to explore the automatically generated mental model. However, as the amount of information increases, the size of the category map is expected to increase accordingly in order to accommodate the important concepts in the information space, which increases the visual load of the category map. In this paper, we propose the fisheye views and fractal views to support the visualization of category map. Fisheye views are developed based on the distortion approach while fractal views are developed based on the information reduction approach. We have developed a prototype system and conducted a user evaluation to investigate the performance of fisheye views and fractal views. The results show that both fisheye views and fractal views significantly increase the effectiveness of visualizing the category map. In addition, fractal views are significantly better than fisheye views.
{"title":"Internet browsing: visualizing category map by fisheye and fractal views","authors":"Christopher C. Yang, Hsinchun Chen, K. Hong","doi":"10.1109/ITCC.2002.1000356","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000356","url":null,"abstract":"A category map developed based on Kohonen's self-organizing map has been proven to be a promising browsing tool for solving the information overload problem of the World Wide Web. The SOM algorithm automatically compresses and transforms a complex information space into a two-dimensional graphical representation. Such graphical representation provides a user-friendly interface for users to explore the automatically generated mental model. However, as the amount of information increases, the size of the category map is expected to increase accordingly in order to accommodate the important concepts in the information space, which increases the visual load of the category map. In this paper, we propose the fisheye views and fractal views to support the visualization of category map. Fisheye views are developed based on the distortion approach while fractal views are developed based on the information reduction approach. We have developed a prototype system and conducted a user evaluation to investigate the performance of fisheye views and fractal views. The results show that both fisheye views and fractal views significantly increase the effectiveness of visualizing the category map. In addition, fractal views are significantly better than fisheye views.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"50 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":"121627886","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.1000392
Tao Wang, Juhua Shi, M. Nascimento
We are interested in the problem of sub-image retrieval (CBSIR), i.e., given a query image one must find the best candidate images that contain that query image. We use two kinds of image feature vectors: global color histograms and autocorrelograms and experimented with several distance measures for both feature vectors in our experimental system. After extensive experimentation we found that using autocorrelograms with the so-called S/sub 1/ distance measure yielded excellent results for sub-image retrieval with an acceptable processing overhead.
{"title":"Experimental results towards content-based sub-image retrieval","authors":"Tao Wang, Juhua Shi, M. Nascimento","doi":"10.1109/ITCC.2002.1000392","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000392","url":null,"abstract":"We are interested in the problem of sub-image retrieval (CBSIR), i.e., given a query image one must find the best candidate images that contain that query image. We use two kinds of image feature vectors: global color histograms and autocorrelograms and experimented with several distance measures for both feature vectors in our experimental system. After extensive experimentation we found that using autocorrelograms with the so-called S/sub 1/ distance measure yielded excellent results for sub-image retrieval with an acceptable processing overhead.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"65 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":"114566282","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.1000431
Jianyu Dong, Yuan F. Zheng
Improving the QoS of video streaming with packet loss is a challenging topic of research. In this paper, we propose a novel content-based retransmission scheme to address this issue. The basic idea is to jointly consider the packets' contents and the channel conditions to optimize QoS. The goal is to deliver the best quality of video possible under the same channel condition. Using the proposed retransmission scheme, we have designed a 3D wavelet video streaming system. Simulation results show that the content-based retransmission can improve the video quality by more than 2 dB compared with the existing non-content-based delay-constrained retransmission when the channel loss rate is high.
{"title":"Content-based retransmission for 3-D wavelet video streaming on the Internet","authors":"Jianyu Dong, Yuan F. Zheng","doi":"10.1109/ITCC.2002.1000431","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000431","url":null,"abstract":"Improving the QoS of video streaming with packet loss is a challenging topic of research. In this paper, we propose a novel content-based retransmission scheme to address this issue. The basic idea is to jointly consider the packets' contents and the channel conditions to optimize QoS. The goal is to deliver the best quality of video possible under the same channel condition. Using the proposed retransmission scheme, we have designed a 3D wavelet video streaming system. Simulation results show that the content-based retransmission can improve the video quality by more than 2 dB compared with the existing non-content-based delay-constrained retransmission when the channel loss rate is high.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"15 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":"117170339","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.1000425
Cheng-Yu Pai, W. Lynch
Traditional MPEG-2 video compression uses test model 5 (TM5) as the rate-control algorithm, which does not consider the perceptual quality of the compressed sequence. This paper proposes a new rate-control algorithm, which integrates TM5 with the Watson's digital-video-quality (DVQ) metric. As a proponent of the VQEG (Video Quality Expert Group), the Watson's DVQ is a subjective quality metric based on the human visual system (HVS) which estimates the perceptual quality of human viewers. Simulation results indicate that the proposed algorithm outperforms TM5 for low-motion video sequence, and performs about the same as TM5 for high-motion video sequences.
{"title":"Subjective-quality-based MPEG-2 video compression","authors":"Cheng-Yu Pai, W. Lynch","doi":"10.1109/ITCC.2002.1000425","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000425","url":null,"abstract":"Traditional MPEG-2 video compression uses test model 5 (TM5) as the rate-control algorithm, which does not consider the perceptual quality of the compressed sequence. This paper proposes a new rate-control algorithm, which integrates TM5 with the Watson's digital-video-quality (DVQ) metric. As a proponent of the VQEG (Video Quality Expert Group), the Watson's DVQ is a subjective quality metric based on the human visual system (HVS) which estimates the perceptual quality of human viewers. Simulation results indicate that the proposed algorithm outperforms TM5 for low-motion video sequence, and performs about the same as TM5 for high-motion video sequences.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"84 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":"122644215","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.1000397
F. Nielsen
We describe algorithms for authoring and viewing high-resolution immersive videos. Given a set of cameras designed to be aligned more or less at the same nodal point, we first present a process for stitching seamlessly synchronized streams of videos into a single immersive video corresponding to the video of the abstract multi-head camera. We describe a general registration technique on to geometric envelopes based on minimizing a novel appropriate objective function, and detail our compounded image synthesis algorithm of multi-head cameras. Several new environment maps with low discrepancy are presented. Finally, we give details of the viewer implementation. Experimental results on both real and synthetic immersive videos are shown.
{"title":"High resolution full spherical videos","authors":"F. Nielsen","doi":"10.1109/ITCC.2002.1000397","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000397","url":null,"abstract":"We describe algorithms for authoring and viewing high-resolution immersive videos. Given a set of cameras designed to be aligned more or less at the same nodal point, we first present a process for stitching seamlessly synchronized streams of videos into a single immersive video corresponding to the video of the abstract multi-head camera. We describe a general registration technique on to geometric envelopes based on minimizing a novel appropriate objective function, and detail our compounded image synthesis algorithm of multi-head cameras. Several new environment maps with low discrepancy are presented. Finally, we give details of the viewer implementation. Experimental results on both real and synthetic immersive videos are shown.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"13 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":"123451252","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.1000432
G. Hong, A. Fong, B. Fong
Although the emerging Internet Protocol version 6 (IPv6) includes provision for quality-of-service (QoS) control capabilities, there is much uncertainty surrounding its widespread acceptance. The Internet is becoming an increasingly popular communication medium due to its wide geographic coverage and continuous availability. However, it is also a harsh environment for transmission of high-bandwidth video data due to severe and time-varying network constraints. Since the best-effort nature of the current Internet does not offer any QoS guarantees, it is necessary to provide sender/receiver-based QoS control to provide adequate video play-out quality at the receiver. In this paper, we investigate current QoS control techniques and propose an integrated approach to this problem.
{"title":"QoS control for Internet delivery of video data","authors":"G. Hong, A. Fong, B. Fong","doi":"10.1109/ITCC.2002.1000432","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000432","url":null,"abstract":"Although the emerging Internet Protocol version 6 (IPv6) includes provision for quality-of-service (QoS) control capabilities, there is much uncertainty surrounding its widespread acceptance. The Internet is becoming an increasingly popular communication medium due to its wide geographic coverage and continuous availability. However, it is also a harsh environment for transmission of high-bandwidth video data due to severe and time-varying network constraints. Since the best-effort nature of the current Internet does not offer any QoS guarantees, it is necessary to provide sender/receiver-based QoS control to provide adequate video play-out quality at the receiver. In this paper, we investigate current QoS control techniques and propose an integrated approach to this problem.","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":"121292533","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.1000418
Won Jay Song, B. Ahn
We have applied the effective index method to reduce the two-dimensional refractive index profile into the one-dimensional refractive index structure and modified the wave equations to obtain paraxial wave equations. TE and TM polarized fields in the curved single-mode planar waveguides are analyzed using the scalar beam-propagation method employing the finite-difference method with a slab structure. The bending loss in bent waveguides is analyzed for optical fields obtained from the beam-propagation method and comparisons are made between the loss for the waveguides with various radii of curvature and refractive index differences. The outward shift of the optical field, which is generated at the connection between a straight and bent waveguide, is obtained from calculations of the location of maximum optical intensity. The transition loss can be reduced by introducing an optimized inward offset at a straight-to-bend junction. The wavelength shift due to birefringence of TE and TM polarized fields in bent waveguides is also calculated.
{"title":"Scalar BPM analyses of TE and TM polarized fields in bent waveguides","authors":"Won Jay Song, B. Ahn","doi":"10.1109/ITCC.2002.1000418","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000418","url":null,"abstract":"We have applied the effective index method to reduce the two-dimensional refractive index profile into the one-dimensional refractive index structure and modified the wave equations to obtain paraxial wave equations. TE and TM polarized fields in the curved single-mode planar waveguides are analyzed using the scalar beam-propagation method employing the finite-difference method with a slab structure. The bending loss in bent waveguides is analyzed for optical fields obtained from the beam-propagation method and comparisons are made between the loss for the waveguides with various radii of curvature and refractive index differences. The outward shift of the optical field, which is generated at the connection between a straight and bent waveguide, is obtained from calculations of the location of maximum optical intensity. The transition loss can be reduced by introducing an optimized inward offset at a straight-to-bend junction. The wavelength shift due to birefringence of TE and TM polarized fields in bent waveguides is also calculated.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"13 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":"132064840","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.1000440
R. Hashemi, M. Bahar, A. Tyler, John F. Young
In this research effort, a neural network approach was used as a method of extrapolating the presence of mercury in human blood from animal data. We also investigated the effect of different data representations (as-is, category, simple binary, thermometer and flag) on the model performance. In addition, we used the rough sets methodology to identify the redundant independent variables and then examined the proposed extrapolation model's performance for a reduced set of independent variables. Moreover, a quality measure was introduced that revealed that the proposed extrapolation model performed extremely well for the thermometer data representation.
{"title":"The investigation of mercury presence in human blood: an extrapolation from animal data using neural networks","authors":"R. Hashemi, M. Bahar, A. Tyler, John F. Young","doi":"10.1109/ITCC.2002.1000440","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000440","url":null,"abstract":"In this research effort, a neural network approach was used as a method of extrapolating the presence of mercury in human blood from animal data. We also investigated the effect of different data representations (as-is, category, simple binary, thermometer and flag) on the model performance. In addition, we used the rough sets methodology to identify the redundant independent variables and then examined the proposed extrapolation model's performance for a reduced set of independent variables. Moreover, a quality measure was introduced that revealed that the proposed extrapolation model performed extremely well for the thermometer data representation.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"28 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":"124372156","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.1000376
Hsing Mei, Chun-Yaung Lu, Chi-Chen Lai
Internet Cache Protocol (ICP) is useful for constructing a cooperative cache environment on the Internet. The proxy servers exchange ICP queries and replies in order to share the cached objects with others. However, the required bandwidth of the ICP procedure in the cooperative environment is fixed no matter how high or low the ICP hit rate is. We propose a querying filter mechanism to select proper ICP queries before sending them out. With the querying filter scheme, every proxy server builds a status table to store favorite Web hosts of its neighbors. When the original hosts are requesting, those objects will be delivered freely in order to keep the ICP hit rate stable. Other queries have to be filtered for decreasing additional traffic cost. By doing so the unqualified queries will be filtered and the network bandwidth can be saved; this eventually raises the utilization of the ICP mechanism.
{"title":"An automatic cache cooperative environment using ICP","authors":"Hsing Mei, Chun-Yaung Lu, Chi-Chen Lai","doi":"10.1109/ITCC.2002.1000376","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000376","url":null,"abstract":"Internet Cache Protocol (ICP) is useful for constructing a cooperative cache environment on the Internet. The proxy servers exchange ICP queries and replies in order to share the cached objects with others. However, the required bandwidth of the ICP procedure in the cooperative environment is fixed no matter how high or low the ICP hit rate is. We propose a querying filter mechanism to select proper ICP queries before sending them out. With the querying filter scheme, every proxy server builds a status table to store favorite Web hosts of its neighbors. When the original hosts are requesting, those objects will be delivered freely in order to keep the ICP hit rate stable. Other queries have to be filtered for decreasing additional traffic cost. By doing so the unqualified queries will be filtered and the network bandwidth can be saved; this eventually raises the utilization of the ICP mechanism.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"21 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":"116388904","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
扫码关注我们
求助内容：
应助结果提醒方式：