A chirp spread spectrum (CSS) system uses a chirp signal which changes the instantaneous frequency according to time for spreading a transmission bandwidth. In the CSS system, the transmission performance can be simply improved by increasing the time-bandwidth product which is known as the processing gain. However, increasing the transmission bandwidth is limited because of the spectrum regulation. In this letter, we propose a correlation-based chirp rate allocation method to improve the transmission performance by analyzing the cross-correlation coefficient in the same time-bandwidth product. In order to analyze the transmission performance of the proposed method, we analytically derive the cross-correlation coefficient according to the time-bandwidth separation product and simulate the transmission performance. The simulation results show that the proposed method can analytically allocate the optimal chirp rate and improve the transmission performance.

In this paper, we propose the application of principal component analysis (PCA) to scale-spaces. PCA is a standard method used in computer vision. Because the translation of an input image into scale-space is a continuous operation, it requires the extension of conventional finite matrix-based PCA to an infinite number of dimensions. Here, we use spectral theory to resolve this infinite eigenvalue problem through the use of integration, and we propose an approximate solution based on polynomial equations. In order to clarify its eigensolutions, we apply spectral decomposition to Gaussian scale-space and scale-normalized Laplacian of Gaussian (sLoG) space. As an application of this proposed method, we introduce a method for generating Gaussian blur images and sLoG images, demonstrating that the accuracy of such an image can be made very high by using an arbitrary scale calculated through simple linear combination. Furthermore, to make the scale-space filtering efficient, we approximate the basis filter set using Gaussian lobes approximation and we can obtain XY-Separable filters. As a more practical example, we propose a new Scale Invariant Feature Transform (SIFT) detector.

Compressed sensing (CS)-based wideband spectrum sensing has been a hot topic because it can cut high signal acquisition costs. However, using CS-based approaches, the spectral recovery requires large computational complexity. This letter proposes a wideband spectrum sensing algorithm based on multirate coprime sampling. It can detect the entire wideband directly from sub-Nyquist samples without spectral recovery, thus it brings a significant reduction of computational complexity. Compared with the excellent spectral recovery algorithm, i.e., orthogonal matching pursuit, our algorithm can maintain good sensing performance with computational complexity being several orders of magnitude lower.

In conventional spread spectrum (SS) watermarking schemes, random sequences are used for the modulation of watermark information. However, because of the mutual interference among those sequences, it requires complicated removal operation to improve the performance. In this paper, we propose an efficient spread spectrum watermarking scheme by introducing the orthogonal frequency divisiion multiplexing (OFDM) technique at the modulation of watermark information. The SS sequences in the proposed method are the DCT basic vectors modulated by a pseudo-random number (PN) sequence. We investigate the SS-based method considering the host interference at the blind detection scenario and analyze the noise caused by attacks. Because every operation is invertible, the quantization index modulation (QIM)-based method is applicable for the OFDM modulated signals. We also consider the property of watermark extracting operation in SS-based and QIM-based method and formalize their models of noisy channel in order to employ an error correcting code. The performance of their methods with error correcting code is numerically evaluated under the constraints of same distortion level in watermarked content. The experimental results indicated a criteria for the selection of SS-based and QIM-based methods for given content, which is determined by the amount of host interference. In case that the host interference is 0.8 times smaller than a watermark signal, the SS-based method is suitable. When it is 1.0 times larger, the QIM-based method should be selected.

Image-to-sound mapping is a technique that transforms an image to a sound signal, which is subsequently treated as a sound spectrogram. In general, the transformed sound differs from a human speech signal. Herein an efficient image-to-sound mapping method, which provides an understandable speech signal without any training, is proposed. To synthesize such a speech signal, the proposed method utilizes a multi-column image and a speech spectral phase that is obtained from a long-time observation of the speech. The original image can be retrieved from the sound spectrogram of the synthesized speech signal. The synthesized speech and the reconstructed image qualities are evaluated using objective tests.

