Sorry, you need to enable JavaScript to visit this website.

Face aging is of great importance for cross-age recognition and entertainment-related applications. Recently, conditional generative adversarial networks (cGANs) have achieved impressive results for facial aging. Existing cGANs-based methods usually require a pixel-wise loss to keep the identity and background consistent. However, minimizing the pixel-wise loss between the input and synthesized images likely resulting in a ghosted or blurry face.

While convolutional neural nets (CNN) have achieved remarkable performance for a wide range of inverse imaging applications, the filter coefficients are computed in a purely data-driven manner and are not explainable. Inspired by an analytically derived CNN by Hadji et al., in this paper we construct a new layered graph convolutional neural net (GCNN) using GraphBio as our graph filter.

We propose a novel problem formulation for sparsity-aware adaptive filtering based on the nonconvex minimax concave (MC) penalty, aiming to obtain a sparse solution with small estimation bias. We present two algorithms: the first algorithm uses a single firm-shrinkage operation, while the second one uses double soft-shrinkage operations. The twin soft-shrinkage operations compensate each other, promoting sparsity while avoiding a serious increase of biases. The whole cost function is convex in certain parameter settings, while the instantaneous cost function is always nonconvex.

In this paper we consider the problem of recovering a signal x of size N from noisy and compressed measurements y = A x + w of size M, where the measurement matrix A is right-orthogonally invariant (ROI). Vector Approximate Message Passing (VAMP) demonstrates great reconstruction results for even highly ill-conditioned matrices A in relatively few iterations. However, performing each iteration is challenging due to either computational or memory point of view.

Naturalistic speech recordings usually contain speech signals from multiple speakers. This phenomenon can degrade the performance of speech technologies due to the complexity of tracing and recognizing individual speakers. In this study, we investigate the detection of overlapping speech on segments as short as 25 ms using Convolutional Neural Networks. We evaluate the detection performance using different spectral features, and show that pyknogram features outperforms other commonly used speech features.

Economic and financial decision-making may cause a significant impact on government, society, and industries. Due to the increasing volume of data, decision science has become an interdisciplinary field of study, supported by efficient methods and models of data analysis. Our contributions lie exactly in the intersection of signal processing, tensorial algebra, and decision science. More precisely, we introduce a novel approach in which the data taken into account in the decision process is modeled as a tensor.