arXiv subjects

Yao Sun

Publications and source records attributed to Yao Sun.

At least 91 records · Page 5Linked to original sources

arXiv2018

A Multi-channel Network with Image Retrieval for Accurate Brain Tissue Segmentation

Magnetic Resonance Imaging (MRI) is widely used in the pathological and functional studies of the brain, such as epilepsy, tumor diagnosis, etc. Automated accurate brain tissue segmentation like cerebro-spinal fluid (CSF), gray matter (GM), white matter (WM) is the basis of these studies and many researchers are seeking it to the best. Based on the truth that multi-channel segmentation network with its own ground truth achieves up to average dice ratio 0.98, we propose a novel method that we add a fourth channel with the ground truth of the most similar image's obtained by CBIR from the database. The results show that the method improves the segmentation performance, as measured by average dice ratio, by approximately 0.01 in the MRBrainS18 database. In addition, our method is concise and robust, which can be used to any network architecture that needs not be modified a lot.

cs.CV↗

arXiv2018

A Strategy of MR Brain Tissue Images' Suggestive Annotation Based on Modified U-Net

Accurate segmentation of MR brain tissue is a crucial step for diagnosis,surgical planning, and treatment of brain abnormalities. However,it is a time-consuming task to be performed by medical experts. So, automatic and reliable segmentation methods are required. How to choose appropriate training dataset from limited labeled dataset rather than the whole also has great significance in saving training time. In addition, medical data labeled is too rare and expensive to obtain extensively, so choosing appropriate unlabeled dataset instead of all the datasets to annotate, which can attain at least same performance, is also very meaningful. To solve the problem above, we design an automatic segmentation method based on U-shaped deep convolutional network and obtain excellent result with average DSC metric of 0.8610, 0.9131, 0.9003 for Cerebrospinal Fluid (CSF), Gray Matter (GM) and White Matter (WM) respectively on the well-known IBSR18 dataset. We use bootstrapping algorithm for selecting the most effective training data and get more state-of-the-art segmentation performance by using only 50% of training data. Moreover, we propose a strategy of MR brain tissue images' suggestive annotation for unlabeled medical data based on the modified U-net. The proposed method performs fast and can be used in clinical.

cs.CV↗

arXiv2018

DASN:Data-Aware Skilled Network for Accurate MR Brain Tissue Segmentation

Accurate segmentation of MR brain tissue is a crucial step for diagnosis, surgical planning, and treatment of brain abnormalities. Automatic and reliable segmenta-tion methods are required to assist doctor. Over the last few years, deep learning especially deep convolutional neural networks (CNNs) have emerged as one of the most prominent approaches for image recognition problems in various do-mains. But the improvement of deep networks always needs inspiration, which is rare for the ordinary. Until now,there have been reasonable MR brain tissue segmentation methods,all of which can achieve promising performance. These different methods have their own characteristic and are distinctive for data sets. In other words, different models performance vary widely on the same data sets and each model has what it is skilled in. It is on the basis of this, we propose a judgement to distinguish data sets that different models are good at. With our method, the segmentation accuracy can be improved easily based on the existing models, neither without increasing training data nor improving the network. We validate our method on the widely used IBSR 18 dataset and obtain average dice ratio of 88.06%,while it is 85.82% and 86.92% when only using separate one model respectively.

cs.CV↗

arXiv2018

Unravelling the origin of piezo/ferro-electric properties of metal-organic frameworks (MOFs) nanocrystals

Metal-organic framework (MOF) UiO-66 nanocrystals were previously believed to be piezo/ferro-electrically inactive because of their centrosymmetric lattice symmetries (Fm-3m (225)) revealed by Powder X-ray diffraction. However, via delicate dual AC resonance tracking piezoresponse force microscopy and piezoresponse force spectroscopy characterizations, our nanoscale probing for the first time demonstrate that UiO-66 nanocrystals show piezo/ferro-electric response. Our compelling experimental and theoretically analyses disclose that the structure of UiO-66 should not be the highly centrosymmetric Fm-3m (225) but a reduced symmetry form instead. UiO-66(Hf)-type MOFs possess stronger piezoresponse and better ferroelectric switching behaviours than their counterparts UiO-66 (Zr)-type MOFs. Our study not only enriches the structural understanding of UiO-66 MOF, but also suggests possible modification of electronic property of the MOFs by judicious selection of metal ions and functional ligands.

