The 10th IEEE International Symposium on Signal Processing and Information Technology最新文献

筛选
英文 中文
Medical image storage system for content-based retrieval 基于内容检索的医学图像存储系统
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711750
S. O. Igwe, Adel Said Elmaghraby
{"title":"Medical image storage system for content-based retrieval","authors":"S. O. Igwe, Adel Said Elmaghraby","doi":"10.1109/ISSPIT.2010.5711750","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711750","url":null,"abstract":"Large image databases have been designed and used in various applications and in content-based retrieval systems. Medical Imaging modalities have been developed in the past each uniquely designed to specific imaging modality based on the image pathobiological medium. This paper presents an approach to improve the process of image storage and retrieval based on image data representation model that integrates both metadata and content description. The low level features and the labels associated with the salient objects extracted from the mages are stored in an ORDBMS (Object Relational Database Management systems) using Oracle. Our technique, which combines the image descriptors obtained by a unified approach phases of image segmentation and annotation, has a good time complexity and the experimental results on several image datasets.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079028","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 novel 3D segmentation approach for segmenting the prostate from dynamic contrast enhanced MRI using current appearance and learned shape prior 一种新的三维分割方法,用于从动态对比增强MRI中分割前列腺,使用当前外观和学习形状先验
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711751
A. Firjani, A. Elnakib, F. Khalifa, A. El-Baz, G. Gimel'farb, M. El-Ghar, Adel Said Elmaghraby
{"title":"A novel 3D segmentation approach for segmenting the prostate from dynamic contrast enhanced MRI using current appearance and learned shape prior","authors":"A. Firjani, A. Elnakib, F. Khalifa, A. El-Baz, G. Gimel'farb, M. El-Ghar, Adel Said Elmaghraby","doi":"10.1109/ISSPIT.2010.5711751","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711751","url":null,"abstract":"Prostate segmentation is an essential step in developing any non-invasive Computer-Assisted Diagnostic (CAD) system for the early diagnosis of prostate cancer using Magnetic Resonance Images (MRI). In this paper, we propose, a novel framework for 3D segmentation of the prostate region from Dynamic Contrast Enhancement Magnetic Resonance Images (DCE-MRI). The framework is based on a maximum aposteriori (MAP) estimate of a new log-likelihood function that consists of three descriptors: (i) 1st-order visual appearance descriptors of the DCE-MRI, (ii) a 3D spatially invariant 2nd-order homogeneity descriptor, and (iii) a 3D prostate shape descriptor. The shape prior is learned from the co-aligned 3D segmented prostate DCE-MRI data. The visual appearances of the object and its background are described with marginal gray-level distributions obtained by separating their mixture over prostate volume. The spatial interactions between the prostate voxels are modeled by a 3D 2nd-order rotation-variant Markov-Gibbs random field (MGRF) of object/background labels with analytically estimated potentials. Experiments with real in vivo prostate DCE-MRI confirm the robustness and accuracy of the proposed approach.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414364","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}
引用次数: 15
Digital security algorithm for GSM incorporated virtual e-banking protocol using watermarking technique 采用水印技术的GSM虚拟电子银行协议的数字安全算法
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711747
S. Alam, Md. Nazmus Sakib, A. Sazzad, C. Shahnaz, S. Fattah
{"title":"Digital security algorithm for GSM incorporated virtual e-banking protocol using watermarking technique","authors":"S. Alam, Md. Nazmus Sakib, A. Sazzad, C. Shahnaz, S. Fattah","doi":"10.1109/ISSPIT.2010.5711747","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711747","url":null,"abstract":"Cashless electronic transaction is getting immense popularity nowadays due to its procedural and bureaucratic simplicity. Almost each and every organization and financial institutes prefers electronic transaction in lieu of pen-paper based banking approach, which depends on high speed internet technology. However, this online monetary transaction is a long cherished blessing for the developed countries. In developing and underdeveloped countries, SMS banking gets rapid popularity over the internet banking via mobile phone, since internet based m-banking suffers from several limitations of internet connectivity, such as inaccessibility, slow speed, intermittent disruptions, and need for costly handset. In this paper, we propose a scheme where even without having an internet connection within the mobile handset, a client can virtually get the advantage of high speed internet banking via a GSM incorporated SMS transaction. Moreover, security over internet is a burning issue irrespective of the type of transaction, especially when the internet based transactions are operated at the user end. In the proposed scheme, we also offer a newly dimensioned security protocol using digital watermarking technique.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128436238","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
Analyses on kernel-specific generalization ability for kernel regressors with training samples 基于训练样本的核回归器特定核泛化能力分析
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711725
A. Tanaka, M. Miyakoshi
{"title":"Analyses on kernel-specific generalization ability for kernel regressors with training samples","authors":"A. Tanaka, M. Miyakoshi","doi":"10.1109/ISSPIT.2010.5711725","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711725","url":null,"abstract":"Theoretical analyses on generalization error of a model space for kernel regressors with respect to training samples are given in this paper. In general, the distance between an unknown true function and a model space tends to be small with a larger set of training samples. However, it is not clarified that a larger set of training samples achieves a smaller difference at each point of the unknown true function and the orthogonal projection of it onto the model space, compared with a smaller set of training samples. In this paper, we show that the upper bound of the squared difference at each point of these two functions with a larger set of training samples is not larger than that with a smaller set of training samples. We also give some numerical examples to confirm our theoretical result.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131731346","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
Disparity map using suboptimal cost with dynamic programming 使用次优代价的视差映射与动态规划
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711778
Eman F. Sawires, A. Hamdy, F. Amer, E. M. Bakr
{"title":"Disparity map using suboptimal cost with dynamic programming","authors":"Eman F. Sawires, A. Hamdy, F. Amer, E. M. Bakr","doi":"10.1109/ISSPIT.2010.5711778","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711778","url":null,"abstract":"1D optimization methods based on dynamic programming (DP) stereo are of practical interest because it can reconstruct an observed 3D optical surface very quickly and thus has potential for real-time applications. While being efficient, its performance is far from the state of the art because the vertical consistency between the scanlines is not enforced. 1D optimization based on dynamic programming for stereo correspondence is re-examined by applying it to the vertical consistency between the scanlines as opposed to the individual scanlines. To do this, a pixel is allowed to have a disparity with possibly sub-optimal cost for it in two directions. Thus, the proposed algorithm is a truly global optimization method because disparity estimate at one pixel depends on the disparity estimates at all the other pixels, unlike the scanline based methods. Proposed algorithm is evaluated on the benchmark Middlebury database. The algorithm is very simple, so the proposed algorithm should be a good candidate for real time implementation. The results are considerably better than that of the scanline based methods. While the results are not the state of the art, the proposed algorithm offers a good trade off in terms of accuracy and computational efficiency.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114583677","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}
引用次数: 5
MRI cases containing cerebral tumors retrieval using Bayesian networks 用贝叶斯网络检索含有脑肿瘤的MRI病例
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711742
Hedi Yazid, Karim Kalti, F. Elouni, N. Amara, K. Tlili
{"title":"MRI cases containing cerebral tumors retrieval using Bayesian networks","authors":"Hedi Yazid, Karim Kalti, F. Elouni, N. Amara, K. Tlili","doi":"10.1109/ISSPIT.2010.5711742","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711742","url":null,"abstract":"We propose in this paper a Bayesian model for the retrieving of MRI (magnetic resonance imaging) exams that contain cerebral tumors. Bayesian network proved its efficiency and reliability in several AI (Artificial Intelligence) problems and especially in aid-decision applications. To diagnose a cerebral tumor in a MRI exam, we need to interpret diverse sequences and to refer to visual descriptors and, also, to the patient's clinical information's (age, sex, other diseases …etc.). Our main idea is argued by the probabilistic aspect chosen in the decision making of diagnosis process. This aspect will be translated as a probabilistic decision model. Our work is tested in a several medical cases that were collected from Sahloul Hospital. Performance indices of experiments are promising.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127111750","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
The case for service provider anonymity 服务提供商匿名的案例
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711743
M. Hussain, D. Skillicorn
{"title":"The case for service provider anonymity","authors":"M. Hussain, D. Skillicorn","doi":"10.1109/ISSPIT.2010.5711743","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711743","url":null,"abstract":"While the majority of the research on anonymity is focused on individuals, there is an increasing number of scenarios that demand anonymity for service providers as well.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"102 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123741724","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
The pressure altitude computation using artificial neural network for Air Data Computer 大气数据计算机用人工神经网络计算气压高度
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711745
I. Turkmen, Yasin Korkmaz
{"title":"The pressure altitude computation using artificial neural network for Air Data Computer","authors":"I. Turkmen, Yasin Korkmaz","doi":"10.1109/ISSPIT.2010.5711745","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711745","url":null,"abstract":"Air Data Computer (ADC) calculates the key data necessary for performing a safe flight and accurate air navigation. Altitude information is one of the important parameter computed by the ADC. Accuracy of the altitude corrected using tables or charts showing the actual corrections in altitude information special to aircraft type. This correction is important in any high performance and jet aircraft. In order to correct these imperfections, certain calibrations need to be made within the ADC. In this paper, artificial neural networks (ANNs) are used to calculate altitude information more easily and accurately using data obtained from tables formed under standard atmosphere conditions.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116388635","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
High performance wideband CMOS current conveyor for low voltage low power applications 高性能宽带CMOS电流输送器,适用于低电压低功耗应用
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711767
Ahmed H. M. Abolila, H. Hamed, E. Hasaneen
{"title":"High performance wideband CMOS current conveyor for low voltage low power applications","authors":"Ahmed H. M. Abolila, H. Hamed, E. Hasaneen","doi":"10.1109/ISSPIT.2010.5711767","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711767","url":null,"abstract":"New low voltage low power CMOS current conveyor (CCII) is presented. The proposed CCII is based on rail-to-rail class AB folded cascode operational amplifier. The new CCII provides very low input impedance at X-port, very high input impedance at Y-port, accurate voltage and current tracking with low offset, and very wide bandwidth. As an application, an oscillator has been built based on the proposed CCII. The performance of the proposed CCII has been confirmed by PSPICE simulation program using TSMC MOSIS 0.18 µm CMOS technology. The presented CCII is supplied at ± 0.75 V.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124341134","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}
引用次数: 15
Hierarchical clustering of 3-D line segments for building detection 用于建筑物检测的三维线段分层聚类
The 10th IEEE International Symposium on Signal Processing and Information Technology Pub Date : 2010-12-15 DOI: 10.1109/ISSPIT.2010.5711732
Dong-Chul Park
{"title":"Hierarchical clustering of 3-D line segments for building detection","authors":"Dong-Chul Park","doi":"10.1109/ISSPIT.2010.5711732","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711732","url":null,"abstract":"A novel approach for an efficient extraction of rectangular boundaries from aerial image data is proposed in this paper. In this approach, a Centroid Neural Network (CNN) with a metric of line segments is utilized for connecting low-level linear structures or grouping similar objects. The proposed an approach, called hierarchical clustering method, utilizes the fact that rooftops of a building are about the same height and perform clustering process with candidate 3-D line segments with similar heights. Experiments are performed with a set of high resolution satellite image data. The results show that the proposed hierarchical clustering method can remove noisy segments such as shade lines efficiently and find more accurate rectangular boundaries.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"507 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123565798","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
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学术官方微信
小红书