Restoration is an important area in improving the visual quality, and lays the foundation for accurate object detection or terrain classification in image analysis. In this paper, we introduce Beta process priors into hierarchical sparse Bayesian learning for recovering underlying degraded hyperspectral images (HSI), including suppressing the various noises and inferring the missing data. The proposed method decomposes the HSI into the weighted summation of the dictionary elements, Gaussian noise term and sparse noise term. With these, the latent information and the noise characteristics of HSI can be well learned and represented. Solved by Gibbs sampler, the underlying dictionary and the noise can be efficiently predicted with no tuning of any parameters. The performance of the proposed method is compared with state-of-the-art ones and validated on two hyperspectral datasets, which are contaminated with the Gaussian noises, impulse noises, stripes and dead pixel lines, or with a large number of data missing uniformly at random. The visual and quantitative results demonstrate the superiority of the proposed method.

Protection of the licensed user (LU) and utilization of the spectrum are the most important goals in cognitive radio networks. To achieve the first goal, a cognitive user (CU) is required to sense for a longer time period, but this adversely affects the second goal, i.e., throughput or utilization of the network, because of the reduced time left for transmission in a time slot. This tradeoff can be controlled by simultaneous sensing and data transmission for the whole frame duration. However, increasing the sensing time to the frame duration consumes more energy. We propose a new frame structure in this paper, in which transmission is done for the whole frame duration whereas sensing is performed only until the required detection probability is satisfied. This means the CU is not required to perform sensing for the whole frame duration, and thus, conserves some energy by sensing for a smaller duration. With the proposed frame structure, throughput of all the CUs is estimated for the frame and, based on the estimated throughput and consumed energy in sensing and transmission, the energy efficient pair of CUs (transmitter and receiver) that maximizes system throughput by consuming less energy, is selected for a time slot. The selected CUs transmits data for the whole time slot, whereas sensing is performed only for certain duration. The performance improvement of the proposed scheme is demonstrated through simulations by comparing it with existing schemes.

This paper proposes a dynamic spectrum controlled (DSTC) channel allocation algorithm to increase the total throughput of satellite communication (SATCOM) systems. To effectively use satellite resources such as the satellite's maximum transponder bandwidth and maximum transmission power and to handle the propagation gain variation at all earth stations, the DSTC algorithm uses two new transmission techniques: spectrum compression and spectrum division. The algorithm controls various transmission parameters, such as the spectrum compression ratio, number of spectrum divisions, combination of modulation method and FEC coding rate (MODCOD), transmission power, and spectrum bandwidth to ensure a constant transmission bit rate under variable propagation conditions. Simulation results show that the DSTC algorithm achieves up to 1.6 times higher throughput than a simple MODCOD-based algorithm.

This paper presents a prototype of a 3D imaging step-frequency radar system at 10-20GHz suitable for the nondestructive inspection of the walls of wooden houses. Using this prototype, it is possible to obtain data for 3D imaging with a single simple scan and make 3D volume images of braces — broken or not — in the walls of wooden houses using synthetic aperture radar processing. The system is a multistatic radar composed of a one-dimensional array antenna (32 transmitting and 32 receiving antennas, which are resistively loaded printed bowtie antennas) and is able to acquire frequency domain data for all the transmitting and receiving antenna pairs, i.e., 32×32=1024 pairs, in 33ms per position. On the basis of comparisons between two array antenna prototype designs, we investigated the optimal distance between a transmitting array and a receiving array to reduce the direct coupling effect. We produced a prototype multistatic radar system and used it to measure different types of wooden targets in two experiments. In the first experiment, we measured plywood bars behind a decorated gypsum board, simulating a broken wooden brace inside a house wall. In the second experiment, we measured a wooden brace made of Japanese cypress as a target inside a model of a typical (wooden) Japanese house wall. The results of both experiments demonstrate the imaging capability of the radar prototype for nondestructive inspection of the insides of wooden house walls.

