{"title":"Global rate control scheme for MPEG-2 HDTV parallel encoding system","authors":"K. Nakamura, M. Ikeda, T. Yoshitome, T. Ogura","doi":"10.1109/ITCC.2000.844209","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844209","url":null,"abstract":"This paper proposes a new rate control scheme for an MPEG-2 HDTV parallel encoding system consisting of multiple encoding units. In this rate control scheme, the target number of bits is allocated to each encoding unit every frame period using the complexity of the divided parts of an image. We evaluate this rate control scheme and verify that its image quality is as good or better than that of single encoding.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368678","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":"Noise detection and cleaning by hypergraph model","authors":"A. Bretto, H. Cherifi","doi":"10.1109/ITCC.2000.844264","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844264","url":null,"abstract":"This paper introduces a new algorithm for visual reconstruction of digital images which have been corrupted by mixed noise. From an image hypergraph model we introduce a combinatorial definition of noisy data. A detection procedure is used to classify the hyperedges either as noisy or clean data. Similar to other techniques, the proposed algorithm uses then an estimation procedure to remove the effects of the noise from image data. Numerical simulations demonstrate that this algorithm suppress the effect of the noise while preserving the edges with a high degree of accuracy at a relatively low computational cost.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128057759","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":"Transparent and robust audio data hiding in subband domain","authors":"Xin Li, H. H. Yu","doi":"10.1109/ITCC.2000.844186","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844186","url":null,"abstract":"Data hiding embeds extra information into digital media for the purpose of authentication, annotation and copyright protection. Transparency and robustness are two contradictory requirements for any data hiding scheme. This paper studies audio data hiding using the spread spectrum (SS) technique in the subband domain. On the transparency part, we propose a novel method of tuning psycho-acoustic models employed in audio compression to control the audibility of the introduced distortion for data hiding. On robustness part, we have studied the feature selection and synchronization problem in order to maximize the survivability of the embedded data. Our study shows that mid-band coefficients are appropriate features for data embedding. We propose to track/recover synchronization of the audio signal before the detection, facilitating the extraction of the embedded data. Experiment results have shown that our data hiding scheme in the subband domain can survive a wide range of attacks while providing transparent audio quality and abundant embedding capacity (>20 bps).","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134236152","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":"Visualization of large complex datasets using virtual reality","authors":"S. Sarathy, K. Shujaee, K. Cannon","doi":"10.1109/ITCC.2000.844280","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844280","url":null,"abstract":"Major advances in high performance computing software and hardware have made it possible for designers and analysts to obtain detailed information about the behavior of complex systems. However, this has lead to a proliferation of vast amounts of data which is beyond the ability of humans to easily comprehend using traditional visualization methods. The method presented combines emerging visualization tools with data filtering and data mining techniques. This method uses virtual reality (VR) coupled with multimedia techniques to display information within an environment that allows non-expert users to understand and interpret the data. A prototype visualization tool was developed under a NASA SBIR Phase II effort. This paper builds on the results of this work and suggests a visualization framework that can be used to examine, comprehend and interpret results in any complex data set, particularly those used in support of decision making activities.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115204861","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":"Recursive depth estimation from a sequence of images","authors":"S. Vasikarla, M. Hanmandlu","doi":"10.1109/ITCC.2000.844211","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844211","url":null,"abstract":"This paper gives the theoretical framework for recursively estimating the depth and motion parameters from the image motion equation derived using the spherical projection. An extended Kalman filter is employed for estimation. Results have been found to be encouraging in some cases when applied on two case studies involving vase and cube respectively.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114742221","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":"Source-channel coding of video signals for transmissions in heterogeneous network with collisions","authors":"A. Gustavo, S. A. Viveros","doi":"10.1109/ITCC.2000.844277","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844277","url":null,"abstract":"The problem of data transmission in a heterogeneous network environment involves many considerations, among these: the design and selection of coding schemes and transmissions techniques are the most relevant. The interest in mobile multimedia networks has stimulated the research in this field. Significant progress has been made in this technology. The problem becomes more relevant if we desire to transmit signals in wireline and wireless networks. Progressive transmission is very useful for sending video and, in general, multimedia data over band-limited channels; although it presents problems over noisy channels due to its use of variable length coding. It therefore requires high quality methods to avoid channels noises. One approach is to merge the above mentioned progressive transmission with VQ 2-D-CELP of video over fading channels approach that extends the concept of CELP for speech coding. This technique employ an inverse error predictor filter, an iterative clustering method to design the predictors form an initial array and an algorithm to determine the block size. We state the general design problem, decompose it into simpler subproblems and discuss the solutions to these subproblems.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124156054","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":"Energy allocation strategies for turbo codes with short frames","authors":"M. Salah, R. Raines, M. Temple, T. G. Bailey","doi":"10.1109/ITCC.2000.844262","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844262","url":null,"abstract":"Turbo codes have been shown to approach the Shannon limit for error correcting capability at low signal-to-noise ratios given large sized frames. Extensive research efforts have been examining ways to enhance the performance of turbo codes for short frames (e.g., voice transmission). One way of enhancing the performance is to optimize the energy allocated to each bit stream to achieve the best performance possible. In standard turbo codes, all bits are transmitted with equal energy. Changing the energy allocation strategy can enhance the performance of turbo codes with short frame lengths. Using computer simulation and analytic bounds, different strategies are discussed and applicability to short frame applications investigated.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126605086","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":"Self-adaptive masking method for automatic shape recognition and motion correction of thallium-201 myocardial perfusion SPECT imaging","authors":"K. Dong, M. Tabrizi, A. Movahed","doi":"10.1109/ITCC.2000.844273","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844273","url":null,"abstract":"We introduce a new self-adaptive masking method for shape detection of low signal to noise ratio (SNR) images to improve the tracking capabilities of the motion correction in nuclear cardiac imaging. The method is developed using two-dimensional fast Fourier transform, ideal filtering in the frequency domain, recursive thresholding, and region recognition. This method is independent of the correlation between the context of the planar images and has a good tolerance for low SNR images. Also it is robust under the circumstances of significant abrupt motion of the object.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415922","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":"Dynamic bandwidth allocation for VBR video traffic based on scene change identification","authors":"Hai Liu, N. Ansari, Y. Shi","doi":"10.1109/ITCC.2000.844239","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844239","url":null,"abstract":"To guarantee quality of service (QoS), the requirements of 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, dynamic bandwidth allocation algorithms, in which scene change identification is incorporated, are proposed to improve the bandwidth utilization. The bandwidth allocated for each scene is based on the maximum and mean bandwidth of the scene. When a scene change is identified, a new negotiation process is triggered, and the bandwidth is reallocated.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134365155","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":"Transmitting datacubes over congested networks","authors":"A. Albanese, M. Cannataro, P. Rullo, D. Saccá","doi":"10.1109/ITCC.2000.844206","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844206","url":null,"abstract":"Online analytical processing is an emerging technique for the implementation of decision support applications that access remote datacubes over information highways. We propose a novel approach for sending datacubes over congested networks, so that, in order to preserve fast response time, some datacube tuples can be eventually lost but yet preserving a good approximation of the overall datacube. The main idea is to prioritize the datacube information and to send it using a priority-based transmission protocol. The proposed method relies on two well-known techniques: the wavelet decomposition, for the encoding of the datacube into a sequence of prioritized coefficients, and the priority encoding transmission protocol, to deliver them. To reconstruct the datacube with a user-defined error level, priorities are assigned using a thresholding technique. Preliminary experimental results are very encouraging.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124562040","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}