Pub Date : 2011-10-13DOI: 10.1109/TSP.2011.6043657
B. Belean, M. Borda, B. Gal, R. Malutan
Automation, computational time and cost are open subjects in microarray image processing. The present paper proposes image processing techniques together with their implementations in order to eliminate the shortcomings of the existing software platforms for microarray image processing: user intervention, increased computational time and cost. Thus, for each step of microarray image processing, application-specific hardware architectures are designed aiming algorithms parallelization for fast processing. Computational time is estimated and compared with state of the art approaches. The proposed hardware architectures integrated inside microarray scanners deliver microarray image characteristics in an automated manner, excluding the need of an additional software platform. The FPGA technology was chosen for implementation, due to its parallel computation capabilities and ease of reconfiguration.
{"title":"FPGA technology and parallel computing towards automatic microarray image processing","authors":"B. Belean, M. Borda, B. Gal, R. Malutan","doi":"10.1109/TSP.2011.6043657","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043657","url":null,"abstract":"Automation, computational time and cost are open subjects in microarray image processing. The present paper proposes image processing techniques together with their implementations in order to eliminate the shortcomings of the existing software platforms for microarray image processing: user intervention, increased computational time and cost. Thus, for each step of microarray image processing, application-specific hardware architectures are designed aiming algorithms parallelization for fast processing. Computational time is estimated and compared with state of the art approaches. The proposed hardware architectures integrated inside microarray scanners deliver microarray image characteristics in an automated manner, excluding the need of an additional software platform. The FPGA technology was chosen for implementation, due to its parallel computation capabilities and ease of reconfiguration.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116666197","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043675
C. Damian, E. Lunca
This paper proposes a high speed and low area architecture for the implementation of a FIR (Finite Impulse Response) filter into a Field Programmable Gate Array (FPGA) device. The new FIR filter type is implemented with no multiplication block, using only adders and shifting registers. This is possible because a coefficient approximation is performed, using an algorithm that computes the coefficients like a sum-of-power-of-two terms.
{"title":"A low area FIR filter for FPGA implementation","authors":"C. Damian, E. Lunca","doi":"10.1109/TSP.2011.6043675","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043675","url":null,"abstract":"This paper proposes a high speed and low area architecture for the implementation of a FIR (Finite Impulse Response) filter into a Field Programmable Gate Array (FPGA) device. The new FIR filter type is implemented with no multiplication block, using only adders and shifting registers. This is possible because a coefficient approximation is performed, using an algorithm that computes the coefficients like a sum-of-power-of-two terms.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125144853","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043701
O. Aydemir, Mehmet Öztürk, T. Kayikçioglu
There are lots of classification and feature extraction algorithms in the field of brain computer interface. It is significant to use optimal classification algorithm and fewer features to implement a fast and accurate brain computer interface system. In this paper, we evaluate the performances of five classical classifiers in different aspects including classification accuracy, sensitivity, specificity, Kappa and computational time in low-dimensional feature vectors extracted from EEG signals. The experiments show that naive Bayes is the most appropriate classifier for low dimensional feature vectors compared to k-nearest neighbor, support vector machine, linear discriminant analysis and decision tree classifiers.
{"title":"Performance evaluation of five classification algorithms in low-dimensional feature vectors extracted from EEG signals","authors":"O. Aydemir, Mehmet Öztürk, T. Kayikçioglu","doi":"10.1109/TSP.2011.6043701","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043701","url":null,"abstract":"There are lots of classification and feature extraction algorithms in the field of brain computer interface. It is significant to use optimal classification algorithm and fewer features to implement a fast and accurate brain computer interface system. In this paper, we evaluate the performances of five classical classifiers in different aspects including classification accuracy, sensitivity, specificity, Kappa and computational time in low-dimensional feature vectors extracted from EEG signals. The experiments show that naive Bayes is the most appropriate classifier for low dimensional feature vectors compared to k-nearest neighbor, support vector machine, linear discriminant analysis and decision tree classifiers.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"29 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125865364","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043717
J. Petrzela
This paper briefly shows the influence of handmade picewise-linear approximation on the global dynamics on the selected third-order systems with the quadratic vector fields. These effects are demonstrated using concept of the Ljapunov exponents calculation. The approximated systems are verified by means of the real electronic circuits derived using integrator synthesis and time-domain analysis in Oread Pspice simulator. The universality of the proposed method is discussed and future perspectives are provided.
{"title":"On the piecewise-linear approximation of the polynomial chaotic dynamics","authors":"J. Petrzela","doi":"10.1109/TSP.2011.6043717","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043717","url":null,"abstract":"This paper briefly shows the influence of handmade picewise-linear approximation on the global dynamics on the selected third-order systems with the quadratic vector fields. These effects are demonstrated using concept of the Ljapunov exponents calculation. The approximated systems are verified by means of the real electronic circuits derived using integrator synthesis and time-domain analysis in Oread Pspice simulator. The universality of the proposed method is discussed and future perspectives are provided.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129878688","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043759
A. Yazgan, I. Cavdar
In this research, the effect of laser phase noise fixing is investigated for different optical channel parameters such as dispersion, attenuation and link distance for Coherent Optical Orthogonal Frequency Division Multiplexing (CO-OFDM) systems. The effect of laser phase noise is examined at different data rates and link distances utilizing only one RF and optical carrier. In this research Phase Shift Keying (PSK) is used as a digital modulation format to maintain the maximum data rate with the acceptable BER value. By fixing the laser phase noise 1.7 Tb/s (111∗16 Gb/s) can be obtained from 191.4 to 185.9 THz at 50 GHz spacing over 1000 km link distance using only one optical cable in C and L bands according to the Telecommunication Standardization Sector (ITU-T). In that case high level modulation formats (N-PSK) should be performed with DWDM technique.
{"title":"Examination of the effect of fixing laser phase noise in Coherent Optical OFDM systems with different channel parameters","authors":"A. Yazgan, I. Cavdar","doi":"10.1109/TSP.2011.6043759","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043759","url":null,"abstract":"In this research, the effect of laser phase noise fixing is investigated for different optical channel parameters such as dispersion, attenuation and link distance for Coherent Optical Orthogonal Frequency Division Multiplexing (CO-OFDM) systems. The effect of laser phase noise is examined at different data rates and link distances utilizing only one RF and optical carrier. In this research Phase Shift Keying (PSK) is used as a digital modulation format to maintain the maximum data rate with the acceptable BER value. By fixing the laser phase noise 1.7 Tb/s (111∗16 Gb/s) can be obtained from 191.4 to 185.9 THz at 50 GHz spacing over 1000 km link distance using only one optical cable in C and L bands according to the Telecommunication Standardization Sector (ITU-T). In that case high level modulation formats (N-PSK) should be performed with DWDM technique.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014718","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043695
Zdeněk Průša, P. Rajmic
This paper presents a novel algorithm for segmented (segmentwise) computation of forward and inverse wavelet transform via a lifting scheme, applicable to any type of a lifting scheme representation of wavelets. The main idea is to process segments taken from a long one-dimensional signal so that after reconstruction, no border distortion between segments occurs. This is achieved by means of sophisticated segment overlapping. In this work, arbitrary and possibly varying segment lengths are considered. The derivation of formulas for overlap enumeration is the main concern of this work. The algorithm produces sets of coefficients for each segment. These sets from each segment ordered correctly are exactly the same coefficients the whole signal discrete wavelet transform results in. Similarly, the whole signal inverse discrete wavelet transform is equal to applying the algorithm to sets of coefficients and overlapping the results accordingly. The algorithm makes it possible to process signals in realtime, allows coarse parallelization since the computation on the particular segments is independent and also allows computation of wavelet transform on devices with a limited amount of memory.
{"title":"Segmented computation of wavelet transform via lifting scheme","authors":"Zdeněk Průša, P. Rajmic","doi":"10.1109/TSP.2011.6043695","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043695","url":null,"abstract":"This paper presents a novel algorithm for segmented (segmentwise) computation of forward and inverse wavelet transform via a lifting scheme, applicable to any type of a lifting scheme representation of wavelets. The main idea is to process segments taken from a long one-dimensional signal so that after reconstruction, no border distortion between segments occurs. This is achieved by means of sophisticated segment overlapping. In this work, arbitrary and possibly varying segment lengths are considered. The derivation of formulas for overlap enumeration is the main concern of this work. The algorithm produces sets of coefficients for each segment. These sets from each segment ordered correctly are exactly the same coefficients the whole signal discrete wavelet transform results in. Similarly, the whole signal inverse discrete wavelet transform is equal to applying the algorithm to sets of coefficients and overlapping the results accordingly. The algorithm makes it possible to process signals in realtime, allows coarse parallelization since the computation on the particular segments is independent and also allows computation of wavelet transform on devices with a limited amount of memory.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674045","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043699
Radim Burget, P. Cika, M. Zukal, J. Masek
This paper deals with localization of Temporomandibular Joint Disc (TJD) in Magnetic Resonance Images (MRI). Since the contrast of the TJD is quite low when compared to noise ratio when displayed using MRI, its detection is quite complicated. Therefore the method described in this paper are not not focused the disk itself but detect the most significant objects around TJD, which has usually much higher contrast. For the automatic TJD localization asessment, a training set containing 160 training samples (80 positive and 80 negative) were created and published and several approaches were examined to find the best method. The best results were achieved using support vector machine with Gaussian kernel, which achieved 98.16±2.81% accuracy of detection. The creation of the training models for feature extraction and model evaluation was implemented with RapidMiner tool and the IMMI extension. The models created are published at the IMMI extension homepage and they can also serve as a guide to use of the IMMI extension.
{"title":"Automated localization of Temporomandibular Joint Disc in MRI images","authors":"Radim Burget, P. Cika, M. Zukal, J. Masek","doi":"10.1109/TSP.2011.6043699","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043699","url":null,"abstract":"This paper deals with localization of Temporomandibular Joint Disc (TJD) in Magnetic Resonance Images (MRI). Since the contrast of the TJD is quite low when compared to noise ratio when displayed using MRI, its detection is quite complicated. Therefore the method described in this paper are not not focused the disk itself but detect the most significant objects around TJD, which has usually much higher contrast. For the automatic TJD localization asessment, a training set containing 160 training samples (80 positive and 80 negative) were created and published and several approaches were examined to find the best method. The best results were achieved using support vector machine with Gaussian kernel, which achieved 98.16±2.81% accuracy of detection. The creation of the training models for feature extraction and model evaluation was implemented with RapidMiner tool and the IMMI extension. The models created are published at the IMMI extension homepage and they can also serve as a guide to use of the IMMI extension.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129373311","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043722
T. Urbanec, Radek Dvorak
The standard ground penetrating radar (GPR) realized with pulsing technology has its limitations and alternatives exist. Using vector network analyzer (VNA) with time domain transformation is possible, but cost of such implementation is prohibitive. The sixport measurement system can be used as alternative to standard VNA. The comparison of the test cases measured by VNA and sixport are in the paper. The resolution is the same and the dynamic range even greater with the use of sixport system.
{"title":"Vector network analyzer versus sixport comparison for ground penetrating radar","authors":"T. Urbanec, Radek Dvorak","doi":"10.1109/TSP.2011.6043722","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043722","url":null,"abstract":"The standard ground penetrating radar (GPR) realized with pulsing technology has its limitations and alternatives exist. Using vector network analyzer (VNA) with time domain transformation is possible, but cost of such implementation is prohibitive. The sixport measurement system can be used as alternative to standard VNA. The comparison of the test cases measured by VNA and sixport are in the paper. The resolution is the same and the dynamic range even greater with the use of sixport system.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133314639","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043788
Pavel Vajsar, Lukás Rucka
Wireless sensor networks (WSN) can be used in many deployed and in many areas. For the wireless sensor network monitoring is important a tool, which is able to provide information about the network and which is able to collect and represent required data from the network. This paper describes the solution called WSN Monitor, which is able to monitor wireless sensor network. The solution is divided into the several parts such as the database storage for collect a data from a wireless sensor network, client and server side applications, Fig. 1. This paper describes the solution requirements, architecture and used technology for develop the solution. The solution was tested for real time monitoring RSS (Received Signal Strength) value in the real wireless sensor network. The second part of this paper brings describe the measurement method, input problems, the results and the evaluation of the measurement values.
无线传感器网络(WSN)可用于许多部署和许多领域。对于无线传感器网络来说，监控是一种重要的工具，它能够提供有关网络的信息，并能够从网络中收集和表示所需的数据。本文介绍了一种能够对无线传感器网络进行监控的WSN Monitor解决方案。该解决方案分为几个部分，如用于从无线传感器网络收集数据的数据库存储、客户端和服务器端应用程序，如图1所示。本文描述了解决方案的需求、体系结构和开发解决方案所使用的技术。在实际无线传感器网络中对该方案进行了实时监测RSS (Received Signal Strength，接收信号强度)值的测试。第二部分介绍了测量方法、输入问题、测量结果和测量值的评价。
{"title":"Monitoring and management system for wireless sensor networks","authors":"Pavel Vajsar, Lukás Rucka","doi":"10.1109/TSP.2011.6043788","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043788","url":null,"abstract":"Wireless sensor networks (WSN) can be used in many deployed and in many areas. For the wireless sensor network monitoring is important a tool, which is able to provide information about the network and which is able to collect and represent required data from the network. This paper describes the solution called WSN Monitor, which is able to monitor wireless sensor network. The solution is divided into the several parts such as the database storage for collect a data from a wireless sensor network, client and server side applications, Fig. 1. This paper describes the solution requirements, architecture and used technology for develop the solution. The solution was tested for real time monitoring RSS (Received Signal Strength) value in the real wireless sensor network. The second part of this paper brings describe the measurement method, input problems, the results and the evaluation of the measurement values.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132439293","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043660
K. Horak
This paper deals with segmentation methods and fatigue features determination for a camera-based visual systems monitoring driver vigilance. Generally visual monitoring systems have to analyse a set of computed fatigue features and recognize driver inattention or sleepiness. The paper is focused mostly on the segmentation methods used for reliable eyes tracking because of eyes features are certainly the most significant features for determining of a driver fatigue. Fundamentals segmentation methods as a simple colour segmentation and Hough transform are introduced in the paper. After that a more complex Haar-like features approach and symmetries detection approach are shortly introduced. Finally, several of the leading fatigue features are listed and described. All the presented segmentation methods were tested on both laboratory and real images.
{"title":"Fatigue features based on eye tracking for driver inattention system","authors":"K. Horak","doi":"10.1109/TSP.2011.6043660","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043660","url":null,"abstract":"This paper deals with segmentation methods and fatigue features determination for a camera-based visual systems monitoring driver vigilance. Generally visual monitoring systems have to analyse a set of computed fatigue features and recognize driver inattention or sleepiness. The paper is focused mostly on the segmentation methods used for reliable eyes tracking because of eyes features are certainly the most significant features for determining of a driver fatigue. Fundamentals segmentation methods as a simple colour segmentation and Hough transform are introduced in the paper. After that a more complex Haar-like features approach and symmetries detection approach are shortly introduced. Finally, several of the leading fatigue features are listed and described. All the presented segmentation methods were tested on both laboratory and real images.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132737794","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
扫码关注我们
求助内容：
应助结果提醒方式：