Search

A two-step algorithm for the dynamic reduction of flexible mechanisms inspired to the IRS method for structures is proposed. The classic Guyan-Iron condensation is first extended to multibody systems by introducing the joint compatibility equations in the equations of motion written in terms of slave and the new class joint-nodes. It is demonstrated that the joint-nodes augment the boundary-nodes, that form subset of nodes with independent displacements. Then, the Miller’s expansion is combined with the extended Guyan-Iron reduction to build a two-step algorithm for the dynamic condensation of flexible multibody systems. Finally, a numerical example is studied to check the accuracy of the proposed method.

In this work we propose a new algorithm for image inpainting. The proposal is patch-based, so we look for similar small regions (windows) through the whole image to inpaint the unknown area. The final goal is to obtain a complete image with no visual differences between the original part and the reconstructed one. The main novelty is the use of color and gradient properties to look for similar windows of the image. We combine these two properties in two stages. In the first one we cluster all the available windows taking into account only the gradient feature. With this step we preselect some windows from the set of all available ones. From all the preselected ones, we finally select the most similar in color intensity. The results show that our algorithm gets final images with better textures than the ones obtained just considering color features.

Integer-pixel Motion Estimation (IME) is one of the fundamental and time-consuming modules in encoding. In this paper, a novel two-step IME algorithm is proposed for High Efficiency Video Coding (HEVC) on a Graphic Processing Unit (GPU). First, the whole search region is roughly investigated with a predefined search pattern, which is analyzed in detail to effectively reduce the complexity. Then, the search result is further refined in the zones only around the best candidates of the first step. By dividing IME into two steps, the proposed algorithm combines the advantage of one-step algorithms in synchronization and the advantage of multiple-step algorithms in complexity. According to the experimental results, the proposed algorithm achieves up to 3.64 times speedup compared with previous representative algorithms, and the search accuracy is maintained at the same time. Since IME algorithm is independent from other modules, it is a good choice for different GPU-based encoding applications.