Total variation minimization has been extensively researched for image denoising and sparse view reconstruction. These methods show superior denoising performance for simple images with little texture, but result in texture information loss when applied to more complex images. It could thus be beneficial to use other regularizers within medical imaging. We propose a general regularization metho...

We propose a convex variational approach to space-time reconstruction which estimates surface normal information and integrates it into the photoconsistency estimation as well as into an anisotropic spatio-temporal total variation regularization. As such the proposed method generalizes the works [4], [5]. Although [4] already studied anisotropic regularization they did not estimate normals but ...

In order to investigate the influence of the stiffness of the compliant prismatic pair, a planar four-bar parallelogram, in a fully compliant parallel mechanism, the stiffness model of the passive compliant prismatic pair in a compliant parallel positioning stage is established using the compliant matrix method and matrix transformation. The influences of the constraints and the compliance of t...

Person re-identification (re-id) is to match people across disjoint camera views in a multi-camera system, and re-id has been an important technology applied in smart city in recent years. However, the majority of existing person re-id methods are not designed for processing sequential data in an online way. This ignores the real-world scenario that person images detected from multi-cameras sys...

The patterns of inter- and intra-regional variation among 12 major geographical groups from around the world were investigated based on 15 nonmetric dental traits. The R-matrix method was applied using a pooled within-group variance-covariance matrix estimated with the maximum likelihood method (tetrachoric correlation matrix) and the threshold value for each trait estimated by univariate probi...

In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post’s correspondence problem to be undecidable and show its application to matrix semigroup problems, such as Any Diagonal Matrix Problem and Recurrent Matrix Problem. We also use infinite periodic traces in counter automaton mod...