Pub Date : 2001-04-02DOI: 10.1109/ITCC.2001.918841
Chung-Lin Huang, Chih-Yu Chang
This paper proposes a system to analyze and summarize the video shots of the baseball game TV program into fifteen categories. The system consists of three modules: feature extraction, Hidden Markov Model (HMM) training, and video shot categorization.
{"title":"Video summarization using hidden Markov model","authors":"Chung-Lin Huang, Chih-Yu Chang","doi":"10.1109/ITCC.2001.918841","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918841","url":null,"abstract":"This paper proposes a system to analyze and summarize the video shots of the baseball game TV program into fifteen categories. The system consists of three modules: feature extraction, Hidden Markov Model (HMM) training, and video shot categorization.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"16 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":"130218460","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.918869
M. C. McCabe, Abdur Chowdhury, D. Grossman, O. Frieder
The fusion of various retrieval strategies has long been suggested as a means of improving retrieval effectiveness. To date, testing of fusion has been done by combining result sets from widely disparate approaches that include an uncontrolled mixture of retrieval strategies and utilities. To isolate the effect of fusion on individual retrieval models, we have implemented probabilistic, vector-space and weighted Boolean models and tested the effect of fusion on these strategies in a systematic fashion. We also tested the effect of fusion on various query representations and have shown up to a 12% improvement in the average precision.
{"title":"System fusion for improving performance in information retrieval systems","authors":"M. C. McCabe, Abdur Chowdhury, D. Grossman, O. Frieder","doi":"10.1109/ITCC.2001.918869","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918869","url":null,"abstract":"The fusion of various retrieval strategies has long been suggested as a means of improving retrieval effectiveness. To date, testing of fusion has been done by combining result sets from widely disparate approaches that include an uncontrolled mixture of retrieval strategies and utilities. To isolate the effect of fusion on individual retrieval models, we have implemented probabilistic, vector-space and weighted Boolean models and tested the effect of fusion on these strategies in a systematic fashion. We also tested the effect of fusion on various query representations and have shown up to a 12% improvement in the average precision.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"44 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":"127840270","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.918825
B. Carpentieri
In this paper, we present communication protocols that allow a "learned" sender and a "learned" receiver to communicate on a bidirectional line, compressing files with (static or dynamic) dictionaries initially built independently by the sender and the receiver from those examples of the source output which they have available. We show that this leads to an improvement in compression, paid with a negligible or almost null possibility of communication error.
{"title":"Communication with a learned receiver on a bidirectional line","authors":"B. Carpentieri","doi":"10.1109/ITCC.2001.918825","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918825","url":null,"abstract":"In this paper, we present communication protocols that allow a \"learned\" sender and a \"learned\" receiver to communicate on a bidirectional line, compressing files with (static or dynamic) dictionaries initially built independently by the sender and the receiver from those examples of the source output which they have available. We show that this leads to an improvement in compression, paid with a negligible or almost null possibility of communication error.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"41 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":"122497620","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.918878
W. Godoy, E. Wille
The objective of the paper is to analyze the bound of addition proposed by D.J. Barros et al. (1997) in contrast to the GMD bound (G.D. Forney Jr., 1966) and the cone bound (W. Godoy Jr., 1990) which shows the Voronoi region of the zero code-word for a specific vector. A new algorithm, which associates the ZNA algorithm (L.B. Levitin and C.R.P. Hartmann, 1985) with the bound of addition, is proposed for soft decision techniques.
{"title":"Analysis of a bound of Voronoi region V(C/sub 0/) and proposal of sub-optimum decoding algorithm","authors":"W. Godoy, E. Wille","doi":"10.1109/ITCC.2001.918878","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918878","url":null,"abstract":"The objective of the paper is to analyze the bound of addition proposed by D.J. Barros et al. (1997) in contrast to the GMD bound (G.D. Forney Jr., 1966) and the cone bound (W. Godoy Jr., 1990) which shows the Voronoi region of the zero code-word for a specific vector. A new algorithm, which associates the ZNA algorithm (L.B. Levitin and C.R.P. Hartmann, 1985) with the bound of addition, is proposed for soft decision techniques.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"332 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":"115461118","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.918822
F. Davoli, P. Maryni, M. Perrando, S. Zappatore
The issue of accessing remote complex laboratories in a networked environment and performing experiments and measurements in which several applications and diverse devices are involved is addressed. A proposal is described for a common architecture for enhanced multimedia remote device control. The aim is to have the ability to set up a "gate" device that is the structured sum of real devices (from routers to microscopes) and virtual ones (e.g. software applications). The architecture exploits the most recent WWW "products", using the flexibility of embedding Java within a middleware framework. The authors do not claim that this will be "the" common architecture in such environment, but this exercise is useful for highlighting a number of problems through the proposal of different sets of solutions. The definition and initial implementation of this concept is part of the activities carried on within the framework of the LABNET project, at the CNIT Multimedia Communications Laboratory in Naples, Italy. The project, which started in April 2000, aims at the implementation of tools for network access to real laboratories and the management of experiments at a distance. The main structure of the project and the on-going activities are also briefly described.
{"title":"A general framework for networked multimedia applications enabling access to laboratory equipment: the LABNET project experience","authors":"F. Davoli, P. Maryni, M. Perrando, S. Zappatore","doi":"10.1109/ITCC.2001.918822","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918822","url":null,"abstract":"The issue of accessing remote complex laboratories in a networked environment and performing experiments and measurements in which several applications and diverse devices are involved is addressed. A proposal is described for a common architecture for enhanced multimedia remote device control. The aim is to have the ability to set up a \"gate\" device that is the structured sum of real devices (from routers to microscopes) and virtual ones (e.g. software applications). The architecture exploits the most recent WWW \"products\", using the flexibility of embedding Java within a middleware framework. The authors do not claim that this will be \"the\" common architecture in such environment, but this exercise is useful for highlighting a number of problems through the proposal of different sets of solutions. The definition and initial implementation of this concept is part of the activities carried on within the framework of the LABNET project, at the CNIT Multimedia Communications Laboratory in Naples, Italy. The project, which started in April 2000, aims at the implementation of tools for network access to real laboratories and the management of experiments at a distance. The main structure of the project and the on-going activities are also briefly described.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"515 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":"126816064","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.918874
R. Hashemi, Lei Jin, G. Anderson, E. Wilson, M. Clark
In this paper, two scanning paradigms are presented and compared that may be used for robotic scanning of a harsh environment such as a celestial body or earth poles. The first paradigm, tight scanning, includes three algorithms, which may be used to find small objects or gasses confined to small regions such as the methane gas given off by bacteria in buried hot springs in the Canadian arctic. The second paradigm, relaxed scanning, includes four algorithms which may be used to find large objects such as large ice deposits that may be buried just below the surface of Mars. The algorithms are compared against their peer algorithms by their quality of performance. Such performance quality is determined by the ratio of scanned area to the traveled distance by the two robots.
{"title":"A comparison of search patterns for cooperative robots operating in remote environment","authors":"R. Hashemi, Lei Jin, G. Anderson, E. Wilson, M. Clark","doi":"10.1109/ITCC.2001.918874","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918874","url":null,"abstract":"In this paper, two scanning paradigms are presented and compared that may be used for robotic scanning of a harsh environment such as a celestial body or earth poles. The first paradigm, tight scanning, includes three algorithms, which may be used to find small objects or gasses confined to small regions such as the methane gas given off by bacteria in buried hot springs in the Canadian arctic. The second paradigm, relaxed scanning, includes four algorithms which may be used to find large objects such as large ice deposits that may be buried just below the surface of Mars. The algorithms are compared against their peer algorithms by their quality of performance. Such performance quality is determined by the ratio of scanned area to the traveled distance by the two robots.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"136 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":"123261147","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.918871
V. Khanna, Phalguni Gupta, C. Hwang
An efficient algorithm is presented to label the connected components in an array representation of 2D images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of union-find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and (lower) bound the size of the table to [N/2]+1 for an N/spl times/N image. It is also shown that the maintenance of the table has an overall linear amortized cost.
{"title":"Finding connected components in digital images","authors":"V. Khanna, Phalguni Gupta, C. Hwang","doi":"10.1109/ITCC.2001.918871","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918871","url":null,"abstract":"An efficient algorithm is presented to label the connected components in an array representation of 2D images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of union-find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and (lower) bound the size of the table to [N/2]+1 for an N/spl times/N image. It is also shown that the maintenance of the table has an overall linear amortized cost.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"59 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":"126566377","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.918861
G. Meghabghab
The research looks at a Web page as a graph structure or a Web graph and tries to classify different Web graphs in the new coordinate space: Out-Degree, In-Degree. The Out-degree coordinate is defined as the number of outgoing Web pages from a given Web page. The In-degree coordinate is the number of Web pages that point to a given Web page. J. Kleinberg's (1988) Web algorithm on discovering "hub Web pages" and "authorities Web pages" is applied in this new coordinate space. Some very uncommon phenomena have been discovered and new interesting results interpreted. The author believes that understanding the underlying Web page as a graph will help design better Web algorithms, enhance retrieval and Web performance, and recommends using graphs as part of a visual aid for search engine designers.
{"title":"Discovering authorities and hubs in different topological Web graph structures","authors":"G. Meghabghab","doi":"10.1109/ITCC.2001.918861","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918861","url":null,"abstract":"The research looks at a Web page as a graph structure or a Web graph and tries to classify different Web graphs in the new coordinate space: Out-Degree, In-Degree. The Out-degree coordinate is defined as the number of outgoing Web pages from a given Web page. The In-degree coordinate is the number of Web pages that point to a given Web page. J. Kleinberg's (1988) Web algorithm on discovering \"hub Web pages\" and \"authorities Web pages\" is applied in this new coordinate space. Some very uncommon phenomena have been discovered and new interesting results interpreted. The author believes that understanding the underlying Web page as a graph will help design better Web algorithms, enhance retrieval and Web performance, and recommends using graphs as part of a visual aid for search engine designers.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"30 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":"116960518","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.918827
M. Saelee, S. Beitzel, Eric C. Jensen, D. Grossman, O. Frieder
We describe a mediator designed specifically for an intranet rather than an Internet. Our intranet mediator allows data reconciliation and integration to be completed long before the query is executed. This is because information about the data sources is known and a combined schema can be defined prior to the query. On the Internet, source schemas are not available so integration cannot occur before the query. In our approach, a data warehouse is used for reconciliation of structured data. We propose a new architecture and describe an initial prototype built to test the architecture.
{"title":"Intranet mediators: a prototype","authors":"M. Saelee, S. Beitzel, Eric C. Jensen, D. Grossman, O. Frieder","doi":"10.1109/ITCC.2001.918827","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918827","url":null,"abstract":"We describe a mediator designed specifically for an intranet rather than an Internet. Our intranet mediator allows data reconciliation and integration to be completed long before the query is executed. This is because information about the data sources is known and a combined schema can be defined prior to the query. On the Internet, source schemas are not available so integration cannot occur before the query. In our approach, a data warehouse is used for reconciliation of structured data. We propose a new architecture and describe an initial prototype built to test the architecture.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"369 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":"124623642","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.918846
S. Rodtook, Y. Rangsanseri
We present a new technique for document image binarization to manage different situations in an image. The problems of image binarization caused by illumination, contrast, noise and much source type-related degradation are addressed. A new technique is applied to determine a local threshold for each pixel. The idea of our technique is to update locally the threshold value whenever the Laplacian sign of the input image changes along the raster scanned line. The Differential of Gaussian (DoG) is used to define the sign image. The proposed technique is tested with images including different types of document components and degradations. The results were compared with a global thresholding technique. It is shown that the proposed technique performs well and is highly robust.
{"title":"Adaptive thresholding of document images based on Laplacian sign","authors":"S. Rodtook, Y. Rangsanseri","doi":"10.1109/ITCC.2001.918846","DOIUrl":"https://doi.org/10.1109/ITCC.2001.918846","url":null,"abstract":"We present a new technique for document image binarization to manage different situations in an image. The problems of image binarization caused by illumination, contrast, noise and much source type-related degradation are addressed. A new technique is applied to determine a local threshold for each pixel. The idea of our technique is to update locally the threshold value whenever the Laplacian sign of the input image changes along the raster scanned line. The Differential of Gaussian (DoG) is used to define the sign image. The proposed technique is tested with images including different types of document components and degradations. The results were compared with a global thresholding technique. It is shown that the proposed technique performs well and is highly robust.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"25 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":"114460044","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
扫码关注我们
求助内容：
应助结果提醒方式：