Pub Date : 2007-11-01DOI: 10.1109/ICSPC.2007.4728250
T. Scholand, C. Spiegel, A. Burnic, A. Waadt, G. Bruck, P. Jung
In the recent years, Bluetooth has become an important short range transmission system which provides data rates up to 3 Mbit/s in its enhanced data rate mode (EDR). In this communication, the authors will illustrate low-cost intermediate frequency (IF) zero-crossing detector (ZXD) for Bluetooth EDR. The IF ZXD facilitates analog signal processing at low IF and the digitization is carried out by a simple comparator. Therefore, low-cost implementation of the receiver is readily at hand. Furthermore, it will be shown that the proposed IF ZXD for Bluetooth EDR facilitates a robust performance, approaching theoretical bounds in the case of single path transmission. The proposed design is flexible and improves earlier published receiver structures.
{"title":"Novel Intermediate Frequency Zero-Crossing Detectors for Bluetooth Enhanced Data Rate Transmission","authors":"T. Scholand, C. Spiegel, A. Burnic, A. Waadt, G. Bruck, P. Jung","doi":"10.1109/ICSPC.2007.4728250","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728250","url":null,"abstract":"In the recent years, Bluetooth has become an important short range transmission system which provides data rates up to 3 Mbit/s in its enhanced data rate mode (EDR). In this communication, the authors will illustrate low-cost intermediate frequency (IF) zero-crossing detector (ZXD) for Bluetooth EDR. The IF ZXD facilitates analog signal processing at low IF and the digitization is carried out by a simple comparator. Therefore, low-cost implementation of the receiver is readily at hand. Furthermore, it will be shown that the proposed IF ZXD for Bluetooth EDR facilitates a robust performance, approaching theoretical bounds in the case of single path transmission. The proposed design is flexible and improves earlier published receiver structures.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121950007","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728571
A. Khazâal, É. Anterrieu
Synthetic aperture imaging radiometers (SAIR) are powerful sensors for high-resolution observations of the Earth at low microwaves frequencies. Within this context, the European Space Agency is currently developing the SMOS mission devoted to the monitoring of soil moisture and ocean salinity at global scale from L-band space borne radiometric observations obtained with a two-dimensional interferometer. This contribution is concerned with the reconstruction of radiometric brightness temperature maps from interferometric measurements provided by SMOS.
{"title":"Brightness Temperature Maps Retrieval for the SMOS Space Mission: Regularized Inversion and Bias Reduction","authors":"A. Khazâal, É. Anterrieu","doi":"10.1109/ICSPC.2007.4728571","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728571","url":null,"abstract":"Synthetic aperture imaging radiometers (SAIR) are powerful sensors for high-resolution observations of the Earth at low microwaves frequencies. Within this context, the European Space Agency is currently developing the SMOS mission devoted to the monitoring of soil moisture and ocean salinity at global scale from L-band space borne radiometric observations obtained with a two-dimensional interferometer. This contribution is concerned with the reconstruction of radiometric brightness temperature maps from interferometric measurements provided by SMOS.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115841940","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728524
O. Vybornova, B. Macq
The paper describes an approach to natural language watermarking and hashing based on semantic structures. In our method we are interested in the linguistic semantic phenomenon of presupposition. Presupposition is implicit information that is taken for granted by the reader and establishes common ground between the author's and reader's situational knowledge; it is a semantic component of certain linguistic expressions (lexical items and syntactic constructions called presupposition triggers, 100 in total). The same sentence can be used with or without presupposition, provided that all the relations between discourse referents are preserved. 3 types of transformations are employed: triggers removal, triggers synonymic replacements and introducing triggers where there were none. The key is formed as a hash table containing information about the original text, the number of transformed sentences and the triggers on which the transformations were based. This method is resilient against data loss and data altering attacks.
{"title":"Text Watermarking against Ownership Rights Violation","authors":"O. Vybornova, B. Macq","doi":"10.1109/ICSPC.2007.4728524","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728524","url":null,"abstract":"The paper describes an approach to natural language watermarking and hashing based on semantic structures. In our method we are interested in the linguistic semantic phenomenon of presupposition. Presupposition is implicit information that is taken for granted by the reader and establishes common ground between the author's and reader's situational knowledge; it is a semantic component of certain linguistic expressions (lexical items and syntactic constructions called presupposition triggers, 100 in total). The same sentence can be used with or without presupposition, provided that all the relations between discourse referents are preserved. 3 types of transformations are employed: triggers removal, triggers synonymic replacements and introducing triggers where there were none. The key is formed as a hash table containing information about the original text, the number of transformed sentences and the triggers on which the transformations were based. This method is resilient against data loss and data altering attacks.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130482180","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728585
Yiqing Lin, W. Abdulla, Yide Ma
In this paper, an efficient audio watermarking detection is developed to revive a watermark attacked by hazardous synchronization attacks, such as time-scale and pitch-scale modifications (TSM and PSM). It outperforms the robustness of our previously implemented audio watermarking scheme by resisting excessive distortion of up to ±10%. The key idea of the method is adaptively aligning the frequency spectra that have been scaled by the attack, so that the synchronization positions can be retrieved for recovering the embedded watermark. Without resorting to the host audio signal, the detection procedure will automatically find a matched state and obtain the highest detection accuracy. Experimental results of robustness tests have proved that the proposed detection method can efficiently handle the severe TSM and PSM attacks and successfully extract the watermark.
{"title":"Audio Watermarking Detection Resistant to Time and Pitch Scale Modification","authors":"Yiqing Lin, W. Abdulla, Yide Ma","doi":"10.1109/ICSPC.2007.4728585","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728585","url":null,"abstract":"In this paper, an efficient audio watermarking detection is developed to revive a watermark attacked by hazardous synchronization attacks, such as time-scale and pitch-scale modifications (TSM and PSM). It outperforms the robustness of our previously implemented audio watermarking scheme by resisting excessive distortion of up to ±10%. The key idea of the method is adaptively aligning the frequency spectra that have been scaled by the attack, so that the synchronization positions can be retrieved for recovering the embedded watermark. Without resorting to the host audio signal, the detection procedure will automatically find a matched state and obtain the highest detection accuracy. Experimental results of robustness tests have proved that the proposed detection method can efficiently handle the severe TSM and PSM attacks and successfully extract the watermark.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372071","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728559
S. Mahmoudi, M. Benjelloun
In this paper we introduce a new segmentation approach used to detect the location and the orientation of the cervical vertebrae in medical x-ray images. A first pre-processing step consists on determining a global polygonal region for each vertebra. After this, we propose a new approach of vertebra localization by extracting the anterior faces of vertebra contours. This approach is based on automatic corner points of interest detection using the Harris operator. A specific goal of the proposed application is to create an efficient semi-automated method of identifying the overall angle of curvature of the spine and the angles between vertebrae.
{"title":"Corner Points Detection for Vertebral Mobility Analysis","authors":"S. Mahmoudi, M. Benjelloun","doi":"10.1109/ICSPC.2007.4728559","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728559","url":null,"abstract":"In this paper we introduce a new segmentation approach used to detect the location and the orientation of the cervical vertebrae in medical x-ray images. A first pre-processing step consists on determining a global polygonal region for each vertebra. After this, we propose a new approach of vertebra localization by extracting the anterior faces of vertebra contours. This approach is based on automatic corner points of interest detection using the Harris operator. A specific goal of the proposed application is to create an efficient semi-automated method of identifying the overall angle of curvature of the spine and the angles between vertebrae.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132441130","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728408
J. Selinummi, A. Niemistö, R. Saleem, G. W. Carter, J. Aitchison, O. Yli-Harja, I. Shmulevich, J. Boyle
Subcellular organelles are commonly analyzed using 2D fluorescent microscopy. However, 3D reconstruction and analysis of organelle topology in a high-throughput manner promises to result in a better understanding of cellular systems. We developed image analysis methods for automated quantitative analysis of peroxisome shapes. The methods employ 3D image stacks obtained by confocal microscopy. There are three fundamental phases: image preprocessing and segmentation, 3D reconstruction, and automated quantification of peroxisome topology in 3D using shape descriptors. The algorithms are shown to produce results that can be used to classify objects of different topologies, and to enable visual studies of peroxisomes in 3D.
{"title":"A Case Study on 3-D Reconstruction and Shape Description of Peroxisomes in Yeast","authors":"J. Selinummi, A. Niemistö, R. Saleem, G. W. Carter, J. Aitchison, O. Yli-Harja, I. Shmulevich, J. Boyle","doi":"10.1109/ICSPC.2007.4728408","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728408","url":null,"abstract":"Subcellular organelles are commonly analyzed using 2D fluorescent microscopy. However, 3D reconstruction and analysis of organelle topology in a high-throughput manner promises to result in a better understanding of cellular systems. We developed image analysis methods for automated quantitative analysis of peroxisome shapes. The methods employ 3D image stacks obtained by confocal microscopy. There are three fundamental phases: image preprocessing and segmentation, 3D reconstruction, and automated quantification of peroxisome topology in 3D using shape descriptors. The algorithms are shown to produce results that can be used to classify objects of different topologies, and to enable visual studies of peroxisomes in 3D.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132566936","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728399
M. Nihtila
The concept of differential flatness of continuous-time systems has its counterpart in discrete-time systems, which are most often applied in modern signal processing problems. This concept of flatness gives a way for open-loop as well as closed-loop control design for dynamic systems when the goal is to drive the system from one steady-state to another. The successive derivatives of the so-called flat output and the control of a continuous-time system are substituted by their backward shifts in discrete approach. Some flatness based properties are preliminarily studied via a linear example. Relations to dead-beat control are also pointed out.
{"title":"Discrete Signal Processing with Flat System Models","authors":"M. Nihtila","doi":"10.1109/ICSPC.2007.4728399","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728399","url":null,"abstract":"The concept of differential flatness of continuous-time systems has its counterpart in discrete-time systems, which are most often applied in modern signal processing problems. This concept of flatness gives a way for open-loop as well as closed-loop control design for dynamic systems when the goal is to drive the system from one steady-state to another. The successive derivatives of the so-called flat output and the control of a continuous-time system are substituted by their backward shifts in discrete approach. Some flatness based properties are preliminarily studied via a linear example. Relations to dead-beat control are also pointed out.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825056","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728318
A. Baganne, R. Ben-Tekaya, R. Tourki
The design of efficient router represents a key issue for the success of the network-on-chip approach. This paper presents and evaluates novel router architecture suitable for networks-on-chip (NoC) design. This router offers lowest latency (1 cycle) and allows supporting several adaptive routing algorithms. Latency reduction is obtained by using fast parallel routing (FPR) arbitration that consists in parallel processing in one stage, routing decisions and arbitration. The proposed router architecture is evaluated in 2D mesh with two adaptive routing algorithms: fully adaptive (FA) and contention look-ahead (CLA). The obtained results show that our router, combined with adaptive routing techniques is effective in terms of latency and throughput.
{"title":"Generic Low Latency Router Design for DSP Implementation on Networks-on-Chip","authors":"A. Baganne, R. Ben-Tekaya, R. Tourki","doi":"10.1109/ICSPC.2007.4728318","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728318","url":null,"abstract":"The design of efficient router represents a key issue for the success of the network-on-chip approach. This paper presents and evaluates novel router architecture suitable for networks-on-chip (NoC) design. This router offers lowest latency (1 cycle) and allows supporting several adaptive routing algorithms. Latency reduction is obtained by using fast parallel routing (FPR) arbitration that consists in parallel processing in one stage, routing decisions and arbitration. The proposed router architecture is evaluated in 2D mesh with two adaptive routing algorithms: fully adaptive (FA) and contention look-ahead (CLA). The obtained results show that our router, combined with adaptive routing techniques is effective in terms of latency and throughput.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128856012","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728278
M. Karra, M. P. Bekakos, I. Milovanovic, E. Milovanovic
Systolic arrays may prove ideal structures for the representation and the mapping of many applications concerning various numerical and non-numerical scientific applications. Especially, some formulation of Dynamic Programming (DP) - a commonly used technique for solving a wide variety of discrete optimization problems, such as scheduling, string-editing, packaging, and inventory management can be solved in parallel on systolic arrays as matrix-vector products. Systolic arrays usually have a very high rate of I/O and are well suited for intensive parallel operations Herein is a description of the FPGA hardware implementation of a matrix-vector multiplication algorithm designed to produce a unidirectional systolic array representation.
{"title":"FPGA Implementation of a Unidirectional Systolic Array Generator for Matrix-Vector Multiplication","authors":"M. Karra, M. P. Bekakos, I. Milovanovic, E. Milovanovic","doi":"10.1109/ICSPC.2007.4728278","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728278","url":null,"abstract":"Systolic arrays may prove ideal structures for the representation and the mapping of many applications concerning various numerical and non-numerical scientific applications. Especially, some formulation of Dynamic Programming (DP) - a commonly used technique for solving a wide variety of discrete optimization problems, such as scheduling, string-editing, packaging, and inventory management can be solved in parallel on systolic arrays as matrix-vector products. Systolic arrays usually have a very high rate of I/O and are well suited for intensive parallel operations Herein is a description of the FPGA hardware implementation of a matrix-vector multiplication algorithm designed to produce a unidirectional systolic array representation.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134484082","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728522
N. Khademi, M. Akhaee, S. Ahadi, M. Moradi, A. Kashi
In this paper, our main purpose is to embed data in the frequency domain of audio signals. Data was embedded by means of quantization index modulation (QIM) in the frequency domain. With this aim, the spectrum of the audio signal was divided into two parts. The first part consisted of the first 19 Barks and the second included the remaining 6 Barks. Each of these parts had a different quantization step size. In order to have large quantization step sizes which yield more robustness, Human Auditory System (HAS) has been used. Decoder detects the watermark signal, without using the original audio signal. Simulation results have shown that this watermarking scheme has better robustness against some common attacks, such as white Gaussian noise, echo, filtering, and MP3 compression, than similar approaches in the time and wavelet domains with the same computational complexity.
{"title":"Audio Watermarking based on Quantization Index Modulation in the Frequency Domain","authors":"N. Khademi, M. Akhaee, S. Ahadi, M. Moradi, A. Kashi","doi":"10.1109/ICSPC.2007.4728522","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728522","url":null,"abstract":"In this paper, our main purpose is to embed data in the frequency domain of audio signals. Data was embedded by means of quantization index modulation (QIM) in the frequency domain. With this aim, the spectrum of the audio signal was divided into two parts. The first part consisted of the first 19 Barks and the second included the remaining 6 Barks. Each of these parts had a different quantization step size. In order to have large quantization step sizes which yield more robustness, Human Auditory System (HAS) has been used. Decoder detects the watermark signal, without using the original audio signal. Simulation results have shown that this watermarking scheme has better robustness against some common attacks, such as white Gaussian noise, echo, filtering, and MP3 compression, than similar approaches in the time and wavelet domains with the same computational complexity.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134624621","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
扫码关注我们
求助内容：
应助结果提醒方式：