This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| bce=nn.BCELoss().to(device) | |
| L1=nn.L1Loss().to(device) | |
| k=50 | |
| def criterion(y_hat,y): | |
| loss=bce(y_hat,y)+k*L1(y_hat,y) | |
| return loss |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # for 128,128 size | |
| class Generator(nn.Module): | |
| def __init__(self): | |
| super(Generator,self).__init__() | |
| self.enc_layer1=conv_block(4,8) | |
| self.enc_layer2=conv_block(8,16) | |
| self.enc_layer3=conv_block(16,32) | |
| self.enc_layer4=conv_block(32,64) | |
| self.enc_layer5=conv_block(64,128) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| D.train() | |
| G.train() | |
| noise_for_generate=torch.randn(batch_size,noise_channels,1,1).to(device) | |
| for epoch in range(epochs): | |
| for idx,(x,_) in enumerate(data_loader): | |
| x=x.to(device) | |
| x_len=x.shape[0] | |
| ### Train D | |
| D.zero_grad() |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import zipfile | |
| !mkdir data_faces && wget https://s3-us-west-1.amazonaws.com/udacity-dlnfd/datasets/celeba.zip | |
| with zipfile.ZipFile("celeba.zip","r") as zip_ref: | |
| zip_ref.extractall("data_faces/") | |
| from torch.utils.data import DataLoader | |
| transform = transforms.Compose([ | |
| transforms.Resize((img_size,img_size)), | |
| transforms.ToTensor()]) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class conv_trans_block(nn.Module): | |
| def __init__(self,in_channels,out_channels,kernal_size=4,stride=2,padding=1): | |
| super(conv_trans_block,self).__init__() | |
| self.block=nn.Sequential( | |
| nn.ConvTranspose2d(in_channels,out_channels,kernal_size,stride,padding), | |
| nn.BatchNorm2d(out_channels), | |
| nn.ReLU()) | |
| def forward(self,x): | |
| return self.block(x) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| D=Discriminator(img_channels,hidden_D).to(device) | |
| G=Generator(noise_channels,img_channels,hidden_G).to(device) | |
| criterion=nn.BCELoss() | |
| opt_D=torch.optim.Adam(D.parameters(),lr=lr, betas=(0.5,0.999)) | |
| opt_G=torch.optim.Adam(G.parameters(),lr=lr, betas=(0.5,0.999)) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Generator(nn.Module): | |
| def __init__(self,noise_channels,img_channels,hidden_G): | |
| super(Generator,self).__init__() | |
| self.G=nn.Sequential( | |
| conv_trans_block(noise_channels,hidden_G*16,kernal_size=4,stride=1,padding=0), | |
| conv_trans_block(hidden_G*16,hidden_G*8), | |
| conv_trans_block(hidden_G*8,hidden_G*4), | |
| conv_trans_block(hidden_G*4,hidden_G*2), | |
| nn.ConvTranspose2d(hidden_G*2,img_channels,kernel_size=4,stride=2,padding=1), | |
| nn.Tanh() |
NewerOlder