119 resultados para Region growing algorithms
em University of Queensland eSpace - Australia
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:
Dual-energy X-ray absorptiometry (DXA) is a widely used method for measuring bone mineral in the growing skeleton. Because scan analysis in children offers a number of challenges, we compared DXA results using six analysis methods at the total proximal femur (PF) and five methods at the femoral neck (FN), In total we assessed 50 scans (25 boys, 25 girls) from two separate studies for cross-sectional differences in bone area, bone mineral content (BMC), and areal bone mineral density (aBMD) and for percentage change over the short term (8 months) and long term (7 years). At the proximal femur for the short-term longitudinal analysis, there was an approximate 3.5% greater change in bone area and BMC when the global region of interest (ROI) was allowed to increase in size between years as compared with when the global ROI was held constant. Trend analysis showed a significant (p < 0.05) difference between scan analysis methods for bone area and BMC across 7 years. At the femoral neck, cross-sectional analysis using a narrower (from default) ROI, without change in location, resulted in a 12.9 and 12.6% smaller bone area and BMC, respectively (both p < 0.001), Changes in FN area and BMC over 8 months were significantly greater (2.3 %, p < 0.05) using a narrower FN rather than the default ROI, Similarly, the 7-year longitudinal data revealed that differences between scan analysis methods were greatest when the narrower FN ROI was maintained across all years (p < 0.001), For aBMD there were no significant differences in group means between analysis methods at either the PF or FN, Our findings show the need to standardize the analysis of proximal femur DXA scans in growing children.
Resumo:
Using benthic habitat data from the Florida Keys (USA), we demonstrate how siting algorithms can help identify potential networks of marine reserves that comprehensively represent target habitat types. We applied a flexible optimization tool-simulated annealing-to represent a fixed proportion of different marine habitat types within a geographic area. We investigated the relative influence of spatial information, planning-unit size, detail of habitat classification, and magnitude of the overall conservation goal on the resulting network scenarios. With this method, we were able to identify many adequate reserve systems that met the conservation goals, e.g., representing at least 20% of each conservation target (i.e., habitat type) while fulfilling the overall aim of minimizing the system area and perimeter. One of the most useful types of information provided by this siting algorithm comes from an irreplaceability analysis, which is a count of the number of, times unique planning units were included in reserve system scenarios. This analysis indicated that many different combinations of sites produced networks that met the conservation goals. While individual 1-km(2) areas were fairly interchangeable, the irreplaceability analysis highlighted larger areas within the planning region that were chosen consistently to meet the goals incorporated into the algorithm. Additionally, we found that reserve systems designed with a high degree of spatial clustering tended to have considerably less perimeter and larger overall areas in reserve-a configuration that may be preferable particularly for sociopolitical reasons. This exercise illustrates the value of using the simulated annealing algorithm to help site marine reserves: the approach makes efficient use of;available resources, can be used interactively by conservation decision makers, and offers biologically suitable alternative networks from which an effective system of marine reserves can be crafted.
Resumo:
Sequence diversity in the coat protein coding region of Australian strains of Johnsongrass mosaic virus (JGMV) was investigated. Field isolates were sampled during a seven year period from Johnsongrass, sorghum and corn across the northern grain growing region. The 23 isolates were found to have greater than 94% nucleotide and amino acid sequence identity. The Australian isolates and two strains from the U.S.A. had about 90% nucleotide sequence identity and were between 19 and 30% different in the N-terminus of the coat protein. Two amino acid residues were found in the core region of the coat protein in isolates obtained from sorghum having the Krish gene for JGMV resistance that differed from those found in isolates from other hosts which did not have this single dominant resistance gene. These amino acid changes may have been responsible for overcoming the resistance conferred by the Krish gene for JGMV resistance in sorghum. The identification of these variable regions was essential for the development of durable pathogen-derived resistance to JGMV in sorghum.
Resumo:
Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.
Resumo:
The dnaA region of Wolbachia, an intracellular bacterial parasite of insects, is unique. A glnA cognate was found upstream of the dnaA gene, while neither of the two open reading frames detected downstream of dnaA has any homologue in the database. This unusual gene arrangement may reflect requirements associated with the unique ecological niche this agent occupies.
Resumo:
Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.
Resumo:
The area of private land suitable and available for growing hoop pine (Araucaria cunninghamii) on the Atherton Tablelands in North Queensland was modelled using a geographic information system (GIS). In Atherton, Eacham and Herberton shires, approximately 64,700 ha of privately owned land were identified as having a mean annual rainfall and soil type similar to Forestry Plantations Queensland (FPQ) hoop pine growth plots with an approximate growth rate of 20 m3 per annum. Land with slope of over 25° and land covered with native vegetation were excluded in the estimation. If land which is currently used for high-value agriculture is also excluded, the net area of land potentially suitable and available for expansion of hoop pine plantations is approximately 22,900 ha. Expert silvicultural advice emphasized the role of site preparation and weed control in affecting the long-term growth rate of hoop pine. Hence, sites with less than optimal fertility and rainfall may be considered as being potentially suitable for growing hoop pine at a lower growth rate. The datasets had been prepared at various scales and differing precision for their description of land attributes. Therefore, the results of this investigation have limited applicability for planning at the individual farm level but are useful at the regional level to target areas for plantation expansion.
Resumo:
A technique based on the polymerase chain reaction (PCR) for the specific detection of Phytophthora medicaginis was developed using nucleotide sequence information of the ribosomal DNA (rDNA) regions. The complete IGS 2 region between the 5 S gene of one rDNA repeat and the small subunit of the adjacent repeat was sequenced for P. medicaginis and related species. The entire nucleotide sequence length of the IGS 2 of P. medicaginis was 3566 bp. A pair of oligonucleotide primers (PPED04 and PPED05), which allowed amplification of a specific fragment (364 bp) within the IGS 2 of P. medicaginis using the PCR, was designed. Specific amplification of this fragment from P. medicaginis was highly sensitive, detecting template DNA as low as 4 ng and in a host-pathogen DNA ratio of 1000000:1. Specific PCR amplification using PPED04 and PPED05 was successful in detecting P. medicaginis in lucerne stems infected under glasshouse conditions and field infected lucerne roots. The procedures developed in this work have application to improved identification and detection of a wide range of Phytophthora spp. in plants and soil.
Resumo:
Small mesothermal vein quam-gold-base-metal sulfide deposits from which some 20 t of Au-Ag bullion have been extracted, are the most common gold deposits in the Georgetown region of north Queensland-several hundred were mined or prospected between 1870 and 1950. These deposits are mostly hosted by Proterozoic granitic and metamorphic rocks and are similar to the much larger Charters Towers deposits such as Day Dawn and Brilliant, and in some respects to the Motherlode deposits of California. The largest deposit in the region-Kidston (> 138 t of Au and Ag since 1985)- is substantially different. It is hosted by sheeted quartz veins and cavities in brecciated Silurian granite and Proterozoic metamorphics above nested high-level Carboniferous intrusives associated with a nearby cauldron subsidence structure. This paper provides new information (K-Ar and Rb-Sr isotopic ages, preliminary oxygen isotope and fluid-inclusion data) from some of the mesothermal deposits and compares it with the Kidston deposit. All six dated mesothermal deposits have Siluro-Devonian (about 425 to 400 Ma) ages. All nine of such deposits analysed have delta(18)O quartz values in the range 8.4 to 15.7 parts per thousand, Fluid-inclusion data indicate homogenisation temperatures in the range 230-350 degrees C. This information, and a re-interpretation of the spatial relationships of the deposits with various elements of the updated regional geology, is used to develop a preliminary metallogenic model of the mesothermal Etheridge Goldfield. The model indicates how the majority of deposits may have formed from hydrothermal systems initiated during the emplacement of granitic batholiths that were possibly, but not clearly, associated with Early Palaeozoic subduction, and that these fluid systems were dominated by substantially modified meteoric and/or magmatic fluids. The large Kidston deposit and a few small relatives are of Carboniferous age and formed more directly from magmatic systems much closer to the surface.