2007 2nd International Conference on Digital Information Management最新文献

筛选
英文 中文
An XML subtree segmentation method based on syntactic segmentation rate 一种基于句法分割率的XML子树分割方法
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444281
Wenxin Liang, Xiangyong Ouyang, H. Yokota
{"title":"An XML subtree segmentation method based on syntactic segmentation rate","authors":"Wenxin Liang, Xiangyong Ouyang, H. Yokota","doi":"10.1109/ICDIM.2007.4444281","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444281","url":null,"abstract":"In this paper, we propose an effective method for segmenting large XML documents into independent meaningful subtrees based on two syntactic segmentation rates: vertical segmentation rate and horizontal segmentation rate. In the proposed method, we use DO-VLEI code to calculate the required parameters for the subtree segmentation. We conduct experiments to observe the effectiveness of the proposed subtree segmentation method using real bibliography XML documents stored in RDBs. We apply our previously proposed subtree matching algorithm SLAX to match the segmented subtrees and evaluate how the matching threshold impacts the precision and recall of subtree matching. Besides, we also integrate the matched subtrees determined by SLAX by our previously proposed subtree integration algorithm. The experimental results indicate that the proposed subtree segmentation method is effective for segmenting XML documents into independent meaningful subtrees and our previously proposed subtree matching algorithm achieves reasonable matching precision and recall using the segmented subtrees.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122816326","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}
引用次数: 4
Smart management system for digital photographs using temporal and spatial features with EXIF metadata 智能管理系统的数字照片使用时间和空间特征与EXIF元数据
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444209
C. Jang, Ji-Yeon Lee, Jeong-Won Lee, Hwan-Gue Cho
{"title":"Smart management system for digital photographs using temporal and spatial features with EXIF metadata","authors":"C. Jang, Ji-Yeon Lee, Jeong-Won Lee, Hwan-Gue Cho","doi":"10.1109/ICDIM.2007.4444209","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444209","url":null,"abstract":"Due to the popular use of digital cameras and the growing capacity of storage, managing a large collection of digital photos is a burdensome job for the average customers. One distinct feature of current digital photos is that image contents are embedded with metadata EXIF, which varies among digital camera manufactures. Since these metadata have abundant information about the photographing environment, it can provide useful hints for managing photos. Most previous digital photo clustering methods were mainly dependent on the timestamp of the photo taken, so users can not always find the intended photos especially if adjacent pictures have very small time gap. The timing gap of digital photos is not a sufficient and reliable clustering condition to satisfy the average customer. In this paper, we propose a novel parameterized clustering system for digital photos by exploiting temporal (time gap between adjacent photos) and spatial features (content similarity on color pixel domain), so each user can adjust his or her own clustering parameters according to the preference between event (temporal condition) and people (spatial content condition). In order to compute the spatial similarity, we applied the adapted color weight function depending on the distribution of a quantified color set. This enabled us not to use the dominant background color in image similarity matching. We also propose a new content matching algorithm called the block matching-expansion procedure. In this experiment, we compared the result with Cooper's most recent work. Using a set of testing 54 photos, we obtained 4 different clusterings from 4 average photographers' manual work. For each manual clustering, we could find a near optimal parameter (balancing temporal and spatial clustering), which were all superior to Cooper's clustering using temporal condition only.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128235887","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}
引用次数: 29
Extending E-R for modelling XML keys 扩展E-R以建模XML键
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444229
M. Nečaský, J. Pokorný
{"title":"Extending E-R for modelling XML keys","authors":"M. Nečaský, J. Pokorný","doi":"10.1109/ICDIM.2007.4444229","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444229","url":null,"abstract":"With the growing popularity of XML there is a need not only to describe the structure of XML data but also its semantics. For the conceptual modelling of XML we can use existing conceptual models. However, special features of XML require extensions of these models. In this paper, we study conceptual modelling of XML keys. We extend the notion of E-R keys to be suitable for modelling the semantics of XML keys and we show how to express them on the XML logical level.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371462","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}
引用次数: 4
Using watersheds segmentation on ISAR image for automatic target recognition 基于流域分割的ISAR图像自动目标识别
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444237
A. Toumi, B. Hoeltzener, A. Khenchaf
{"title":"Using watersheds segmentation on ISAR image for automatic target recognition","authors":"A. Toumi, B. Hoeltzener, A. Khenchaf","doi":"10.1109/ICDIM.2007.4444237","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444237","url":null,"abstract":"This paper deals with the processing adopted for shape extraction from the ID-presentation (image) in radar automatic target recognition field. The goal is to provide helpful information to human operator for target recognition. However, extracting the target characteristics from a radar echoes is the rather difficult task. Hence, several kinds of radar signatures can be employed to acquire information about target [10, 11]. In this paper, we present one approach for retrieval system for target recognition bused on ISAR-images in radar experimentation field. Then, we propose efficient features that deals with target shape which are extracted using Watersheds transformation. Of course, the target shape gives a better human interpretation.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129149898","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}
引用次数: 14
An access control video watermarking method that is robust to geometric distortions 一种对几何失真具有鲁棒性的门禁视频水印方法
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444266
Lino Coria-Mendoza, P. Nasiopoulos, R. Ward, M. Pickering
{"title":"An access control video watermarking method that is robust to geometric distortions","authors":"Lino Coria-Mendoza, P. Nasiopoulos, R. Ward, M. Pickering","doi":"10.1109/ICDIM.2007.4444266","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444266","url":null,"abstract":"A new video watermarking algorithm for access control is introduced. This method is content- dependent and uses the dual tree complex wavelet transform (DT CWT) to create a watermark that is robust to geometric distortions and lossy compression. The watermark is a random array of 1's and -1's. A one-level DT CWT is applied to this watermark and the coefficients of this transformation are embedded into selected frequency components of the video sequence. The robustness of this method is tested against a joint attack, which involves rotation, scaling, cropping and H.264 video compression.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129219910","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}
引用次数: 10
New method for ranking arabic web sites using ontology concepts 基于本体概念的阿拉伯语网站排序新方法
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444298
Zakaryia Qawaqneh, E. El-Qawasmeh, A. Kayed
{"title":"New method for ranking arabic web sites using ontology concepts","authors":"Zakaryia Qawaqneh, E. El-Qawasmeh, A. Kayed","doi":"10.1109/ICDIM.2007.4444298","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444298","url":null,"abstract":"Recently the numbers of Arabic web sites are rapidly increasing in the World Wide Web. Existing search engines retrieve information based on keywords, so huge number of irrelevant information is retrieved for users. By the appearing of the second generation of the World Wide Web the semantic web, many suitable approaches to retrieve information that depends on semantic can be built. Semantic web provides data models and languages such as Resource Description Framework (RDF), and Web Ontology Language (WOL) that facilitate building ontology within a specific domain. Ontology can capture concepts for specific domain. In addition, it can capture properties of these concepts, and their relationships. Therefore, they help machines to deal with data domain semantically. This paper proposes a new approach to measure the relevancy of Arabic documents to the user query using ontology concepts. In this paper we built Arabic ontology concepts for the electronic commerce domain in Arabic language. Ontology concepts are used to find new approach for ranking Arabic documents, and show the effectiveness of ontology in retrieving relevant documents.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128154823","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}
引用次数: 11
Biorthogonal matrix dirty paper coding for information hiding in still images 静态图像信息隐藏的双正交矩阵脏纸编码
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444265
Xin Xu, M. Tomlinson, M. Ambroze, M. Z. Ahmed
{"title":"Biorthogonal matrix dirty paper coding for information hiding in still images","authors":"Xin Xu, M. Tomlinson, M. Ambroze, M. Z. Ahmed","doi":"10.1109/ICDIM.2007.4444265","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444265","url":null,"abstract":"In this paper, a new method of dirty paper code design is investigated, namely the biorthogonal matrix. The error probability is analysed for the code design. Since the code has the maximum dmm, the robustness of this code is optimal. However, due to the limited availability of the codewords, the performance is restricted. Simulation results shown in this paper identify this restriction and solutions are discussed. Superior coding and binning methods are derived from the in-depth analysis of the simulation results.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127964740","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}
引用次数: 0
Communities detection and analysis of their dynamics in collaborative networks 协同网络中社区动态检测与分析
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444313
Manel Ben Jdidia, C. Robardet, E. Fleury
{"title":"Communities detection and analysis of their dynamics in collaborative networks","authors":"Manel Ben Jdidia, C. Robardet, E. Fleury","doi":"10.1109/ICDIM.2007.4444313","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444313","url":null,"abstract":"In this paper we propose a new way to identify communities in evolving graphs like collaborative networks. We apply this approach on the Infocom co-authorship network to determine stable collaborations and evolving communities. Finally, we analyse the impact of the co-authorships relation topology on the formation of the program committee board of the conference.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131373366","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}
引用次数: 33
Domain-specific Information Retrieval system with a correspondence graph 具有对应图的特定领域信息检索系统
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444191
A. Azarian, A. Siadat, J. Bauchat
{"title":"Domain-specific Information Retrieval system with a correspondence graph","authors":"A. Azarian, A. Siadat, J. Bauchat","doi":"10.1109/ICDIM.2007.4444191","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444191","url":null,"abstract":"This paper describes different existing solutions and proposes a new approach for information retrieval with request specified in natural language within a specific domain and in a multilingual context. The experimental platform employed was the SIDIS- Enterprise car-diagnosis System of Siemens AG (Germany). The paper proposes a new methodology to retrieve car failures symptoms and is based on a correspondence graph. This methodology is more based on perception than on similarity computation between request and symptoms. A comparison study between this approach and usual retrieval methods (e.g. term frequency based) provide promising results.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130005268","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}
引用次数: 1
SemanticWeb: Vision of distributed and trusted data environment? SemanticWeb:分布式可信数据环境的愿景?
2007 2nd International Conference on Digital Information Management Pub Date : 2007-10-01 DOI: 10.1109/ICDIM.2007.4444295
Martin Rimnac, Zdenka Linkova, R. Špánek
{"title":"SemanticWeb: Vision of distributed and trusted data environment?","authors":"Martin Rimnac, Zdenka Linkova, R. Špánek","doi":"10.1109/ICDIM.2007.4444295","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444295","url":null,"abstract":"The vision of the semantic web as a distributed and trusted environment for data sharing together with related issues are presented. The paper brings a basic binary matrix formalism for the internal representation of sources and shows the clasical issues as a data inconsistency and a data integration. Aspects of these issues lead to the binary formalism to be generalised into the 〈0, 1〉 interval one to enable the consideration of uncertainty at various level. Finally, the need of a source trust definition is presented and discussed with respect to a semantic web.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"1966 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130215145","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信