23,326 research outputs found
Adversarial Deep Structured Nets for Mass Segmentation from Mammograms
Mass segmentation provides effective morphological features which are
important for mass diagnosis. In this work, we propose a novel end-to-end
network for mammographic mass segmentation which employs a fully convolutional
network (FCN) to model a potential function, followed by a CRF to perform
structured learning. Because the mass distribution varies greatly with pixel
position, the FCN is combined with a position priori. Further, we employ
adversarial training to eliminate over-fitting due to the small sizes of
mammogram datasets. Multi-scale FCN is employed to improve the segmentation
performance. Experimental results on two public datasets, INbreast and
DDSM-BCRP, demonstrate that our end-to-end network achieves better performance
than state-of-the-art approaches.
\footnote{https://github.com/wentaozhu/adversarial-deep-structural-networks.git}Comment: Accepted by ISBI2018. arXiv admin note: substantial text overlap with
arXiv:1612.0597
Association schemes from the action of fixing a nonsingular conic in PG(2,q)
The group has an embedding into such that it acts as
the group fixing a nonsingular conic in . This action affords a
coherent configuration on the set of non-tangent lines of the
conic. We show that the relations can be described by using the cross-ratio.
Our results imply that the restrictions and to the sets
of secant lines and to the set of exterior lines,
respectively, are both association schemes; moreover, we show that the elliptic
scheme is pseudocyclic.
We further show that the coherent configuration with even allow
certain fusions. These provide a 4-class fusion of the hyperbolic scheme
, and 3-class fusions and 2-class fusions (strongly regular graphs)
of both schemes and $R_{-}(q^2). The fusion results for the
hyperbolic case are known, but our approach here as well as our results in the
elliptic case are new.Comment: 33 page
Determination of a Type of Permutation Binomials over Finite Fields
Let f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x], where . We
prove that is a permutation polynomial of if and only if one
of the following occurs: (i) , odd, and is a
primitive rd root of unity. (ii) belongs to a finite set which is
determined in the paper
Development and Verification of a Flight Stack for a High-Altitude Glider in Ada/SPARK 2014
SPARK 2014 is a modern programming language and a new state-of-the-art tool
set for development and verification of high-integrity software. In this paper,
we explore the capabilities and limitations of its latest version in the
context of building a flight stack for a high-altitude unmanned glider. Towards
that, we deliberately applied static analysis early and continuously during
implementation, to give verification the possibility to steer the software
design. In this process we have identified several limitations and pitfalls of
software design and verification in SPARK, for which we give workarounds and
protective actions to avoid them. Finally, we give design recommendations that
have proven effective for verification, and summarize our experiences with this
new language
- β¦