Yun JIANG Huiyang LIU Xiaopeng JIAO Ji WANG Qiaoqiao XIA
In this letter, a novel projection algorithm is proposed in which projection onto a triangle consisting of the three even-vertices closest to the vector to be projected replaces check polytope projection, achieving the same FER performance as exact projection algorithm in both high-iteration and low-iteration regime. Simulation results show that compared with the sparse affine projection algorithm (SAPA), it can improve the FER performance by 0.2 dB as well as save average number of iterations by 4.3%.
Yuqiang ZHANG Huamin YANG Cheng HAN Chao ZHANG Chaoran ZHU
In this paper, we present a novel photometric compensation network named CASEformer, which is built upon the Swin module. For the first time, we combine coordinate attention and channel attention mechanisms to extract rich features from input images. Employing a multi-level encoder-decoder architecture with skip connections, we establish multiscale interactions between projection surfaces and projection images, achieving precise inference and compensation. Furthermore, through an attention fusion module, which simultaneously leverages both coordinate and channel information, we enhance the global context of feature maps while preserving enhanced texture coordinate details. The experimental results demonstrate the superior compensation effectiveness of our approach compared to the current state-of-the-art methods. Additionally, we propose a method for multi-surface projection compensation, further enriching our contributions.
This paper proposes an enhanced model of Random Projection Outlyingness (RPO) for unsupervised outlier detection. When datasets have multiple modalities, the RPOs have frequent detection errors. The proposed model deals with this problem via unsupervised clustering and a local score weighting. The experimental results demonstrate that the proposed model outperforms RPO and is comparable with other existing unsupervised models on benchmark datasets, in terms of in terms of Area Under the Curves (AUCs) of Receiver Operating Characteristic (ROC).
Yujin ZHENG Junwei ZHANG Yan LIN Qinglin ZHANG Qiaoqiao XIA
The Euclidean projection operation is the most complex and time-consuming of the alternating direction method of multipliers (ADMM) decoding algorithms, resulting in a large number of resources when deployed on hardware platforms. We propose a simplified line segment projection algorithm (SLSA) and present the hardware design and the quantization scheme of the SLSA. In simulation results, the proposed SLSA module has a better performance than the original algorithm with the same fixed bitwidths due to the centrosymmetric structure of SLSA. Furthermore, the proposed SLSA module with a simpler structure without hypercube projection can reduce time consuming by up to 72.2% and reduce hardware resource usage by more than 87% compared to other Euclidean projection modules in the experiments.
Rui JIANG Xiao ZHOU You Yun XU Li ZHANG
Millimeter wave (mmWave) massive Multiple-Input Multiple-Output (MIMO) systems generally adopt hybrid precoding combining digital and analog precoder as an alternative to full digital precoding to reduce RF chains and energy consumption. In order to balance the relationship between spectral efficiency, energy efficiency and hardware complexity, the hybrid-connected system structure should be adopted, and then the solution process of hybrid precoding can be simplified by decomposing the total achievable rate into several sub-rates. However, the singular value decomposition (SVD) incurs high complexity in calculating the optimal unconstrained hybrid precoder for each sub-rate. Therefore, this paper proposes PAST, a low complexity hybrid precoding algorithm based on projection approximate subspace tracking. The optimal unconstrained hybrid precoder of each sub-rate is estimated with the PAST algorithm, which avoids the high complexity process of calculating the left and right singular vectors and singular value matrix by SVD. Simulations demonstrate that PAST matches the spectral efficiency of SVD-based hybrid precoding in full-connected (FC), hybrid-connected (HC) and sub-connected (SC) system structure. Moreover, the superiority of PAST over SVD-based hybrid precoding in terms of complexity and increases with the number of transmitting antennas.
Hiroya YAMAMOTO Daichi KITAHARA Hiroki KURODA Akira HIRABAYASHI
This paper addresses single image super-resolution (SR) based on convolutional neural networks (CNNs). It is known that recovery of high-frequency components in output SR images of CNNs learned by the least square errors or least absolute errors is insufficient. To generate realistic high-frequency components, SR methods using generative adversarial networks (GANs), composed of one generator and one discriminator, are developed. However, when the generator tries to induce the discriminator's misjudgment, not only realistic high-frequency components but also some artifacts are generated, and objective indices such as PSNR decrease. To reduce the artifacts in the GAN-based SR methods, we consider the set of all SR images whose square errors between downscaling results and the input image are within a certain range, and propose to apply the metric projection onto this consistent set in the output layers of the generators. The proposed technique guarantees the consistency between output SR images and input images, and the generators with the proposed projection can generate high-frequency components with few artifacts while keeping low-frequency ones as appropriate for the known noise level. Numerical experiments show that the proposed technique reduces artifacts included in the original SR images of a GAN-based SR method while generating realistic high-frequency components with better PSNR values in both noise-free and noisy situations. Since the proposed technique can be integrated into various generators if the downscaling process is known, we can give the consistency to existing methods with the input images without degrading other SR performance.
Yujin ZHENG Yan LIN Zhuo ZHANG Qinglin ZHANG Qiaoqiao XIA
Linear programming (LP) decoding based on the alternating direction method of multipliers (ADMM) has proved to be effective for low-density parity-check (LDPC) codes. However, for high-density parity-check (HDPC) codes, the ADMM-LP decoder encounters two problems, namely a high-density check matrix in HDPC codes and a great number of pseudocodewords in HDPC codes' fundamental polytope. The former problem makes the check polytope projection extremely complex, and the latter one leads to poor frame error rates (FER) performance. To address these issues, we introduce the even vertex algorithm (EVA) into the ADMM-LP decoding algorithm for HDPC codes, named as HDPC-EVA. HDPC-EVA can reduce the complexity of the projection process and improve the FER performance. We further enhance the proposed decoder by the automorphism groups of codes, creating diversity in the parity-check matrix. The simulation results show that the proposed decoder is capable of cutting down the average decoding time for each iteration by 30%-60%, as well as achieving near maximum likelihood (ML) performance on some BCH codes.
Riku AKEMA Masao YAMAGISHI Isao YAMADA
Approximate Simultaneous Diagonalization (ASD) is a problem to find a common similarity transformation which approximately diagonalizes a given square-matrix tuple. Many data science problems have been reduced into ASD through ingenious modelling. For ASD, the so-called Jacobi-like methods have been extensively used. However, the methods have no guarantee to suppress the magnitude of off-diagonal entries of the transformed tuple even if the given tuple has an exact common diagonalizer, i.e., the given tuple is simultaneously diagonalizable. In this paper, to establish an alternative powerful strategy for ASD, we present a novel two-step strategy, called Approximate-Then-Diagonalize-Simultaneously (ATDS) algorithm. The ATDS algorithm decomposes ASD into (Step 1) finding a simultaneously diagonalizable tuple near the given one; and (Step 2) finding a common similarity transformation which diagonalizes exactly the tuple obtained in Step 1. The proposed approach to Step 1 is realized by solving a Structured Low-Rank Approximation (SLRA) with Cadzow's algorithm. In Step 2, by exploiting the idea in the constructive proof regarding the conditions for the exact simultaneous diagonalizability, we obtain an exact common diagonalizer of the obtained tuple in Step 1 as a solution for the original ASD. Unlike the Jacobi-like methods, the ATDS algorithm has a guarantee to find an exact common diagonalizer if the given tuple happens to be simultaneously diagonalizable. Numerical experiments show that the ATDS algorithm achieves better performance than the Jacobi-like methods.
Jonghyeok LEE Sunghyun HWANG Sungjin YOU Woo-Jin BYUN Jaehyun PARK
To estimate angle, velocity, and range information of multiple targets jointly in FMCW MIMO radar, two-dimensional (2D) MUSIC with matched filtering and FFT algorithm is proposed. By reformulating the received FMCW signal of the colocated MIMO radar, we exploit 2D MUSIC to estimate the angle and Doppler frequency of multiple targets. Then by using a matched filter together with the estimated angle and Doppler frequency and FFT operation, the range of the target is estimated. To effectively estimate the parameters of multiple targets with large distance differences, we also propose a successive interference cancellation method that uses the orthogonal projection. That is, rather than estimating the multiple target parameters simultaneously using 2D MUSIC, we estimate the target parameters sequentially, in which the parameters of the target having strongest reflected power are estimated first and then, their effect on the received signal is canceled out by using the orthogonal projection. Simulations verify the performance of the proposed algorithm.
Guodong SUN Zhen ZHOU Yuan GAO Yun XU Liang XU Song LIN
In this paper we design a fast fabric defect detection framework (Fast-DDF) based on gray histogram back-projection, which adopts end to end multi-convoluted network model to realize defect classification. First, the back-projection image is established through the gray histogram on fabric image, and the closing operation and adaptive threshold segmentation method are performed to screen the impurity information and extract the defect regions. Then, the defect images segmented by the Fast-DDF are marked and normalized into the multi-layer convolutional neural network for training. Finally, in order to solve the problem of difficult adjustment of network model parameters and long training time, some strategies such as batch normalization of samples and network fine tuning are proposed. The experimental results on the TILDA database show that our method can deal with various defect types of textile fabrics. The average detection accuracy with a higher rate of 96.12% in the database of five different defects, and the single image detection speed only needs 0.72s.
Zhangkai LUO Zhongmin PEI Bo ZOU
In this letter, a polarization filtering based transmission (PFBT) scheme is proposed to enhance the spectrum efficiency in wireless communications. In such scheme, the information is divided into several parts and each is conveyed by a polarized signal with a unique polarization state (PS). Then, the polarized signals are added up and transmitted by the dual-polarized antenna. At the receiver side, the oblique projection polarization filters (OPPFs) are adopted to separate each polarized signal. Thus, they can be demodulated separately. We mainly focus on the construction methods of the OPPF matrix when the number of the separate parts is 2 and 3 and evaluate the performance in terms of the capacity and the bit error rate. In addition, we also discuss the probability of the signal separation when the number of the separate parts is equal or greater than 4. Theoretical results and simulation results demonstrate the performance of the proposed scheme.
Yan LIN Qiaoqiao XIA Wenwu HE Qinglin ZHANG
Using linear programming (LP) decoding based on alternating direction method of multipliers (ADMM) for low-density parity-check (LDPC) codes shows lower complexity than the original LP decoding. However, the development of the ADMM-LP decoding algorithm could still be limited by the computational complexity of Euclidean projections onto parity check polytope. In this paper, we proposed a bisection method iterative algorithm (BMIA) for projection onto parity check polytope avoiding sorting operation and the complexity is linear. In addition, the convergence of the proposed algorithm is more than three times as fast as the existing algorithm, which can even be 10 times in the case of high input dimension.
Yuanlei QI Feiran YANG Ming WU Jun YANG
The blind multichannel identification is useful in many applications. Although many approaches have been proposed to address this challenging problem, the adaptive filtering-based methods are attractive due to their computational efficiency and good convergence property. The multichannel normalized least mean-square (MCNLMS) algorithm is easy to implement, but it converges very slowly for a correlated input. The multichannel affine projection algorithm (MCAPA) is thus proposed to speed up the convergence. However, the convergence of the MCNLMS and MCAPA is still unsatisfactory in practice. In this paper, we propose a time-domain Kalman filtering approach to the blind multichannel identification problem. Specifically, the proposed adaptive Kalman filter is based on the cross relation method and also uses more past input vectors to explore the decorrelation property. Simulation results indicate that the proposed method outperforms the MCNLMS and MCAPA significantly in terms of the initial convergence and tracking capability.
Affine projection sign algorithm (APSA) is an important adaptive filtering method to combat the impulsive noisy environment. However, the performance of APSA is poor, if its regularization parameter is not well chosen. We propose a variable regularization APSA (VR-APSA) approach, which adopts a gradient-based method to recursively reduce the norm of the a priori error vector. The resulting VR-APSA leverages the time correlation of both the input signal matrix and error vector to adjust the value of the regularization parameter. Simulation results confirm that our algorithm exhibits both fast convergence and small misadjustment properties.
Wei JHANG Shiaw-Wu CHEN Ann-Chen CHANG
This letter presents an efficient hybrid direction of arrival (DOA) estimation scheme for massive uniform linear array. In this scheme, the DOA estimator based on a discrete Fourier transform (DFT) is first applied to acquire coarse initial DOA estimates for single data snapshot. And then, the fine DOA is accurately estimated through using the iterative search estimator within a very small region. It iteratively searches for correct DOA vector by minimizing the objective function using a Taylor series approximation of the DOA vector with the one initially estimated. Since the proposed scheme does not need to perform eigen-decomposition and spectrum search while maintaining better DOA estimates, it also has low complexity and real-time capability. Simulation results are presented to demonstrate the efficiency of the proposed scheme.
Liqing SHAN Shexiang MA Xin MENG Long ZHOU
In order to solve the problem in Automatic Identification System (AIS) that the signal in the target slot cannot be correctly received due to partial overlap of signals in adjacent time slots, the paper introduces a new criterion: maximum expected signal power (MESP) and proposes a novel beamforming algorithm based on generalized singular value decomposition (GSVD) and orthogonal projection. The algorithm employs GSVD to estimate the signal subspace, and adopts orthogonal projection to project the received signal onto the orthogonal subspace of the non-target signal. Then, beamforming technique is used to maximize the output power of the target signal on the basis of MESP. Theoretical analysis and simulation results show the effectiveness of the proposed algorithm.
In this paper, we propose a novel algorithm called multi-projection ensemble discriminant clustering (MPEDC) for JPEG steganalysis. The scheme makes use of the optimal projection of linear discriminant analysis (LDA) algorithm to get more projection vectors by using the micro-rotation method. These vectors are similar to the optimal vector. MPEDC combines unsupervised K-means algorithm to make a comprehensive decision classification adaptively. The power of the proposed method is demonstrated on three steganographic methods with three feature extraction methods. Experimental results show that the accuracy can be improved using iterative discriminant classification.
Yong-Uk YOON Yong-Jo AHN Donggyu SIM Jae-Gon KIM
In this letter, methods of inactive regions padding for Segmented Sphere Projection (SSP) of 360 videos are proposed. A 360 video is projected onto a 2D plane to be coded with diverse projection formats. Some projection formats have inactive regions in the converted 2D plane such as SSP. The inactive regions may cause visual artifacts as well as coding efficiency decrease due to discontinuous boundaries between active and inactive regions. In this letter, to improve coding efficiency and reduce visual artifacts, the inactive regions are padded by using two types of adjacent pixels in either rectangular-face or circle-face boundaries. By padding the inactive regions with the highly correlated adjacent pixels, the discontinuities between active and inactive regions are reduced. The experimental results show that, in terms of end-to-end Weighted to Spherically uniform PSNR (WS-PSNR), the proposed methods achieve 0.3% BD-rate reduction over the existing padding method for SSP. In addition, the visual artifacts along the borders between discontinuous faces are noticeably reduced.
Dual-motor driving servo systems are widely used in many military and civil fields. Since backlash nonlinearity affects the dynamic performance and steady-state tracking accuracy of these systems, it is necessary to study a control strategy to reduce its adverse effects. We first establish the state-space model of a system. To facilitate the design of the controller, we simplify the model based on the state-space model. Then, we design an adaptive controller combining a projection algorithm with dynamic surface control applied to a dual-motor driving servo system, which we believe to be the first, and analyze its stability. Simulation results show that projection algorithm-based dynamic surface control has smaller tracking error, faster tracking speed, and better robustness and stability than mere dynamic surface control. Finally, the experimental analysis validates the effectiveness of the proposed control algorithm.
In this Letter, a robust variable step-size affine-projection subband adaptive filter algorithm (RVSS-APSAF) is proposed, whereby a band-dependent variable step-size is introduced to improve convergence and misalignment performances in impulsive noise environments. Specifically, the weight vector is adaptively updated to achieve robustness against impulsive noises. Finally, the proposed RVSS-APSAF algorithm is tested for system identification in an impulsive noise environment.