arXiv subjects

Srdjan Stankovic

Publications and source records attributed to Srdjan Stankovic.

11 recordsLinked to original sources

arXiv2017

Conditions for Unique Reconstruction of Sparse Signals Using Compressive Sensing Methods

A signal is sparse in one of its representation domain if the number of nonzero coefficients in that domain is much smaller than the total number of coefficients. Sparse signals can be reconstructed from a very reduced set of measurements/observations. The topic of this paper are conditions for the unique reconstruction of sparse signals from a reduced set of observations. After the basic definitions are introduced, the unique reconstruction conditions are reviewed using the spark, restricted isometry, and coherence of the measurement matrix. Uniqueness of the reconstruction of signals sparse in the discrete Fourier domain (DFT), as the most important signal transformation domain, is considered as well.

cs.IT↗

arXiv2017

On some common compressive sensing recovery algorithms and applications - Review paper

Compressive Sensing, as an emerging technique in signal processing is reviewed in this paper together with its common applications. As an alternative to the traditional signal sampling, Compressive Sensing allows a new acquisition strategy with significantly reduced number of samples needed for accurate signal reconstruction. The basic ideas and motivation behind this approach are provided in the theoretical part of the paper. The commonly used algorithms for missing data reconstruction are presented. The Compressive Sensing applications have gained significant attention leading to an intensive growth of signal processing possibilities. Hence, some of the existing practical applications assuming different types of signals in real-world scenarios are described and analyzed as well.

cs.IT↗

arXiv2017

Identification of image source using serialnumber-based watermarking under Compressive Sensing conditions

Although the protection of ownership and the prevention of unauthorized manipulation of digital images becomes an important concern, there is also a big issue of image source origin authentication. This paper proposes a procedure for the identification of the image source and content by using the Public Key Cryptography Signature (PKCS). The procedure is based on the PKCS watermarking of the images captured with numerous automatic observing cameras in the Trap View cloud system. Watermark is created based on 32-bit PKCS serial number and embedded into the captured image. Watermark detection on the receiver side extracts the serial number and indicates the camera which captured the image by comparing the original and the extracted serial numbers. The watermarking procedure is designed to provide robustness to image optimization based on the Compressive Sensing approach. Also, the procedure is tested under various attacks and shows successful identification of ownership.

cs.MM↗

arXiv2016

A System for Compressive Sensing Signal Reconstruction

An architecture for hardware realization of a system for sparse signal reconstruction is presented. The threshold based reconstruction method is considered, which is further modified in this paper to reduce the system complexity in order to provide easier hardware realization. Instead of using the partial random Fourier transform matrix, the minimization problem is reformulated using only the triangular R matrix from the QR decomposition. The triangular R matrix can be efficiently implemented in hardware without calculating the orthogonal Q matrix. A flexible and scalable realization of matrix R is proposed, such that the size of R changes with the number of available samples and sparsity level.

cs.IT↗

arXiv2015

An Approach to 2D Signals Recovering in Compressive Sensing Context

In this paper we study the compressive sensing effects on 2D signals exhibiting sparsity in 2D DFT domain. A simple algorithm for reconstruction of randomly under-sampled data is proposed. It is based on the analytically determined threshold that precisely separates signal and non-signal components in the 2D DFT domain. The algorithm operates fast in a single iteration providing the accurate signal reconstruction. In the situations that are not comprised by the analytic derivation and constrains, the algorithm is still efficient and need just a couple of iterations. The proposed solution shows promising results in ISAR imaging (simulated data are used), where the reconstruction is achieved even in the case when less than 10% of data is available.

cs.IT↗

arXiv2015

Compressive Sensing of Sparse Signals in the Hermite Transform Basis: Analysis and Algorithm for Signal Reconstruction

An analysis of the influence of missing samples in signals exhibiting sparsity in the Hermite transform domain is provided. Based on the statistical properties derived for the Hermite coefficients of randomly undersampled signal, the probability of success in detection of signal components support is determined. Based on the probabilistic analysis, a threshold for the detection of signal components is provided. It is a crucial step in the definition of a simple non-iterative algorithm for compressive sensing signal reconstruction. The derived theoretical concepts are proved on several examples using different statistical tests.

