博客
关于我
pytorch可视化 resnet50特征图
阅读量:82 次
发布时间:2019-02-26

本文共 1446 字,大约阅读时间需要 4 分钟。

ResNet50??????PyTorch???????? inference ??

????????ResNet50?????????????????????????????????????????????????????????????PyTorch??????ResNet50???????????????

??????

ResNet50??????????????????????Residual Blocks??????????????????

  • ????[1, 3, 224, 224]????????????????
  • ???1?[1, 64, 112, 112]
  • ?????1?[1, 64, 112, 112]
  • ?????ReLU?
  • ??????[1, 64, 56, 56]
  • ?1?[1, 256, 56, 56]
  • ?2?[1, 512, 28, 28]
  • ?3?[1, 1024, 14, 14]
  • ?4?[1, 2048, 7, 7]
  • ??????[1, 2048]
  • ?????[1, 1000]

???????

??? inference ??????????????????PyTorch?????????????????????????????????????

  • ??????PyTorch??????????ResNet50???
  • ????????????????????????
  • ???????????????????????????????
  • ??????

    ??????????????????

    import cv2import timeimport osimport matplotlib.pyplot as pltimport torchfrom torch import nnimport torchvision.models as modelsimport torchvision.transforms as transformssavepath = 'vis_resnet50/features_elephant'if not os.path.exists(savepath):    os.mkdir(savepath)def draw_features(width, height, x, savename):    tic = time.time()    fig = plt.figure(figsize=(16, 16))    fig.subplots_adjust(left=0.05, right=0.95, bottom=0.05, top=0.95, wspace=0.05)    # ??????????    plt.imshow(x)    plt.savefig(os.path.join(savepath, savename))    plt.close()    toc = time.time()    print(f"?????{toc - tic:.2f}?")

    ????

    • ?????ResNet50?????????????????[1, 3, 224, 224]?
    • ??????????PyTorch???????????????
    • ????????????????????????????????????????

    ????????????????ResNet50??????????????????????????

    转载地址:http://taxz.baihongyu.com/

    你可能感兴趣的文章
    POJ 2019 Cornfields (二维RMQ)
    查看>>
    poj 2057 The Lost House 贪心思想在动态规划上的应用
    查看>>
    poj 2057 树形DP,数学期望
    查看>>
    poj 2112 最优挤奶方案
    查看>>
    Qt编写自定义控件12-进度仪表盘
    查看>>
    SpringBoot主启动原理在SpringApplication类《第六课》
    查看>>
    poj 2186 Popular Cows :求能被有多少点是能被所有点到达的点 tarjan O(E)
    查看>>
    POJ 2186:Popular Cows Tarjan模板题
    查看>>
    POJ 2229 Sumsets(递推,找规律)
    查看>>
    poj 2236
    查看>>
    POJ 2243 Knight Moves
    查看>>
    POJ 2262 Goldbach's Conjecture
    查看>>
    POJ 2362 Square DFS
    查看>>
    Qt笔记——解决添加Qt Designer Form Class时“allocation of incomplete type Ui::”
    查看>>
    poj 2386 Lake Counting(BFS解法)
    查看>>
    poj 2387 最短路模板题
    查看>>
    POJ 2391 多源多汇拆点最大流 +flody+二分答案
    查看>>
    POJ 2403
    查看>>
    poj 2406 还是KMP的简单应用
    查看>>
    POJ 2431 Expedition 优先队列
    查看>>