cond-mat.mtrl-sci↗

arXiv2018

Face Aging with Contextual Generative Adversarial Nets

Face aging, which renders aging faces for an input face, has attracted extensive attention in the multimedia research. Recently, several conditional Generative Adversarial Nets (GANs) based methods have achieved great success. They can generate images fitting the real face distributions conditioned on each individual age group. However, these methods fail to capture the transition patterns, e.g., the gradual shape and texture changes between adjacent age groups. In this paper, we propose a novel Contextual Generative Adversarial Nets (C-GANs) to specifically take it into consideration. The C-GANs consists of a conditional transformation network and two discriminative networks. The conditional transformation network imitates the aging procedure with several specially designed residual blocks. The age discriminative network guides the synthesized face to fit the real conditional distribution. The transition pattern discriminative network is novel, aiming to distinguish the real transition patterns with the fake ones. It serves as an extra regularization term for the conditional transformation network, ensuring the generated image pairs to fit the corresponding real transition pattern distribution. Experimental results demonstrate the proposed framework produces appealing results by comparing with the state-of-the-art and ground truth. We also observe performance gain for cross-age face verification.

cs.CV↗

arXiv2018

Cross-domain Human Parsing via Adversarial Feature and Label Adaptation

Human parsing has been extensively studied recently due to its wide applications in many important scenarios. Mainstream fashion parsing models focus on parsing the high-resolution and clean images. However, directly applying the parsers trained on benchmarks to a particular application scenario in the wild, e.g., a canteen, airport or workplace, often gives non-satisfactory performance due to domain shift. In this paper, we explore a new and challenging cross-domain human parsing problem: taking the benchmark dataset with extensive pixel-wise labeling as the source domain, how to obtain a satisfactory parser on a new target domain without requiring any additional manual labeling? To this end, we propose a novel and efficient cross-domain human parsing model to bridge the cross-domain differences in terms of visual appearance and environment conditions and fully exploit commonalities across domains. Our proposed model explicitly learns a feature compensation network, which is specialized for mitigating the cross-domain differences. A discriminative feature adversarial network is introduced to supervise the feature compensation to effectively reduce the discrepancy between feature distributions of two domains. Besides, our model also introduces a structured label adversarial network to guide the parsing results of the target domain to follow the high-order relationships of the structured labels shared across domains. The proposed framework is end-to-end trainable, practical and scalable in real applications. Extensive experiments are conducted where LIP dataset is the source domain and 4 different datasets including surveillance videos, movies and runway shows are evaluated as target domains. The results consistently confirm data efficiency and performance advantages of the proposed method for the cross-domain human parsing problem.

cs.CV↗

arXiv2018

On existence and stability of equilibria of DC Microgrid with constant power loads

The problem of existence and stability of equilibria of DC microgirds with constant power loads methods is addressed in this paper. Constant power loads (CPLs) often cause instability due to its negative impedance characteristics. What is the worse, CPLs may cause that the system admits no equilibria for its nonlinearity. The purpose of paper can be summarized as: A) designing a controller to overcome CPLs instability; B) obtaining the sufficient conditions to guarantee the existence of the equilibria; C) Under the conditions of equilibria existing, obtaining the sufficient conditions of local stability. For the first objective, the method based on virtual resistance and virtual inductance is proposed. For the second objective, we transform the problem of solvability of quadratic equations into the existence of the fixed point of a mapping. Thus, the analytical sufficient conditions is obtained based on Tarski fixed point theorem. Moreover, a numerical method is also provided to reduce conservatism. For the third objective, the small-signal model is established to predict the system qualitative behavior around equilibria. The stability conditions are obtained by using quadratic eigenvalue problem (GEP) theorem. These explicit conditions are obtained as a function of system parameters and it lead to build reliable microgrid.

