31 resultados para the Fuzzy Colour Segmentation Algorithm

em University of Queensland eSpace - Australia


Relevância:

100.00% 100.00%

Publicador:

Resumo:

This study compared emotional Stroop interference in the emotional colour naming Stroop and the emotional counting Stroop by measuring reaction times and event-related potentials to positive, negative and neutral words. Twenty participants had ERPs recorded at 61 sites while performing both types of emotional Stroop tasks as well as congruent and incongruent conflict conditions. All participants rated stimulus emotionality retrospectively. A robust reaction time Stroop effect was observed in response latency for the traditional ‘‘conflict’’ conditions (congruent vs. incongruent) for the counting Stroop though not the colour naming Stroop task. There was also no evidence of emotional interference for either of the tasks; however, there was trend for positive interference in the colour naming Stroop. The P5 was identified as the event-related potential associated with emotional processing. For the P5 component, significant emotionality effects were evident in the emotional colour naming Stroop for latency (542 ms). There was a significant interaction between valence and hemisphere. The latency of the P5 in the right hemisphere was later for the positive words than negative and neutral. Comparable effects of valence were evident for the emotional counting Stroop for amplitude but not latency.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

THE STORY OF HOW FEATHERS EVOLVED IS FAR FROM OVER. IN 1868, THOMAS HUXLEY declared that dinosaurs gave rise to birds. He based his claim on Compsognathus, a 150-million-year-old dinosaur fossil from Solnhofen, Germany, whose delicate hind legs were remarkably similar to those of table fowl. The discovery seven years earlier of Archaeopteryx, a fossil bird with a long bony tail, toothed jaws and clawed fingers, had convinced many people that birds were somehow related to reptiles. But Compsognathus was the fossil that placed dinosaurs firmly in the middle of this complex evolutionary equation. Wings, claimed Huxley, must have grown out of rudimentary forelimbs. And feathers? Whether Compsognathus had them, Huxley could only guess. Nevertheless, his theory clearly required that scales had somehow transformed into feathers. The question was not just how, but why?

Relevância:

100.00% 100.00%

Publicador:

Resumo:

To examine the effect of an algorithm-based sedation guideline developed in a North American intensive care unit (ICU) on the duration of mechanical ventilation of patients in an Australian ICU. The intervention was tested in a pre-intervention, post-intervention comparative investigation in a 14-bed adult intensive care unit. Adult mechanically ventilated patients were selected consecutively (n =322) The pre-intervention and post-intervention groups were similar except for a higher number of patients with a neurological diagnosis in the pre-intervention group. An algorithm-based sedation guideline including a sedation scale was introduced using a multifaceted implementation strategy. The median duration of ventilation was 5.6 days in the post-intervention group, compared with 4.8 days for the pre-intervention group (P = 0.99). The length of stay was 8.2 days in the post-intervention group versus 7.1 days in the pre-intervention group (P = 0.04). There were no statistically significant differences for the other secondary outcomes, including the score on the Experience of Treatment in ICU 7 item questionnaire, number of tracheostomies and number of self-extubations. Records of compliance to recording the sedation score during both phases revealed that patients were slightly more deeply sedated when the guideline was used. The use of the algorithm-based sedation guideline did not reduce duration of mechanical ventilation in the setting of this study.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mixture models implemented via the expectation-maximization (EM) algorithm are being increasingly used in a wide range of problems in pattern recognition such as image segmentation. However, the EM algorithm requires considerable computational time in its application to huge data sets such as a three-dimensional magnetic resonance (MR) image of over 10 million voxels. Recently, it was shown that a sparse, incremental version of the EM algorithm could improve its rate of convergence. In this paper, we show how this modified EM algorithm can be speeded up further by adopting a multiresolution kd-tree structure in performing the E-step. The proposed algorithm outperforms some other variants of the EM algorithm for segmenting MR images of the human brain. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.

Relevância:

100.00% 100.00%

