MRF-UNets: Searching UNet with Markov Random Fields

نویسندگان

چکیده

UNet [27] is widely used in semantic segmentation due to its simplicity and effectiveness. However, manually-designed architecture applied a large number of problem settings, either with no optimizations, or manual tuning, which time consuming can be sub-optimal. In this work, firstly, we propose Markov Random Field Neural Architecture Search (MRF-NAS) that extends improves the recent Adaptive Optimal Network Width (AOWS) method [4] (i) more general MRF framework (ii) diverse M-best loopy inference (iii) differentiable parameter learning. This provides necessary NAS efficiently explore network architectures induce graphs, including loops arise from skip connections. With as backbone, find an architecture, MRF-UNet, shows several interesting characteristics. Secondly, through lens these characteristics, identify sub-optimality original further improve our results MRF-UNetV2. Experiments show MRF-UNets significantly outperform benchmarks on three aerial image datasets two medical while maintaining low computational costs. The code available at: https://github.com/zifuwanggg/MRF-UNets .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Random Fields and Conditional Random Fields

Markov chains provided us with a way to model 1D objects such as contours probabilistically, in a way that led to nice, tractable computations. We now consider 2D Markov models. These are more powerful, but not as easy to compute with. In addition we will consider two additional issues. First, we will consider adding observations to our models. These observations are conditioned on the value of...

متن کامل

Markov Random Topic Fields

Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified graphs describing relationships between documents. These graph are encoded in the form of a Markov random field over topics and serve to encourage related documents to have similar topic structures. Experiments on show upw...

متن کامل

Discrimination between Urban Area and Vegetation in High- Resolution Images Using Markov Random Fields (mrf)

The automatic extraction of traffic data from digital images is a challenging task and implies an extensive pre-processing of this data. An important information which simplifies the further extraction of traffic objects is the recognition of active traffic regions. A possible approach is masking of streets using platform attitude and position together with a digital street map (i). But often s...

متن کامل

Combinatorial Markov Random Fields

A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatorial Markov random fields (Comrafs), which are Markov random fields where some of the nodes are combinatorial random variables. We argue that Comrafs are powerful models for unsupervised and semi-supervised learning. We put Comraf...

متن کامل

Markov Random Fields

1. Markov property The Markov property of a stochastic sequence {Xn}n≥0 implies that for all n ≥ 1, Xn is independent of (Xk : k / ∈ {n− 1, n, n + 1}), given (Xn−1, Xn+1). Another way to write this is: Xn ⊥ (Xk : k / ∈ ∂{n}) | (Xk : k ∈ ∂{n}) where ∂{n} is the set of neighbors of site n. We would like to now generalize this Markov property from one-dimensional index sets to more arbitrary domains.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-26409-2_36