Pub Date : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032232
Ming Zhang, Zizhan Zheng, N. Shroff
Stealthy attacks are a major threat to cyber security. In practice, both attackers and defenders have resource constraints that could limit their capabilities. Hence, to develop robust defense strategies, a promising approach is to utilize game theory to understand the fundamental tradeoffs involved. Previous works in this direction, however, mainly focus on the single-node case without considering strict resource constraints. In this paper, a game-theoretic model for protecting a system of multiple nodes against stealthy attacks is proposed. We consider the practical setting where the frequencies of both the attack and the defense are constrained by limited resources, and an asymmetric feedback structure where the attacker can fully observe the states of nodes while largely hiding its actions from the defender. We characterize best strategies for both the defender and the attacker, and study the Nash Equilibria of the game.
{"title":"Stealthy attacks and observable defenses: A game theoretic model under strict resource constraints","authors":"Ming Zhang, Zizhan Zheng, N. Shroff","doi":"10.1109/GlobalSIP.2014.7032232","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032232","url":null,"abstract":"Stealthy attacks are a major threat to cyber security. In practice, both attackers and defenders have resource constraints that could limit their capabilities. Hence, to develop robust defense strategies, a promising approach is to utilize game theory to understand the fundamental tradeoffs involved. Previous works in this direction, however, mainly focus on the single-node case without considering strict resource constraints. In this paper, a game-theoretic model for protecting a system of multiple nodes against stealthy attacks is proposed. We consider the practical setting where the frequencies of both the attack and the defense are constrained by limited resources, and an asymmetric feedback structure where the attacker can fully observe the states of nodes while largely hiding its actions from the defender. We characterize best strategies for both the defender and the attacker, and study the Nash Equilibria of the game.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"12 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113978763","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032202
Chung-Hui Kuo
While the traditional printing industry has been experiencing significant challenges from the rapid advancement of telecommunication and display technologies, the increasing demand for short-run and high quality printed material, fulfilled by digital printing technologies, provides future growth opportunity. To minimize the production cost in material and labor, researchers continue to pursue the idea of a Smart Printing Press, which can predict and sense possible failures and automatically recover to optimize the output image quality. In this paper, we will introduce a press-optimization algorithm to deterministically detect and automatically repair the non-uniformity image artifact through modulating the exposure output from its digital image-writing modules. This algorithm has been successfully deployed in the Intelligent Calibration System software package on commercial digital presses of Eastman Kodak Company.
{"title":"Active digital press optimization","authors":"Chung-Hui Kuo","doi":"10.1109/GlobalSIP.2014.7032202","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032202","url":null,"abstract":"While the traditional printing industry has been experiencing significant challenges from the rapid advancement of telecommunication and display technologies, the increasing demand for short-run and high quality printed material, fulfilled by digital printing technologies, provides future growth opportunity. To minimize the production cost in material and labor, researchers continue to pursue the idea of a Smart Printing Press, which can predict and sense possible failures and automatically recover to optimize the output image quality. In this paper, we will introduce a press-optimization algorithm to deterministically detect and automatically repair the non-uniformity image artifact through modulating the exposure output from its digital image-writing modules. This algorithm has been successfully deployed in the Intelligent Calibration System software package on commercial digital presses of Eastman Kodak Company.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942830","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032158
Xianghui Mao, Yuantao Gu
Subspace clustering possesses a wide range of applications, including network data analysis, image segmentation, and medical image processing, etc. Aimed at reducing the computational complexity of subspace clustering performed on high-dimensional data, we propose a compressed subspace clustering approach by random projection. From the view of subspace principal angles, we analyze the subspace affinity change brought by compression, and provide an estimate of compressed subspace affinity when the embedded subspaces share a certain number of intersected dimensions with all other dimensions orthogonal pairwisely. In such condition, a lower bound on compressed dimensionality is also theoretically proved in this paper. Our results show that the raw data can be compressed to very few measurements yet will remain high subspace separability. Numerical simulations validate the above theoretical results.
{"title":"Compressed subspace clustering: A case study","authors":"Xianghui Mao, Yuantao Gu","doi":"10.1109/GlobalSIP.2014.7032158","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032158","url":null,"abstract":"Subspace clustering possesses a wide range of applications, including network data analysis, image segmentation, and medical image processing, etc. Aimed at reducing the computational complexity of subspace clustering performed on high-dimensional data, we propose a compressed subspace clustering approach by random projection. From the view of subspace principal angles, we analyze the subspace affinity change brought by compression, and provide an estimate of compressed subspace affinity when the embedded subspaces share a certain number of intersected dimensions with all other dimensions orthogonal pairwisely. In such condition, a lower bound on compressed dimensionality is also theoretically proved in this paper. Our results show that the raw data can be compressed to very few measurements yet will remain high subspace separability. Numerical simulations validate the above theoretical results.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134286720","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032357
Xing Jiang, U. Braga-Neto
Bolstered error estimation has been shown to perform better than cross-validation and competitively with bootstrap in small-sample settings. However, its performance can deteriorate in the high-dimensional settings prevalent in Genomic Signal Processing. We propose here a modification of Bolstered error estimation that is based on the principle of Naive Bayes. Rather than attempting to estimate a single variance parameter for a spherical bolstering kernel in high-dimensional spaces from a small sample, we assume an ellipsoidal kernel and estimate each univariate variance separately along each variable. In simulation results based on a model for gene-expression data and a linear SVM classification rule, the new bolstered estimator clearly outperformed the old one, as well as cross-validation and resubstitution, and was also superior to the 0.632 bootstrap except in the case where a large feature set is selected.
{"title":"A Naive-Bayes approach to Bolstered error estimation in high-dimensional spaces","authors":"Xing Jiang, U. Braga-Neto","doi":"10.1109/GlobalSIP.2014.7032357","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032357","url":null,"abstract":"Bolstered error estimation has been shown to perform better than cross-validation and competitively with bootstrap in small-sample settings. However, its performance can deteriorate in the high-dimensional settings prevalent in Genomic Signal Processing. We propose here a modification of Bolstered error estimation that is based on the principle of Naive Bayes. Rather than attempting to estimate a single variance parameter for a spherical bolstering kernel in high-dimensional spaces from a small sample, we assume an ellipsoidal kernel and estimate each univariate variance separately along each variable. In simulation results based on a model for gene-expression data and a linear SVM classification rule, the new bolstered estimator clearly outperformed the old one, as well as cross-validation and resubstitution, and was also superior to the 0.632 bootstrap except in the case where a large feature set is selected.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131513978","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032337
Dawei Wang, Pinyi Ren, Yichen Wang, Qinghe Du, Li Sun
In this paper, we develop an energy cooperation scheme for secondary users' (SU) spectrum access in the hybrid energy supply primary system, which will improve both energy efficiency and spectral efficiency. Specifically, the cooperation is implemented into two stages. In the first stage, the secondary system is allowed to access the licensed for secondary transmission. Simultaneously, the primary system harvests energy from the secondary radio-frequency signals. In the second stage, the primary system employs the energy from the energy harvester and the constant energy source for primary transmission in the remaining slot. Both the primary and secondary systems will benefit from our proposed energy cooperation scheme. The secondary system is allocated to access the spectrum freely and the primary system can harvest energy from SUs' radio-frequency signals. To analyze the throughput performance of both the primary and secondary systems, we derive the closed-form expressions of the outage probability and ergodic capacity for the delay-limited and delay-tolerant transmission modes, respectively. Simulation results verify the analytical results and demonstrate that compared with direct transmission, the performance of the primary system in terms of throughput improves and the secondary system acquires more spectrum opportunities for the secondary transmission.
{"title":"Energy cooperation for reciprocally-benefited spectrum access in cognitive radio networks","authors":"Dawei Wang, Pinyi Ren, Yichen Wang, Qinghe Du, Li Sun","doi":"10.1109/GlobalSIP.2014.7032337","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032337","url":null,"abstract":"In this paper, we develop an energy cooperation scheme for secondary users' (SU) spectrum access in the hybrid energy supply primary system, which will improve both energy efficiency and spectral efficiency. Specifically, the cooperation is implemented into two stages. In the first stage, the secondary system is allowed to access the licensed for secondary transmission. Simultaneously, the primary system harvests energy from the secondary radio-frequency signals. In the second stage, the primary system employs the energy from the energy harvester and the constant energy source for primary transmission in the remaining slot. Both the primary and secondary systems will benefit from our proposed energy cooperation scheme. The secondary system is allocated to access the spectrum freely and the primary system can harvest energy from SUs' radio-frequency signals. To analyze the throughput performance of both the primary and secondary systems, we derive the closed-form expressions of the outage probability and ergodic capacity for the delay-limited and delay-tolerant transmission modes, respectively. Simulation results verify the analytical results and demonstrate that compared with direct transmission, the performance of the primary system in terms of throughput improves and the secondary system acquires more spectrum opportunities for the secondary transmission.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129372730","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032092
Amin Azari, Guowang Miao
In Machine-to-Machine (M2M) networks, an energy efficient scalable medium access control (MAC) is crucial for serving massive battery-driven machine-type devices. In this paper, we investigate the energy efficient MAC design to minimize battery power consumption in cellular-based M2M communications. We present an energy efficient MAC protocol that not only adapts contention and reservation-based protocols for M2M communications in cellular networks, but also benefits from partial clustering to handle the massive access problem. Then we investigate the energy efficiency and access capacity of contention-based protocols and present an energy efficient contention-based protocol for intra-cluster communication of the proposed MAC, which results in huge power saving. The simulation results show that the proposed MAC protocol outperforms the others in energy saving without sacrificing much delay or throughput. Also, the lifetimes of both individual nodes and the whole M2M network are significantly extended.
{"title":"Energy efficient MAC for cellular-based M2M communications","authors":"Amin Azari, Guowang Miao","doi":"10.1109/GlobalSIP.2014.7032092","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032092","url":null,"abstract":"In Machine-to-Machine (M2M) networks, an energy efficient scalable medium access control (MAC) is crucial for serving massive battery-driven machine-type devices. In this paper, we investigate the energy efficient MAC design to minimize battery power consumption in cellular-based M2M communications. We present an energy efficient MAC protocol that not only adapts contention and reservation-based protocols for M2M communications in cellular networks, but also benefits from partial clustering to handle the massive access problem. Then we investigate the energy efficiency and access capacity of contention-based protocols and present an energy efficient contention-based protocol for intra-cluster communication of the proposed MAC, which results in huge power saving. The simulation results show that the proposed MAC protocol outperforms the others in energy saving without sacrificing much delay or throughput. Also, the lifetimes of both individual nodes and the whole M2M network are significantly extended.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133489198","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032090
Oskari Tervo, Le-Nam Tran, M. Juntti
We study the joint beamforming and antenna selection problem for energy efficiency maximization in multi-user multiple-input single-output (MISO) downlink channel. By viewing antenna selection as finding a sparse solution, we first introduce a sparsity-inducing regularization term to the design problem. Since the resulting problem is nonconvex, it is difficult to find an optimal solution, and we apply a local optimization method based on the concept of sequential convex approximation (SCA) to solve this problem. By proper reformulations we arrive at a fast converging iterative algorithm, where a convex program is solved at each iteration. In the first design, we simply ignore antennas of which the associated beamformers are nearly zero and select the remaining ones. In the second design, we further perform the search over the selected antennas of the first design to improve the energy efficiency. Numerical results demonstrate remarkable performance gains of the proposed approaches in terms of energy efficiency over the solution without antenna selection.
{"title":"Joint transmit beamforming and antenna selection for energy efficiency maximization in MISO downlink","authors":"Oskari Tervo, Le-Nam Tran, M. Juntti","doi":"10.1109/GlobalSIP.2014.7032090","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032090","url":null,"abstract":"We study the joint beamforming and antenna selection problem for energy efficiency maximization in multi-user multiple-input single-output (MISO) downlink channel. By viewing antenna selection as finding a sparse solution, we first introduce a sparsity-inducing regularization term to the design problem. Since the resulting problem is nonconvex, it is difficult to find an optimal solution, and we apply a local optimization method based on the concept of sequential convex approximation (SCA) to solve this problem. By proper reformulations we arrive at a fast converging iterative algorithm, where a convex program is solved at each iteration. In the first design, we simply ignore antennas of which the associated beamformers are nearly zero and select the remaining ones. In the second design, we further perform the search over the selected antennas of the first design to improve the energy efficiency. Numerical results demonstrate remarkable performance gains of the proposed approaches in terms of energy efficiency over the solution without antenna selection.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132679050","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032083
Meng-Lin Ku, Yan Chen, K. Liu
This paper presents a data-driven approach of finding optimal scheduling policies for a solar-powered sensor node that attempts to maximize net bit rates by adapting its transmission to the changes of channel fading and battery recharge. The problem is formulated as a discounted Markov decision process (MDP) framework, whereby the energy harvesting process is stochastically quantized into several representative solar states with distinct energy arrivals and is totally driven by historical data records at a sensor node. We evaluate the average net bit rate of the optimal transmission scheduling policy, and computer simulations show that the proposed policy significantly outperforms other schemes with or without the knowledge of short-term energy harvesting and channel fading patterns.
{"title":"Data-driven stochastic scheduling for solar-powered sensor communications","authors":"Meng-Lin Ku, Yan Chen, K. Liu","doi":"10.1109/GlobalSIP.2014.7032083","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032083","url":null,"abstract":"This paper presents a data-driven approach of finding optimal scheduling policies for a solar-powered sensor node that attempts to maximize net bit rates by adapting its transmission to the changes of channel fading and battery recharge. The problem is formulated as a discounted Markov decision process (MDP) framework, whereby the energy harvesting process is stochastically quantized into several representative solar states with distinct energy arrivals and is totally driven by historical data records at a sensor node. We evaluate the average net bit rate of the optimal transmission scheduling policy, and computer simulations show that the proposed policy significantly outperforms other schemes with or without the knowledge of short-term energy harvesting and channel fading patterns.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759429","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032320
Cuimei Cui, H. Man, Yiming Wang, Shuqi Liu
Cognitive routing coupled with cooperative spectrum sensing in multi-hop Cognitive Radio Ad Hoc Network (CRAHN) is investigated. Recognizing the spectrum dynamics and the problems of hidden terminal and shadow fading in CRAHNs, we propose an opportunistic routing protocol that exploits a Dual-stage Collaborative Spectrum Sensing (DCSS) scheme to improve the accuracy of spectrum available opportunity due to the effects of Primary Users' (PUs) activity. The simulation results indicate that routing access opportunity and breakage probability using the proposed DCSS, when compared to the Single Collaborative Spectrum Sensing (SCSS) scheme and Non-Cooperation Sensing (NCS) scheme, is closer to the practical value of routing establishment. Besides, it is observed that the number of available channels and hop counts also affect the success rate of routing establishment.
{"title":"Cooperative spectrum-aware opportunistic routing in cognitive Radio Ad Hoc Networks","authors":"Cuimei Cui, H. Man, Yiming Wang, Shuqi Liu","doi":"10.1109/GlobalSIP.2014.7032320","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032320","url":null,"abstract":"Cognitive routing coupled with cooperative spectrum sensing in multi-hop Cognitive Radio Ad Hoc Network (CRAHN) is investigated. Recognizing the spectrum dynamics and the problems of hidden terminal and shadow fading in CRAHNs, we propose an opportunistic routing protocol that exploits a Dual-stage Collaborative Spectrum Sensing (DCSS) scheme to improve the accuracy of spectrum available opportunity due to the effects of Primary Users' (PUs) activity. The simulation results indicate that routing access opportunity and breakage probability using the proposed DCSS, when compared to the Single Collaborative Spectrum Sensing (SCSS) scheme and Non-Cooperation Sensing (NCS) scheme, is closer to the practical value of routing establishment. Besides, it is observed that the number of available channels and hop counts also affect the success rate of routing establishment.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131418984","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 : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032134
S. Marple
Current compression of complex SAR imagery uses line-by-line 1-D linear prediction which can cause discontinuities during reconstruction between lines. This paper introduces computationally fast full 2-D linear prediction techniques which can process entire complex SAR images (or sub-images) with another 10X factor improvement in complex data compression over 1-D techniques, while yielding better weak target and shadow area preservation. 2-D linear prediction also compresses linear extent target features not possible with 1-D algorithms.
{"title":"2-D linear predictive compression of complex synthetic aperture radar (SAR) images","authors":"S. Marple","doi":"10.1109/GlobalSIP.2014.7032134","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032134","url":null,"abstract":"Current compression of complex SAR imagery uses line-by-line 1-D linear prediction which can cause discontinuities during reconstruction between lines. This paper introduces computationally fast full 2-D linear prediction techniques which can process entire complex SAR images (or sub-images) with another 10X factor improvement in complex data compression over 1-D techniques, while yielding better weak target and shadow area preservation. 2-D linear prediction also compresses linear extent target features not possible with 1-D algorithms.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343171","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
扫码关注我们
求助内容：
应助结果提醒方式：