← Search

Masao Yamagishi

14 accepted papers

2020

Exploiting Commutativity Condition for CP Decomposition Via Approximate Simultaneous Diagonalization

ICASSP 2020accepted

In this paper, we propose a novel strategy which utilizes an inherent algebraic property of simultaneously diagonalizable matrix tuples, i.e., commutativity, for both (i) reducing approximate CP decomposition of a higher-order tensor to Approximate Simultaneous Diagonalization (ASD) and (ii) solving…

Cited by 0SourceScholar
2019

An Alternating Projection Algorithm for Approximate Simultaneous Diagonalization

ICASSP 2019accepted

In this paper, we present a novel formulation of Approximate Simultaneous Diagonalization (ASD) with a nonconvex feasibility problem to find a structured low rank matrix whose building blocks are the Kronecker sums of given multiple matrices. To tackle this feasibility problem, we propose an alterna…

Cited by 0SourceScholar
2019

Convexity-edge-preserving Signal Recovery with Linearly Involved Generalized Minimax Concave Penalty Function

ICASSP 2019accepted

In this paper, we propose a new linearly involved convexity-preserving model for signal recovery by extending the idea in the generalized minimax concave (GMC) penalty [Se-lesnick' 17]. The proposed model can use nonconvex penalties but maintain the overall convexity and is applicable to much more g…

Cited by 0SourceScholar
2018

Alternating Minimization Approach for Identification of Piecewise Continuous Hammerstein Systems

ICASSP 2018accepted

Identification of piecewise continuous Hammerstein systems, which consist of the cascade of memoryless piecewise continuous systems followed by linear systems, is an important problem in engineering. In the identification process, major existing approaches approximate exact minimization of the non-c…

Cited by 0SourceScholar
2018

Automatic Shrinkage Tuning Robust to Input Correlation for Sparsity-Aware Adaptive Filtering

ICASSP 2018accepted

We propose a novel automatic shrinkage tuning technique for the adaptive proximal forward-backward splitting (APFBS) algorithm. The shrinkage tuning aims to choose an appropriate value of the shrinkage parameter and achieve minimal system mismatch as possible. The system mismatch is approximated bas…

Cited by 0SourceScholar
2017

Acceleration of Adaptive normalized quasi-Newton algorithm with improved upper bounds of the condition number

ICASSP 2017accepted

In 2013, Nguyen and Yamada proposed Adaptive normalized quasi-Newton algorithm and its adaptive step size for accurate and stable extraction of the first generalized eigenvector. The adaptive step size is determined by an upper bound of the condition number of a time-varying matrix. However, the emp…

Cited by 0SourceScholar
2017

An augmented Lagrangian algorithm for decomposition of symmetric tensors of order-4

ICASSP 2017accepted

Decomposition of symmetric tensors has found numerous applications in blind sources separation, blind identification, clustering, and analysis of social interactions. In this paper, we consider fourth order symmetric tensors, and its symmetric tensor decomposition. By imposing unit-length constraint…

Cited by 0SourceScholar
2017

Automatic shrinkage tuning based on a system-mismatch estimate for sparsity-aware adaptive filtering

ICASSP 2017accepted

Exploiting the sparsity in learning algorithms is a key to achieve excellent performances of adaptive filters. This can be realized by the adaptive proximal forward-backward splitting with carefully chosen parameters. In this paper, we propose an automatic parameter tuning based on a minimization pr…

Cited by 4SourceScholar
2017

Global behavior of parallel projection method for certain nonconvex feasibility problems

ICASSP 2017accepted

Finding a common point of multiple closed sets in a real Hilbert space has been an important task in a wide range of signal processing. In this paper, we study asymptotic properties of the parallel projection method (PPM) for closed sets satisfying a special feasibility condition, which holds in the…

Cited by 0SourceScholar
2016

A fast dual iterative algorithm for convexly constrained spline smoothing

ICASSP 2016accepted

This paper proposes fast iterative algorithms for solving convexly constrained spline smoothing through a characterization of solutions in a primal-dual space. In view of achievements for fast implementations of spline interpolation, the update of the proposed algorithm is designed as the compositio…

Cited by 2SourceScholar
2016

Image restoration using a stochastic variant of the alternating direction method of multipliers

ICASSP 2016accepted

We propose an efficient image restoration framework based on stochastic optimization. Image restoration usually requires some iterative methods for solving optimization problems that characterize restored images, where the multiplication of the observation matrix Φ ϵ Rm × n and variables has to be c…

Cited by 0SourceScholar
2016

Stabilization of adaptive eigenvector extraction by continuation in nested orthogonal complement structure

ICASSP 2016accepted

Nguyen and Yamada [NY'13] proposed an adaptive algorithm for fast and stable extraction of the first generalized Hermitian eigenvector and mentioned the extension to the first r generalized eigenvector extraction based on the nested orthogonal complement structure [NTY'12]. However, we recently foun…

Cited by 0SourceScholar
2015

A virtual resampling technique for algebraic two-dimensional phase unwrapping

ICASSP 2015accepted

Two-dimensional (2D) phase unwrapping is a reconstruction problem of a continuous phase, defined over 2D-domain, from its wrapped samples. In our previous work, we presented a two-step phase unwrapping algorithm which first constructs, as the real and imaginary parts of a complex function, a pair of…

Cited by 0SourceScholar
2015

Reduced-rank modeling of time-varying spectral patterns for supervised source separation

ICASSP 2015accepted

In this paper, we propose a new modeling technique of signals having time-varying spectral patterns for supervised source separation. Typical examples of such signals are instrumental sounds having several segments such as “attack” and “sustain”. In the proposed technique, a given signal is modeled…

Cited by 0SourceScholar