eess.SY↗

arXiv2017

Stability Analysis of DC Microgrids with Constant Power Load under Distributed Control Method

DC microgrids are becoming popular as effective means to integrate various renewable energy resources. Constant power loads (CPLs) may yield instability due to the negative impedance characteristic. This paper analyzes the stability of the DC microgrid in presence of CPL. Distributed generations (DGs) are controlled by using a distributed controller which aims at current sharing and voltage recovery. For simplicity, a reduced order model is derived on the fundamental of neglecting the transient state of the DC/DC converter. The purpose of this paper is to analyze stability conditions and give the suggestions to design control parameters. The stability conditions are obtained by using inertia theorem. Moreover, this paper makes a further detailed research based on the existed theorems. Simulation results are provided to verify the effectiveness and validity of the proposed theorem.

eess.SY↗

arXiv2017

Optimal Decentralized Economical-sharing Criterion and Scheme for Microgrid

In order to address the economical dispatch problem in islanded microgrid, this letter proposes an optimal criterion and two decentralized economical-sharing schemes. The criterion is to judge whether global optimal economical-sharing can be realized via a decentralized manner. On the one hand, if the system cost functions meet this criterion, the corresponding decentralized droop method is proposed to achieve the global optimal dispatch. Otherwise, if the system does not meet this criterion, a modified method to achieve suboptimal dispatch is presented. The advantages of these methods are convenient,effective and communication-less.

eess.SY↗

arXiv2017

A Fully Decentralized Control of Grid-Connected Cascaded Inverters

This letter proposes a decentralized control scheme for grid-connected cascaded modular inverters without any communication, and each module makes decisions based on its own local information. In contrast, the conventional methods are usually centralized control and depend on a real-time communication. Thus, the proposed scheme has advantages of improved reliability and decreased costs. The overall system stability is analyzed, and the stability condition is derived as well. The feasibility of the proposed method is verified by simulation.

eess.SY↗

arXiv2017

Protecting Against Untrusted Relays: An Information Self-encrypted Approach

The reliability and transmission distance are generally limited for the wireless communications due to the severe channel fading. As an effective way to resist the channel fading, cooperative relaying is usually adopted in wireless networks where neighbouring nodes act as relays to help the transmission between the source and the destination. Most research works simply regard these cooperative nodes trustworthy, which may be not practical in some cases especially when transmitting confidential information. In this paper, we consider the issue of untrusted relays in cooperative communications and propose an information self-encrypted approach to protect against these relays. Specifically, the original packets of the information are used to encrypt each other as the secret keys such that the information cannot be recovered before all of the encrypted packets have been received. The information is intercepted only when the relays obtain all of these encrypted packets. It is proved that the intercept probability is reduced to zero exponentially with the number of the original packets. However, the security performance is still not satisfactory for a large number of relays. Therefore, the combination of destination-based jamming is further adopted to confuse the relays, which makes the security performance acceptable even for a large number of relays. Finally, the simulation results are provided to confirm the theoretical analysis and the superiority of the proposed scheme.

cs.IT↗

arXiv2017

Optimal Decentralized Economical-sharing Scheme in Islanded AC Microgrids with Cascaded Inverters

To address the economical dispatch problem without communications in islanded AC microgrids consisting of cascaded inverters, this paper proposes an optimal decentralized economical-sharing scheme. In proposed scheme, optimal sharing function of the current is applied to generate the reference voltages. And the frequency is used to drive all distributed generators (DGs) synchronize operation in microgrids. When the microgrid is in steady state, DGs share a single common frequency and current in terms of the proposed scheme. Thus the potential advantages of simplicity and decentralized manner are retained. The AC microgrid model has been developed through simulations and experiments to verify the effectiveness and performance of the proposed scheme.

eess.SY↗

arXiv2014

A Monomial-Oriented GVW for Computing Gröbner Bases

