The measurement of applied forces during anterior single rod surgical correction of adolescent idiopathic scoliosis

INTRODUCTION. Following anterior thoracoscopic instrumentation and fusion for the treatment of thoracic AIS, implant related complications have been reported as high as 20.8%. Currently the magnitudes of the forces applied to the spine during anterior scoliosis surgery are unknown. The aim of this study was to measure the segmental compressive forces applied during anterior single rod instrumentation in a series of adolescent idiopathic scoliosis patients. METHODS. A force transducer was designed, constructed and retrofitted to a surgical cable compression tool, routinely used to apply segmental compression during anterior scoliosis correction. Transducer output was continuously logged during the compression of each spinal joint, the output at completion converted to an applied compression force using calibration data. The angle between adjacent vertebral body screws was also measured on intra-operative frontal plane fluoroscope images taken both before and after each joint compression. The difference in angle between the two images was calculated as an estimate for the achieved correction at each spinal joint. RESULTS. Force measurements were obtained for 15 scoliosis patients (Aged 11-19 years) with single thoracic curves (Cobb angles 47˚- 67˚). In total, 95 spinal joints were instrumented. The average force applied for a single joint was 540 N (± 229 N)ranging between 88 N and 1018 N. Experimental error in the force measurement, determined from transducer calibration was ± 43 N. A trend for higher forces applied at joints close to the apex of the scoliosis was observed. The average joint correction angle measured by fluoroscope imaging was 4.8˚ (±2.6˚, range 0˚-12.6˚). CONCLUSION. This study has quantified in-vivo, the intra-operative correction forces applied by the surgeon during anterior single rod instrumentation. This data provides a useful contribution towards an improved understanding of the biomechanics of scoliosis correction. In particular, this data will be used as input for developing patient-specific finite element simulations of scoliosis correction surgery.

Elasto-plastic stress analysis of an insulated rail joint (IRJ) with a loading below shakedown limit

A finite element numerical simulation is carried out to examine stress distributions on railhead in the vicinity of the endpost of a insulated rail joint. The contact patch and pressure distribution are considered using modified Hertzian formulation. A combined elasto-plastic material modelling available in Abaqus is employed in the simulation. A dynamic load factor of 1.21 is considered in modelling for the wheel load based on a previous study as part of this on going research. Shakedown theorem is employed in this study. A peak pressure load which is above the shakedown limit is determined as input load. As a result, a progressive damage in the railhead has been captured as depicted in the equivalent plastic strain plot.

Adding a receding horizon to Locally Weighted Regression for learning robot control

There have been notable advances in learning to control complex robotic systems using methods such as Locally Weighted Regression (LWR). In this paper we explore some potential limits of LWR for robotic applications, particularly investigating its application to systems with a long horizon of temporal dependence. We define the horizon of temporal dependence as the delay from a control input to a desired change in output. LWR alone cannot be used in a temporally dependent system to find meaningful control values from only the current state variables and output, as the relationship between the input and the current state is under-constrained. By introducing a receding horizon of the future output states of the system, we show that sufficient constraint is applied to learn good solutions through LWR. The new method, Receding Horizon Locally Weighted Regression (RH-LWR), is demonstrated through one-shot learning on a real Series Elastic Actuator controlling a pendulum.

Fourier active appearance models

Gaining invariance to camera and illumination variations has been a well investigated topic in Active Appearance Model (AAM) fitting literature. The major problem lies in the inability of the appearance parameters of the AAM to generalize to unseen conditions. An attractive approach for gaining invariance is to fit an AAM to a multiple filter response (e.g. Gabor) representation of the input image. Naively applying this concept with a traditional AAM is computationally prohibitive, especially as the number of filter responses increase. In this paper, we present a computationally efficient AAM fitting algorithm based on the Lucas-Kanade (LK) algorithm posed in the Fourier domain that affords invariance to both expression and illumination. We refer to this as a Fourier AAM (FAAM), and show that this method gives substantial improvement in person specific AAM fitting performance over traditional AAM fitting methods.

Monitoring mesenchymal stem cell cultures using image processing and pattern recognition techniques

