Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918757
Jianfei Cai, C. Chen
The authors present a FEC-based end-to-end error control scheme for video streaming over packet loss networks. We propose a novel robust video streaming system in which an interleaving is applied to the compressed bitstream before channel coding. The application of such preinterleaving is able to improve the performance of video streaming over packet loss networks because pre-interleaving can simultaneously satisfy different requirements arising from both channel coding and source coding. We demonstrate with simulations that the proposed approach can achieve a significant improvement for video streaming over heavy packet loss networks.
{"title":"FEC-based video streaming over packet loss networks with pre-interleaving","authors":"Jianfei Cai, C. Chen","doi":"10.1109/ITCC.2001.918757","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918757","url":null,"abstract":"The authors present a FEC-based end-to-end error control scheme for video streaming over packet loss networks. We propose a novel robust video streaming system in which an interleaving is applied to the compressed bitstream before channel coding. The application of such preinterleaving is able to improve the performance of video streaming over packet loss networks because pre-interleaving can simultaneously satisfy different requirements arising from both channel coding and source coding. We demonstrate with simulations that the proposed approach can achieve a significant improvement for video streaming over heavy packet loss networks.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"85 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":"123287277","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918758
S. Deshpande, W. Zeng
JPEG2000 is a new image compression standard. One of the goals of JPEG2000 is to support large images. Since even the compressed image file can be very big for large images, downloading the entire image can take a long time depending upon the user's connection speed. Thus, we propose to use streaming of JPEG2000 images. We use the Hypertext Transfer Protocol (HTTP) for streaming. The use of HTTP to stream JPEG2000 images will ease its deployment. Thus, JPEG2000 images can be hosted by a Web server and can be streamed to the client helper application. The solution is scalable, so client devices with different capabilities, a variety of screen resolutions, and heterogeneous bandwidths can all achieve a scalable viewing of the same content stored in a single file. It is also possible to stream only selected regions of the image at a particular resolution and decode this partial stream and display it at the client. Thus, the proposed approach can handle resolution, quality and region of interest scalability feature of JPEG2000 images.
{"title":"HTTP streaming of JPEG2000 images","authors":"S. Deshpande, W. Zeng","doi":"10.1109/ITCC.2001.918758","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918758","url":null,"abstract":"JPEG2000 is a new image compression standard. One of the goals of JPEG2000 is to support large images. Since even the compressed image file can be very big for large images, downloading the entire image can take a long time depending upon the user's connection speed. Thus, we propose to use streaming of JPEG2000 images. We use the Hypertext Transfer Protocol (HTTP) for streaming. The use of HTTP to stream JPEG2000 images will ease its deployment. Thus, JPEG2000 images can be hosted by a Web server and can be streamed to the client helper application. The solution is scalable, so client devices with different capabilities, a variety of screen resolutions, and heterogeneous bandwidths can all achieve a scalable viewing of the same content stored in a single file. It is also possible to stream only selected regions of the image at a particular resolution and decode this partial stream and display it at the client. Thus, the proposed approach can handle resolution, quality and region of interest scalability feature of JPEG2000 images.","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":"131331470","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918855
S. Neogy, A. Sinha, P. K. Das
The method of taking checkpoints in a truly distributed manner, that is in the absence of a global checkpoint coordinator has been very tricky. This has been dealt with in a system that uses a loosely synchronized clock. The constituent processes take their checkpoints according to their own clocks at predetermined checkpoint instants. Since these checkpoints are asynchronous, in order to determine a global consistent set of such checkpoints there must be some sort of synchronization among them. Synchronization information is appended to clock synchronization messages that are used by the constituent processes for checkpoint-synchronization. Communication in this system is synchronous, so processes may be blocked for communication at the checkpointing instants. The blocked processes take their checkpoints after they unblock. It is shown that the set of such i-th checkpoints is consistent and hence the rollback required by the system in case failure occurs is only up to the last saved state.
{"title":"Checkpoint processing in distributed systems software using synchronized clocks","authors":"S. Neogy, A. Sinha, P. K. Das","doi":"10.1109/ITCC.2001.918855","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918855","url":null,"abstract":"The method of taking checkpoints in a truly distributed manner, that is in the absence of a global checkpoint coordinator has been very tricky. This has been dealt with in a system that uses a loosely synchronized clock. The constituent processes take their checkpoints according to their own clocks at predetermined checkpoint instants. Since these checkpoints are asynchronous, in order to determine a global consistent set of such checkpoints there must be some sort of synchronization among them. Synchronization information is appended to clock synchronization messages that are used by the constituent processes for checkpoint-synchronization. Communication in this system is synchronous, so processes may be blocked for communication at the checkpointing instants. The blocked processes take their checkpoints after they unblock. It is shown that the set of such i-th checkpoints is consistent and hence the rollback required by the system in case failure occurs is only up to the last saved state.","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":"131756599","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918849
A. Fong, G. R. Higgie, B. Fong
The convergence of multimedia applications, which include such diverse sources as video, audio and computer data, places harsh demands on the communications process. Source coding is an important step in the communications process. A good source-coding scheme is characterized by its high efficiency in removing redundancy inherent in the information source. It should also ensure data integrity and be suitable for different data types. Codeword synchronization is an important aspect of any data communications system, whether it is a wireline or wireless system. Traditionally, block codes are used for source coding to reduce uncertainties in synchronization. The authors propose the application of minimal sync-delay T-codes for information source coding. The aim is to facilitate widespread deployment of efficient codes that also have intrinsically strong synchronizing performance.
{"title":"Multimedia applications of self-synchronizing T-codes","authors":"A. Fong, G. R. Higgie, B. Fong","doi":"10.1109/ITCC.2001.918849","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918849","url":null,"abstract":"The convergence of multimedia applications, which include such diverse sources as video, audio and computer data, places harsh demands on the communications process. Source coding is an important step in the communications process. A good source-coding scheme is characterized by its high efficiency in removing redundancy inherent in the information source. It should also ensure data integrity and be suitable for different data types. Codeword synchronization is an important aspect of any data communications system, whether it is a wireline or wireless system. Traditionally, block codes are used for source coding to reduce uncertainties in synchronization. The authors propose the application of minimal sync-delay T-codes for information source coding. The aim is to facilitate widespread deployment of efficient codes that also have intrinsically strong synchronizing performance.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"52 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":"122324509","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918762
Pol-Lin Tai, Chii-Tung Liu, Jia-Shung Wang
The authors propose a scalable video coding algorithm for low bit rate failure-free video transmission. In the failure-free video transmission, two channels are utilized to transmit the same video source. In the receiver, the video can be reconstructed by any single encoded bitstream. While receiving two encoded bitstreams, the image quality can be improved by combining two bitstreams. We develop a motion vector refinement technique to improve the image quality. In the encoder, the positions of the macroblocks for channel two are shifted by eight pixels from channel one. In the receiver, the motion vectors transmitted in each channel can be refined to more accurate motion vectors with smaller block size when two channels are received. The final decoded image is merged from the two reconstructed images by the two channels. Experimental results show our proposed method has high efficiency and high reliability.
{"title":"Scalable video coding for failure-free video transmission","authors":"Pol-Lin Tai, Chii-Tung Liu, Jia-Shung Wang","doi":"10.1109/ITCC.2001.918762","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918762","url":null,"abstract":"The authors propose a scalable video coding algorithm for low bit rate failure-free video transmission. In the failure-free video transmission, two channels are utilized to transmit the same video source. In the receiver, the video can be reconstructed by any single encoded bitstream. While receiving two encoded bitstreams, the image quality can be improved by combining two bitstreams. We develop a motion vector refinement technique to improve the image quality. In the encoder, the positions of the macroblocks for channel two are shifted by eight pixels from channel one. In the receiver, the motion vectors transmitted in each channel can be refined to more accurate motion vectors with smaller block size when two channels are received. The final decoded image is merged from the two reconstructed images by the two channels. Experimental results show our proposed method has high efficiency and high reliability.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"48 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":"121104367","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918870
V. Khanna, Phalguni Gupta, C. Hwang
In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to re-compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components' labeling when a homogeneous region in the quadtree is changing. The updating algorithms visit less nodes compared to the batch approach.
{"title":"Maintenance of connected components in quadtree-based image representation","authors":"V. Khanna, Phalguni Gupta, C. Hwang","doi":"10.1109/ITCC.2001.918870","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918870","url":null,"abstract":"In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to re-compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components' labeling when a homogeneous region in the quadtree is changing. The updating algorithms visit less nodes compared to the batch approach.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"12 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":"128900676","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918847
A. Dehghani, F. Shabani, P. Nava
In this paper a new method for off-line recognition of isolated handwritten Persian characters based on hidden Markov models (HMMs) is proposed. In the proposed system, document images are acquired in 300-dpi resolution. Multiple filters such as median and morphologal filters are utilized for noise removal. The features used in this process are methods based on regional projection contour transformation (RPCT). In this stage, two types of feature vectors, based on this technique, are extracted. The recognition system consists of two stages. For each character in the training phase, multiple HMMs corresponding to different feature vectors are built. In the classification phase, the results of the individual classifiers are integrated to produce the final recognition.
{"title":"Off-line recognition of isolated Persian handwritten characters using multiple hidden Markov models","authors":"A. Dehghani, F. Shabani, P. Nava","doi":"10.1109/ITCC.2001.918847","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918847","url":null,"abstract":"In this paper a new method for off-line recognition of isolated handwritten Persian characters based on hidden Markov models (HMMs) is proposed. In the proposed system, document images are acquired in 300-dpi resolution. Multiple filters such as median and morphologal filters are utilized for noise removal. The features used in this process are methods based on regional projection contour transformation (RPCT). In this stage, two types of feature vectors, based on this technique, are extracted. The recognition system consists of two stages. For each character in the training phase, multiple HMMs corresponding to different feature vectors are built. In the classification phase, the results of the individual classifiers are integrated to produce the final recognition.","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":"133268300","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918789
S. Mitra, C. A. Murthy, M. Kundu, B. Bhattacharya, T. Acharya
Deals with a new technique of fractal image compression based on the theory of iterated function systems (IFS) with probabilities. The theory of IFS with probabilities, in the context of image compression, is a relatively unexplored area. The rationale behind using this approach stems from the fact that it is possible to define a Markov operator associated with the probability measure whose support is the support of the given image. A new technique of fractal image compression is proposed using IFS with probabilities. The technique is found to be extremely fast in computing both the coefficients of maps and the probabilities. Thus, the proposed technique provides a very fast fractal-based image compression encoding.
{"title":"Fractal image compression using iterated function system with probabilities","authors":"S. Mitra, C. A. Murthy, M. Kundu, B. Bhattacharya, T. Acharya","doi":"10.1109/ITCC.2001.918789","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918789","url":null,"abstract":"Deals with a new technique of fractal image compression based on the theory of iterated function systems (IFS) with probabilities. The theory of IFS with probabilities, in the context of image compression, is a relatively unexplored area. The rationale behind using this approach stems from the fact that it is possible to define a Markov operator associated with the probability measure whose support is the support of the given image. A new technique of fractal image compression is proposed using IFS with probabilities. The technique is found to be extremely fast in computing both the coefficients of maps and the probabilities. Thus, the proposed technique provides a very fast fractal-based image compression encoding.","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":"116040830","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918877
S. Choudhury, N. Chaki, S. Bhattacharya
In an effort to design and develop a suitable platform for the next generation information systems, a new Graph Object Oriented database Model (GOOM) is proposed. In fact, the proposed model in its present definition is an improvement of our earlier work (S. Choudhury et al., 1998; 2000). The evolution is found to be absolutely essential in the interest of implementing the model and towards building a reliable Graph Query Language (GQL). We have introduced the concept of encapsulating homogeneous entities into semantic group while permitting the declaration of relationships amongst different semantic groups from various user-defined views. The proposed model aims at extracting the positive features of both object and relational data models besides providing a structured graphic representation. The paper emphasizes the mathematical foundation of the proposed graph language. In fact, the proposed GQL maintains a very similar interface to that of widely accepted SQL.
为了设计和开发适合下一代信息系统的平台，提出了一种新的面向对象的图形数据库模型(GOOM)。事实上，目前提出的模型定义是对我们早期工作的改进(S. Choudhury et al.， 1998;2000)。对于实现模型和构建可靠的图形查询语言(GQL)来说，这种演变是绝对必要的。我们引入了将同构实体封装到语义组中的概念，同时允许从不同的用户定义视图声明不同语义组之间的关系。该模型除了提供结构化的图形表示外，还旨在提取对象和关系数据模型的积极特征。本文强调了所提出的图语言的数学基础。实际上，建议的GQL维护了与被广泛接受的SQL非常相似的接口。
{"title":"Graph object oriented model and query language: a semi-structured approach","authors":"S. Choudhury, N. Chaki, S. Bhattacharya","doi":"10.1109/ITCC.2001.918877","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918877","url":null,"abstract":"In an effort to design and develop a suitable platform for the next generation information systems, a new Graph Object Oriented database Model (GOOM) is proposed. In fact, the proposed model in its present definition is an improvement of our earlier work (S. Choudhury et al., 1998; 2000). The evolution is found to be absolutely essential in the interest of implementing the model and towards building a reliable Graph Query Language (GQL). We have introduced the concept of encapsulating homogeneous entities into semantic group while permitting the declaration of relationships amongst different semantic groups from various user-defined views. The proposed model aims at extracting the positive features of both object and relational data models besides providing a structured graphic representation. The paper emphasizes the mathematical foundation of the proposed graph language. In fact, the proposed GQL maintains a very similar interface to that of widely accepted SQL.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"205 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":"132219663","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 : 2001-04-02DOI: 10.1109/ITCC.2001.918858
G. Al-Rawi, J. Cioffi
We present a domain-programmable (code-independent) parallel architecture for efficiently implementing iterative probabilistic decoding of LDPC codes. The architecture is based on distributed computing and message passing. The exploited parallelism was found to be communication limited. To increase the utilization of the computational resources, we separate the routing process and state management functionalities performed by physical nodes from computation functionalities performed by function units that can be shared by multiple physical nodes. Simulation results show that the proposed architecture leads to improvements in FU utilization by 251%, 116%, and 209% compared to a hypothetical fully parallel custom implementation, a fully sequential implementation, and a proprietary FPGA custom implementation, respectively, that all use the same core FU design. Compared to an implementation on a shared-memory general-purpose parallel machine, the proposed architecture exhibits 75.6% improvement in scalability. We also introduce a novel low cost store-and-forward routing algorithm for deadlock avoidance in torus networks.
{"title":"A highly efficient domain-programmable parallel architecture for iterative LDPCC decoding","authors":"G. Al-Rawi, J. Cioffi","doi":"10.1109/ITCC.2001.918858","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918858","url":null,"abstract":"We present a domain-programmable (code-independent) parallel architecture for efficiently implementing iterative probabilistic decoding of LDPC codes. The architecture is based on distributed computing and message passing. The exploited parallelism was found to be communication limited. To increase the utilization of the computational resources, we separate the routing process and state management functionalities performed by physical nodes from computation functionalities performed by function units that can be shared by multiple physical nodes. Simulation results show that the proposed architecture leads to improvements in FU utilization by 251%, 116%, and 209% compared to a hypothetical fully parallel custom implementation, a fully sequential implementation, and a proprietary FPGA custom implementation, respectively, that all use the same core FU design. Compared to an implementation on a shared-memory general-purpose parallel machine, the proposed architecture exhibits 75.6% improvement in scalability. We also introduce a novel low cost store-and-forward routing algorithm for deadlock avoidance in torus networks.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"34 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":"122304489","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
扫码关注我们
求助内容：
应助结果提醒方式：