Article

# Transvaginal 3-d power Doppler ultrasound evaluation of the fetal brain at 10-13 weeks' gestation.

Department of Perinatology and Gynecology, Kagawa University School of Medicine, Miki, Kagawa, Japan.
Ultrasound in medicine & biology (Impact Factor: 2.02). 03/2012; 38(3):396-401. DOI:10.1016/j.ultrasmedbio.2011.10.015
Source: PubMed

ABSTRACT The objective of this study was to measure the fetal brain volume (FBV) and vascularization and blood flow using transvaginal 3-D power Doppler (3DPD) ultrasound late in the first trimester of pregnancy. 3DPD ultrasound examinations with the VOCAL imaging analysis program were performed on 36 normal fetuses from 10-13 weeks' gestation. FBV and 3DPD indices related to the fetal brain vascularization (vascularization index [VI], flow index [FI] and vascularization flow index [VFI]) were calculated in each fetus. Intra- and interclass correlation coefficients and intra- and interobserver agreements of measurements were assessed. FBV was curvilinearly correlated well with the gestational age (R2 = 0.861, p < 0.0001). All 3-D power Doppler indices (VI, FI and VFI) showed no change at 10-13 weeks' gestation. FBV and all 3-D power Doppler indices (VI, FI and VFI) showed a correlation > 0.82, with good intra- and interobserver agreement. Our findings suggest that 3-D ultrasound is a superior means of evaluating the FBV in utero, and that 3-D power Doppler ultrasound histogram analysis may provide new information on the assessment of fetal brain perfusion.

0 0
·
0 Bookmarks
·
71 Views
• ##### Article: Blow-Up Lemma.
[hide abstract]
ABSTRACT: Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs.
Combinatorica 01/1997; 17:109-123. · 0.56 Impact Factor
• Source
##### Article: Regular spanning subgraphs of bipartite graphs of high minimum degree
[hide abstract]
ABSTRACT: Let G be a simple balanced bipartite graph on $2n$ vertices, $\delta = \delta(G)/n$, and $\rho={\delta + \sqrt{2 \delta -1} \over 2}$. If $\delta > 1/2$ then it has a $\lfloor \rho n \rfloor$-regular spanning subgraph. The statement is nearly tight.
09/2007;
• ##### Article: Variants of the Hajnal-Szemer'edi Theorem
[hide abstract]
ABSTRACT: The Hajnal-Szemer'edi Theorem [6] states that a graph with hk vertices and minimum degree at least (h Gamma 1)k contains k vertex disjoint copies of K h . Its proof is not algorithmic. Here, we present an algorithm which, for a fixed h, finds in such a graph k Gamma C(h) vertex disjoint copies of K h in polynomial time in k, C(h) being a constant depending on h only. The proof suggests a variant of the theorem for h-partite graphs, which is conjectured here and proven in a slightly weaker form in some special cases. 1 Introduction All graphs considered here are finite and without loops or parallel edges. Given a graph G with kh vertices, it is useful to formulate conditions on the minimum degree of G that ensure that it contains k vertex disjoint copies of K h , the complete graph on h vertices. By considering the complete h-partite graph with k Gamma 1 vertices in one color class, k + 1 vertices in another, and k vertices in each of the remaining color classes, one sees that...
01/1999;