Choice of a pertinent color space for color texture characterization using parametric spectral analysis

This article presents a comparison of different color spaces including RGB, IHLS and L?a*b* for color texture characterization. This comparison is based on the fusion of the independent spatial structure and color feature cues. In IHLS and L*a*b*, two channel complex color images are created from the luminance and the chrominance values. For such images, two dimensional complex multichannel linear prediction models are used to perform parametric power spectrum estimation and the structure feature cues are computed from this estimated power spectrum. Quantitative comparison of auto spectra of luminance and combined chrominance channels for different color spaces is done. This comparison is based on the degree of decorrelation between luminance and chrominance information provided by different color space transformations. Three dimensional histograms are used as color feature cues. Then, to classify color textures, Kullback-Leibler divergence based symmetric distance measures are calculated for pure color, luminance structure and chrominance structure feature cues. Individual as well as combined effect of information from all feature cues on classification results is then compared for different color spaces and different color texture data sets. The proposed color texture classification method performs better than the state of the art methods in certain cases. The L*a*b* color space gives us a better characterization of the chrominance spatial structure as well as the overall spatial structure for all of the chosen data sets. Experimental results on pixel classification of color textures are also presented and discussed.     

Crypt analysis of two time pads in case of compressed speech

Keystream reuse, also known as the two time pad problem, is a well known weakness in stream ciphers. The implementers of the cryptographic algorithms are still underestimating this threat. The keystream reuse exploitation techniques presented so far assume the underlying plaintext to be textual data and all the heuristics presented previously are based on the language characteristics of the underlying text based data, which fail when compression is applied on the plaintext before encryption. This paper presents exploitation techniques for two time pads in case of stream ciphered digitized and compressed speech signals. In this paper we show that how an adversary can automatically recover the digitized speech signals encrypted under the same keystream provided the language (e.g. English) and digital encoding/compression scheme details of the underlying speech signals are known. Our technique of cryptanalysis is based on the modeling of the speech parameters by exploiting the inter frame correlations between each components of the speech vectors in different frames and then using these models to decode the two speech signals in the keystream reuse scenario. The technique is flexible enough to incorporate all modern speech coding schemes based on parameter or hybrid encoding and compression techniques. The simulation experiments have showed promising results for most of the present day speech digitization and compression techniques.     

All-digital gated ring oscillator $$\Delta \Sigma$$ modulators

This paper presents all-digital time-mode \(\Delta \Sigma\) modulators. The proposed modulators consist of a voltage-to-time integrator, a seven-stage gated ring oscillator functioning as a 3-bit quantizer, and seven digital differentiators. A detailed analysis of the nonlinear characteristics of the modulators is provided. Designed in IBM 130 nm 1.2 V CMOS technology with a 100 mV 100 kHz sinusoidal input and a 4.4 MHz frequency clock, the first-order modulator provides 47 dB SNR over 0–150 KHz bandwidth while consuming 1.1 mW while the second-order modulator provides 55 dB SNR over the same bandwidth while consuming consumes 1.45 mW.     

Apodized chirped fiber Bragg grating for postdispersion compensation in wavelength division multiplexing optical networks

In this paper, a postdispersion compensation unit is proposed leading to a better performance for the optical communication systems. This unit utilizes a chirped fiber Bragg grating (CFBG). For enhanced performance of the CFBG, a proper apodization function is chosen to improve the quality factor (Q‐factor) and the bit error rate (BER) of the system. A 110‐km wavelength division multiplexing (WDM) optical link is investigated. The system performance is evaluated through its Q‐factor, eye diagram, and BER showing best performance when using the Hamming apodization function.     

Analysis of the decoupled uplink downlink technique for varying path loss exponent in multi-tier HetNet

In this paper, the impact of varying path loss exponent (PLE) on user association probability, decoupled uplink coverage probability as well as decoupled uplink average spectral efficiency in downlink uplink decoupled (DUDe) multi-tier heterogeneous networks, is investigated. We investigate the effect of the difference in path loss exponents in both macro and small cell environments over uplink network performance. It is assumed that the mobile user connected to the macro base station experience different path loss exponent as compared to when connected to small base station. It is observed that the difference of path loss exponents in both cases has significant effect on the user association probability, decoupled uplink coverage probability as well as decoupled uplink average spectral efficiency. Moreover, in order to further support key findings and make sound comparison between coupled and DUDe performance in varying PLE environment, generalized analytical expressions for coupled association probabilities, along with coupled uplink coverage probability and coupled uplink average spectral efficiency have been derived. The analytical results evaluated in this paper are compared with the computer simulation and found in good agreement. Our analysis shows that decoupling technique performs suboptimal for cases where the environments around macro and small base stations are different with respect to each other. The work explained in this paper highlights the limitation of applying DUDe technique in realistic conditions where the PLEs of cellular tiers are not exactly equal to one another.

     

POLYBiNN: Binary Inference Engine for Neural Networks using Decision Trees

Journal of Signal Processing Systems - Convolutional Neural Networks (CNNs) and Deep Neural Networks (DNNs) have gained significant popularity in several classification and regression applications....     

Distributed Online Algorithms for the Agent Migration Problem in WSNs

The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement and migration algorithms proposed in the literature, assume that the communication rates between agents remain stable for a sufficiently long time to amortize the migration costs. Then, the problem is that frequent changes in the application-level communication may lead to several non-beneficial agent migrations, which may actually increase the total network cost, instead of decreasing it. To tackle this problem, we propose two distributed algorithms that take migration decisions in an online fashion, trying to deal with fluctuations in agent communication. The first algorithm is more of theoretical value, as it assumes infinite storage to keep information about the message exchange history of agents, while the second algorithm is a refined version that works with finite storage and limited information. We describe these algorithms in detail, and provide proofs for their competitive ratio vs. an optimal oracle. In addition, we evaluate the performance of the proposed algorithms for different parameter settings through a series of simulated experiments, also comparing their results with those achieved by an optimal static placement that is computed with full (a posteriori) knowledge of the execution scenarios. Our theoretical and experimental results are a strong indication for the robustness and effectiveness of the proposed algorithms.     

New high accuracy CMOS current conveyors

In this paper, a new CMOS CCII⁺ is proposed. The circuit is characterized by high precision in voltage tracking and exhibits very low input resistance. An adaptive voltage offset cancellation methodology is introduced and then applied to the proposed circuit. As a result, a higher accuracy CCII⁺ is presented. For both circuits, the voltage offset cancellation is independent of the input current and voltage. To demonstrate the strength of the proposed architectures, fair comparisons with Liu and Yodprasit CCII realizations are held.     

Propagation Path Loss and Materials Insertion Loss in Indoor Environment at WiMAX Band of 3.3 to 3.6?GHz

The purpose of this study is to characterize the indoor channel for IEEE 802.16 (WiMAX) at 3.3?C3.6?GHz frequency. This work presents a channel model based on measurements conducted in commonly found scenarios in buildings. These scenarios include closed corridor, wide corridor and semi open corridor. Path loss equations are determined using log-distance path loss model and a Rayleigh multipath induced fading, Normal multipath induced fading or a combination of both. A numerical analysis of measurements in each scenario was conducted and the study determined equations that describe path loss for each scenario. Propagation loss is given for 300?MHz bandwidth. This work also represents the insertion loss of different materials and the obstruction loss due the existence of human beings between the transmitting antenna and the receiving one.