Pub Date : 2008-10-01DOI: 10.1109/ACSSC.2008.5074641
Hong Zhao
{"title":"Session TP1b: Statistical signal processing for forensics and security","authors":"Hong Zhao","doi":"10.1109/ACSSC.2008.5074641","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074641","url":null,"abstract":"","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117343981","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-10-01DOI: 10.1109/ACSSC.2008.5074829
Yingda Chen, S. Kishore
The unreliability of network edges in wireless networks invalidates some fundamental assumptions used in most studies on network coding and may present a performance bottleneck in its application. Particularly, wireless systems that are designed based on randomized network coding (RNC) would face two layers of uncertainty when receivers attempt to retrieve source information, among which the uncertainty brought by wireless fading can have a major impact on the system performance. In this paper, we approach the RNC scheme in wireless networks with both layers of uncertainty in mind, and we look at the joint impact of channel fading and broadcasting on the performance of RNC in the wireless setting. We show that the compromising effect of fading can be elevated when the wireless broadcasting medium is properly utilized. Furthermore, by exploiting the capacity-reliability inherent in the application of RNC, we demonstrate additional improvements in the performance of RNC over wireless network edges.
{"title":"Randomized network coding in broadcast wireless networks with fading edges","authors":"Yingda Chen, S. Kishore","doi":"10.1109/ACSSC.2008.5074829","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074829","url":null,"abstract":"The unreliability of network edges in wireless networks invalidates some fundamental assumptions used in most studies on network coding and may present a performance bottleneck in its application. Particularly, wireless systems that are designed based on randomized network coding (RNC) would face two layers of uncertainty when receivers attempt to retrieve source information, among which the uncertainty brought by wireless fading can have a major impact on the system performance. In this paper, we approach the RNC scheme in wireless networks with both layers of uncertainty in mind, and we look at the joint impact of channel fading and broadcasting on the performance of RNC in the wireless setting. We show that the compromising effect of fading can be elevated when the wireless broadcasting medium is properly utilized. Furthermore, by exploiting the capacity-reliability inherent in the application of RNC, we demonstrate additional improvements in the performance of RNC over wireless network edges.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117124608","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-10-01DOI: 10.1109/ACSSC.2008.5074572
D. Needell, J. Tropp, R. Vershynin
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed regularized orthogonal matching pursuit (ROMP) that has bridged the gap between these two approaches. ROMP is the first stable greedy algorithm providing uniform guarantees. Even more recently, Needell and Tropp developed the stable greedy algorithm compressive sampling matching pursuit (CoSaMP). CoSaMP provides uniform guarantees and improves upon the stability bounds and RIC requirements of ROMP. CoSaMP offers rigorous bounds on computational cost and storage. In many cases, the running time is just O(N log N), where N is the ambient dimension of the signal. This review summarizes these major advances.
{"title":"Greedy signal recovery review","authors":"D. Needell, J. Tropp, R. Vershynin","doi":"10.1109/ACSSC.2008.5074572","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074572","url":null,"abstract":"The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed regularized orthogonal matching pursuit (ROMP) that has bridged the gap between these two approaches. ROMP is the first stable greedy algorithm providing uniform guarantees. Even more recently, Needell and Tropp developed the stable greedy algorithm compressive sampling matching pursuit (CoSaMP). CoSaMP provides uniform guarantees and improves upon the stability bounds and RIC requirements of ROMP. CoSaMP offers rigorous bounds on computational cost and storage. In many cases, the running time is just O(N log N), where N is the ambient dimension of the signal. This review summarizes these major advances.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930348","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-10-01DOI: 10.1109/ACSSC.2008.5074489
C. Agurto, S. Murillo, V. Murray, M. Pattichis, S. Russell, M. Abràmoff, P. Soliz
We present the application of an Amplitude-Modulation Frequency-Modulation (AM-FM) method for extracting potentially relevant features towards the classification of diseased retinas from healthy retinas. In terms of AM-FM features, we use histograms of the instantaneous amplitude, the angle of the instantaneous frequency and the magnitude of the instantaneous frequency extracted over different frequency scales. To classify the AM-FM features, we use a combination of a clustering method and Partial Least Squares (PLS). Using 18 images from each of the four risk levels, three experiments were performed to test the algorithm's ability to differentiate the controls (Risk 0) from each of the three levels of pathology, i.e. Risk 1, Risk 2, and Risk 3. For Risk 0 versus Risk 3 an area under the receiver operating system (AROC) of 0.99 was achieved with a best sensitivity of 100% and a specificity of 95%. For Risk 0 versus Risk 2, the AROC was 0.96 with 94% sensitivity and 85% specificity. For Risk 0 versus Risk 1, the AROC was 0.93 and a sensitivity/specificity of 94%/67%.
{"title":"Detection and phenotyping of retinal disease using AM-FM processing for feature extraction","authors":"C. Agurto, S. Murillo, V. Murray, M. Pattichis, S. Russell, M. Abràmoff, P. Soliz","doi":"10.1109/ACSSC.2008.5074489","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074489","url":null,"abstract":"We present the application of an Amplitude-Modulation Frequency-Modulation (AM-FM) method for extracting potentially relevant features towards the classification of diseased retinas from healthy retinas. In terms of AM-FM features, we use histograms of the instantaneous amplitude, the angle of the instantaneous frequency and the magnitude of the instantaneous frequency extracted over different frequency scales. To classify the AM-FM features, we use a combination of a clustering method and Partial Least Squares (PLS). Using 18 images from each of the four risk levels, three experiments were performed to test the algorithm's ability to differentiate the controls (Risk 0) from each of the three levels of pathology, i.e. Risk 1, Risk 2, and Risk 3. For Risk 0 versus Risk 3 an area under the receiver operating system (AROC) of 0.99 was achieved with a best sensitivity of 100% and a specificity of 95%. For Risk 0 versus Risk 2, the AROC was 0.96 with 94% sensitivity and 85% specificity. For Risk 0 versus Risk 1, the AROC was 0.93 and a sensitivity/specificity of 94%/67%.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124452965","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-10-01DOI: 10.1109/ACSSC.2008.5074445
Yenming J. Chen, R. Scholtz
The oscillator model proposed is based on Robinson's oscillator. Two cases are studied, noise-free and noise-present conditions. Three types of oscillator models based on Robinson are introduced when noise is present. A new oscillator phase noise model which indicates the effect of a nonlinearity is proposed. The results show that the newly defined phase noise is a modified Wiener process whose variance increases with time. The spread of the variance of the phase noise is reduced if the hard-limiter nonlinearity used in the oscillator model is replaced by a soft-limiter with small slope. Similar effects are seen by reducing the system gain parameters. Further system performance improvement is achieved by the introduction of a soft-limiter in the outer-loop of the model.
{"title":"Theoretical models of oscillators, phase noise and the effects of nonlinearity","authors":"Yenming J. Chen, R. Scholtz","doi":"10.1109/ACSSC.2008.5074445","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074445","url":null,"abstract":"The oscillator model proposed is based on Robinson's oscillator. Two cases are studied, noise-free and noise-present conditions. Three types of oscillator models based on Robinson are introduced when noise is present. A new oscillator phase noise model which indicates the effect of a nonlinearity is proposed. The results show that the newly defined phase noise is a modified Wiener process whose variance increases with time. The spread of the variance of the phase noise is reduced if the hard-limiter nonlinearity used in the oscillator model is replaced by a soft-limiter with small slope. Similar effects are seen by reducing the system gain parameters. Further system performance improvement is achieved by the introduction of a soft-limiter in the outer-loop of the model.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149340","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-10-01DOI: 10.1109/ACSSC.2008.5074787
V. Veeravalli
{"title":"Session WA4: New directions in MIMO","authors":"V. Veeravalli","doi":"10.1109/ACSSC.2008.5074787","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074787","url":null,"abstract":"","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442620","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-10-01DOI: 10.1109/ACSSC.2008.5074654
S. Weber, A. Petropulu
Cooperative retransmission (CR) for cellular uplink employs recovery epochs where colliding packets are retransmitted until all packets are recoverable by the base station. We consider a general class of queueing dynamics, appropriate for cellular uplink MAC protocols, where time slots are grouped into epochs, and each epoch results in some subset of the active nodes completing a transmission to the base station. Employing moment generating functions, we express the queue length in terms of the number of arrivals during each epoch, and from here we obtain general expressions for throughput and delay (queueing plus service). We specialize these general results for four MAC uplink protocols: i) independent queues with no collisions (providing an upper bound on performance), ii) slotted Aloha, iii) perfect cooperative retransmission (each time slot yields a new independent signal combination), and iv) imperfect cooperative retransmission (a time slot gives useful information with probability 1 - q).
{"title":"Achievable throughput and queueing delay for imperfect cooperative retransmission MAC protocols","authors":"S. Weber, A. Petropulu","doi":"10.1109/ACSSC.2008.5074654","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074654","url":null,"abstract":"Cooperative retransmission (CR) for cellular uplink employs recovery epochs where colliding packets are retransmitted until all packets are recoverable by the base station. We consider a general class of queueing dynamics, appropriate for cellular uplink MAC protocols, where time slots are grouped into epochs, and each epoch results in some subset of the active nodes completing a transmission to the base station. Employing moment generating functions, we express the queue length in terms of the number of arrivals during each epoch, and from here we obtain general expressions for throughput and delay (queueing plus service). We specialize these general results for four MAC uplink protocols: i) independent queues with no collisions (providing an upper bound on performance), ii) slotted Aloha, iii) perfect cooperative retransmission (each time slot yields a new independent signal combination), and iv) imperfect cooperative retransmission (a time slot gives useful information with probability 1 - q).","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129868870","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-10-01DOI: 10.1109/ACSSC.2008.5074387
R. Madan
{"title":"Session MA6: MIMO radar and sensor fusion","authors":"R. Madan","doi":"10.1109/ACSSC.2008.5074387","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074387","url":null,"abstract":"","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"7 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128294627","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-10-01DOI: 10.1109/ACSSC.2008.5074439
Rami N. Khal, Y. Zakharov, Junruo Zhang
In this paper, two joint data-aided channel and frequency offset estimators are proposed for frequency-flat fast fading channels. The proposed estimators are based on cubic spline approximation and a two stage frequency estimation using a fast Fourier transform-based coarse search and dichotomous fine search. The first estimator relies on the Bayesian approach and by exploiting prior channel statistics can provide a high performance. The second estimator, with a slightly lower accuracy, can operate when the prior statistics are unknown. These estimators are examined for Rayleigh fading channels. They achieve a high accuracy performance over a wide range of signal to noise ratio, for different Doppler frequencies and throughout all the frequency acquisition range.
{"title":"Joint channel and frequency offset estimators for frequency-flat fast fading channels","authors":"Rami N. Khal, Y. Zakharov, Junruo Zhang","doi":"10.1109/ACSSC.2008.5074439","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074439","url":null,"abstract":"In this paper, two joint data-aided channel and frequency offset estimators are proposed for frequency-flat fast fading channels. The proposed estimators are based on cubic spline approximation and a two stage frequency estimation using a fast Fourier transform-based coarse search and dichotomous fine search. The first estimator relies on the Bayesian approach and by exploiting prior channel statistics can provide a high performance. The second estimator, with a slightly lower accuracy, can operate when the prior statistics are unknown. These estimators are examined for Rayleigh fading channels. They achieve a high accuracy performance over a wide range of signal to noise ratio, for different Doppler frequencies and throughout all the frequency acquisition range.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129952796","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}
The scalable video coding (SVC) amendment of H.264/AVC offers three scalability dimensions: spatial, temporal, and quality scalabilities. Since these three dimensions can be easily combined, a single SVC bit stream has various extraction points, providing many sub-streams. When a specific bit rate is given, finding an optimal extraction point among various extraction points is a difficult problem due to the difference in the metric of each scalability dimension. We develop a method to efficiently transform three scalability dimensions into utility functions and propose an algorithm to find an efficient extraction path by using the points of inflection. Experimental results show that our approach can find a better extraction path as compared to the Joint Scalable Video Model (JSVM) basic extractor. Moreover, using the determined extraction path for an SVC bit stream is less complex owing to its monotonically increasing property.
{"title":"Determining efficient bit stream extraction paths in H.264/AVC scalable video coding","authors":"Dongeun Lee, Yonghee Lee, Heejung Lee, Jonghun Lee, Heonshik Shin","doi":"10.1109/ACSSC.2008.5074833","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074833","url":null,"abstract":"The scalable video coding (SVC) amendment of H.264/AVC offers three scalability dimensions: spatial, temporal, and quality scalabilities. Since these three dimensions can be easily combined, a single SVC bit stream has various extraction points, providing many sub-streams. When a specific bit rate is given, finding an optimal extraction point among various extraction points is a difficult problem due to the difference in the metric of each scalability dimension. We develop a method to efficiently transform three scalability dimensions into utility functions and propose an algorithm to find an efficient extraction path by using the points of inflection. Experimental results show that our approach can find a better extraction path as compared to the Joint Scalable Video Model (JSVM) basic extractor. Moreover, using the determined extraction path for an SVC bit stream is less complex owing to its monotonically increasing property.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129976011","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
扫码关注我们
求助内容：
应助结果提醒方式：