DL| Transformer 구조
in Blog / DL on Transformer, Self-attention
Transformer 구조 정리
Transformer The Illustrated Transformer BoostCampAITECH
DL| Cascade R-CNN과 DCN
in Blog / DL on Cascade rcnn, Dcn
Cascade R-CNN과 DCN
DCN 리뷰 BoostCampAITECH
DL| EfficientNet과 EfficientDet, BiFPN
in Blog / DL on Efficientnet, Efficientdet, Bifpn
EfficientNet과 EfficientDet, BiFPN
WRN EfficientNet and EfficientDet BoostCampAITECH
DL| Instance, Panoptic, Landmark Localization
in Blog / DL on Mask r-cnn, Yolact, Yolactedge, Upsnet, Vspnet, Landmark, Heatmap, Hourglass, Densepose, Retinaface
Instance, Panoptic, Landmark Localization 대략적인 모델들 요약
BoostCampAITECH
DL| CNN Viz
in Blog / DL on Zfnet, Cam, Grad-cam, Gap
CNN Viz 방법들
GAP BoostCampAITECH
ALGORITHM| Floyd-Warshall(플로이드 워셜)
in Blog / ALGORITHM on 최단 경로, Floyd-warshall
Floyd-Warshall
DL| SSD, RetinaNet, DETR, CornerNet, CenterNet
in Blog / DL on Ssd, Retinanet, Detr, Cornernet, Centernet
SSD, RetinaNet, DETR, CornerNet, CenterNet
BoostCampAITECH
DL| Object Detection Neck 구조 정리(FPN부터 NASFPN까지)
in Blog / DL on Neck, Fpn, Panet, Detectors, Aspp, Bifpn, Nasfpn, Augfpn
Neck 종류들(FPN, PANet, DetectoRS, BiFPN, NASFPN, AugFPN)
ASPP(Atrous Spatial Pyramid Pooling) BoostCampAITECH
ALGORITHM| Minimum Spanning Tree와 구현 알고리즘
in Blog / ALGORITHM on Mst, Kruskal, Prim
MST, Kruskal MST, Prim MST
최소 신장 트리(MST, Minimum Spanning Tree)란 Kruskal 알고리즘 이란 Prim 알고리즘 이란
ALGORITHM| Union Find란?
in Blog / ALGORITHM on Disjoint set, Union find
Union Find 설명과 기본 구현, 최적화 구현
Union-Find 알고리즘 Disjoint Set #2 Union By Rank와 Path Compression