Searcharxiv⌕ Search

arXiv subjects

Guohua Liu

Publications and source records attributed to Guohua Liu.

22 records · Page 2Linked to original sources

Automated Segmentation of Brain Gray Matter Nuclei on Quantitative Susceptibility Mapping Using Deep Convolutional Neural Network

Abnormal iron accumulation in the brain subcortical nuclei has been reported to be correlated to various neurodegenerative diseases, which can be measured through the magnetic susceptibility from the quantitative susceptibility mapping (QSM). To quantitively measure the magnetic susceptibility, the nuclei should be accurately segmented, which is a tedious task for clinicians. In this paper, we proposed a double-branch residual-structured U-Net (DB-ResUNet) based on 3D convolutional neural network (CNN) to automatically segment such brain gray matter nuclei. To better tradeoff between segmentation accuracy and the memory efficiency, the proposed DB-ResUNet fed image patches with high resolution and the patches with low resolution but larger field of view into the local and global branches, respectively. Experimental results revealed that by jointly using QSM and T$_\text{1}$ weighted imaging (T$_\text{1}$WI) as inputs, the proposed method was able to achieve better segmentation accuracy over its single-branch counterpart, as well as the conventional atlas-based method and the classical 3D-UNet structure. The susceptibility values and the volumes were also measured, which indicated that the measurements from the proposed DB-ResUNet are able to present high correlation with values from the manually annotated regions of interest.

eess.IV↗

Thermodynamics of general flat space and boson star quasi-local systems

We study thermodynamics of flat space/boson star systems enclosed in a scalar reflecting box with St$\ddot{u}$ckelberg mechanism. We also disclose effects of model parameters on transitions and the properties appear to be qualitatively the same as those in holographic St$\ddot{u}$ckelberg transitions. Moreover, we obtain a relation $\barζ\thickapprox 2 \tildeζ$ and the second order characteristic exponent, which also hold in holographic superconductor theories. The similarity between quasi-local thermodynamic transitions and holographic transitions provides additional evidences that holographic theories may also exist in the quasi-local space.

hep-th↗

Holographic entanglement entropy in two-order insulator/superconductor transitions

We study holographic superconductor model with two scalar fields coupled to one single Maxwell field in the AdS soliton background away from the probe limit. We disclose properties of phase transitions mostly from the holographic topological entanglement entropy approach. With different sets of parameters, we observe various types of transitions, especially a new first order phase transition between the condensation of different order parameters in the insulator/superconductor system. Our results show that the entanglement entropy is a good probe to critical phase transition points and the order of phase transitions in the two-order model. We also conclude that the entanglement entropy is useful to some extent in determining the physically supported phases. In addition, we investigate properties of the condensation through the scalar operator and the charge density in the dual theory. As a summary, we draw the complete phase diagram of the effects of the scalar charge on phase transitions. At last, we give some qualitative understanding and obtain the analytical condition for the first order phase transition to occur.

hep-th↗

Relating Weight Constraint and Aggregate Programs: Semantics and Representation

Weight constraint and aggregate programs are among the most widely used logic programs with constraints. In this paper, we relate the semantics of these two classes of programs, namely the stable model semantics for weight constraint programs and the answer set semantics based on conditional satisfaction for aggregate programs. Both classes of programs are instances of logic programs with constraints, and in particular, the answer set semantics for aggregate programs can be applied to weight constraint programs. We show that the two semantics are closely related. First, we show that for a broad class of weight constraint programs, called strongly satisfiable programs, the two semantics coincide. When they disagree, a stable model admitted by the stable model semantics may be circularly justified. We show that the gap between the two semantics can be closed by transforming a weight constraint program to a strongly satisfiable one, so that no circular models may be generated under the current implementation of the stable model semantics. We further demonstrate the close relationship between the two semantics by formulating a transformation from weight constraint programs to logic programs with nested expressions which preserves the answer set semantics. Our study on the semantics leads to an investigation of a methodological issue, namely the possibility of compact representation of aggregate programs by weight constraint programs. We show that almost all standard aggregates can be encoded by weight constraints compactly. This makes it possible to compute the answer sets of aggregate programs using the ASP solvers for weight constraint programs. This approach is compared experimentally with the ones where aggregates are handled more explicitly, which show that the weight constraint encoding of aggregates enables a competitive approach to answer set computation for aggregate programs.

cs.LO↗