51 resultados para motion cueing algorithm (MCA)
em University of Queensland eSpace - Australia
Resumo:
In this letter, we propose a class of self-stabilizing learning algorithms for minor component analysis (MCA), which includes a few well-known MCA learning algorithms. Self-stabilizing means that the sign of the weight vector length change is independent of the presented input vector. For these algorithms, rigorous global convergence proof is given and the convergence rate is also discussed. By combining the positive properties of these algorithms, a new learning algorithm is proposed which can improve the performance. Simulations are employed to confirm our theoretical results.
Resumo:
Streaming video application requires high security as well as high computational performance. In video encryption, traditional selective algorithms have been used to partially encrypt the relatively important data in order to satisfy the streaming performance requirement. Most video selective encryption algorithms are inherited from still image encryption algorithms, the encryption on motion vector data is not considered. The assumption is that motion vector data are not as important as pixel image data. Unfortunately, in some cases, motion vector itself may be sufficient enough to leak out useful video information. Normally motion vector data consume over half of the whole video stream bandwidth, neglecting their security may be unwise. In this paper, we target this security problem and illustrate attacks at two different levels that can restore useful video information using motion vectors only. Further, an information analysis is made and a motion vector information model is built. Based on this model, we describe a new motion vector encryption algorithm called MVEA. We show the experimental results of MVEA. The security strength and performance of the algorithm are also evaluated.
Resumo:
Abstract—This paper describes an electrical model of the ventricles incorporating real geometry and motion. Cardiac geometry and motion is obtained from segmentations of multipleslice MRI time sequences. A static heart model developed previously is deformed to match the observed geometry using a novel shape registration algorithm. The resulting electrocardiograms and body surface potential maps are compared to a static simulation in the resting heart. These results demonstrate that introducing motion into the cardiac model modifies the ECG during the T wave at peak contraction of the ventricles.
Resumo:
This paper describes experiments conducted in order to simultaneously tune 15 joints of a humanoid robot. Two Genetic Algorithm (GA) based tuning methods were developed and compared against a hand-tuned solution. The system was tuned in order to minimise tracking error while at the same time achieve smooth joint motion. Joint smoothness is crucial for the accurate calculation of online ZMP estimation, a prerequisite for a closedloop dynamically stable humanoid walking gait. Results in both simulation and on a real robot are presented, demonstrating the superior smoothness performance of the GA based methods.
Resumo:
Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.
Resumo:
Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.
Resumo:
Background: The redox proteins that incorporate a thioredoxin fold have diverse properties and functions. The bacterial protein-folding factor DsbA is the most oxidizing of the thioredoxin family. DsbA catalyzes disulfide-bond formation during the folding of secreted proteins, The extremely oxidizing nature of DsbA has been proposed to result from either domain motion or stabilizing active-site interactions in the reduced form. In the domain motion model, hinge bending between the two domains of DsbA occurs as a result of redox-related conformational changes. Results: We have determined the crystal structures of reduced and oxidized DsbA in the same crystal form and at the same pH (5.6). The crystal structure of a lower pH form of oxidized DsbA has also been determined (pH 5.0). These new crystal structures of DsbA, and the previously determined structure of oxidized DsbA at pH 6.5, provide the foundation for analysis of structural changes that occur upon reduction of the active-site disulfide bond. Conclusions: The structures of reduced and oxidized DsbA reveal that hinge bending motions do occur between the two domains. These motions are independent of redox state, however, and therefore do not contribute to the energetic differences between the two redox states, instead, the observed domain motion is proposed to be a consequence of substrate binding. Furthermore, DsbA's highly oxidizing nature is a result of hydrogen bond, electrostatic and helix-dipole interactions that favour the thiolate over the disulfide at the active site.
Resumo:
Evaluation of trunk movements, trunk muscle activation, intra-abdominal pressure and displacement of centres of pressure and mass was undertaken to determine whether trunk orientation is a controlled variable prior to and during rapid bilateral movement of the upper limbs. Standing subjects performed rapid bilateral symmetrical upper limb movements in three directions (flexion, abduction and extension). The results indicated a small (0.4-3.3 degrees) but consistent initial angular displacement between the segments of the trunk in a direction opposite to that produced by the reactive moments resulting from limb movement. Phasic activation of superficial trunk muscles was consistent with this pattern of preparatory motion and with the direction of motion of the centre of mass. In contrast, activation of the deep abdominal muscles was independent of the direction of limb motion, suggesting a non-direction specific contribution to spinal stability. The results support the opinion that feedforward postural responses result in trunk movements, and that orientation of the trunk and centre of mass are both controlled variables in relation to rapid limb movements.
Resumo:
To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.
Resumo:
Three-dimensional trunk motion. trunk muscle electromyography and intra-abdominal pressure were evaluated to investigate the preparatory control of the trunk associated with voluntary unilateral upper limb movement. The directions of angular motion produced by moments reactive to limb movement in each direction were predicted using a three-dimensional model of the body. Preparatory motion of the trunk occurred in three dimensions in the directions opposite to the reactive moments. Electromyographic recordings from the superficial trunk muscles were consistent with preparatory trunk motion. However, activation of transversus abdominis was inconsistent with control of direction-specific moments acting on the trunk. The results provide evidence that anticipatory postural adjustments result in movements and not simple rigidification of the trunk. (C) 2000 Elsevier Science B.V. All rights reserved.
Resumo:
OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.
Resumo:
In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.
Resumo:
An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.