Compressed sensing (CS)-based wideband spectrum sensing approaches have attracted much attention because they release the burden of high signal acquisition costs. However, in CS-based sensing approaches, highly non-linear reconstruction methods are used for spectrum recovery, which require high computational complexity. This letter proposes a two-step compressive wideband sensing algorithm. This algorithm introduces a coarse sensing step to further compress the sub-Nyquist measurements before spectrum recovery in the following compressive fine sensing step, as a result of the significant reduction in computational complexity. Its enabled sufficient condition and computational complexity are analyzed. Even when the sufficient condition is just satisfied, the average reduced ratio of computational complexity can reach 50% compared with directly performing compressive sensing with the excellent algorithm that is used in our fine sensing step.

One of the major subjects for marine resources development and information processing is how to realize underwater short-range and large-capacity data transmissions. The acoustic wave is an effective carrier and has been used for underwater data transmissions because it has lower attenuation in seawater than the radio wave, and has average propagation distance of about 10km or more. However, along with the imaging of transmission data, the inherent low speed of the acoustic wave makes it cannot and become an ideal carrier for high-speed and large-capacity communications. On the other hand, visible-light wave with wavelength of 400nm-650nm is an ideal carrier, which has received much attention. Its attractive features are high transparency and low attenuation rate in underwater, easily control the propagation direction and range by the visibility, and high data rate and capacity, making it excellent for application in underwater wireless communications. However, visible-light waves in the seawater have the spectral attenuation characteristics due to different marine environment. Therefore, in this paper an underwater optical wireless communication method with adaptation seawater function is considered for seawater turbidity of the spatio-temporal change. Two crucial components in the underwater optical wireless communication system, the light wavelength and the modulation method are controlled using wavelength- and modulation-adaptation techniques, respectively. The effectiveness of the method of the adaptation wavelength is demonstrated in underwater optical image transmissions.