cs.IT↗

arXiv2015

Polynomial Fourier Domain as a Domain of Signal Sparsity

A compressive sensing (CS) reconstruction method for polynomial phase signals is proposed in this paper. It relies on the Polynomial Fourier transform, which is used to establish a relationship between the observation and sparsity domain. Polynomial phase signals are not sparse in commonly used domains such as Fourier or wavelet domain. Therefore, for polynomial phase signals standard CS algorithms applied in these transformation domains cannot provide satisfactory results. In that sense, the Polynomial Fourier transform is used to ensure sparsity. The proposed approach is generalized using time-frequency representations obtained by the Local Polynomial Fourier transform (LPFT). In particular, the first-order LPFT can produce linear time-frequency representation for chirps. It provides revealing signal local behavior, which leads to sparse representation. The theory is illustrated on examples.

cs.IT↗

arXiv2015

Sparse Time-Frequency Representation for Signals with Fast Varying Instantaneous Frequency

Time-frequency distributions have been used to provide high resolution representation in a large number of signal processing applications. However, high resolution and accurate instantaneous frequency (IF) estimation usually depend on the employed distribution and complexity of signal phase function. To ensure an efficient IF tracking for various types of signals, the class of complex time distributions has been developed. These distributions facilitate analysis in the cases when standard distributions cannot provide satisfactory results (e.g., for highly nonstationary signal phase). In that sense, an ambiguity based form of the forth order complex-time distribution is considered, in a new compressive sensing (CS) context. CS is an intensively growing approach in signal processing that allows efficient analysis and reconstruction of randomly undersampled signals. In this paper, the randomly chosen ambiguity domain coefficients serve as CS measurements. By exploiting sparsity in the time-frequency plane, it is possible to obtain highly concentrated IF using just small number of random coefficients from ambiguity domain. Moreover, in noisy signal case, this CS approach can be efficiently combined with the L-statistics producing robust time-frequency representations. Noisy coefficients are firstly removed using the L-statistics and then reconstructed by using CS algorithm. The theoretical considerations are illustrated using experimental results.

cs.IT↗

arXiv2015

Hardware Architecture for Single Iteration Reconstruction Algorithm

A hardware architecture for the single iteration algorithm is proposed in this paper. Single iteration algorithm enables reconstruction of the full signal when small number of signal samples is available. The algorithm is based on the threshold calculation, and allows distinguishing between signal components and noise that appears as a consequence of missing samples. The proposed system for hardware realization is divided into three parts, each part with different functionality. The system is suitable for the FPGA realization. Realization of the blocks for which there are no standard components in FPGA, is discussed as well.

cs.IT↗

arXiv2010

A Holistic Approach to Securing Web Applications

Protection of Web applications is an activity that requires constant monitoring of security threats as well as looking for solutions in this field. Since protection has moved from the lower layers of OSI models to the application layer and having in mind the fact that 75% of all the attacks are performed at the application layer, special attention should be paid to the application layer. It is possible to improve protection of Web application on the level of the system architecture by introducing new components which will realize protection on higher levels of OSI models. This paper deals with Intrusion Detection Systems, Intrusion Prevention Systems, Web Application Firewall and gives a holistic approach to securing Web applications using aforementioned components.

cs.CR↗

arXiv2009

Defense Strategies Against Modern Botnets

Botnets are networks of compromised computers with malicious code which are remotely controlled and which are used for starting distributed denial of service (DDoS) attacks, sending enormous number of e-mails (SPAM) and other sorts of attacks. Defense against modern Botnets is a real challenge. This paper offers several strategies for defense against Botnets with a list and description of measures and activities which should be carried out in order to establish successful defense. The paper also offers parallel preview of the strategies with their advantages and disadvantages considered in accordance with various criteria.

cs.CR↗