首页
学习
活动
专区
工具
TVP
发布

JNing的专栏

专栏作者
694
文章
966091
阅读量
50
订阅数
论文阅读: 1911.SINet
1911.09099:SINet: Extreme Lightweight Portrait Segmentation Networks with Spatial Squeeze Modules and Information Blocking Decoder
JNingWei
2021-12-06
3770
论文阅读: 1808.BiSeNet
1808.00897:BiSeNet: Bilateral Segmentation Network for Real-time Semantic Segmentation
JNingWei
2021-12-06
3670
棋盘效应(Checkerboard Artifacts)
定义:棋盘效应是由于反卷积的“不均匀重叠”(Uneven overlap)的结果。使图像中某个部位的颜色比其他部位更深: 📷 具体原因:在反卷积操作时,如果卷积核(Kernel)大小不能被步长(Stride)整除时,反卷积输出的结果就会不均匀重叠: 📷 在二维情况下棋盘效应更为严重,如下: 📷 原则上,网络可以通过训练调整权重来避免这种情况。解决方法就是注意调整好卷积核(Kernel)大小与步长(Stride)的关系。 不重叠(图a: kernel <= stride)与均匀重叠(图b: kern
JNingWei
2021-12-06
8510
【pytorch】model
几个主要api的区别:pytorch model.named_parameters() ,model.parameters() ,model.state_dict().items()
JNingWei
2021-12-06
1580
【leetcode】分治/动态规划/贪心/递归/迭代
算法策略 分治:自顶向下,分而治之。常用递归。 动态规划(DP):类似于分治,但会存储每个子问题的解,避免重复计算。常用迭代。 贪心:类似于DP,但每步都求局部最优。计算次数往往会比DP少。凡是用贪心能解决的,DP都能解决。 实现手段 递归:A调用A自身。所有的递归都可以转化成迭代。 迭代:A循环调用B,并不断更新变量的旧值。
JNingWei
2020-06-02
5740
【tensorflow】tf.name_scope与tf.variable_scope区别
但是,tf.Variable() 每次都会新建变量。 如果希望重用(共享)一些变量,必须用到get_variable(),它会去搜索变量名,有就直接用,没有再新建。
JNingWei
2020-03-23
8660
【tensorflow】TFRecord读写机理
1.tfrecord,写的时候是一行一行地写的,读的时候是每batch个行地读的。
JNingWei
2020-03-17
5100
【tkinter】辨识键盘输入
在使用tkinter的时候经常会不知道某个键盘具体对应的 event.char和event.keycode是什么,上网去查找又很麻烦。
JNingWei
2020-03-17
1.1K0
【python】个人经验:如何写出兼容py2与py3的代码
Python2已经停止维护,但由于历史原因,我们不得不在接下来的几年中,习惯两种语言依然共存的状况。 如果能习惯性地写出同时兼容py2与py3的代码,就可以减少很多不必要的踩坑。
JNingWei
2020-03-17
6700
【opencv】cv::Mat 公有成员函数 (Public Member Func)
用来度量每一个像素中每一个通道的精度,但它本身与图像的通道数无关。 depth数值越大,精度越高。 Mat.depth()得到的是一个0~6的数字,分别代表不同的位数,对应关系如下:
JNingWei
2020-03-12
1.1K0
【opencv】cv头文件
需要调用到opencv的什么功能,就在代码头提前引用好对应的头文件。 所有的头文件都可以在include/opencv2/文件夹找到。
JNingWei
2020-03-12
1.8K0
leetcode: 109. Convert Sorted List to Binary Search Tree
Difficulty Medium. Problem Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees
JNingWei
2019-02-25
3990
leetcode: 108. Convert Sorted Array to Binary Search Tree
Difficulty Easy. Problem Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne
JNingWei
2019-02-25
3540
leetcode: 107. Binary Tree Level Order Traversal II
Difficulty Easy. Problem Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20
JNingWei
2019-02-25
3330
leetcode: 106. Construct Binary Tree from Inorder and Postorder Traversal
Difficulty Medium. Problem Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, given inorder = [9,3,15,20,7] postorder = [9,15,7,20,3] Return the foll
JNingWei
2019-02-25
2890
leetcode: 105. Construct Binary Tree from Preorder and Inorder Traversal
Difficulty Medium. Problem Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, given preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] Return the follow
JNingWei
2019-02-25
4330
leetcode: 104. Maximum Depth of Binary Tree
Difficulty Easy. Problem Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given binary t
JNingWei
2019-02-25
2740
leetcode: 103. Binary Tree Zigzag Level Order Traversal
Difficulty Medium. Problem Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree [3,9,20,null,null,15,7],
JNingWei
2019-02-25
2730
leetcode: 102. Binary Tree Level Order Traversal
Difficulty Medium. Problem Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its l
JNingWei
2019-02-25
2560
leetcode: 101. Symmetric Tree
Difficulty Easy. Problem # Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). # # For example, this binary tree [1,2,2,3,4,4,3] is symmetric: # # 1 # / \ # 2 2 # / \ / \ # 3 4 4 3 # # But the fo
JNingWei
2019-02-25
3000
点击加载更多
社区活动
Python精品学习库
代码在线跑,知识轻松学
热点技术征文第五期
新风口Sora来袭,普通人该如何把握机会?
博客搬家 | 分享价值百万资源包
自行/邀约他人一键搬运博客,速成社区影响力并领取好礼
技术创作特训营·精选知识专栏
往期视频·干货材料·成员作品·最新动态
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档