2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System最新文献

筛选
英文 中文
A Novel Collaborative Filtering Mechanism for Product Recommendation in P2P Networks 一种新的P2P网络产品推荐协同过滤机制
Fuyong Yuan, Jian Liu, Chunxia Yin, Yulian Zhang, Nan Shen
{"title":"A Novel Collaborative Filtering Mechanism for Product Recommendation in P2P Networks","authors":"Fuyong Yuan, Jian Liu, Chunxia Yin, Yulian Zhang, Nan Shen","doi":"10.1109/SITIS.2007.69","DOIUrl":"https://doi.org/10.1109/SITIS.2007.69","url":null,"abstract":"With the fast development of Internet, many recommender systems have emerged in e-commerce applications to support the product recommendation. However, most centralized recommender systems based on collaborative filtering can't work effectively when large number of users require to them. In P2P networks, this paper proposes a PRBOCF (Product Recommendation Based On Collaborative Filtering), which is a scalable mechanism to recommend products in distributed way. In PRBOCF, as two main parts of product information, image and text are weighted respectively and their features are represented by one vector. For increasing the quality of representing the text of product according to the Vector Space Model, WordNet v2.0 is employed to deal with the relationship of words in the text. Then a peer's preference is represented by a feature space consisting of all the vectors of its saved products information. For acquiring the recommender systems scalable and best quality of recommendation, PRBOCF makes product recommendation by searching for neighbor peers with similar preference through local information of recent ratings. Finally, the simulation results are discussed.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115288921","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}
引用次数: 3
Single-Patch NURBS Face 单补丁NURBS脸
Ken Yano, K. Harada
{"title":"Single-Patch NURBS Face","authors":"Ken Yano, K. Harada","doi":"10.1109/SITIS.2007.85","DOIUrl":"https://doi.org/10.1109/SITIS.2007.85","url":null,"abstract":"We describe a novel NURBS surface fitting method to a human face model. Our first step is to resample of the original mesh model. The next step we fit a tensor product NURBS surface to the grid points. Our method is characteristic in that we use only one patch to fit the model. By eliminating the need to make patch boundaries, our resampling and fitting method can be used for interactive system with minimum user interactions.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792806","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}
引用次数: 2
An Information Hiding Scheme Using a Pattern-Based Compression Algorithm 一种基于模式压缩算法的信息隐藏方案
F. Keissarian
{"title":"An Information Hiding Scheme Using a Pattern-Based Compression Algorithm","authors":"F. Keissarian","doi":"10.1109/SITIS.2007.105","DOIUrl":"https://doi.org/10.1109/SITIS.2007.105","url":null,"abstract":"This paper presents a data hiding scheme that hides the data in the compression domain of a digital image. The pattern-based compression algorithm used for hiding the information, compresses the image according to the visual activity of individual image blocks. The key point of the proposed scheme is to first identify the smooth area of the host image and then embed the data in these areas. Experimental results confirm that the proposed scheme can embed a large amount of data in the compressed file while maintaining satisfactory image quality.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124110066","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
General Parallel Matrix Multiplication on the OTIS Network OTIS网络上的一般并行矩阵乘法
Zhaoquan Cai, Wenhong Wei
{"title":"General Parallel Matrix Multiplication on the OTIS Network","authors":"Zhaoquan Cai, Wenhong Wei","doi":"10.1109/SITIS.2007.36","DOIUrl":"https://doi.org/10.1109/SITIS.2007.36","url":null,"abstract":"The optical transpose interconnection system (OTIS), proposed by Marsden et al., is a hybrid optical and electronic interconnection system for large parallel computers. In this network model, Wang and Sahni in proposed the two size of NtimesN or kNtimeskN matrices multiplication algorithm, however, the algorithm of matrix multiplication about general matrix was not introduced , and the matrix multiplication proposed by them can only be applied to OTIS-Mesh, not to general OTIS architecture. So in this paper, we map matrices to OTIS network using a new mapping scheme, and propose general algorithm to multiply two vectors, a vector and a matrix, and two matrices, at last we compare our algorithm with Canonpsilas algorithm and O(N3) serial algorithm by experiments, and the result proved that our algorithm is better than them.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126304245","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}
引用次数: 2
A Robust Overlay Network for Real-Time Multimedia Dissemination 实时多媒体传播的鲁棒覆盖网络
Qiang Zeng, Hua Miao, Zhaoliang Zhu
{"title":"A Robust Overlay Network for Real-Time Multimedia Dissemination","authors":"Qiang Zeng, Hua Miao, Zhaoliang Zhu","doi":"10.1109/SITIS.2007.41","DOIUrl":"https://doi.org/10.1109/SITIS.2007.41","url":null,"abstract":"Robustness of overlay networks is an importantproperty as well as short delay for real-time media transmission. Unlike previous schemes, which achieve robustness by restoring spanning trees afternodes or links fail, we focus on reducing possible data loss when failure occurs. According to analysis of the relation between tree depth and data loss, we first present a spanning tree which minimizes dataloss but results in large delay. By introducing a factor, we propose a spanning tree which exhibits fine flexibility and tradeoff between data loss and delay. Simulation results show that it achieves relatively low data loss and delay simultaneously, as is optimum for a large range of applications.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125978265","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
Constructing Efficient Cache Invalidation Schemes in Mobile Environments 在移动环境下构建高效的缓存失效机制
Po-Jen Chuang, Yu-Shian Chiu
{"title":"Constructing Efficient Cache Invalidation Schemes in Mobile Environments","authors":"Po-Jen Chuang, Yu-Shian Chiu","doi":"10.1109/SITIS.2007.133","DOIUrl":"https://doi.org/10.1109/SITIS.2007.133","url":null,"abstract":"Cache invalidation is an effective approach to maintaining data consistency between the server and mobile clients in a mobile environment. This paper presents two new cache invalidation schemes which are designed according to the real situations and are therefore able to comply with the more practical needs in a mobile environment. The ABI+HCQU divides data into different groups based on their utilization rates (hot/cold/query/update) and adapts their broadcasting intervals (ABI) accordingly to suit the actual needs. The SWRCC + MUVI (sleep/wakeup/recovery/check/confirm+modified/uncertain/ valid/ invalid) aims to solve the validity problem of cached data after a client is disconnected from the server. The new cache invalidation schemes are shown through experimental evaluation to outperform most existing schemes in terms of data access time, cache miss rates and bandwidth consumption.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132169162","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}
引用次数: 12
Segmentation of Offline Palmprint 离线掌纹分割
Yan Zheng, Yuanfang Liu, Guangshun Shi, Jiyi Li, Qingren Wang
{"title":"Segmentation of Offline Palmprint","authors":"Yan Zheng, Yuanfang Liu, Guangshun Shi, Jiyi Li, Qingren Wang","doi":"10.1109/SITIS.2007.134","DOIUrl":"https://doi.org/10.1109/SITIS.2007.134","url":null,"abstract":"In this paper, an offline palmprint image is divided into four components: blank regions, knuckle-finger regions, high quality palm regions and unrecoverable low quality palm regions. The high quality palm regions are the ROI of offline palmprint images and the other three regions constitute background regions. A block-based segmentation algorithm is proposed to identify the high quality palm regions from background regions. In experiment section, the segmentation algorithm is tested from three aspects: by human inspection, by comparing the segmentation results with an official pattern and by observing the change of accuracy rate of minutiae after masking the unrecoverable low quality palm regions. Our palmprint database for testing contains 200 image samples and each image comprises 1600 blocks. Only 2.4% of blocks are misclassified. The accuracy rate also increases significantly after masking.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127857870","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}
引用次数: 7
Blind Source Separation of Temporal Correlated Signals 时间相关信号的盲源分离
Bin Xia, Hong Xie
{"title":"Blind Source Separation of Temporal Correlated Signals","authors":"Bin Xia, Hong Xie","doi":"10.1109/SITIS.2007.125","DOIUrl":"https://doi.org/10.1109/SITIS.2007.125","url":null,"abstract":"In this paper, we present a new framework for blind source separation of temporal correlated signals. In general, temporal correlated signals are not independent which means the independence assumption for independent component analysis method is not satisfied. To achieve good separation performance, we apply high order statistics and temporal structure together to put the separation processing in residual level. The residual signals, which is residual part of source signals by extracted temporal structure, are independent. We discuss two types of BSS problem: instantaneous BSS and convolutive BSS. The cost function is derived by simplifying the mutual information of residual signals for both cases. And then we develop efficient learning algorithms respectively. Computer simulations are given to show the separation performance of the proposed algorithm and some comparisons with other algorithms are also provided.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127062149","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
A New Fuzzy Supervised Classification Method Based on Aggregation Operator 一种基于聚合算子的模糊监督分类新方法
S. Meher
{"title":"A New Fuzzy Supervised Classification Method Based on Aggregation Operator","authors":"S. Meher","doi":"10.1109/SITIS.2007.74","DOIUrl":"https://doi.org/10.1109/SITIS.2007.74","url":null,"abstract":"A new fuzzy supervised classification method based on aggregation operator is proposed in the present article. The proposed classifier aggregates the information extracted by exploring feature-wise degree of belonging to classes. I uses a pi-type membership function and MEAN (average) aggregation reasoning rule (operator). The effectiveness of the proposed classifier is verified with four benchmark data sets including a realtime financial domain data. Various performance measures are used for quantitative evaluation of the classifier. Experimental results on these data sets illustrate significant improvement in the classification performance of the proposed method compared to three other fuzzy classifiers, namely, explicit fuzzy, fuzzy k-nearest neighbor and fuzzy maximum likelihood.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123224346","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}
引用次数: 6
FRFT Based Transmultiplexers 基于FRFT的复用器
G. Aggrey, R. Tao
{"title":"FRFT Based Transmultiplexers","authors":"G. Aggrey, R. Tao","doi":"10.1109/SITIS.2007.103","DOIUrl":"https://doi.org/10.1109/SITIS.2007.103","url":null,"abstract":"Transmultiplexers, the basis of which is filter banks, have been successfully utilized for multiuser communications. One important limitation however, is the leakage of signal from one channel to another known as crosstalk. This occurs because the core elements, synthesis and analysis filters employed are nonideal. To minimize its effect has been the focus of transmultiplexer design. This study therefore investigates a new approach to transmultiplexer design using the FRFT based filter banks in the processing of nonstationary signals. This method can enhance the elimination of the crosstalk and amplitude distortion.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127098289","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学术官方微信