Coalgebra and coinduction provide new results and insights for the supervisory control of discrete-event systems (DES) with partial observations. In the case of full observations, coinduction has been used to define a new operation on languages called supervised product, which represents the tuple of languages of the supervised system. The first language acts as a supervisor and the second as a...

The idea of video super resolution is to use the temporal information of seeing a scene from many slightly different viewpoints in the successive frames of a video to enhance the overall resolution and quality of each frame. Classical energy minimization approaches first establish a correspondence of the current video frame to several of its neighbors and then use this temporal information to e...

We present formulae relating controllability, observability, and co-observability arising in the context of supervisory control of discrete event systems. Given a discrete event plant G with event set Σ, uncontrollable event set Σui, and observation mask Mi of the ith supervisor, we first show that the infimal prefix-closed, (L(G), ⋂ i Σui)controllable, and (L(G),Σui,Mi)–co-observable superlang...

The purpose of this work is to develop and study a decentralized strategy for Pareto optimization an aggregate cost consisting regularized risks. Each risk modeled as the expectation some loss function with unknown probability distribution while regularizers are assumed deterministic, but not required be differentiable or even continuous. individual, regularized, functions distributed across st...

Total Generalized Variation (TGV) regularization in image reconstruction relies on an infimal convolution type combination of generalized first- and second-order derivatives. This helps to avoid the staircasing effect (TV) regularization, while still preserving sharp contrasts images. The associated crucially hinges two parameters whose proper adjustment represents a challenging task. In this w...

In many applications, one deals with nonsmooth functions, e.g., in dynamical systems, mechanics, or optimization. order to establish theoretical results, it is often beneficial regularize the functions an intermediate step. this work, we investigate properties of a generalization Moreau–Yosida regularization on normed space where replace quadratic kernel infimal convolution more general functio...

Non-convex sparsity-inducing penalties outperform their convex counterparts, but generally sacrifice the cost function convexity. As a middle ground, we propose sharpening sparse regularizers (SSR) framework to design non-separable non-convex that induce sparsity more effectively than such as l <sub...

We provide a version of Korovkin-type theorems for monotone sublinear operators in vector lattices&#x0D; and discuss the possibilities further extensions generalizations. &#x0D; .

In this paper, we propose new operator-splitting algorithms for the total variation regularized infimal convolution (TV-IC) model [6] in order to remove mixed Poisson-Gaussian (MPG) noise. existing splitting algorithm TV-IC, an inner loop by Newton method had be adopted one nonlinear optimization subproblem, which increased computation cost per outer loop. By introducing a bilinear constraint a...