图像通信业务的现状与发展方向

阐述了图像通信的业务涵盖范围及其技术发展现状，简要介绍了图像通信的发展方向，指出了图像通信产业发展面临的研究课题。     

2D Burgers equation with large Reynolds number using POD/DEIM and calibration

Model order reduction of the two‐dimensional Burgers equation is investigated. The mathematical formulation of POD/discrete empirical interpolation method (DEIM)‐reduced order model (ROM) is derived based on the Galerkin projection and DEIM from the existing high fidelity‐implicit finite‐difference full model. For validation, we numerically compared the POD ROM, POD/DEIM, and the full model in two cases of Re = 100 and Re = 1000, respectively. We found that the POD/DEIM ROM leads to a speed‐up of CPU time by a factor of O(10). The computational stability of POD/DEIM ROM is maintained by means of a careful selection of POD modes and the DEIM interpolation points. The solution of POD/DEIM in the case of Re = 1000 has an accuracy with error O(10^?3) versus O(10^?4) in the case of Re = 100 when compared with the high fidelity model. For this turbulent flow, a closure model consisting of a Tikhonov regularization is carried out in order to recover the missing information and is developed to account for the small‐scale dissipation effect of the truncated POD modes. It is shown that the computational results of this calibrated ROM exhibit considerable agreement with the high fidelity model, which implies the efficiency of the closure model used. Copyright © 2016 John Wiley & Sons, Ltd.     

TV2.0时代传统电视的变革及其发展趋势研究

TV2.0是一种全新的电视媒体信息传播理念,它强调收看形式或节目内容的互动性,使观众在看电视的过程中获得参与和分享,达到全新的个人体验,为此探讨了TV2.0时代传统电视的变革及其发展趋势。     

A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space

We propose a cubic regularization algorithm that is constructed to deal with nonconvex minimization problems in function space. It allows for a flexible choice of the regularization term and thus accounts for the fact that in such problems one often has to deal with more than one norm. Global and local convergence results are established in a general framework.     

A coefficient identification problem for a mathematical model related to ductal carcinoma in situ

We consider a coefficient identification problem for a mathematical model with free boundary related to ductal carcinoma in situ (DCIS). This inverse problem aims to determine the nutrient consumption rate from additional measurement data at a boundary point. We first obtain a global‐in‐time uniqueness of our inverse problem. Then based on the optimization method, we present a regularization algorithm to recover the nutrient consumption rate. Finally, our numerical experiment shows the effectiveness of the proposed numerical method.     

Oriented total variation l1/2 regularization

Total Variation (TV) is a widely used image restoration/decomposition model. It is observed that the classical TV l1 and TV l2 regularization, on the one hand, do not favor higher-gradient structures over lower-gradient details as expected for structure preserving image processing, and on the other hand, tend to reduce the horizontal and vertical gradients, and thus inevitably blur the oblique edges in images. In this paper, we address these two problems by defining Oriented Total Variation l1/2 (OTV l1/2). It is theoretically and experimentally demonstrated that applying l1/2 regularization to the directional derivatives of images leads to superior structure preservation. OTV l1/2 regularization can be applied to image denoising and video compression, and the experimental results verify that OTV l1/2 outperforms other similar models.     

Regularized inversion of the Laplace transform for series of experiments

Not only in low-field nuclear magnetic resonance, Laplace inversion is a relevant and challenging topic. Considerable conceptual and technical progress has been made, especially for the inversion of data encoding two decay dimensions. Distortion of spectra by overfitting of even moderate noise is counteracted requiring a priori smooth spectra. In this contribution, we treat the case of simple and fast one-dimensional decay experiments that are repeated many times in a series in order to study the evolution of a sample or process. Incorporating the a priori knowledge that also in the series dimension evolution should be smooth, peak position can be stabilized and resolution improved in the decay dimension. It is explained how the standard one-dimensional regularized Laplace inversion can be extended quite simply in order to include regularization in the series dimension. Obvious improvements compared with series of one-dimensional inversions are presented for simulated as well as experimental data. For the latter, comparison with multiexponential fitting is performed.     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.     

Convergence results for a self-dual regularization of convex problems

We study a one-parameter regularization technique for convex optimization problems whose main feature is self-duality with respect to the Legendre–Fenchel conjugation. The self-dual technique, introduced by Goebel, can be defined for both convex and saddle functions. When applied to the latter, we show that if a saddle function has at least one saddle point, then the sequence of saddle points of the regularized saddle functions converges to the saddle point of minimal norm of the original one. For convex problems with inequality and state constraints, we apply the regularization directly on the objective and constraint functions, and show that, under suitable conditions, the associated Lagrangians of the regularized problem hypo/epi-converge to the original Lagrangian, and that the associated value functions also epi-converge to the original one. Finally, we find explicit conditions ensuring that the regularized sequence satisfies Slater's condition.