Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrew F. Laine

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Tal Danino

> Home > Persons > Andrew F. Laine

Publications

2022
[c116]
- view
  authority control:
- export record
  dblp key:
  - conf/embc/ZhuLFSLDG22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/embc/ZhuLFSLDG22
Nanyan Zhu, Chen Liu, Britney Forsyth, Zakary S. Singer, Andrew F. Laine, Tal Danino, Jia Guo:
Segmentation with Residual Attention U-Net and an Edge-Enhancement Approach Preserves Cell Shape Features. EMBC 2022: 2115-2118
[c115]
- view
  authority control:
- export record
  dblp key:
  - conf/isbi/DoshiSTMMLGD22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isbi/DoshiSTMMLGD22
Anjali Doshi, Marian Shaw, Ruxandra Tonea, Rosalía Minyety, Soonhee Moon, Andrew Laine, Jia Guo, Tal Danino:
A Deep Learning Pipeline For Segmentation of Proteus Mirabilis Colony Patterns. ISBI 2022: 1-5
2020
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-05548
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-05548
Nanyan Zhu, Chen Liu, Zakary S. Singer, Tal Danino, Andrew F. Laine, Jia Guo:
Segmentation with Residual Attention U-Net and an Edge-Enhancement Approach Preserves Cell Shape Features. CoRR abs/2001.05548 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.