Chao XU Yunfeng YAN Lehangyu YANG Sheng LI Guorui FENG
The altered fingerprints help criminals escape from police and cause great harm to the society. In this letter, an altered fingerprint detection method is proposed. The method is constructed by two deep convolutional neural networks to train the time-domain and frequency-domain features. A spectral attention module is added to connect two networks. After the extraction network, a feature fusion module is then used to exploit relationship of two network features. We make ablation experiments and add the module proposed in some popular architectures. Results show the proposed method can improve the performance of altered fingerprint detection compared with the recent neural networks.
Jaeseong JEONG Chang Heon KIM Namhun KOO Soonhak KWON Sumin LEE
The differential uniformity, the boomerang uniformity, and the extended Walsh spectrum etc are important parameters to evaluate the security of S (substitution)-box. In this paper, we introduce efficient formulas to compute these cryptographic parameters of permutation polynomials of the form xrh(x(2n-1)/d) over a finite field of q=2n elements, where r is a positive integer and d is a positive divisor of 2n-1. The computational cost of those formulas is proportional to d. We investigate differentially 4-uniform permutation polynomials of the form xrh(x(2n-1)/3) and compute the boomerang spectrum and the extended Walsh spectrum of them using the suggested formulas when 6≤n≤12 is even, where d=3 is the smallest nontrivial d for even n. We also investigate the differential uniformity of some permutation polynomials introduced in some recent papers for the case d=2n/2+1.
Lu ZHANG Chengqun WANG Mengyuan FANG Weiqiang XU
To solve the problem of metamerism in the color reproduction process, various spectral reflectance reconstruction methods combined with neural network have been proposed in recent years. However, these methods are generally sensitive to initial values and can easily converge to local optimal solutions, especially on small data sets. In this paper, we propose a spectral reflectance reconstruction algorithm based on the Back Propagation Neural Network (BPNN) and an improved Sparrow Search Algorithm (SSA). In this algorithm, to solve the problem that BPNN is sensitive to initial values, we propose to use SSA to initialize BPNN, and we use the sine chaotic mapping to further improve the stability of the algorithm. In the experiment, we tested the proposed algorithm on the X-Rite ColorChecker Classic Mini Chart which contains 24 colors, the results show that the proposed algorithm has significantly better performance compared to other algorithms and moreover it can meet the needs of spectral reflectance reconstruction on small data sets. Code is avaible at https://github.com/LuraZhang/spectral-reflectance-reconsctuction.
Wanghan LV Lihong HU Weijun ZENG Huali WANG Zhangkai LUO
As known to us all, L-shaped co-prime array (LCA) is a recently introduced two-dimensional (2-D) sparse array structure, which is extended from linear co-prime array (CA). Such sparse array geometry can be used for 2-D parameters estimation with higher degrees-of-freedom (DOF). However, in the scenario where several narrowband transmissions spread over a wide spectrum, existing technique based on LCA with Nyquist sampling may encounter a bottleneck for both analog and digital processing. To alleviate the burden of high-rate Nyquist sampling, a method of joint wideband spectrum and direction-of-arrival (DOA) estimation with compressed sampling based on LCA, which is recognized as LCA-based modulated wideband converter (MWC), is presented in this work. First, the received signal along each antenna is mixed to basebands, low-pass filtered and down-sampled to get the compressed sampling data. Then by constructing the virtual received data of 2-D difference coarray, we estimate the wideband spectrum and DOA jointly using two recovery methods where the first is a joint ESPRIT method and the other is a joint CS method. Numerical simulations illustrate the validity of the proposed LCA based MWC system and show the superiority.
Tomoyuki FURUICHI Mizuki MOTOYOSHI Suguru KAMEDA Takashi SHIBA Noriharu SUEMATSU
To reduce the complexity of direct radio frequency (RF) undersampling real-time spectrum monitoring in wireless Internet of Things (IoT) bands (920MHz, 2.4GHz, and 5 GHz bands), a design method of sampling frequencies is proposed in this paper. The Direct RF Undersampling receiver architecture enables the use of ADC with sampling clock lower frequency than receiving RF signal, but it needs RF signal identification signal processing from folded spectrums with multiple sampling clock frequencies. The proposed design method allows fewer sampling frequencies to be used than the conventional design method for continuous frequency range (D.C. to 5GHz-band). The proposed method reduced 2 sampling frequencies in wireless IoT bands case compared with the continuous range. The design result using the proposed method is verified by measurement.
The energy efficiency of intelligent reflecting surface (IRS) enabled internet of things (IoT) networks is studied in this letter. The energy efficiency is mathematically expressed, respectively, as the number of reflecting elements and the spectral efficiency of the network and is shown to scale in the logarithm of the reflecting elements number in the high regime of transmit power from source node. Furthermore, it is revealed that the energy efficiency scales linearly over the spectral efficiency in the high regime of transmit power, in contrast to conventional studies on energy and spectral efficiency trade-offs in the non-IRS wireless IoT networks. Numerical simulations are carried out to verify the derived results for the IRS enabled IoT networks.
Xueyan ZHANG Libin QU Zhangkai LUO
Coprime (pair of) DFT filter banks (coprime DFTFB), which process signals like a spectral analyzer in time domain, divides the power spectrum equally into MN bands by employing two DFT filter banks (DFTFBs) of size only M and N respectively, where M and N are coprime integers. With coprime DFTFB, frequencies in wide sense stationary (WSS) signals can be effectively estimated with a much lower sampling rates than the Nyquist rates. However, the imperfection of practical FIR filter and the correlation based detection mode give rise to two kinds of spurious peaks in power spectrum estimation, that greatly limit the application of coprime DFTFB. Through detailed analysis of the spurious peaks, this paper proposes a modified spectral analyzer based on dual coprime DFTFBs and sub-decimation, which not only depresses the spurious peaks, but also improves the frequency estimation accuracy. The mathematical principle proof of the proposed spectral analyzer is also provided. In discussion of simultaneous signals detection, an O-extended MN-band coprime DFTFB (OExt M-N coprime DFTFB) structure is naturally deduced, where M, N, and O are coprime with each other. The original MN-band coprime DFTFB (M-N coprime DFTFB) can be seen a special case of the OExt M-N coprime DFTFB with extending factor O equals ‘1’. In the numerical simulation section, BPSK signals with random carrier frequencies are employed to test the proposed spectral analyzer. The results of detection probability versus SNR curves through 1000 Monte Carlo experiments verify the effectiveness of the proposed spectrum analyzer.
This article proposes to apply the auto-correlation function (ACF), bispectrum analysis, and convolutional neural networks (CNN) to implement radar emitter identification (REI) based on intrapulse features. In this work, we combine ACF with bispectrum for signal feature extraction. We first calculate the ACF of each emitter signal, and then the bispectrum of the ACF and obtain the spectrograms. The spectrum images are taken as the feature maps of the radar emitters and fed into the CNN classifier to realize automatic identification. We simulate signal samples of different modulation types in experiments. We also consider the feature extraction method directly using bispectrum analysis for comparison. The simulation results demonstrate that by combining ACF with bispectrum analysis, the proposed scheme can attain stronger robustness to noise, the spectrograms of our approach have more pronounced features, and our approach can achieve better identification performance at low signal-to-noise ratios.
Kosei OZEKI Naofumi AOKI Saki ANAZAWA Yoshinori DOBASHI Kenichi IKEDA Hiroshi YASUDA
This study has developed a system that performs data communications using high frequency bands of sound signals. Unlike radio communication systems using advanced wireless devices, it only requires the legacy devices such as microphones and speakers employed in ordinary telephony communication systems. In this study, we have investigated the possibility of a machine learning approach to improve the recognition accuracy identifying binary symbols exchanged through sound media. This paper describes some experimental results evaluating the performance of our proposed technique employing a neural network as its classifier of binary symbols. The experimental results indicate that the proposed technique may have a certain appropriateness for designing an optimal classifier for the symbol identification task.
Yoji UESUGI Keita KATAGIRI Koya SATO Kei INAGE Takeo FUJII
This paper proposes a measurement-based spectrum database (MSD) with clustered fading distributions toward greater storage efficiencies. The conventional MSD can accurately model the actual characteristics of multipath fading by plotting the histogram of instantaneous measurement data for each space-separated mesh and utilizing it in communication designs. However, if the database contains all of a distribution for each location, the amount of data stored will be extremely large. Because the main purpose of the MSD is to improve spectral efficiency, it is necessary to reduce the amount of data stored while maintaining quality. The proposed method reduces the amount of stored data by estimating the distribution of the instantaneous received signal power at each point and integrating similar distributions through clustering. Numerical results show that clustering techniques can reduce the amount of data while maintaining the accuracy of the MSD. We then apply the proposed method to the outage probability prediction for the instantaneous received signal power. It is revealed that the prediction accuracy is maintained even when the amount of data is reduced.
Takashi SHIBA Tomoyuki FURUICHI Mizuki MOTOYOSHI Suguru KAMEDA Noriharu SUEMATSU
We propose a spectrum regeneration and demodulation method for multiple direct RF undersampled real signals by using a new algorithm. Many methods have been proposed to regenerate the RF spectrum by using undersampling because of its simple circuit architecture. However, it is difficult to regenerate the spectrum from a real signal that has a band wider than a half of the sampling frequency, because it is difficult to include complex conjugate relation of the folded spectrum into the linear algebraic equation in this case. We propose a new spectrum regeneration method from direct undersampled real signals that uses multiple clocks and an extended algorithm considering the complex conjugate relation. Simulations are used to verify the potential of this method. The validity of the proposed method is verified by using the simulation data and the measured data. We also apply this algorithm to the demodulation system.
Zihang SONG Yue GAO Rahim TAFAZOLLI
Cognitive radio provides a feasible solution for alleviating the lack of spectrum resources by enabling secondary users to access the unused spectrum dynamically. Spectrum sensing and learning, as the fundamental function for dynamic spectrum sharing in 5G evolution and 6G wireless systems, have been research hotspots worldwide. This paper reviews classic narrowband and wideband spectrum sensing and learning algorithms. The sub-sampling framework and recovery algorithms based on compressed sensing theory and their hardware implementation are discussed under the trend of high channel bandwidth and large capacity to be deployed in 5G evolution and 6G communication systems. This paper also investigates and summarizes the recent progress in machine learning for spectrum sensing technology.
Atomu SAKAI Keiichi MIZUTANI Takeshi MATSUMURA Hiroshi HARADA
The Dynamic Spectrum Sharing (DSS) system, which uses the frequency band allocated to incumbent systems (i.e., primary users) has attracted attention to expand the available bandwidth of the fifth-generation mobile communication (5G) systems in the sub-6GHz band. In Japan, a DSS system in the 2.3GHz band, in which the ARIB STD-B57-based Field Pickup Unit (FPU) is assigned as an incumbent system, has been studied for the secondary use of 5G systems. In this case, the incumbent FPU is a mobile system, and thus, the DSS system needs to use not only a spectrum sharing database but also radio sensors to detect primary signals with high accuracy, protect the primary system from interference, and achieve more secure spectrum sharing. This paper proposes highly efficient sensing methods for detecting the ARIB STD-B57-based FPU signals in the 2.3GHz band. The proposed methods can be applied to two types of the FPU signal; those that apply the Continuous Pilot (CP) mode pilot and the Scattered Pilot (SP) mode pilot. Moreover, we apply a sample addition method and a symbol addition method for improving the detection performance. Even in the 3GPP EVA channel environment, the proposed method can, with a probability of more than 99%, detect the FPU signal with an SNR of -10dB. In addition, we propose a quantized reference signal for reducing the implementation complexity of the complex cross-correlation circuit. The proposed reference signal can reduce the number of quantization bits of the reference signal to 2 bits for in-phase and 3 bits for orthogonal components.
Hiroyuki SHINBO Kousuke YAMAZAKI Yoji KISHI
To achieve highly efficient spectrum usage, dynamic sharing of scarce spectrum resources has recently become the subject of intense discussion. The technologies of dynamic spectrum sharing (DSS) have already been adopted or are scheduled to be adopted in a number of countries, and Japan is no exception. The authors and organizations collaborating in the research and development project being undertaken in Japan have studied a novel DSS system positioned between the fifth-generation mobile communication system (5G system) and different incumbent radio systems. Our DSS system has three characteristics. (1) It detects dynamically unused sharable spectrums (USSs) of incumbent radio systems for the space axis by using novel propagation models and estimation of the transmitting location with radio sensor information. (2) It manages USSs for the time axis by interference calculation with propagation parameters, fair assignment and future usage of USSs. (3) It utilizes USSs for the spectrum axis by using methods that decrease interference for lower separation distances. In this paper, we present an overview and the technologies of our DSS system and its applications in Japan.
Chao WANG Michihiko OKUYAMA Ryo MATSUOKA Takahiro OKABE
Water detection is important for machine vision applications such as visual inspection and robot motion planning. In this paper, we propose an approach to per-pixel water detection on unknown surfaces with a hyperspectral image. Our proposed method is based on the water spectral characteristics: water is transparent for visible light but translucent/opaque for near-infrared light and therefore the apparent near-infrared spectral reflectance of a surface is smaller than the original one when water is present on it. Specifically, we use a linear combination of a small number of basis vector to approximate the spectral reflectance and estimate the original near-infrared reflectance from the visible reflectance (which does not depend on the presence or absence of water) to detect water. We conducted a number of experiments using real images and show that our method, which estimates near-infrared spectral reflectance based on the visible spectral reflectance, has better performance than existing techniques.
This paper presents an efficient method for solving PnP, PnPf, and PnPfr problems, which are the problems of determining camera parameters from 2D-3D point correspondences. The proposed method is derived based on a simple usage of linear algebra, similarly to the classical DLT methods. Therefore, the new method is easier to understand, easier to implement, and several times faster than the state-of-the-art methods using Gröbner basis. Contrary to the existing Gröbner basis methods, the proposed method consists of three algorithms depending on the number of the points and the 3D point configuration. Experimental results show that the proposed method is as accurate as the state-of-the-art methods even in near-planar scenes while achieving up to three times faster.
Takashi YASUI Jun-ichiro SUGISAKA Koichi HIRAYAMA
In this study, we conduct guided mode analyses for chalcogenide glass channel waveguides using As2Se3 core and As2S3 lower cladding to determine their single-mode conditions across the astronomical N-band (8-12µm). The results reveal that a single-mode operation over the band can be achieved by choosing a suitable core-thickness.
Takaaki SAEKI Yuki SAITO Shinnosuke TAKAMICHI Hiroshi SARUWATARI
This paper proposes two high-fidelity and computationally efficient neural voice conversion (VC) methods based on a direct waveform modification using spectral differentials. The conventional spectral-differential VC method with a minimum-phase filter achieves high-quality conversion for narrow-band (16 kHz-sampled) VC but requires heavy computational cost in filtering. This is because the minimum phase obtained using a fixed lifter of the Hilbert transform often results in a long-tap filter. Furthermore, when we extend the method to full-band (48 kHz-sampled) VC, the computational cost is heavy due to increased sampling points, and the converted-speech quality degrades due to large fluctuations in the high-frequency band. To construct a short-tap filter, we propose a lifter-training method for data-driven phase reconstruction that trains a lifter of the Hilbert transform by taking into account filter truncation. We also propose a frequency-band-wise modeling method based on sub-band multi-rate signal processing (sub-band modeling method) for full-band VC. It enhances the computational efficiency by reducing sampling points of signals converted with filtering and improves converted-speech quality by modeling only the low-frequency band. We conducted several objective and subjective evaluations to investigate the effectiveness of the proposed methods through implementation of the real-time, online, full-band VC system we developed, which is based on the proposed methods. The results indicate that 1) the proposed lifter-training method for narrow-band VC can shorten the tap length to 1/16 without degrading the converted-speech quality, and 2) the proposed sub-band modeling method for full-band VC can improve the converted-speech quality while reducing the computational cost, and 3) our real-time, online, full-band VC system can convert 48 kHz-sampled speech in real time attaining the converted speech with a 3.6 out of 5.0 mean opinion score of naturalness.
Zhen LI Baojun ZHAO Wenzheng WANG Baoxian WANG
Hyperspectral images (HSIs) are generally susceptible to various noise, such as Gaussian and stripe noise. Recently, numerous denoising algorithms have been proposed to recover the HSIs. However, those approaches cannot use spectral information efficiently and suffer from the weakness of stripe noise removal. Here, we propose a tensor decomposition method with two different constraints to remove the mixed noise from HSIs. For a HSI cube, we first employ the tensor singular value decomposition (t-SVD) to effectively preserve the low-rank information of HSIs. Considering the continuity property of HSIs spectra, we design a simple smoothness constraint by using Tikhonov regularization for tensor decomposition to enhance the denoising performance. Moreover, we also design a new unidirectional total variation (TV) constraint to filter the stripe noise from HSIs. This strategy will achieve better performance for preserving images details than original TV models. The developed method is evaluated on both synthetic and real noisy HSIs, and shows the favorable results.
Yusuke SAKUMOTO Hiroyuki OHSAKI
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple random walks theoretically to attain a deep understanding of their characteristics. The first meeting time is one of the important metrics for multiple random walks. The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in a graph. This time is closely related to the rendezvous problem, a fundamental problem in computer science. The first meeting time of multiple random walks has been analyzed previously, but many of these analyses focused on regular graphs. In this paper, we analyze the first meeting time of multiple random walks in arbitrary graphs and clarify the effects of graph structures on expected values. First, we derive the spectral formula of the expected first meeting time on the basis of spectral graph theory. Then, we examine the principal component of the expected first meeting time using the derived spectral formula. The clarified principal component reveals that (a) the expected first meeting time is almost dominated by $n/(1+d_{ m std}^2/d_{ mavg}^2)$ and (b) the expected first meeting time is independent of the starting nodes of random walkers, where n is the number of nodes of the graph. davg and dstd are the average and the standard deviation of weighted node degrees, respectively. Characteristic (a) is useful for understanding the effect of the graph structure on the first meeting time. According to the revealed effect of graph structures, the variance of the coefficient dstd/davg (degree heterogeneity) for weighted degrees facilitates the meeting of random walkers.