An improved seeded region growing algorithm

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.

3,5-cycle decompositions

For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.

The relationship between multiple birth children's early phonological skills and later literacy

Previous studies have shown that multiple ; birth children (MBC) are prone to early phonological ;difficulties and later literacy problems. However, to date, ;there has been no systematic long-term follow-up of MBC with phonological difficulties in the preschool years to determine whether these difficulties predict later literacy problems. In this study, 20 MBC whose early speech and language skills had been previously documented were compared to normative data and 20 singleton controls on tasks assessing phonological ; processing and literacy. The major findings indicated that MBC performed significantly more poorly on some tasks :df phonological processing than singleton controls did. Further, the early phonological skills of MBC (i.e., the number of inappropriate phonological processes used) correlated with poor performance on visual rhyme recognition, word repetition, and phoneme detection tasks 5 years later. There was no significant relationship between early biological factors (birth weight and gestation period) and performance on the phonological processing and literacy-related subtests. These results cl-support the hypothesis that MBC's early speech and language difficulties are not merely a transient phase;of; development, but a real disorder, with consequences for later academic achievement.

Pinch my wig or winch my pig: Spelling, spoonerisms and other language skills

Phonological processing skills have often been assumed to play a minimal role in skilled adult spelling despite evidence showing their importance in the development of spelling skills. The present study investigated the relationship between phonological awareness and spelling in adults. It was hypothesised that subjects demonstrating higher levels of spelling proficiency would also show superior phonological processing skills. This relationship was expected to be mediated by sound-spelling mapping knowledge. Given the irregularities of sound-spelling correspondences in English, it was also predicted that knowledge of orthographic conventions would be related to spelling competency. Two measures of each component skill were used on seventy three university students. As predicted, the importance of spelling-sound mapping skills in spelling were demonstrated, as was a relationship between phonological awareness and spelling-sound correspondences. In addition a moderate correlation was found between orthographic tasks and spelling performance. It was concluded that, among university students at least, phonological ability makes an important contribution to skilled adult spelling.

The lobatamides, novel cytotoxic macrolides from southwestern Pacific tunicates

Novel macrolides, lobatamides A-F (1-6), have been isolated from shallow water Australian collections of Aplidium lobatum, from a deep water collection of Aplidium sp., and from an unidentified Philippine ascidian. Full details of the isolation and structure elucidation of 1-6 are provided herein, along with results and analyses of the testing of lobatamides A-D (1-4) in the NCI human tumor 60 cell-line screen. The lobatamides share a common core structure with the recently described salicylihalamides, which were isolated from a Haliclona sp. sponge. COMPARE analyses of the mean-graph differential cytotoxicity profiles of the lobatamides and the salicylihalamides showed high correlations with each other but not with members of the NCI's standard agents database. These compounds, therefore, appear to comprise a new mechanistic class, meriting further antitumor investigations.

(m,n)-cycle systems

We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m(1),m(2),...,m(t) are sufficient in the case \{m(1), m(2), ..., m(t)}\=2. The method is used to settle the case where the cycle lengths are 4 and 5. (C) 1998 Elsevier Science B.V. All rights reserved.

Decomposing complete tripartite graphs into cycles of lengths 3 and 4

Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved.

An evaluation of the time dependence of the anisotropy of the water diffusion tensor in acute human ischemia

We have performed MRI examinations to determine the water diffusion tensor in the brain of six patients who were admitted to the hospital within 12 h after the onset of cerebral ischemic symptoms. The examinations have been carried out immediately after admission, and thereafter at varying intervals up to 90 days post admission. Maps of the trace of the diffusion tensor, the fractional anisotropy and the lattice index, as well as maps of cerebral blood perfusion parameters, were generated to quantitatively assess the character of the water diffusion tensor in the infarcted area. In patients with significant perfusion deficits and substantial lesion volume changes, four of six cases, our measurements show a monotonic and significant decrease in the diffusion anisotropy within the ischemic lesion as a function of time. We propose that retrospective analysis of this quantity, in combination with brain tissue segmentation and cerebral perfusion maps, may be used in future studies to assess the severity of the ischemic event. (C) 1999 Elsevier Science Inc.

A reproducible method for automated extraction of brain volumes from 3D human head MR images

An automated method for extracting brain volumes from three commonly acquired three-dimensional (3D) MR images (proton density, T1 weighted, and T2-weighted) of the human head is described. The procedure is divided into four levels: preprocessing, segmentation, scalp removal, and postprocessing. A user-provided reference point is the sole operator-dependent input required, The method's parameters were first optimized and then fixed and applied to 30 repeat data sets from 15 normal older adult subjects to investigate its reproducibility. Percent differences between total brain volumes (TBVs) for the subjects' repeated data sets ranged from .5% to 2.2%. We conclude that the method is both robust and reproducible and has the potential for wide application.

Maximal sets of Hamilton cycles in Kn,n

In this article, we prove that there exists a maximal set of m Hamilton cycles in K-n,K-n if and only if n/4 < m less than or equal to n/2. (C) 2000 John Wiley & Sons, Inc.

Maximum packings of K-v-K-u with triples

We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of K-v - K-u (the complete graph on v vertices with a. hole of size u) into the maximum possible number of edge disjoint triangles.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.

A family of perfect factorisations of complete bipartite graphs

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n = p(2) for an odd prime p. We construct a family of (p-1)/2 non-isomorphic perfect 1-factorisations of K-n,K-n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltoilian if the permutation defined by any row relative to any other row is a single Cycle. (C) 2002 Elsevier Science (USA).

C4-saturated bipartite graphs

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.