Pub Date : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775649
M. Milanova, R. Kountchev, V. Todorov, R. Kountcheva
In the paper is presented new method for lossless compression of biomedical signals, aimed at telemedicine applications and efficient data storage with content protection. The method is based on data compression algorithm developed by the authors. The high compression ratio obtained permits efficient data transfer via communication channels and enhances the distance monitoring of patients. The presented approach is suitable for the processing of various biomedical signals. The relatively low computational complexity permits real time hardware and software applications.
{"title":"New Method for Lossless Compression of Medical Records","authors":"M. Milanova, R. Kountchev, V. Todorov, R. Kountcheva","doi":"10.1109/ISSPIT.2008.4775649","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775649","url":null,"abstract":"In the paper is presented new method for lossless compression of biomedical signals, aimed at telemedicine applications and efficient data storage with content protection. The method is based on data compression algorithm developed by the authors. The high compression ratio obtained permits efficient data transfer via communication channels and enhances the distance monitoring of patients. The presented approach is suitable for the processing of various biomedical signals. The relatively low computational complexity permits real time hardware and software applications.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130221557","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775656
S. Hamad, R. Ammar, M. E. Khalifa, T. Fergany
Distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed a multistep approach for restructuring DOO software. According to this approach, the OO system is partitioned into clusters that are then merged into larger groups forming what we call Merged Cluster Graph. The last step in this approach is concerned by mapping these merged clusters onto the target distributed architecture. Generally, the mapping problem is intractable thus allowing only for efficient heuristics. This paper presents two algorithms to solve the mapping problem using a randomized approach. The proposed algorithms has proved to be efficient, Simple and easy to understand and implement. Furthermore, the performance of the proposed algorithms was tested against some existing deterministic techniques. The experimental results showed an outstanding performance of the proposed algorithms in minimizing the overall mapping cost of the produced assignments.
{"title":"Randomized Algorithms for Mapping Clustered Object-Oriented Software onto Distributed Architectures","authors":"S. Hamad, R. Ammar, M. E. Khalifa, T. Fergany","doi":"10.1109/ISSPIT.2008.4775656","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775656","url":null,"abstract":"Distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed a multistep approach for restructuring DOO software. According to this approach, the OO system is partitioned into clusters that are then merged into larger groups forming what we call Merged Cluster Graph. The last step in this approach is concerned by mapping these merged clusters onto the target distributed architecture. Generally, the mapping problem is intractable thus allowing only for efficient heuristics. This paper presents two algorithms to solve the mapping problem using a randomized approach. The proposed algorithms has proved to be efficient, Simple and easy to understand and implement. Furthermore, the performance of the proposed algorithms was tested against some existing deterministic techniques. The experimental results showed an outstanding performance of the proposed algorithms in minimizing the overall mapping cost of the produced assignments.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130836492","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775683
A. Plaza, J. Plaza, A. Cristo
Hyperspectral image processing has been a very active area in remote sensing and other application domains in recent years. Despite the availability of a wide range of advanced processing techniques for hyperspectral data analysis, a great majority of available techniques for this purpose are based on the consideration of spectral information separately from spatial information information, and thus the two types of information are not treated simultaneously. In this paper, we describe several innovative spatial/spectral techniques for hyperspectral image processing. The techniques described in this work cover different aspects of hyperspectral image processing such as dimensionality reduction, feature extraction, and spectral unmixing. The techniques addressed in this paper are based on concepts inspired by mathematical morphology, a theory that provides a remarkable framework to achieve the desired integration of spatial and spectral information. The proposed techniques are experimentally validated using standard hyperspectral data sets with ground-truth, and compared to traditional approaches in the hyperspectral imaging literature, revealing that the integration of spatial and spectral information can significantly improve the analysis of hyperspectral scenes when conducted in simultaneous fashion.
{"title":"Morphological feature extraction and spectral unmixing of hyperspectral images","authors":"A. Plaza, J. Plaza, A. Cristo","doi":"10.1109/ISSPIT.2008.4775683","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775683","url":null,"abstract":"Hyperspectral image processing has been a very active area in remote sensing and other application domains in recent years. Despite the availability of a wide range of advanced processing techniques for hyperspectral data analysis, a great majority of available techniques for this purpose are based on the consideration of spectral information separately from spatial information information, and thus the two types of information are not treated simultaneously. In this paper, we describe several innovative spatial/spectral techniques for hyperspectral image processing. The techniques described in this work cover different aspects of hyperspectral image processing such as dimensionality reduction, feature extraction, and spectral unmixing. The techniques addressed in this paper are based on concepts inspired by mathematical morphology, a theory that provides a remarkable framework to achieve the desired integration of spatial and spectral information. The proposed techniques are experimentally validated using standard hyperspectral data sets with ground-truth, and compared to traditional approaches in the hyperspectral imaging literature, revealing that the integration of spatial and spectral information can significantly improve the analysis of hyperspectral scenes when conducted in simultaneous fashion.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398541","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775708
S. Hajipour, M. Shamsollahi, H. Mamaghanian, V. Abootalebi
The activity generated in the brain in response to external stimulations which is named the evoked potential (EP) is typically buried in the background EEG. Because of the low signal to noise ratio of EPs, it is difficult to record single trial evoked potentials. The traditional technique which is based on ensemble averaging destroys the dynamic information of single trials. In this paper, a new method has been proposed based on generalized eigen value decomposition to extract single trial EPs from single channel EEG recordings. The extraction of the N75-P100-N135 complex in simulated and actual visual evoked potentials is mainly taken under consideration. To illustrate the effectiveness of the proposed algorithm, it is compared with the iterative ICA method.
{"title":"Extracting Single Trial Visual Evoked Potentials Using Iterative Generalized Eigen Value Decomposition","authors":"S. Hajipour, M. Shamsollahi, H. Mamaghanian, V. Abootalebi","doi":"10.1109/ISSPIT.2008.4775708","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775708","url":null,"abstract":"The activity generated in the brain in response to external stimulations which is named the evoked potential (EP) is typically buried in the background EEG. Because of the low signal to noise ratio of EPs, it is difficult to record single trial evoked potentials. The traditional technique which is based on ensemble averaging destroys the dynamic information of single trials. In this paper, a new method has been proposed based on generalized eigen value decomposition to extract single trial EPs from single channel EEG recordings. The extraction of the N75-P100-N135 complex in simulated and actual visual evoked potentials is mainly taken under consideration. To illustrate the effectiveness of the proposed algorithm, it is compared with the iterative ICA method.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128809859","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775691
R. Mironov, R. Kountchev
A modified method for 2D adaptive interpolation of contour images of sign language interpreter is presented. The adaptation is based on the local information from the four neighborhood pixels of processed image and the interpolation kind is changed to zero or bi-linear one. The presented method is used in a system for transmission of contour images of sign language interpreter for deaf people training. The experimental results obtained by simulation of the developed algorithm show that the quality of interpolated images is better than that obtained with the classic low order (zero and first) 2D interpolation and the computational complexity is lower than that of the high order 2D interpolation (spline and cubic).
{"title":"Adaptive Contour Image Interpolation for Sign Language Interpretations","authors":"R. Mironov, R. Kountchev","doi":"10.1109/ISSPIT.2008.4775691","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775691","url":null,"abstract":"A modified method for 2D adaptive interpolation of contour images of sign language interpreter is presented. The adaptation is based on the local information from the four neighborhood pixels of processed image and the interpolation kind is changed to zero or bi-linear one. The presented method is used in a system for transmission of contour images of sign language interpreter for deaf people training. The experimental results obtained by simulation of the developed algorithm show that the quality of interpolated images is better than that obtained with the classic low order (zero and first) 2D interpolation and the computational complexity is lower than that of the high order 2D interpolation (spline and cubic).","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793024","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775654
J. D. de Carvalho, H. Veiga, P. Gomes, A. Reis, R. Costa
Rapidly growing communication networks and high requirement applications have led to increasing demands on bandwidth. This development has been a motivation for the study of new technologies. It is the case of e.g. WiMAX (based on IEEE 802.16) that can be used to simply and quickly extend medium and long distance backbones at very competitive prices. In the present work an initial evaluation is made of this technology for point-to-point links, using Alvarion equipments. Several results are presented and discussed at OSI levels 3 and 4.
{"title":"A Contribution to Experimental Performance Evaluation of Point-to-Point WiMAX Links","authors":"J. D. de Carvalho, H. Veiga, P. Gomes, A. Reis, R. Costa","doi":"10.1109/ISSPIT.2008.4775654","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775654","url":null,"abstract":"Rapidly growing communication networks and high requirement applications have led to increasing demands on bandwidth. This development has been a motivation for the study of new technologies. It is the case of e.g. WiMAX (based on IEEE 802.16) that can be used to simply and quickly extend medium and long distance backbones at very competitive prices. In the present work an initial evaluation is made of this technology for point-to-point links, using Alvarion equipments. Several results are presented and discussed at OSI levels 3 and 4.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117181716","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775705
F. Garcia-Ugalde, B. Psenicka
First part of this paper a very simple algorithm for the design of a second-order state-space digital filter (SDF) was developed on the condition that the sensitivity of the coefficients in the state-space digital filter (SDF) are spread uniformly to all coefficients of the SDF. In the second part, section III, was developed a matrix algorithm for designing state-space digital filters for arbitrary filter order without low coefficient sensitivity.
{"title":"On the design of state-space digital filters","authors":"F. Garcia-Ugalde, B. Psenicka","doi":"10.1109/ISSPIT.2008.4775705","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775705","url":null,"abstract":"First part of this paper a very simple algorithm for the design of a second-order state-space digital filter (SDF) was developed on the condition that the sensitivity of the coefficients in the state-space digital filter (SDF) are spread uniformly to all coefficients of the SDF. In the second part, section III, was developed a matrix algorithm for designing state-space digital filters for arbitrary filter order without low coefficient sensitivity.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127771707","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775650
V. Cherkashyn, R. Kountchev, D. He, R. Kountcheva
New adaptive method for image compression based on pyramid decomposition with neural networks with error back propagation (BPNN) is presented in this paper. The processed image is divided in blocks and then each is compressed in the space of the hidden layers of 3-layer BPNNs, which build the so-called inverse difference pyramid. The results of the new method modeling are compared with these, obtained using the image compression standards JPEG and JPEG2000.
{"title":"Adaptive Image Pyramidal Representation","authors":"V. Cherkashyn, R. Kountchev, D. He, R. Kountcheva","doi":"10.1109/ISSPIT.2008.4775650","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775650","url":null,"abstract":"New adaptive method for image compression based on pyramid decomposition with neural networks with error back propagation (BPNN) is presented in this paper. The processed image is divided in blocks and then each is compressed in the space of the hidden layers of 3-layer BPNNs, which build the so-called inverse difference pyramid. The results of the new method modeling are compared with these, obtained using the image compression standards JPEG and JPEG2000.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097710","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775715
A. Sapru, R. Lakkundi, N. Ahmed
Multimedia applications have revolutionized mobile phone usage, with emphasis on interaction between user and the phone. Camera being an integral part of new generation phones can be used to felicitate this interaction using machine vision techniques. Vision algorithms have been explored to be ported on to mobile devices, however due to real-time complexity limitation these algorithms have not been largely deployed in embedded mobile applications. In this paper we propose and implement a machine vision algorithm well suited for embedded applications. The algorithm uses a predefined angular motion of human arm for camera control purpose. The algorithm being low complex is also implemented on an OMAP 2420-H4 board, which is largely used by mobile phone manufacturers.
{"title":"Gesture Recognition by Line Fitting Over Significant Pixels","authors":"A. Sapru, R. Lakkundi, N. Ahmed","doi":"10.1109/ISSPIT.2008.4775715","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775715","url":null,"abstract":"Multimedia applications have revolutionized mobile phone usage, with emphasis on interaction between user and the phone. Camera being an integral part of new generation phones can be used to felicitate this interaction using machine vision techniques. Vision algorithms have been explored to be ported on to mobile devices, however due to real-time complexity limitation these algorithms have not been largely deployed in embedded mobile applications. In this paper we propose and implement a machine vision algorithm well suited for embedded applications. The algorithm uses a predefined angular motion of human arm for camera control purpose. The algorithm being low complex is also implemented on an OMAP 2420-H4 board, which is largely used by mobile phone manufacturers.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129661083","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 : 2008-12-01DOI: 10.1109/ISSPIT.2008.4775644
M. Dzenana, F. Orucevic
This paper proposes and discusses a GIS that integrates geographic resources with business intelligence data from SAP, TIS and other systems. Location is a unifying theme in business. Location can be an address, a service boundary, a sales territory, or a delivery route. All these things can be visualized and interactively managed and analyzed in a GIS. Spatial relationships, patterns and trends reveal invaluable business intelligence and bring easy-to-understand visualization to business applications. Use GIS to answer basic or sophisticated question on how to improve businesses workflow, management, and ROI (Return on Invest). To be able to integrate GIS system with other business systems and processes, it is necessary that spatial and non-spatial data are "no different". In presentation I will present GIS application which demonstrates concept of integrating data and systems with spatial and non spatial data. The application integrates data from different systems: traditional GIS data, TIS and SAP. Data integration enabling easier and more effective control of telecommunication networks, supervising and effect solutions of failures on element telecommunications systems, access networks and networks features, better controlling systems, witch we afford to end users. Goal is faster and more quality solutions of user's request. Present solutions in this paper based on OpenGIS standards and interfaces to geospatial information providers, Oracle Database and Application Server.
{"title":"Notice of Violation of IEEE Publication PrinciplesIntegration of Spatial Data with Business Intelligence Systems","authors":"M. Dzenana, F. Orucevic","doi":"10.1109/ISSPIT.2008.4775644","DOIUrl":"https://doi.org/10.1109/ISSPIT.2008.4775644","url":null,"abstract":"This paper proposes and discusses a GIS that integrates geographic resources with business intelligence data from SAP, TIS and other systems. Location is a unifying theme in business. Location can be an address, a service boundary, a sales territory, or a delivery route. All these things can be visualized and interactively managed and analyzed in a GIS. Spatial relationships, patterns and trends reveal invaluable business intelligence and bring easy-to-understand visualization to business applications. Use GIS to answer basic or sophisticated question on how to improve businesses workflow, management, and ROI (Return on Invest). To be able to integrate GIS system with other business systems and processes, it is necessary that spatial and non-spatial data are \"no different\". In presentation I will present GIS application which demonstrates concept of integrating data and systems with spatial and non spatial data. The application integrates data from different systems: traditional GIS data, TIS and SAP. Data integration enabling easier and more effective control of telecommunication networks, supervising and effect solutions of failures on element telecommunications systems, access networks and networks features, better controlling systems, witch we afford to end users. Goal is faster and more quality solutions of user's request. Present solutions in this paper based on OpenGIS standards and interfaces to geospatial information providers, Oracle Database and Application Server.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133202032","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
扫码关注我们
求助内容：
应助结果提醒方式：