Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028300
L. Moraru, L. Cimponeriu, Anastasios Bezerianos
The present work proposes an optimal symbol dynamics transformation as an approach to analyze dynamic aspects of heart rate variability (HRV) in an asphyxia experiment in rats. The approximate entropy (ApEn) was used to quantify the regularity of short symbolic sequences derived from 5 min R-R intervals (RRI). The comparison of several symbol transformations applied in HRV analysis indicates our approach as optimal for characterizing the transitions between different phases in the recovery process following asphyxia in rats.
本文提出了一种最优符号动态变换方法来分析大鼠窒息实验中心率变异性(HRV)的动态方面。利用近似熵(ApEn)来量化由5 min R-R区间(RRI)得到的短符号序列的规律性。在HRV分析中应用的几种符号变换的比较表明,我们的方法是表征大鼠窒息后恢复过程中不同阶段之间转换的最佳方法。
{"title":"Heart period dynamics following an asphyxia experiment in rats","authors":"L. Moraru, L. Cimponeriu, Anastasios Bezerianos","doi":"10.1109/ICDSP.2002.1028300","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028300","url":null,"abstract":"The present work proposes an optimal symbol dynamics transformation as an approach to analyze dynamic aspects of heart rate variability (HRV) in an asphyxia experiment in rats. The approximate entropy (ApEn) was used to quantify the regularity of short symbolic sequences derived from 5 min R-R intervals (RRI). The comparison of several symbol transformations applied in HRV analysis indicates our approach as optimal for characterizing the transitions between different phases in the recovery process following asphyxia in rats.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468337","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028144
D. Sabino, E. K. Nakamura, L. Costa, R. Calado, M. Zago
A new approach to chromatin texture characterization is proposed, based on the recently introduced concept of multiscale fractal dimension. Promising results for differentiating normal from abnormal blood cells have been obtained by considering the peaks of multiscale fractal dimension after Minkowski-Bouligand dilation of the nucleus gray tones. Results for a lymphocyte database exemplify the potential of the method with respect to nuclear texture discrimination. A brief review of related works is also included, focusing on statistical approaches.
{"title":"Chromatin texture characterization using multiscale fractal dimension","authors":"D. Sabino, E. K. Nakamura, L. Costa, R. Calado, M. Zago","doi":"10.1109/ICDSP.2002.1028144","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028144","url":null,"abstract":"A new approach to chromatin texture characterization is proposed, based on the recently introduced concept of multiscale fractal dimension. Promising results for differentiating normal from abnormal blood cells have been obtained by considering the peaks of multiscale fractal dimension after Minkowski-Bouligand dilation of the nucleus gray tones. Results for a lymphocyte database exemplify the potential of the method with respect to nuclear texture discrimination. A brief review of related works is also included, focusing on statistical approaches.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115158174","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028191
N. Thomos, N. Boulgouris, E. Kokkinou, M. Strintzis
In this paper, the sequential decoding of convolutional codes is proposed for data hiding in the wavelet domain. The performance of this technique is evaluated for data hiding in JPEG2000 images and is shown to be advantageous in comparison to other methods for the embedding/extraction of information in digital images.
{"title":"Efficient data hiding in JPEG2000 images using sequential decoding of convolutional codes","authors":"N. Thomos, N. Boulgouris, E. Kokkinou, M. Strintzis","doi":"10.1109/ICDSP.2002.1028191","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028191","url":null,"abstract":"In this paper, the sequential decoding of convolutional codes is proposed for data hiding in the wavelet domain. The performance of this technique is evaluated for data hiding in JPEG2000 images and is shown to be advantageous in comparison to other methods for the embedding/extraction of information in digital images.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"756 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116117427","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028219
Manish Arora, V. SureshBabuP., K. VinayM.
Mobile multimedia messaging (MMS) promises to provide a richer and versatile experience to the user along with new revenue streams for mobile service operators. MMS allows a full content range including images, audio, video and text in any combination. It delivers a location independent, total communication experience to the mobile customer. As proved by the success of short message service (SMS) in generating revenue MMS applications would be the essential drivers of continuous growth in new services beyond voice. Current programmable mobile handsets could suffice as platforms for simple MMS service introduction if the existing capability of the RISC processor of the handset is exercised fully. Speech, an important content in MMS has traditionally been encoded and decoded on DSP processors. This paper describes the challenges and techniques of implementing speech codecs on RISC processors. The specific speech codec implemented was GSM-AMR and the processor used was ARM9TDMI. The techniques described are generic and applicable to any speech codec and RISC processor platform.
{"title":"RISC processor based speech codec implementation for emerging mobile multimedia messaging solutions","authors":"Manish Arora, V. SureshBabuP., K. VinayM.","doi":"10.1109/ICDSP.2002.1028219","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028219","url":null,"abstract":"Mobile multimedia messaging (MMS) promises to provide a richer and versatile experience to the user along with new revenue streams for mobile service operators. MMS allows a full content range including images, audio, video and text in any combination. It delivers a location independent, total communication experience to the mobile customer. As proved by the success of short message service (SMS) in generating revenue MMS applications would be the essential drivers of continuous growth in new services beyond voice. Current programmable mobile handsets could suffice as platforms for simple MMS service introduction if the existing capability of the RISC processor of the handset is exercised fully. Speech, an important content in MMS has traditionally been encoded and decoded on DSP processors. This paper describes the challenges and techniques of implementing speech codecs on RISC processors. The specific speech codec implemented was GSM-AMR and the processor used was ARM9TDMI. The techniques described are generic and applicable to any speech codec and RISC processor platform.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121209698","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028165
E. Dellandréa, P. Makris, N. Vincent, M. Boiron
We present in this paper a medical signal analysis method that we have developed in order to study, in an atraumatic and non-invasive way, the inferior oesophageal sphincter behaviour. This one plays an important part in the gastro-oesophageal reflux phenomenon. The proposed method is more efficient and is better suited to our problem than traditional signal processing methods that did not give good results. It has a double originality. The first one lies on the audio signal coding, based on its time-frequency representation, and allowing the extraction of a set of ordered words that makes up a text. The second one lies on the use of the Zipf law as an analysis tool. The parameters obtained from the Zipf law observation allow one to automatically detect and characterize signal regions of interest, which are periods corresponding to xiphoidal sounds (produced when a bolus, a small quantity of baryte, crosses the inferior oesophageal sphincter). Thus, the results permit one to evaluate the sphincter capability, which is a precious help for specialists.
{"title":"A medical acoustic signal analysis method based on Zipf law","authors":"E. Dellandréa, P. Makris, N. Vincent, M. Boiron","doi":"10.1109/ICDSP.2002.1028165","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028165","url":null,"abstract":"We present in this paper a medical signal analysis method that we have developed in order to study, in an atraumatic and non-invasive way, the inferior oesophageal sphincter behaviour. This one plays an important part in the gastro-oesophageal reflux phenomenon. The proposed method is more efficient and is better suited to our problem than traditional signal processing methods that did not give good results. It has a double originality. The first one lies on the audio signal coding, based on its time-frequency representation, and allowing the extraction of a set of ordered words that makes up a text. The second one lies on the use of the Zipf law as an analysis tool. The parameters obtained from the Zipf law observation allow one to automatically detect and characterize signal regions of interest, which are periods corresponding to xiphoidal sounds (produced when a bolus, a small quantity of baryte, crosses the inferior oesophageal sphincter). Thus, the results permit one to evaluate the sphincter capability, which is a precious help for specialists.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123436486","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028179
V. Nascimento
Despite its qualities of robustness, low cost, and good tracking performance, in many situations the LMS algorithm suffers from slow initial convergence. We propose a method to speed up this convergence rate by varying the length of the adaptive filter, taking advantage of the larger step-sizes allowed for short filters. The results presented here show that variable-length adaptive filters have the potential to achieve quite fast convergence rates, with a modest increase in the computational complexity.
{"title":"Improving the initial convergence of adaptive filters: variable-length LMS algorithms","authors":"V. Nascimento","doi":"10.1109/ICDSP.2002.1028179","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028179","url":null,"abstract":"Despite its qualities of robustness, low cost, and good tracking performance, in many situations the LMS algorithm suffers from slow initial convergence. We propose a method to speed up this convergence rate by varying the length of the adaptive filter, taking advantage of the larger step-sizes allowed for short filters. The results presented here show that variable-length adaptive filters have the potential to achieve quite fast convergence rates, with a modest increase in the computational complexity.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804912","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028222
Anwar S. Dawood, S. J. Visser, John A. Williams
Programmable logic offers an efficient solution for the performance and flexibility required by real time image processing systems. Application specific integrated circuit (ASIC) devices could provide such performance, but the lack of flexibility for changing operation requirements and the associated high development and production cost limit their acceptance for space applications. Field programmable gate arrays (FPGAs) offer highly flexible designs, scalable circuits, and real time system performance. The parallel processing power of FPGAs allows data to be processed more quickly than a similar microprocessor implementation. The High Performance Computing (HPC-I) payload for the Australian scientific mission satellite FedSat has been designed and manufactured to validate the use of FPGA technology onboard satellites for a variety of space applications. This paper elaborates on implementing image processing algorithms and techniques on FPGAs for space applications. It presents the implementation, testing and performance evaluation of a Gaussian filter and convolution engine on HPC-I.
{"title":"Reconfigurable FPGAS for real time image processing in space","authors":"Anwar S. Dawood, S. J. Visser, John A. Williams","doi":"10.1109/ICDSP.2002.1028222","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028222","url":null,"abstract":"Programmable logic offers an efficient solution for the performance and flexibility required by real time image processing systems. Application specific integrated circuit (ASIC) devices could provide such performance, but the lack of flexibility for changing operation requirements and the associated high development and production cost limit their acceptance for space applications. Field programmable gate arrays (FPGAs) offer highly flexible designs, scalable circuits, and real time system performance. The parallel processing power of FPGAs allows data to be processed more quickly than a similar microprocessor implementation. The High Performance Computing (HPC-I) payload for the Australian scientific mission satellite FedSat has been designed and manufactured to validate the use of FPGA technology onboard satellites for a variety of space applications. This paper elaborates on implementing image processing algorithms and techniques on FPGAs for space applications. It presents the implementation, testing and performance evaluation of a Gaussian filter and convolution engine on HPC-I.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129049904","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028236
N. Milisavjeviae, A. Yarovoy
A new algorithm is proposed for subsurface object detection and 3D localization using ground-penetrating radar (GPR) data, if GPR antennas are slightly elevated above the ground. Due to an effective approximation, the algorithm solves problems linked to calculating the position of the refracting point of electromagnetic waves on the air-ground interface. We present how the typical hyperbolic object signature can be detected on a B-scan. Then, we argue that only one surface coordinate can be extracted from the hyperbola detected in one B-scan, so that additional information is needed to find the transverse object position. We show that an antenna configuration with two receive antennas solves this problem. The problem of extracting the third object coordinate as well as the propagation velocity of electromagnetic waves in the ground is also addressed. The algorithm is illustrated on a data set acquired by this antenna configuration.
{"title":"Position determination of a subsurface object by combined output of two receive GPR antennas","authors":"N. Milisavjeviae, A. Yarovoy","doi":"10.1109/ICDSP.2002.1028236","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028236","url":null,"abstract":"A new algorithm is proposed for subsurface object detection and 3D localization using ground-penetrating radar (GPR) data, if GPR antennas are slightly elevated above the ground. Due to an effective approximation, the algorithm solves problems linked to calculating the position of the refracting point of electromagnetic waves on the air-ground interface. We present how the typical hyperbolic object signature can be detected on a B-scan. Then, we argue that only one surface coordinate can be extracted from the hyperbola detected in one B-scan, so that additional information is needed to find the transverse object position. We show that an antenna configuration with two receive antennas solves this problem. The problem of extracting the third object coordinate as well as the propagation velocity of electromagnetic waves in the ground is also addressed. The algorithm is illustrated on a data set acquired by this antenna configuration.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746343","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028345
M. Beddoes, R. Ward
This paper proposes a hybrid of two methods to determine the weight-constants in a class of artificial neuron networks, ANNs. The class of ANNs we are interested in are characterized by feed-forward processing elements. One of the methods is the genetic algorithm, GA; the other is "training through" back-propagation of the error, BPE. We expect our hybrid scheme to be faster than using BPE alone.
{"title":"A possible genetic-algorithm based method for optimizing a class of ANN transfer functions","authors":"M. Beddoes, R. Ward","doi":"10.1109/ICDSP.2002.1028345","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028345","url":null,"abstract":"This paper proposes a hybrid of two methods to determine the weight-constants in a class of artificial neuron networks, ANNs. The class of ANNs we are interested in are characterized by feed-forward processing elements. One of the methods is the genetic algorithm, GA; the other is \"training through\" back-propagation of the error, BPE. We expect our hybrid scheme to be faster than using BPE alone.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130412978","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028264
H. Veeraraghavan, O. Masoud, N. Papanikolopoulos
The goal of this project is to develop a passive vision-based sensing system capable of monitoring an intersection by observing the vehicle and pedestrian flow, and predicting situations that might give rise to accidents. A single camera mounted at an arbitrary position looking at an intersection is used. However, for extended applications multiple cameras will be needed. Some of the key elements are camera calibration, motion tracking, vehicle classification, and predicting collisions. In this paper, we focus on motion tracking. Motion segmentation is performed using an adaptive background model that models each pixel as a mixture of Gaussians. The method used is similar to the Stauffer method for motion segmentation. Tracking of objects is performed by computing the overlap between oriented bounding boxes. The oriented boxes are computed by vector quantization of blobs in the scene. The principal angles computed during vector quantization along with other cues of the object are used for classification of detected entities into vehicles and pedestrians.
{"title":"Real-time tracking for managing suburban intersections","authors":"H. Veeraraghavan, O. Masoud, N. Papanikolopoulos","doi":"10.1109/ICDSP.2002.1028264","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028264","url":null,"abstract":"The goal of this project is to develop a passive vision-based sensing system capable of monitoring an intersection by observing the vehicle and pedestrian flow, and predicting situations that might give rise to accidents. A single camera mounted at an arbitrary position looking at an intersection is used. However, for extended applications multiple cameras will be needed. Some of the key elements are camera calibration, motion tracking, vehicle classification, and predicting collisions. In this paper, we focus on motion tracking. Motion segmentation is performed using an adaptive background model that models each pixel as a mixture of Gaussians. The method used is similar to the Stauffer method for motion segmentation. Tracking of objects is performed by computing the overlap between oriented bounding boxes. The oriented boxes are computed by vector quantization of blobs in the scene. The principal angles computed during vector quantization along with other cues of the object are used for classification of detected entities into vehicles and pedestrians.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125952115","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}