Stem cells have attracted tremendous interest in recent times due to their promise in providing innovative new treatments for a great range of currently debilitating diseases. This is due to their potential ability to regenerate and repair damaged tissue, and hence restore lost body function, in a manner beyond the body's usual healing process. Bone marrow-derived mesenchymal stem cells or bone marrow stromal cells are one type of adult stem cells that are of particular interest. Since they are derived from a living human adult donor, they do not have the ethical issues associated with the use of human embryonic stem cells. They are also able to be taken from a patient or other donors with relative ease and then grown readily in the laboratory for clinical application. Despite the attractive properties of bone marrow stromal cells, there is presently no quick and easy way to determine the quality of a sample of such cells. Presently, a sample must be grown for weeks and subject to various time-consuming assays, under the direction of an expert cell biologist, to determine whether it will be useful. Hence there is a great need for innovative new ways to assess the quality of cell cultures for research and potential clinical application. The research presented in this thesis investigates the use of computerised image processing and pattern recognition techniques to provide a quicker and simpler method for the quality assessment of bone marrow stromal cell cultures. In particular, aim of this work is to find out whether it is possible, through the use of image processing and pattern recognition techniques, to predict the growth potential of a culture of human bone marrow stromal cells at early stages, before it is readily apparent to a human observer. With the above aim in mind, a computerised system was developed to classify the quality of bone marrow stromal cell cultures based on phase contrast microscopy images. Our system was trained and tested on mixed images of both healthy and unhealthy bone marrow stromal cell samples taken from three different patients. This system, when presented with 44 previously unseen bone marrow stromal cell culture images, outperformed human experts in the ability to correctly classify healthy and unhealthy cultures. The system correctly classified the health status of an image 88% of the time compared to an average of 72% of the time for human experts. Extensive training and testing of the system on a set of 139 normal sized images and 567 smaller image tiles showed an average performance of 86% and 85% correct classifications, respectively. The contributions of this thesis include demonstrating the applicability and potential of computerised image processing and pattern recognition techniques to the task of quality assessment of bone marrow stromal cell cultures. As part of this system, an image normalisation method has been suggested and a new segmentation algorithm has been developed for locating cell regions of irregularly shaped cells in phase contrast images. Importantly, we have validated the efficacy of both the normalisation and segmentation method, by demonstrating that both methods quantitatively improve the classification performance of subsequent pattern recognition algorithms, in discriminating between cell cultures of differing health status. We have shown that the quality of a cell culture of bone marrow stromal cells may be assessed without the need to either segment individual cells or to use time-lapse imaging. Finally, we have proposed a set of features, that when extracted from the cell regions of segmented input images, can be used to train current state of the art pattern recognition systems to predict the quality of bone marrow stromal cell cultures earlier and more consistently than human experts.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Exponentiated gradient algorithms for large-margin structured classification

We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes supervised training of Markov random fields and weighted context-free grammars as special cases. We describe an algorithm that solves the large-margin optimization problem defined in [12], using an exponential-family (Gibbs distribution) representation of structured objects. The algorithm is efficient—even in cases where the number of labels y is exponential in size—provided that certain expectations under Gibbs distributions can be calculated efficiently. The method for structured labels relies on a more general result, specifically the application of exponentiated gradient updates [7, 8] to quadratic programs.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

Productivity, Technical and Efficiency Change in Singapore’s Services Sector, 2005 to 2008

The current study was motivated by statements made by the Economic Strategies Committee that Singapore’s recent productivity levels in services were well below countries such as the US, Japan and Hong Kong. Massive employment of foreign workers was cited as the reason for poor productivity levels. To shed more light on Singapore’s falling productivity, a nonparametric Malmquist productivity index was employed which provides measures of productivity change, technical change and efficiency change. The findings reveal that growth in total factor productivity was attributed to technical change with no improvement in efficiency change. Such results suggest that gains from TFP were input-driven rather than from a ‘best-practice’ approach such as improvements in operations or better resource allocation.

Intrinsically photosensitive melanopsin retinal ganglion cell contributions to the post-illumination pupil response and circadian rhythm