Publicador:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The aim of this work was to exemplify the specific contribution of both two- and three-dimensional (31)) X-ray computed tomography to characterise earthworm burrow systems. To achieve this purpose we used 3D mathematical morphology operators to characterise burrow systems resulting from the activity of an anecic (Aporrectodea noctunia), and an endogeic species (Allolobophora chlorotica), when both species were introduced either separately or together into artificial soil cores. Images of these soil cores were obtained using a medical X-ray tomography scanner. Three-dimensional reconstructions of burrow systems were obtained using a specifically developed segmentation algorithm. To study the differences between burrow systems, a set of classical tools of mathematical morphology (granulometries) were used. So-called granulometries based on different structuring elements clearly separated the different burrow systems. They enabled us to show that burrows made by the anecic species were fatter, longer, more vertical, more continuous but less sinuous than burrows of the endogeic species. The granulometry transform of the soil matrix showed that burrows made by A. nocturna were more evenly distributed than those of A. chlorotica. Although a good discrimination was possible when only one species was introduced into the soil cores, it was not possible to separate burrows of the two species from each other in cases where species were introduced into the same soil core. This limitation, partly due to the insufficient spatial resolution of the medical scanner, precluded the use of the morphological operators to study putative interactions between the two species.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This note gives a theory of state transition matrices for linear systems of fuzzy differential equations. This is used to give a fuzzy version of the classical variation of constants formula. A simple example of a time-independent control system is used to illustrate the methods. While similar problems to the crisp case arise for time-dependent systems, in time-independent cases the calculations are elementary solutions of eigenvalue-eigenvector problems. In particular, for nonnegative or nonpositive matrices, the problems at each level set, can easily be solved in MATLAB to give the level sets of the fuzzy solution. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Two varieties of adzuki beans (Vigna angularis), Bloodwood and Erimo, were stored at temperatures of 10, 20 or 30degreesC, and relative humidities (RH) 40 or 65%, and samples were analysed at 0, 1.5, 3 and 6 months. Storage at 30degreesC for > 1.5 months caused a significant decrease in the a(star) and b(star) colour values and darkening of the seed coat. Beans stored at 65% RH had lower L-star but higher a(star) and b(star) colour values than those stored at 40% RH. Bloodwood and Erimo samples showed similar trends in colour during storage. The best storage conditions for the preservation of the adzuki colour were 10degreesC and 65% RH. The Australian beans had lower L-star, a(star) and b(star) colour values than Japanese Erimo-shouzu beans and storage increased the difference.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The expectation-maximization (EM) algorithm has been of considerable interest in recent years as the basis for various algorithms in application areas of neural networks such as pattern recognition. However, there exists some misconceptions concerning its application to neural networks. In this paper, we clarify these misconceptions and consider how the EM algorithm can be adopted to train multilayer perceptron (MLP) and mixture of experts (ME) networks in applications to multiclass classification. We identify some situations where the application of the EM algorithm to train MLP networks may be of limited value and discuss some ways of handling the difficulties. For ME networks, it is reported in the literature that networks trained by the EM algorithm using iteratively reweighted least squares (IRLS) algorithm in the inner loop of the M-step, often performed poorly in multiclass classification. However, we found that the convergence of the IRLS algorithm is stable and that the log likelihood is monotonic increasing when a learning rate smaller than one is adopted. Also, we propose the use of an expectation-conditional maximization (ECM) algorithm to train ME networks. Its performance is demonstrated to be superior to the IRLS algorithm on some simulated and real data sets.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

QTL detection experiments in livestock species commonly use the half-sib design. Each male is mated to a number of females, each female producing a limited number of progeny. Analysis consists of attempting to detect associations between phenotype and genotype measured on the progeny. When family sizes are limiting experimenters may wish to incorporate as much information as possible into a single analysis. However, combining information across sires is problematic because of incomplete linkage disequilibrium between the markers and the QTL in the population. This study describes formulae for obtaining MLEs via the expectation maximization (EM) algorithm for use in a multiple-trait, multiple-family analysis. A model specifying a QTL with only two alleles, and a common within sire error variance is assumed. Compared to single-family analyses, power can be improved up to fourfold with multi-family analyses. The accuracy and precision of QTL location estimates are also substantially improved. With small family sizes, the multi-family, multi-trait analyses reduce substantially, but not totally remove, biases in QTL effect estimates. In situations where multiple QTL alleles are segregating the multi-family analysis will average out the effects of the different QTL alleles.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper investigates the performance of EASI algorithm and the proposed EKENS algorithm for linear and nonlinear mixtures. The proposed EKENS algorithm is based on the modified equivariant algorithm and kernel density estimation. Theory and characteristic of both the algorithms are discussed for blind source separation model. The separation structure of nonlinear mixtures is based on a nonlinear stage followed by a linear stage. Simulations with artificial and natural data demonstrate the feasibility and good performance of the proposed EKENS algorithm.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Texture-segmentation is the crucial initial step for texture-based image retrieval. Texture is the main difficulty faced to a segmentation method. Many image segmentation algorithms either can’t handle texture properly or can’t obtain texture features directly during segmentation which can be used for retrieval purpose. This paper describes an automatic texture segmentation algorithm based on a set of features derived from wavelet domain, which are effective in texture description for retrieval purpose. Simulation results show that the proposed algorithm can efficiently capture the textured regions in arbitrary images, with the features of each region extracted as well. The features of each textured region can be directly used to index image database with applications as texture-based image retrieval.