In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R=1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R=(n-1)/n. This implies that a rate R=1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R=1/n CC encoder from good PCC encoders with rate R=(n-1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R=1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.

High peak-to-average power ratio (PAPR) and spectral leakage are two main problems of orthogonal frequency division multiplexing (OFDM) systems. For alleviating the above problems, this paper proposes a joint model which efficiently suppresses both PAPR and spectral leakage, by combining serial peak cancellation (SPC) and time-domain N-continuous OFDM (TD-NC-OFDM) in an iterative way. Furthermore, we give an analytical expression of the proposed joint model to analyze the mutual effects between SPC and TD-NC-OFDM. Lastly, simulation results also support that the joint optimization model can obtain notable PAPR reduction and sidelobe suppression performance with low implementation cost.

The previous researches on the chaotic CDMA have theoretically derived the chaotic sequences having the minimum asynchronous cross-correlation. To minimize the asynchronous cross-correlation, autocorrelation of each sequence have to be C(τ)≈C×rτ, r=-2+√3, dumped oscillation with increase of the lag τ. There are several methods to generate such sequences, using a chaotic map, using the Lebesgue spectrum filter (LSF) and so on. In this paper, such lowest cross-correlation found in the chaotic CDMA researches is applied to solution search algorithms for combinatorial optimization problems. In combinatorial optimization, effectiveness of the chaotic search has already been clarified. First, an importance of chaos and autocorrelation with dumped oscillation for combinatorial optimization is shown. Next, in order to realize ideal solution search, the LSF is applied to the Hopfield-Tank neural network, the 2-opt method and the 2-exchange method. Effectiveness of the LSF is clarified even for the large problems for the traveling salesman problems and the quadratic assignment problems.

In the present paper we show how to obtain rapidly the spectral BRDF and BTDF of different display components or transparent displays using Fourier optics system under different illumination configurations. Results can be used to simulate the entire structure of a LCD display or to predict transparent display performances under various illuminations.

In this letter, we propose a novel discriminative representation for patterned fabric defect inspection when only limited negative samples are available. Fisher criterion is introduced into the loss function of deep learning, which can guide the learning direction of deep networks and make the extracted features more discriminating. A deep neural network constructed from the encoder part of trained autoencoders is utilized to classify each pixel in the images into defective or defectless categories, using as context a patch centered on the pixel. Sequentially the confidence map is processed by median filtering and binary thresholding, and then the defect areas are located. Experimental results demonstrate that our method achieves state-of-the-art performance on the benchmark fabric images.

This paper describes a novel harmonic-based robust voice activity detection (H-RVAD) method with harmonic spectral local peak (HSLP) feature. HSLP is extracted by spectral amplitude analysis between the adjacent formants, and such characteristic can be used to identify and verify audio stream containing meaningful human speech accurately in low SNR environment. And, an enhanced low SNR noisy speech recognition system framework with wakeup module, speech recognition module and confirmation module is proposed. Users can determine or reject the system feedback while a recognition result was given in the framework, to prevent any chance that the voiced noise misleads the recognition result. The H-RVAD method is evaluated by the AURORA2 corpus in eight types of noise and three SNR levels and increased overall average performance from 4% to 20%. In home noise, the performance of H-RVAD method can be performed from 4% to 14% sentence recognition rate in average.

To discuss whether rotational invariance is the main role in spectrogram features, new spectral features based on local normalized center moments, denoted by LNCMSF, are proposed. The proposed LNCMSF firstly adopts 2nd order normalized center moments to describe local energy distribution of the logarithmic energy spectrum, then normalized center moment spectrograms NC1 and NC2 are gained. Secondly, DCT (Discrete Cosine Transform) is used to eliminate the correlation of NC1 and NC2, then high order cepstral coefficients TNC1 and TNC2 are obtained. Finally, LNCMSF is generated by combining NC1, NC2, TNC1 and TNC2. The rotational invariance test experiment shows that the rotational invariance is not a necessary property in partial spectrogram features. The recognition experiment shows that the maximum UA (Unweighted Average of Class-Wise Recall Rate) of LNCMSF are improved by at least 10.7% and 1.2% respectively, compared to that of MFCC (Mel Frequency Cepstrum Coefficient) and HuWSF (Weighted Spectral Features Based on Local Hu Moments).

This paper describes a novel statistical bandwidth extension (BWE) technique based on a Gaussian mixture model (GMM) and a sub-band basis spectrum model (SBM), in which each dimensional component represents a specific acoustic space in the frequency domain. The proposed method can achieve the BWE from speech data with an arbitrary frequency bandwidth whereas the conventional methods perform the conversion from fixed narrow-band data. In the proposed method, we train a GMM with SBM parameters extracted from full-band spectra in advance. According to the bandwidth of input signal, the trained GMM is reconstructed to the GMM of the joint probability density between low-band SBM and high-band SBM components. Then high-band SBM components are estimated from low-band SBM components of the input signal based on the reconstructed GMM. Finally, BWE is achieved by adding the spectra decoded from estimated high-band SBM components to the ones of the input signal. To construct the full-band signal from the narrow-band one, we apply this method to log-amplitude spectra and aperiodic components. Objective and subjective evaluation results show that the proposed method extends the bandwidth of speech data robustly for the log-amplitude spectra. Experimental results also indicate that the aperiodic component extracted from the upsampled narrow-band signal realizes the same performance as the restored and the full-band aperiodic components in the proposed method.

This paper presents a weighted diversity combining technique for the cyclostationarity detection based spectrum sensing of orthogonal frequency division multiplexing signals in cognitive radio. In cognitive radio systems, secondary users must detect the desired signal in an extremely low signal-to-noise ratio (SNR) environment. In such an environment, multiple antenna techniques (space diversity) such as maximum ratio combining are not effective because the energy of the target signal is also extremely weak, and it is difficult to synchronize some received signals. The cyclic autocorrelation function (CAF) is used for traditional cyclostationarity detection based spectrum sensing. In the presented technique, the CAFs of the received signals are combined, while the received signals themselves are combined with general space diversity techniques. In this paper, the value of the CAF at peak and non-peak cyclic frequencies are computed, and we attempt to improve the sensing performance by using different weights for each CAF value. The results were compared with those from conventional methods and showed that the presented technique can improve the spectrum sensing performance.