Scribd
Upload
9 views

U Net AI by Hand

Handwritten explanations for u net architecture workings

Uploaded by

sa9884
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

U Net AI by Hand

Handwritten explanations for u net architecture workings

Uploaded by

sa9884
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

UNet

R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 1


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 2


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 3


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 4


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 5


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 6


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 7


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 8


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 9


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 10


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 11


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 12


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 13


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 14


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 15


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 16


UNet
R 1 0 1 0 2 1 1 0 1 0 1 0 0 1 0 0
G 1 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1
B 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0
conv
1 1 0
0 1 1
maxpool

conv
1 -1
1 2
maxpool

conv
-1 1
10 -1
transposed *
1 2
conv
*
conv 3 1

1 0 1 0
0 1 0 1
transposed *
1 0
conv
*
0 1
conv
-1 0 1 0
0 1 0 1

conv R’ 1 0
G’ 0 1
B’ 1 1

AI by Hand ✍ Vol. 2 © 2024 Tom Yeh 17

You might also like