1-13hit |
Norisato SUGA Toshihiro FURUKAWA
In this letter, we show the new signal power estimation method base on the subspace projection. This work mainly contributes to the SINR estimation problem because, in this research, the signal power estimation is implicitly or explicitly performed. The difference between our method and the conventional method related to this topic is the exploitation of the subspace character of the signals constructing the observed signal. As tools to perform subspace operation, we apply orthogonal projection and oblique projection which can extracts desired parameters. In the proposed scheme, the statistics of the projected observed signal by these projection are used to estimate the parameters.
Nari TANABE Toshihiro FURUKAWA Kohichi SAKANIWA Shigeo TSUJII
We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.
Tomohiro TAKAHASHI Kazunori URUMA Katsumi KONISHI Toshihiro FURUKAWA
This letter deals with the signal declipping algorithm based on the matrix rank minimization approach, which can be applied to the signal restoration in linear systems. We focus on the null space of a low-rank matrix and provide a block adaptive algorithm of the matrix rank minimization approach to signal declipping based on the null space alternating optimization (NSAO) algorithm. Numerical examples show that the proposed algorithm is faster and has better performance than other algorithms.
Nari TANABE Toshihiro FURUKAWA Shigeo TSUJII
We propose a noise suppression algorithm with the Kalman filter theory. The algorithm aims to achieve robust noise suppression for the additive white and colored disturbance from the canonical state space models with (i) a state equation composed of the speech signal and (ii) an observation equation composed of the speech signal and additive noise. The remarkable features of the proposed algorithm are (1) applied to adaptive white and colored noises where the additive colored noise uses babble noise, (2) realization of high performance noise suppression without sacrificing high quality of the speech signal despite simple noise suppression using only the Kalman filter algorithm, while many conventional methods based on the Kalman filter theory usually perform the noise suppression using the parameter estimation algorithm of AR (auto-regressive) system and the Kalman filter algorithm. We show the effectiveness of the proposed method, which utilizes the Kalman filter theory for the proposed canonical state space model with the colored driving source, using numerical results and subjective evaluation results.
Ryohei SASAKI Katsumi KONISHI Tomohiro TAKAHASHI Toshihiro FURUKAWA
This letter deals with an audio declipping problem and proposes a multiple matrix rank minimization approach. We assume that short-time audio signals satisfy the autoregressive (AR) model and formulate the declipping problem as a multiple matrix rank minimization problem. To solve this problem, an iterative algorithm is provided based on the iterative partial matrix shrinkage (IPMS) algorithm. Numerical examples show its efficiency.
Kazunori URUMA Katsumi KONISHI Tomohiro TAKAHASHI Toshihiro FURUKAWA
This letter proposes a new image colorization algorithm based on the sparse optimization. Introducing some assumptions, a problem of recovering a color image from a grayscale image with the small number of known color pixels is formulated as a mixed l0/l1 norm minimization, and an iterative reweighted least squares (IRLS) algorithm is proposed. Numerical examples show that the proposed algorithm colorizes the grayscale image efficiently.
Norisato SUGA Toshihiro FURUKAWA
In this letter, we show the recursive representation of the optimum projection matrix. The recursive representation of the orthogonal projection and oblique projection have been done in past references. These projections are optimum when the noise is only characterized by the white noise or the structured noise. However, in some practical applications, a desired signal is deteriorated by both the white noise and structured noise. In this situation, the optimum projection matrix has been given by Behrens. For this projection matrix, the recursive representation has not been done. Therefore, in this letter, we propose the recursive representation of this projection matrix.
Tomohiro TAKAHASHI Katsumi KONISHI Kazunori URUMA Toshihiro FURUKAWA
This paper proposes an image inpainting algorithm based on multiple linear models and matrix rank minimization. Several inpainting algorithms have been previously proposed based on the assumption that an image can be modeled using autoregressive (AR) models. However, these algorithms perform poorly when applied to natural photographs because they assume that an image is modeled by a position-invariant linear model with a fixed model order. In order to improve inpainting quality, this work introduces a multiple AR model and proposes an image inpainting algorithm based on multiple matrix rank minimization with sparse regularization. In doing so, a practical algorithm is provided based on the iterative partial matrix shrinkage algorithm, with numerical examples showing the effectiveness of the proposed algorithm.
Taku NAKAHARA Kazunori URUMA Tomohiro TAKAHASHI Toshihiro FURUKAWA
Recently, the demand for the digitization of manga is increased. Then, in the case of an old manga where the original pictures have been lost, we have to digitize it from comics. However, the show-through phenomenon would be caused by scanning of the comics since it is represented as the double sided images. This letter proposes the manga show-through cancellation method based on the deep convolutional neural network (CNN). Numerical results show that the effectiveness of the proposed method.
Takahiro NATORI Nari TANABE Toshihiro FURUKAWA
This paper proposes the MIMO MC-CDMA channel estimation method for the various mobile environments. The distinctive feature of the proposed method is possible to robustly estimate with respect to the mobile velocity using the Kalman filter with the colored driving source. Effectiveness of the proposed method are shown by computer simulations.
Kazunori URUMA Katsumi KONISHI Tomohiro TAKAHASHI Toshihiro FURUKAWA
This letter deals with a sparse signal recovery problem and proposes a new algorithm based on the iterative reweighted least squares (IRLS) algorithm. We assume that the non-zero values of a sparse signal is always greater than a given constant and modify the IRLS algorithm to satisfy this assumption. Numerical results show that the proposed algorithm recovers a sparse vector efficiently.
Nari TANABE Toshihiro FURUKAWA Kohichi SAKANIWA Shigeo TSUJII
We have proposed in [5] a practical blind channel identification algorithm for the white observation noise. In this paper, we examine the effectiveness of the algorithm given in [5] for the colored observation noise. The proposed algorithm utilizes Gram-Schmidt orthogonalization procedure and estimates (1) the channel order, (2) the noise variance and then (3) the channel impulse response with less computational complexity compared to the conventional algorithms using eigenvalue decomposition. It can be shown through numerical examples that the algorithm proposed in [5] is quite effective in the colored noise case.
Kazuma SHIMADA Katsumi KONISHI Kazunori URUMA Tomohiro TAKAHASHI Toshihiro FURUKAWA
This paper deals with the problem of reconstructing a high-resolution digital image from a single low-resolution digital image and proposes a new intra-frame super-resolution algorithm based on the mixed lp/l1 norm minimization. Introducing some assumptions, this paper formulates the super-resolution problem as a mixed l0/l1 norm minimization and relaxes the l0 norm term to the lp norm to avoid ill-posedness. A heuristic iterative algorithm is proposed based on the iterative reweighted least squares (IRLS). Numerical examples show that the proposed algorithm achieves super-resolution efficiently.