330 resultados para Region growing algorithms


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We describe an investigation into how Massey University's Pollen Classifynder can accelerate the understanding of pollen and its role in nature. The Classifynder is an imaging microscopy system that can locate, image and classify slide based pollen samples. Given the laboriousness of purely manual image acquisition and identification it is vital to exploit assistive technologies like the Classifynder to enable acquisition and analysis of pollen samples. It is also vital that we understand the strengths and limitations of automated systems so that they can be used (and improved) to compliment the strengths and weaknesses of human analysts to the greatest extent possible. This article reviews some of our experiences with the Classifynder system and our exploration of alternative classifier models to enhance both accuracy and interpretability. Our experiments in the pollen analysis problem domain have been based on samples from the Australian National University's pollen reference collection (2890 grains, 15 species) and images bundled with the Classifynder system (400 grains, 4 species). These samples have been represented using the Classifynder image feature set. In addition to the Classifynder's native neural network classifier, we have evaluated linear discriminant, support vector machine, decision tree and random forest classifiers on these data with encouraging results. Our hope is that our findings will help enhance the performance of future releases of the Classifynder and other systems for accelerating the acquisition and analysis of pollen samples. © 2013 AIP Publishing LLC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In studies of germ cell transplantation, measureing tubule diameters and counting cells from different populations using antibodies as markers are very important. Manual measurement of tubule sizes and cell counts is a tedious and sanity grinding work. In this paper, we propose a new boundary weighting based tubule detection method. We first enhance the linear features of the input image and detect the approximate centers of tubules. Next, a boundary weighting transform is applied to the polar transformed image of each tubule region and a circular shortest path is used for the boundary detection. Then, ellipse fitting is carried out for tubule selection and measurement. The algorithm has been tested on a dataset consisting of 20 images, each having about 20 tubules. Experiments show that the detection results of our algorithm are very close to the results obtained manually. © 2013 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background The use of dual growing rods is a fusionless surgical approach to the treatment of early onset scoliosis (EOS), which aims of harness potential growth in order to correct spinal deformity. The purpose of this study was to compare the in-vitro biomechanical response of two different dual rod designs under axial rotation loading. Methods Six porcine spines were dissected into seven level thoracolumbar multi-segmental units. Each specimen was mounted and tested in a biaxial Instron machine, undergoing nondestructive left/right axial rotation to peak moments of 4Nm at a constant rotation rate of 8deg.s-1. A motion tracking system (Optotrak) measured 3D displacements of individual vertebrae. Each spine was tested in an un-instrumented state first and then with appropriately sized semi-constrained growing rods and ‘rigid’ rods in alternating sequence. Range of motion, neutral zone size and stiffness were calculated from the moment-rotation curves and intervertebral ranges of motion were calculated from Optotrak data. Findings Irrespective of test sequence, rigid rods showed significantly reduction of total rotation across all instrumented levels (with increased stiffness) whilst semi-constrained rods exhibited similar rotation behavior to the un-instrumented (P<0.05). An 11% and 8% increase in stiffness for left and right axial rotation respectively and 15% reduction in total range of motion was recorded with dual rigid rods compared with semi-constrained rods. Interpretation Based on these findings, the semi-constrained growing rods do not increase axial rotation stiffness compared with un-instrumented spines. This is thought to provide a more physiological environment for the growing spine compared to dual rigid rod constructs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background We used data from the Global Burden of Diseases, Injuries, and Risk Factors Study 2010 (GBD 2010) to estimate the burden of disease attributable to mental and substance use disorders in terms of disability-adjusted life years (DALYs), years of life lost to premature mortality (YLLs), and years lived with disability (YLDs). Methods For each of the 20 mental and substance use disorders included in GBD 2010, we systematically reviewed epidemiological data and used a Bayesian meta-regression tool, DisMod-MR, to model prevalence by age, sex, country, region, and year. We obtained disability weights from representative community surveys and an internet-based survey to calculate YLDs. We calculated premature mortality as YLLs from cause of death estimates for 1980–2010 for 20 age groups, both sexes, and 187 countries. We derived DALYs from the sum of YLDs and YLLs. We adjusted burden estimates for comorbidity and present them with 95% uncertainty intervals. Findings In 2010, mental and substance use disorders accounted for 183·9 million DALYs (95% UI 153·5 million–216·7 million), or 7·4% (6·2–8·6) of all DALYs worldwide. Such disorders accounted for 8·6 million YLLs (6·5 million–12·1 million; 0·5% [0·4–0·7] of all YLLs) and 175·3 million YLDs (144·5 million–207·8 million; 22·9% [18·6–27·2] of all YLDs). Mental and substance use disorders were the leading cause of YLDs worldwide. Depressive disorders accounted for 40·5% (31·7–49·2) of DALYs caused by mental and substance use disorders, with anxiety disorders accounting for 14·6% (11·2–18·4), illicit drug use disorders for 10·9% (8·9–13·2), alcohol use disorders for 9·6% (7·7–11·8), schizophrenia for 7·4% (5·0–9·8), bipolar disorder for 7·0% (4·4–10·3), pervasive developmental disorders for 4·2% (3·2–5·3), childhood behavioural disorders for 3·4% (2·2–4·7), and eating disorders for 1·2% (0·9–1·5). DALYs varied by age and sex, with the highest proportion of total DALYs occurring in people aged 10–29 years. The burden of mental and substance use disorders increased by 37·6% between 1990 and 2010, which for most disorders was driven by population growth and ageing. Interpretation Despite the apparently small contribution of YLLs—with deaths in people with mental disorders coded to the physical cause of death and suicide coded to the category of injuries under self-harm—our findings show the striking and growing challenge that these disorders pose for health systems in developed and developing regions. In view of the magnitude of their contribution, improvement in population health is only possible if countries make the prevention and treatment of mental and substance use disorders a public health priority.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

