Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918764
M. Steinebach, J. Dittmann, Christian Seibel, Lucilla Croce Ferri, F. Petitcolas, Nazim Fatès, C. Fontaine, F. Raynal
We briefly present the architecture of a public automated evaluation service we are developing for still images, sound and video. We also detail new tests that will be included in this platform. The set of tests is related to audio data and addresses the usual equalisation and normalisation but also time stretching, pitch shifting and specially designed audio attack algorithms. These attacks are discussed and results on watermark attacks and perceived quality after applying the attacks are provided.
{"title":"StirMark benchmark: audio watermarking attacks","authors":"M. Steinebach, J. Dittmann, Christian Seibel, Lucilla Croce Ferri, F. Petitcolas, Nazim Fatès, C. Fontaine, F. Raynal","doi":"10.1109/ITCC.2001.918764","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918764","url":null,"abstract":"We briefly present the architecture of a public automated evaluation service we are developing for still images, sound and video. We also detail new tests that will be included in this platform. The set of tests is related to audio data and addresses the usual equalisation and normalisation but also time stretching, pitch shifting and specially designed audio attack algorithms. These attacks are discussed and results on watermark attacks and perceived quality after applying the attacks are provided.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"21 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":"124619127","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.918867
Jeanson Hung, Hung-Shung Wong, Jung-Hua Wang
A novel cellular search (CS) algorithm for block-matching motion estimation is presented. Two different search patterns, namely the large CS pattern (LCSP) and the small CS pattern (SCSP), are employed to perform a search for the best-matching block. The LCSP assumes that the best-matching block can be located in any direction from the centre of the LCSP, and we show that the number of blocks via LCSP searching is less than via other algorithms. Following the LCSP search, the SCSP is used to search those blocks near the centre block. We show that the CS algorithm is computationally efficient; it requires less computation time than other algorithms, such as the three-step search of T. Koga et al. (1981), the new three-step search of R. Li et al. (1994) and the four-step search of L.M. Po et al. (1996).
{"title":"A novel cellular search algorithm for block-matching motion estimation","authors":"Jeanson Hung, Hung-Shung Wong, Jung-Hua Wang","doi":"10.1109/ITCC.2001.918867","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918867","url":null,"abstract":"A novel cellular search (CS) algorithm for block-matching motion estimation is presented. Two different search patterns, namely the large CS pattern (LCSP) and the small CS pattern (SCSP), are employed to perform a search for the best-matching block. The LCSP assumes that the best-matching block can be located in any direction from the centre of the LCSP, and we show that the number of blocks via LCSP searching is less than via other algorithms. Following the LCSP search, the SCSP is used to search those blocks near the centre block. We show that the CS algorithm is computationally efficient; it requires less computation time than other algorithms, such as the three-step search of T. Koga et al. (1981), the new three-step search of R. Li et al. (1994) and the four-step search of L.M. Po et al. (1996).","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"23 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":"124637354","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.918862
F. Bonchi, F. Giannotti, G. Manco, C. Renso, M. Nanni, D. Pedreschi, S. Ruggieri
Presents a vertical application of data warehousing and data mining technology: intelligent Web caching. We introduce several ways to construct intelligent Web caching algorithms that employ predictive models of Web requests; the general idea is to extend the LRU (least recently used) policy of Web and proxy servers by making it sensible to Web access models extracted from Web log data using data mining techniques. Two approaches have been studied, in particular one based on association rules and another based on decision trees. The experimental results of the new algorithms show substantial improvements over existing LRU-based caching techniques in terms of the hit rate, i.e. the fraction of Web documents directly retrieved in the cache. We designed and developed a prototypical system, which supports data warehousing of Web log data, extraction of data mining models and simulation of the Web caching algorithms, around an architecture that integrates the various phases in the knowledge discovery process. The system supports a systematic evaluation and benchmarking of the proposed algorithms with respect to existing caching strategies.
{"title":"Data mining for intelligent Web caching","authors":"F. Bonchi, F. Giannotti, G. Manco, C. Renso, M. Nanni, D. Pedreschi, S. Ruggieri","doi":"10.1109/ITCC.2001.918862","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918862","url":null,"abstract":"Presents a vertical application of data warehousing and data mining technology: intelligent Web caching. We introduce several ways to construct intelligent Web caching algorithms that employ predictive models of Web requests; the general idea is to extend the LRU (least recently used) policy of Web and proxy servers by making it sensible to Web access models extracted from Web log data using data mining techniques. Two approaches have been studied, in particular one based on association rules and another based on decision trees. The experimental results of the new algorithms show substantial improvements over existing LRU-based caching techniques in terms of the hit rate, i.e. the fraction of Web documents directly retrieved in the cache. We designed and developed a prototypical system, which supports data warehousing of Web log data, extraction of data mining models and simulation of the Web caching algorithms, around an architecture that integrates the various phases in the knowledge discovery process. The system supports a systematic evaluation and benchmarking of the proposed algorithms with respect to existing caching strategies.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"5 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":"121245193","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.918780
D. Liu, W. Karplus
The ever increasing number of data-intensive scientific visualizations motivate the need for high-performance data management support. One such example is given from a simulation and visualization system that assists the physician in the planning and execution of a novel, non-invasive, and very effective treatment of brain aneurysm. The output dataset of this blood flow simulation is very large and information rich and demands an effective means to gaining insights into the nature of time-varying flow fields. For this purpose, we built a computing environment which exploits efficient data storage and management techniques to provide a sufficient performance for real time visualization. Our approach has substantial advantages for achieving higher access efficiency and storage utilization, yielding frame rates suitable for interactive visualization on common desktop workstations. Practical experiments indicate that the techniques developed in this environment can provide the basic building blocks for future efficient implementation of large complex data visualization systems.
{"title":"Data management for exploring complex time-dependent flow datasets","authors":"D. Liu, W. Karplus","doi":"10.1109/ITCC.2001.918780","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918780","url":null,"abstract":"The ever increasing number of data-intensive scientific visualizations motivate the need for high-performance data management support. One such example is given from a simulation and visualization system that assists the physician in the planning and execution of a novel, non-invasive, and very effective treatment of brain aneurysm. The output dataset of this blood flow simulation is very large and information rich and demands an effective means to gaining insights into the nature of time-varying flow fields. For this purpose, we built a computing environment which exploits efficient data storage and management techniques to provide a sufficient performance for real time visualization. Our approach has substantial advantages for achieving higher access efficiency and storage utilization, yielding frame rates suitable for interactive visualization on common desktop workstations. Practical experiments indicate that the techniques developed in this environment can provide the basic building blocks for future efficient implementation of large complex data visualization systems.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"255 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":"121294500","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.918756
Jian Lu
For an end-to-end media streaming system, the Internet can be considered a back box in the middle that connects a client at one end to the server at the other end. We present both ends' views of the streaming problems and review two approaches to these problems. The first approach, which is represented by scalable coding, is reactive in nature because it seeks to best adapt to changing network conditions such as bandwidth fluctuation and packet loss. The reactive approach is helpful in keeping a steam uninterrupted and proving a graceful degradation, but offers no guarantee on quality of the streamed content and does not help solve server-side problems such as scalability. The other approach is proactive and has motivated recent development in content delivery network. We show that a content delivery network helps improve quality and scalability of streaming, and can be complemented with a reactive approach like scalable coding.
{"title":"Reactive and proactive approaches to media streaming: from scalable coding to content delivery networks","authors":"Jian Lu","doi":"10.1109/ITCC.2001.918756","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918756","url":null,"abstract":"For an end-to-end media streaming system, the Internet can be considered a back box in the middle that connects a client at one end to the server at the other end. We present both ends' views of the streaming problems and review two approaches to these problems. The first approach, which is represented by scalable coding, is reactive in nature because it seeks to best adapt to changing network conditions such as bandwidth fluctuation and packet loss. The reactive approach is helpful in keeping a steam uninterrupted and proving a graceful degradation, but offers no guarantee on quality of the streamed content and does not help solve server-side problems such as scalability. The other approach is proactive and has motivated recent development in content delivery network. We show that a content delivery network helps improve quality and scalability of streaming, and can be complemented with a reactive approach like scalable coding.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"35 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":"122157411","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.918761
S. Shirani, M. Gallant, F. Kossentini
We address the problem of robust transmission of compressed visual information over unreliable networks. Our approach employs the principle of multiple descriptions, through pre- and post-processing of the image data, without modification to the source or channel codecs. We employ oversampling to add redundancy to the original image data followed by a partitioning of the oversampled image into "equal" sub-images which can be coded and transmitted over separate channels. Simulations using two descriptors show that this approach yields exceptional performance when only one descriptor is received and outperforms other popular multiple description approaches.
{"title":"Multiple description image coding using pre- and post-processing","authors":"S. Shirani, M. Gallant, F. Kossentini","doi":"10.1109/ITCC.2001.918761","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918761","url":null,"abstract":"We address the problem of robust transmission of compressed visual information over unreliable networks. Our approach employs the principle of multiple descriptions, through pre- and post-processing of the image data, without modification to the source or channel codecs. We employ oversampling to add redundancy to the original image data followed by a partitioning of the oversampled image into \"equal\" sub-images which can be coded and transmitted over separate channels. Simulations using two descriptors show that this approach yields exceptional performance when only one descriptor is received and outperforms other popular multiple description approaches.","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":"126129694","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.918820
Scott Wilson, C. Chu
The proliferation of low-cost multispectral CCD video technology in combination with the Global Positioning System (GPS) has progressed to the point where quantifiable and meaningful results can be derived from low-altitude aerial digital video systems. This low-cost technology will provide meaningful and sometimes critical data that will be required for regional and site-specific land and emergency management. Historically, video has not had the resolution or repeatability to be used for spatial processing, but newer digital systems have expanded the capabilities. Potential applications include the areas of precision farming, oil-spill clean-up, fire remediation and corridor mapping. In this article, we explain how we developed a low-altitude digital video system and compared it to a number of commercially available remote sensing platforms. Salient information such as color, texture, shape and orientation can be extracted from the images and used in a geographic information system for landscape and site-specific analysis.
{"title":"Development of a digital video system for remote sensing of coasts","authors":"Scott Wilson, C. Chu","doi":"10.1109/ITCC.2001.918820","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918820","url":null,"abstract":"The proliferation of low-cost multispectral CCD video technology in combination with the Global Positioning System (GPS) has progressed to the point where quantifiable and meaningful results can be derived from low-altitude aerial digital video systems. This low-cost technology will provide meaningful and sometimes critical data that will be required for regional and site-specific land and emergency management. Historically, video has not had the resolution or repeatability to be used for spatial processing, but newer digital systems have expanded the capabilities. Potential applications include the areas of precision farming, oil-spill clean-up, fire remediation and corridor mapping. In this article, we explain how we developed a low-altitude digital video system and compared it to a number of commercially available remote sensing platforms. Salient information such as color, texture, shape and orientation can be extracted from the images and used in a geographic information system for landscape and site-specific analysis.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"124 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":"128136039","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.918784
J. Dholakia, V. Jain
Discusses and compares three prominent contenders for 3G wireless communication. These are: OFDM (orthogonal frequency division multiplexing), CDMA (code division multiple access) and MC-CDMA (multi-carrier CDMA) - a hybrid of the first two. OFDM has gained increasing acceptance as an alternative to single-carrier modulation for wireless systems. Potential exists for very high bit rates and for reaching the channel capacity even over frequency-selective fading channels. CDMA is the technique being most seriously considered for 3G wireless systems. It uses PN (pseudonoise) sequences to spread the signal spectrum to a wide band, thereby achieving greater robustness to deep fades than a narrowband signal, and the capability for multi-user access. The third technique, MC-CDMA, uses a combination of OFDM and CDMA, and has certain advantages that are pointed out. Finally, this paper touches upon an application, namely wireless video.
{"title":"Technologies for 3G wireless communications","authors":"J. Dholakia, V. Jain","doi":"10.1109/ITCC.2001.918784","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918784","url":null,"abstract":"Discusses and compares three prominent contenders for 3G wireless communication. These are: OFDM (orthogonal frequency division multiplexing), CDMA (code division multiple access) and MC-CDMA (multi-carrier CDMA) - a hybrid of the first two. OFDM has gained increasing acceptance as an alternative to single-carrier modulation for wireless systems. Potential exists for very high bit rates and for reaching the channel capacity even over frequency-selective fading channels. CDMA is the technique being most seriously considered for 3G wireless systems. It uses PN (pseudonoise) sequences to spread the signal spectrum to a wide band, thereby achieving greater robustness to deep fades than a narrowband signal, and the capability for multi-user access. The third technique, MC-CDMA, uses a combination of OFDM and CDMA, and has certain advantages that are pointed out. Finally, this paper touches upon an application, namely wireless video.","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":"127444838","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.918775
M. Husák, J. Jakovenko
The core of the project is the design, construction of and results obtained with a wireless measuring system using a passive integrated resonance circuit. The system is intended for measurement of small pressure variations and wireless information transmission. It is based on the principle of variation of the resonance frequency of a single-chip integrated timed circuit with measuring capacitance. The one-chip resonant circuit has been realised as a monolith integrated sensor in CMOS technology. The dimension is approximately 10 mm/sup 2/. The active part has the form of an absorption resonance frequency meter. Measurement, control, approximation, computation and result processing are performed on a PC. The paper deals with the theory of system design, electronic circuit connections, parasitic capacitances effects calculation, fabrication technology of the integrated passive resonant circuit, result evaluation and techniques of the PC-controlled absorption meter.
{"title":"Sensor system with wireless data communication","authors":"M. Husák, J. Jakovenko","doi":"10.1109/ITCC.2001.918775","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918775","url":null,"abstract":"The core of the project is the design, construction of and results obtained with a wireless measuring system using a passive integrated resonance circuit. The system is intended for measurement of small pressure variations and wireless information transmission. It is based on the principle of variation of the resonance frequency of a single-chip integrated timed circuit with measuring capacitance. The one-chip resonant circuit has been realised as a monolith integrated sensor in CMOS technology. The dimension is approximately 10 mm/sup 2/. The active part has the form of an absorption resonance frequency meter. Measurement, control, approximation, computation and result processing are performed on a PC. The paper deals with the theory of system design, electronic circuit connections, parasitic capacitances effects calculation, fabrication technology of the integrated passive resonant circuit, result evaluation and techniques of the PC-controlled absorption meter.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"18 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":"123714958","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.918864
S. M. Chung, Qing Wang
Skin cancer is the most common type of cancer in the USA. A large, shared skin cancer image database on the Internet would be quite valuable to both medical professionals and consumers. In this paper, such a database is created using a three-tier system: a client application implemented in Java applets, a Web server and a back-end database server. JDBC-ODBC is used for the Web server to communicate with the database server. Various browsing and content-based retrieval methods are supported for the skin cancer image database through Web-based graphical user interfaces. A data mining algorithm for finding association rules between different features of the skin cancer images is also implemented.
{"title":"Content-based retrieval and data mining of a skin cancer image database","authors":"S. M. Chung, Qing Wang","doi":"10.1109/ITCC.2001.918864","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918864","url":null,"abstract":"Skin cancer is the most common type of cancer in the USA. A large, shared skin cancer image database on the Internet would be quite valuable to both medical professionals and consumers. In this paper, such a database is created using a three-tier system: a client application implemented in Java applets, a Web server and a back-end database server. JDBC-ODBC is used for the Web server to communicate with the database server. Various browsing and content-based retrieval methods are supported for the skin cancer image database through Web-based graphical user interfaces. A data mining algorithm for finding association rules between different features of the skin cancer images is also implemented.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"119 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":"115086213","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
扫码关注我们
求助内容：
应助结果提醒方式：