The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for short. The mo-GVW algorithm presents a new frame of GVW and regards {\em labeled monomials} instead of {\em labeled polynomials} as basic elements of the algorithm. Being different from the original GVW algorithm, for each labeled monomial, the mo-GVW makes efforts to find the smallest signature that can generate this monomial. The mo-GVW algorithm also avoids generating J-pairs, and uses efficient methods of searching reducers and checking criteria. Thus, the mo-GVW algorithm has a better performance during practical implementations.

cs.SC↗

arXiv2014

An Improvement over the GVW Algorithm for Inhomogeneous Polynomial Systems

The GVW algorithm is a signature-based algorithm for computing Gröbner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are rejected by GVW's Syzygy Criterion, instead, GVW have to compute some J-pairs with lower signatures but higher degrees. Consequently, degrees of polynomials appearing during the computations may unnecessarily grow up higher and the computation become more expensive. In this paper, a variant of the GVW algorithm, called M-GVW, is proposed and mutant pairs are introduced to overcome inconveniences brought by inhomogeneous input polynomials. Some techniques from linear algebra are used to improve the efficiency. Both GVW and M-GVW have been implemented in C++ and tested by many examples from boolean polynomial rings. The timings show M-GVW usually performs much better than the original GVW algorithm when mutant pairs are found. Besides, M-GVW is also compared with intrinsic Gröbner bases functions on Maple, Singular and Magma. Due to the efficient routines from the M4RI library, the experimental results show that M-GVW is very efficient.

cs.SC↗

arXiv2013

Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases

Signature-based algorithms is a popular kind of algorithms for computing Gröbner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view, this paper aims to give an easier way to understand signature-based Gröbner basis algorithms.

cs.SC↗

arXiv2011

Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms

Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the detachability problem. The new method only uses the outputs of signature-based algorithms, and no extra Groebner basis computations are needed. When a Groebner basis is obtained by signature-based algorithms, the detachability problem can be settled in polynomial time.

cs.SC↗

arXiv2011

A Generalized Criterion for Signature-based Algorithms to Compute Gröbner Bases

A generalized criterion for signature-based algorithms to compute Gröbner bases is proposed in this paper. This criterion is named by "generalized criterion", because it can be specialized to almost all existing criteria for signature-based algorithms which include the famous F5 algorithm, F5C, extended F5, G$^2$V and the GVW algorithm. The main purpose of current paper is to study in theory which kind of criteria is correct in signature-based algorithms and provide a generalized method to develop new criteria. For this purpose, by studying some key facts and observations of signature-based algorithms, a generalized criterion is proposed. The generalized criterion only relies on a partial order defined on a set of polynomials. When specializing the partial order to appropriate specific orders, the generalized criterion can specialize to almost all existing criteria of signature-based algorithms. For {\em admissible} partial orders, a proof is presented for the correctness of the algorithm that is based on this generalized criterion. And the partial orders implied by the criteria of F5 and GVW are also shown to be admissible. More importantly, the generalized criterion provides an effective method to check whether a new criterion is correct as well as to develop new criteria for signature-based algorithms.

cs.SC↗

arXiv2011

A Generalized Criterion for Signature Related Gröbner Basis Algorithms

A generalized criterion for signature related algorithms to compute Gröbner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gröbner basis, including the famous F5 algorithm, the extended F5 algorithm and the GVW algorithm. The main purpose of current paper is to study in theory what kind of criteria is correct in signature related algorithms and provide a generalized method to develop new criteria. For this purpose, a generalized criterion is proposed. The generalized criterion only relies on a general partial order defined on a set of polynomials. When specializing the partial order to appropriate specific orders, the generalized criterion can specialize to almost all existing criteria of signature related algorithms. For {\em admissible} partial orders, a complete proof of the correctness of the algorithm based on this generalized criterion is also presented. This proof has no extra requirements on the computing order of critical pairs, and is also valid for non-homogeneous polynomial systems. More importantly, the partial orders implied by existing criteria are admissible. Besides, one can also check whether a new criterion is correct in signature related algorithms or even develop new criteria by using other admissible partial orders in the generalized criterion.

cs.SC↗