Intrinsically photosensitive retinal ganglion cells (ipRGCs) in the eye transmit the environmental light level, projecting to the suprachiasmatic nucleus (SCN) (Berson, Dunn & Takao, 2002; Hattar, Liao, Takao, Berson & Yau, 2002), the location of the circadian biological clock, and the olivary pretectal nucleus (OPN) of the pretectum, the start of the pupil reflex pathway (Hattar, Liao, Takao, Berson & Yau, 2002; Dacey, Liao, Peterson, Robinson, Smith, Pokorny, Yau & Gamlin, 2005). The SCN synchronizes the circadian rhythm, a cycle of biological processes coordinated to the solar day, and drives the sleep/wake cycle by controlling the release of melatonin from the pineal gland (Claustrat, Brun & Chazot, 2005). Encoded photic input from ipRGCs to the OPN also contributes to the pupil light reflex (PLR), the constriction and recovery of the pupil in response to light. IpRGCs control the post-illumination component of the PLR, the partial pupil constriction maintained for > 30 sec after a stimulus offset (Gamlin, McDougal, Pokorny, Smith, Yau & Dacey, 2007; Kankipati, Girkin & Gamlin, 2010; Markwell, Feigl & Zele, 2010). It is unknown if intrinsic ipRGC and cone-mediated inputs to ipRGCs show circadian variation in their photon-counting activity under constant illumination. If ipRGCs demonstrate circadian variation of the pupil response under constant illumination in vivo, when in vitro ipRGC activity does not (Weng, Wong & Berson, 2009), this would support central control of the ipRGC circadian activity. A preliminary experiment was conducted to determine the spectral sensitivity of the ipRGC post-illumination pupil response under the experimental conditions, confirming the successful isolation of the ipRGC response (Gamlin, et al., 2007) for the circadian experiment. In this main experiment, we demonstrate that ipRGC photon-counting activity has a circadian rhythm under constant experimental conditions, while direct rod and cone contributions to the PLR do not. Intrinsic ipRGC contributions to the post-illumination pupil response decreased 2:46 h prior to melatonin onset for our group model, with the peak ipRGC attenuation occurring 1:25 h after melatonin onset. Our results suggest a centrally controlled evening decrease in ipRGC activity, independent of environmental light, which is temporally synchronized (demonstrates a temporal phase-advanced relationship) to the SCN mediated release of melatonin. In the future the ipRGC post-illumination pupil response could be developed as a fast, non-invasive measure of circadian rhythm. This study establishes a basis for future investigation of cortical feedback mechanisms that modulate ipRGC activity.

Measuring and decomposing changes in agricultural productivity, nitrogen use efficiency and cumulative exergy efficiency: Application to OECD agriculture

This paper uses an aggregate quantity space to decompose the temporal changes in nitrogen use efficiency and cumulative exergy use efficiency into changes of Moorsteen–Bjurek (MB) Total Factor Productivity (TFP) changes and changes in the aggregate nitrogen and cumulative exergy contents. Changes in productivity can be broken into technical change and changes in various efficiency measures such as technical efficiency, scale efficiency and residual mix efficiency. Changes in the aggregate nitrogen and cumulative exergy contents can be driven by changes in the quality of inputs and outputs and changes in the mixes of inputs and outputs. Also with cumulative exergy content analysis, changes in the efficiency in input production can increase or decrease the cumulative exergy transformity of agricultural production. The empirical study in 30 member countries of the Organisation for Economic Co-operation Development from 1990 to 2003 yielded some important findings. The production technology progressed but there were reductions in technical efficiency, scale efficiency and residual mix efficiency levels. This result suggests that the production frontier had shifted up but there existed lags in the responses of member countries to the technological change. Given TFP growth, improvements in nutrient use efficiency and cumulative exergy use efficiency were counteracted by reductions in the changes of the aggregate nitrogen contents ratio and aggregate cumulative exergy contents ratio. The empirical results also confirmed that different combinations of inputs and outputs as well as the quality of inputs and outputs could have more influence on the growth of nutrient and cumulative exergy use efficiency than factors that had driven productivity change. Keywords: Nutrient use efficiency; Cumulative exergy use efficiency; Thermodynamic efficiency change; Productivity growth; OECD agriculture; Sustainability