One of the problems to be solved in attaining the full potentials of hematopoietic stem cell (HSC) applications is the limited availability of the cells. Growing HSCs in a bioreactor offers an alternative solution to this problem. Besides, it also offers the advantages of eliminating labour intensive process as well as the possible contamination involved in the periodic nutrient replenishments in the traditional T-flask stem cell cultivation. In spite of this, the optimization of HSC cultivation in a bioreactor has been barely explored. This manuscript discusses the development of a mathematical model to describe the dynamics in nutrient distribution and cell concentration of an ex vivo HSC cultivation in a microchannel perfusion bioreactor. The model was further used to optimize the cultivation by proposing three alternative feeding strategies in order to prevent the occurrence of nutrient limitation in the bioreactor. The evaluation of these strategies, the periodic step change increase in the inlet oxygen concentration, the periodic step change increase in the media inflow, and the feedback control of media inflow, shows that these strategies can successfully improve the cell yield of the bioreactor. In general, the developed model is useful for the design and optimization of bioreactor operation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This thesis demonstrates how patients' perceived urgency affects their decision to use public hospital emergency departments. The findings inform public health policy solutions aimed at reducing rapid growth in emergency department utilisation which results in congestion and affects the safety, satisfaction, and the quality of care. This research identified that patients attending emergency departments did so based on the perception of their own health status and beliefs that emergency departments were the most suitable location for their care. Blaming patients as "frequent flyers" or "inappropriate users" ignores the complex and multi-factorial nature of the genuine need for urgent medical care felt by patients.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Office of Urban Management recognises that the values which characterise the SEQ region as 'subtropical' are important determinants of form in urban and regional planning. Subtropical values are those qualities on which our regional identity depends. A built environment which responds positively to these values is a critical ingredient for achieving a desirable future for the region. The Centre for Subtropical Design has undertaken this study to identify the particular set of values which characterises SEQ, and to translate theses values into design principals that will maintain and reinforce the value set. The principles not only apply to the overall balance between the natural environment and the built environment, but can be applied by local government authorities to guide local planning schemes and help shape specific built for outcomes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A coverage algorithm is an algorithm that deploys a strategy as to how to cover all points in terms of a given area using some set of sensors. In the past decades a lot of research has gone into development of coverage algorithms. Initially, the focus was coverage of structured and semi-structured indoor areas, but with time and development of better sensors and introduction of GPS, the focus has turned to outdoor coverage. Due to the unstructured nature of an outdoor environment, covering an outdoor area with all its obstacles and simultaneously performing reliable localization is a difficult task. In this paper, two path planning algorithms suitable for solving outdoor coverage tasks are introduced. The algorithms take into account the kinematic constraints of an under-actuated car-like vehicle, minimize trajectory curvatures, and dynamically avoid detected obstacles in the vicinity, all in real-time. We demonstrate the performance of the coverage algorithm in the field by achieving 95% coverage using an autonomous tractor mower without the aid of any absolute localization system or constraints on the physical boundaries of the area.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Bearing faults are the most common cause of wind turbine failures. Unavailability and maintenance cost of wind turbines are becoming critically important, with their fast growing in electric networks. Early fault detection can reduce outage time and costs. This paper proposes Anomaly Detection (AD) machine learning algorithms for fault diagnosis of wind turbine bearings. The application of this method on a real data set was conducted and is presented in this paper. For validation and comparison purposes, a set of baseline results are produced using the popular one-class SVM methods to examine the ability of the proposed technique in detecting incipient faults.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The quality of environmental decisions should be gauged according to managers' objectives. Management objectives generally seek to maximize quantifiable measures of system benefit, for instance population growth rate. Reaching these goals often requires a certain degree of learning about the system. Learning can occur by using management action in combination with a monitoring system. Furthermore, actions can be chosen strategically to obtain specific kinds of information. Formal decision making tools can choose actions to favor such learning in two ways: implicitly via the optimization algorithm that is used when there is a management objective (for instance, when using adaptive management), or explicitly by quantifying knowledge and using it as the fundamental project objective, an approach new to conservation.This paper outlines three conservation project objectives - a pure management objective, a pure learning objective, and an objective that is a weighted mixture of these two. We use eight optimization algorithms to choose actions that meet project objectives and illustrate them in a simulated conservation project. The algorithms provide a taxonomy of decision making tools in conservation management when there is uncertainty surrounding competing models of system function. The algorithms build upon each other such that their differences are highlighted and practitioners may see where their decision making tools can be improved. © 2010 Elsevier Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article aims to fill in the gap of the second-order accurate schemes for the time-fractional subdiffusion equation with unconditional stability. Two fully discrete schemes are first proposed for the time-fractional subdiffusion equation with space discretized by finite element and time discretized by the fractional linear multistep methods. These two methods are unconditionally stable with maximum global convergence order of $O(\tau+h^{r+1})$ in the $L^2$ norm, where $\tau$ and $h$ are the step sizes in time and space, respectively, and $r$ is the degree of the piecewise polynomial space. The average convergence rates for the two methods in time are also investigated, which shows that the average convergence rates of the two methods are $O(\tau^{1.5}+h^{r+1})$. Furthermore, two improved algorithms are constrcted, they are also unconditionally stable and convergent of order $O(\tau^2+h^{r+1})$. Numerical examples are provided to verify the theoretical analysis. The comparisons between the present algorithms and the existing ones are included, which show that our numerical algorithms exhibit better performances than the known ones.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Most real-life data analysis problems are difficult to solve using exact methods, due to the size of the datasets and the nature of the underlying mechanisms of the system under investigation. As datasets grow even larger, finding the balance between the quality of the approximation and the computing time of the heuristic becomes non-trivial. One solution is to consider parallel methods, and to use the increased computational power to perform a deeper exploration of the solution space in a similar time. It is, however, difficult to estimate a priori whether parallelisation will provide the expected improvement. In this paper we consider a well-known method, genetic algorithms, and evaluate on two distinct problem types the behaviour of the classic and parallel implementations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In providing simultaneous information on expression profiles for thousands of genes, microarray technologies have, in recent years, been largely used to investigate mechanisms of gene expression. Clustering and classification of such data can, indeed, highlight patterns and provide insight on biological processes. A common approach is to consider genes and samples of microarray datasets as nodes in a bipartite graphs, where edges are weighted e.g. based on the expression levels. In this paper, using a previously-evaluated weighting scheme, we focus on search algorithms and evaluate, in the context of biclustering, several variations of Genetic Algorithms. We also introduce a new heuristic “Propagate”, which consists in recursively evaluating neighbour solutions with one more or one less active conditions. The results obtained on three well-known datasets show that, for a given weighting scheme,optimal or near-optimal solutions can be identified.