Two-Pass Hexagonal algorithm with improved Hashtable structure for motion estimation

This paper presents an improved Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA, Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). The hashtable structure of LHMEA is improved compared to the original TPA and LHMEA. The evaluation of the algorithm considers the three important metrics being processing time, compression rate and PSNR. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

Linear hashtable motion estimation algorithm for distributed video processing

This paper presents a parallel Linear Hashtable Motion Estimation Algorithm (LHMEA). Most parallel video compression algorithms focus on Group of Picture (GOP). Based on LHMEA we proposed earlier [1][2], we developed a parallel motion estimation algorithm focus inside of frame. We divide each reference frames into equally sized regions. These regions are going to be processed in parallel to increase the encoding speed significantly. The theory and practice speed up of parallel LHMEA according to the number of PCs in the cluster are compared and discussed. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass Hexagonal Search (HEXBS) motion estimation, which only searches a small number of Macroblocks (MBs). We evaluated distributed parallel implementation of LHMEA of TPA for real time video compression.

Proposal of an admittance enhanced redundant joint mechanism to improve backdrivability

This paper describes a proposed admittance enhanced redundant joint mechanism (AERJM) which allows greater flexibility in the design of robotic joints. First, the basic concept of a redundant joint mechanism that reduces joint inertia is explained. Second, the AERJM structure is discussed. AERJM consists of a redundancy introducing mechanism (RIM), the adjustable admittance mechanism (AAM) and an admittance enhancing actuator. The working principles of the AERJM concept are analysed. The design and a working prototype, consisting of a variable reduction mechanism, along with a spring and a damper with constant coefficients, are described.

Validating a new clinical subtyping scheme for delirium with electronic motion analysis

The usefulness of motor subtypes of delirium is unclear due to inconsistency in sub-typing methods and a lack of validation with objective measures of activity. The activity of 40 patients was measured with 24 h accelerometry monitoring. Patients with Diagnostic and Statistical Manual of Mental Disorders, fourth edition (DSM-IV) delirium (n = 30) were allocated into hyperactive, hypoactive and mixed motor subtypes. Delirium subtypes differed in relation to overall amount of activity, including movement in both sagittal and transverse planes. Differences were greater in the daytime and during the early evening ‘sundowning’ period. Frequency of postural changes was the most discriminating measure examined. Clinical subtypes of delirium defined by observed motor behaviour on the ward differ in electronically measured activity levels.

OFDM joint data detection and phase noise cancellation based on minimum mean square prediction error

This paper proposes a new iterative algorithm for orthogonal frequency division multiplexing (OFDM) joint data detection and phase noise (PHN) cancellation based on minimum mean square prediction error. We particularly highlight the relatively less studied problem of "overfitting" such that the iterative approach may converge to a trivial solution. Specifically, we apply a hard-decision procedure at every iterative step to overcome the overfitting. Moreover, compared with existing algorithms, a more accurate Pade approximation is used to represent the PHN, and finally a more robust and compact fast process based on Givens rotation is proposed to reduce the complexity to a practical level. Numerical Simulations are also given to verify the proposed algorithm. (C) 2008 Elsevier B.V. All rights reserved.