Pub Date : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577100
O. Hagsand, M. Hidell, Peter Sjödin
The requirements on IP routers are increasing for every new generation of designs. The driving forces are growing traffic volumes and demands for new services. We argue that a decentralized modular system design would improve the scalability, flexibility, and reliability of future routers. We have designed and implemented such a distributed router, based on physical separation between different functional modules for control and forwarding plane operations. This paper presents the design and implementation, focusing on the internal communication protocols and implementation aspects of the control plane
{"title":"Design and implementation of a distributed router","authors":"O. Hagsand, M. Hidell, Peter Sjödin","doi":"10.1109/ISSPIT.2005.1577100","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577100","url":null,"abstract":"The requirements on IP routers are increasing for every new generation of designs. The driving forces are growing traffic volumes and demands for new services. We argue that a decentralized modular system design would improve the scalability, flexibility, and reliability of future routers. We have designed and implemented such a distributed router, based on physical separation between different functional modules for control and forwarding plane operations. This paper presents the design and implementation, focusing on the internal communication protocols and implementation aspects of the control plane","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130965697","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577181
M. Fahmy, Y. Hasan
In this paper, an algorithm is developed to construct a set of M orthogonal basis along which signals, whether noisy or noise-free, can be decomposed. Combining a modified Prony signal approximation and Gram-Schmidt orthogonalization schemes (to obtain the orthogonal bases), the proposed method represents the processed signal as the sum of M damped exponentials. It is shown that the employed bases are closely related to the roots of an Mth order forward linear prediction polynomial, satisfying the system. In addition, an optimization procedure is described to optimally adjust these bases to accurately represent the signal under consideration. The proposed procedure finds applications in signal compression and signal de-noising, where it is only necessary to specify the orthogonal basis, as well as the decomposition weights rather than sending the complete signal batch. Illustrative examples are given
{"title":"Novel scheme for compact orthogonal modified-Prony representation of signals","authors":"M. Fahmy, Y. Hasan","doi":"10.1109/ISSPIT.2005.1577181","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577181","url":null,"abstract":"In this paper, an algorithm is developed to construct a set of M orthogonal basis along which signals, whether noisy or noise-free, can be decomposed. Combining a modified Prony signal approximation and Gram-Schmidt orthogonalization schemes (to obtain the orthogonal bases), the proposed method represents the processed signal as the sum of M damped exponentials. It is shown that the employed bases are closely related to the roots of an Mth order forward linear prediction polynomial, satisfying the system. In addition, an optimization procedure is described to optimally adjust these bases to accurately represent the signal under consideration. The proposed procedure finds applications in signal compression and signal de-noising, where it is only necessary to specify the orthogonal basis, as well as the decomposition weights rather than sending the complete signal batch. Illustrative examples are given","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862806","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577079
S. Mohammad Razavizadeh, V. Tabataba Vakili, P. Azmi, M. Fardis
In this paper, we introduce a new transmission scheme for downlink of multiple antenna code division multiple access (CDMA) systems. In the proposed scheme, the Alamouti's space-time block coding (STBC) method is extended to multiuser systems. Moreover, to mitigate multiple access interference in the conventional receivers, the linear transmit preceding technique is used in the transmitter. We show that using STBC codes in conjunction with transmit preceding in CDMA systems can significantly increase the capacity of these systems. In this method, the mobile terminals are simple and they do not need any information about other users' spreading sequences. Our computer simulations show that the proposed method has the same performance as the methods based on the combination of receive diversity and multiuser detection in the uplink of CDMA systems
{"title":"On space-time block coding in downlink of multiuser CDMA systems","authors":"S. Mohammad Razavizadeh, V. Tabataba Vakili, P. Azmi, M. Fardis","doi":"10.1109/ISSPIT.2005.1577079","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577079","url":null,"abstract":"In this paper, we introduce a new transmission scheme for downlink of multiple antenna code division multiple access (CDMA) systems. In the proposed scheme, the Alamouti's space-time block coding (STBC) method is extended to multiuser systems. Moreover, to mitigate multiple access interference in the conventional receivers, the linear transmit preceding technique is used in the transmitter. We show that using STBC codes in conjunction with transmit preceding in CDMA systems can significantly increase the capacity of these systems. In this method, the mobile terminals are simple and they do not need any information about other users' spreading sequences. Our computer simulations show that the proposed method has the same performance as the methods based on the combination of receive diversity and multiuser detection in the uplink of CDMA systems","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585485","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577214
H. Pirsiavash, S. Kasaei, F. Marvasti
The performance of most image denoising systems depends on some parameters which should be set carefully based on noise distribution and its variance. As in some applications noise characteristics are unknown, in this research, a criterion which its minimization leads to the best parameter set up is introduced. The proposed criterion is evaluated for the wavelet shrinkage image denoising algorithm using the cross validation procedure. The criterion is tested for some different values of thresholds, and the output leading to the minimum criterion value is selected as the final denoised output. The resulting outputs of our method and the previous threshold selection scheme for the wavelet shrinkage, i.e. the median absolute difference (MAD), are compared. The objective and subjective test results show the improved efficiency of the proposed denoising algorithm
{"title":"An efficient parameter selection criterion for image denoising","authors":"H. Pirsiavash, S. Kasaei, F. Marvasti","doi":"10.1109/ISSPIT.2005.1577214","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577214","url":null,"abstract":"The performance of most image denoising systems depends on some parameters which should be set carefully based on noise distribution and its variance. As in some applications noise characteristics are unknown, in this research, a criterion which its minimization leads to the best parameter set up is introduced. The proposed criterion is evaluated for the wavelet shrinkage image denoising algorithm using the cross validation procedure. The criterion is tested for some different values of thresholds, and the output leading to the minimum criterion value is selected as the final denoised output. The resulting outputs of our method and the previous threshold selection scheme for the wavelet shrinkage, i.e. the median absolute difference (MAD), are compared. The objective and subjective test results show the improved efficiency of the proposed denoising algorithm","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116160520","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577172
M. Karam
In this work, we have extended the abstract graph model which we have previously introduced (Karam, M. et al., Sept. 2001), and incorporated the extended model into a visual dataflow testing system that allows testers to import, test, and reflect, with the use of colors, the testedness/coverage of a visual dataflow program's controls. The testing environment in our system is complemented with an augmentation technique that uses visual artifacts and a coloring scheme. Results from our case studies indicates the usefulness of this technique and its practicality in terms of catching, as well as locating faults in real Prograph (shafer Dan, Oct. 1994) programs
在这项工作中，我们扩展了我们之前介绍过的抽象图形模型(Karam, M. et al.， 2001年9月)，并将扩展模型合并到一个可视化数据流测试系统中，该系统允许测试人员通过使用颜色来导入、测试和反映可视化数据流程序控制的可测试性/覆盖率。我们系统中的测试环境是通过使用视觉工件和着色方案的增强技术进行补充的。我们的案例研究结果表明，该技术在捕捉和定位实际程序中的故障方面是有用的，并且具有实用性(shafer Dan, 1994年10月)
{"title":"Using visual augmentations to test control interactions in visual dataflow languages","authors":"M. Karam","doi":"10.1109/ISSPIT.2005.1577172","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577172","url":null,"abstract":"In this work, we have extended the abstract graph model which we have previously introduced (Karam, M. et al., Sept. 2001), and incorporated the extended model into a visual dataflow testing system that allows testers to import, test, and reflect, with the use of colors, the testedness/coverage of a visual dataflow program's controls. The testing environment in our system is complemented with an augmentation technique that uses visual artifacts and a coloring scheme. Results from our case studies indicates the usefulness of this technique and its practicality in terms of catching, as well as locating faults in real Prograph (shafer Dan, Oct. 1994) programs","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125967001","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577114
S. Alirezaee, K. Faez, H. Rashidy Kanan, H. Aghaeinia
Detecting and localizing a face in a single image is the most important part of almost all face recognition systems. Face localization aims to determine the image position of a face for verification purpose of documents such as passport, driving license, ID cards, etc. In this paper an entropy-based method is proposed for detecting the high information region of the image, which may include eyes, mouth, nose, etc. The derived regions in this stage of recognition are sent to feature extraction and classification phase. The method has been tested on the ORL database. The results show the effectiveness and robustness of the proposed method for face detection and localization in presence of white additive Gaussian noise up to 25 dBw. We have achieved localization rate 99.75% for detection of faces in the ORL data set that we had which means 1 miss over 400 ORL faces
{"title":"A new entropy-based algorithm for face localization","authors":"S. Alirezaee, K. Faez, H. Rashidy Kanan, H. Aghaeinia","doi":"10.1109/ISSPIT.2005.1577114","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577114","url":null,"abstract":"Detecting and localizing a face in a single image is the most important part of almost all face recognition systems. Face localization aims to determine the image position of a face for verification purpose of documents such as passport, driving license, ID cards, etc. In this paper an entropy-based method is proposed for detecting the high information region of the image, which may include eyes, mouth, nose, etc. The derived regions in this stage of recognition are sent to feature extraction and classification phase. The method has been tested on the ORL database. The results show the effectiveness and robustness of the proposed method for face detection and localization in presence of white additive Gaussian noise up to 25 dBw. We have achieved localization rate 99.75% for detection of faces in the ORL data set that we had which means 1 miss over 400 ORL faces","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691942","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577152
Pu Wang, Jianyu Yang, Jintao Xiong
This paper presents a novel method for kernel design of a bilinear time frequency distribution (TFD) for multiple linear frequency modulated (LFM) signals with unbalanced amplitudes. The kernel is constructed from the product ambiguity function (AF), which suppresses cross terms and noise in the ambiguity domain. An algorithm is developed to determine the angles and distances of the radically distributed contents of the auto terms in the ambiguity domain. To reduce the residual signals and error propagation effect, an iterative approach is implemented. Simulation results validate the method and demonstrate cross terms and noise suppression and high resolution in the time frequency domain
{"title":"Kernel Design of bilinear TFD for multiple LFM signals with unbalanced amplitudes","authors":"Pu Wang, Jianyu Yang, Jintao Xiong","doi":"10.1109/ISSPIT.2005.1577152","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577152","url":null,"abstract":"This paper presents a novel method for kernel design of a bilinear time frequency distribution (TFD) for multiple linear frequency modulated (LFM) signals with unbalanced amplitudes. The kernel is constructed from the product ambiguity function (AF), which suppresses cross terms and noise in the ambiguity domain. An algorithm is developed to determine the angles and distances of the radically distributed contents of the auto terms in the ambiguity domain. To reduce the residual signals and error propagation effect, an iterative approach is implemented. Simulation results validate the method and demonstrate cross terms and noise suppression and high resolution in the time frequency domain","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237810","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577154
S. Furnell
Although proven security technologies are available to protect eCommerce transactions, consumers can still face significant challenges if they have low threat awareness or limited technology literacy. This paper considers such challenges, linked to the consumer's understanding and the usability of the security features placed before them. The need to ensure threat awareness is well illustrated by the problem of phishing - a threat that can specifically target eCommerce users, and which explicitly uses their lack of knowledge as a basis for exploitation. Having established a need for protection, the discussion proceeds to consider the barriers posed by security technologies themselves, identifying a range of issues that may specifically be encountered by end-users. Providing a solution to the problems is far from straightforward, but the paper proposes a number of directions in which useful contributions can be made
{"title":"Considering the security challenges in consumer-oriented eCommerce","authors":"S. Furnell","doi":"10.1109/ISSPIT.2005.1577154","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577154","url":null,"abstract":"Although proven security technologies are available to protect eCommerce transactions, consumers can still face significant challenges if they have low threat awareness or limited technology literacy. This paper considers such challenges, linked to the consumer's understanding and the usability of the security features placed before them. The need to ensure threat awareness is well illustrated by the problem of phishing - a threat that can specifically target eCommerce users, and which explicitly uses their lack of knowledge as a basis for exploitation. Having established a need for protection, the discussion proceeds to consider the barriers posed by security technologies themselves, identifying a range of issues that may specifically be encountered by end-users. Providing a solution to the problems is far from straightforward, but the paper proposes a number of directions in which useful contributions can be made","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126845362","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577104
G. Kravaritis, B. Mulgrew
This paper studies the problem of tracking multiple targets on the ground when information about the road map is available. It introduces an algorithmic structure which employs a particle filter for estimation and tracking in conjunction with a gating function and a data association scheme for measurement-to-track assignment. The proposed technique is based on the variable structure multiple model particle filter and the joint probabilistic data association algorithm
{"title":"Multitarget ground tracking with road maps and particle filters","authors":"G. Kravaritis, B. Mulgrew","doi":"10.1109/ISSPIT.2005.1577104","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577104","url":null,"abstract":"This paper studies the problem of tracking multiple targets on the ground when information about the road map is available. It introduces an algorithmic structure which employs a particle filter for estimation and tracking in conjunction with a gating function and a data association scheme for measurement-to-track assignment. The proposed technique is based on the variable structure multiple model particle filter and the joint probabilistic data association algorithm","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121603886","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577143
J. A. Onieva, J. Lopez, Jianying Zhou, R. Román
Digital rights management (DRM) is an umbrella term for any of several arrangements, which allows a vendor of content in electronic form to control the material and restrict its usage in various ways that can be specified by the vendor. These arrangements are provided through security techniques, mainly encryption, and the distribution, in a detached manner, of content and rights. This allows free access to the content by the consumers, but only those carrying the proper right object (RO) will be able to process such content. As a security service considered in different layers of the security framework defined by ITU X.805, almost all applications need to consider non-repudiation in the very beginning of their design. Unfortunately this has not been done so far in DRM specifications due to practical issues and the type of content distributed. We analyze this service for the a DRM framework and provide a solution which allows the right objects acquisition to be undeniable
{"title":"Extending an OMA-based DRM framework with non-repudiation services","authors":"J. A. Onieva, J. Lopez, Jianying Zhou, R. Román","doi":"10.1109/ISSPIT.2005.1577143","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577143","url":null,"abstract":"Digital rights management (DRM) is an umbrella term for any of several arrangements, which allows a vendor of content in electronic form to control the material and restrict its usage in various ways that can be specified by the vendor. These arrangements are provided through security techniques, mainly encryption, and the distribution, in a detached manner, of content and rights. This allows free access to the content by the consumers, but only those carrying the proper right object (RO) will be able to process such content. As a security service considered in different layers of the security framework defined by ITU X.805, almost all applications need to consider non-repudiation in the very beginning of their design. Unfortunately this has not been done so far in DRM specifications due to practical issues and the type of content distributed. We analyze this service for the a DRM framework and provide a solution which allows the right objects acquisition to be undeniable","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126046031","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
扫码关注我们
求助内容：
应助结果提醒方式：