View Code? Open in Web Editor
NEW
Coding Self_Study : Online Judge
00self-algorithm's Introduction
- VideoCoding [VVC,MPEG-I(MIV),VCM]
- DeepLearning [SuperResolution,S2VT]
- C++ / Python
- Video Understanding (TMIV/VCM/VTM)
- pytorch, tensorflow2
- ffmpeg(OpenSW)
- Docker, git management
- *“Immersive Video Coding Using Deep Learning Based Specular Detection”, Association for the Advancement of Artificial Intelligence (Under Review)
- “Specular Detection and Rendering for Immersive Multimedia”, IEEE Multimedia (Major Revisions)
- “Efficient Video Captioning Using Quality Enhancement in Video Communication Systems”, Expert Systems with Applications (Under Review)
- “Low-Complexity Two-Step Lossless Depth Coding Using Coarse Lossy Coding”, Multimedia Tools and Applications, Apr. 2022
- “Low-Complexity Intra Coding in Versatile Video Coding”, IEEE Trans. Consumer Electronics, May 2022
*:First Order
- *"몰입형 입체 영상 부호화를 위한 VVC 인루프 필터 성능 분석", 2022 한국방송미디어공학회 추계학술대회
- *[MPEG-I] “Future MPEG Immersive Video Coding Based on Specular Detection”, m57981, Oct.2021
- *[MPEG-I] “Deep Learning Based Specular Pruning”, m58997, Jan.2022
- [MPEG-I] "The crosscheck report for EE4.a in Future MIV exploration experiment", m56611, April.2021
- [MPEG-I] "Results for EE3 on Future MIV", m57492, July.2021
- [VVC] “AHG11:Deep Neural Network for Super-Resolution”, JVET-T0096, Oct.2020
- [VCM] “VVC tool combination for efficient feature map coding”, m60128, Jul.2022
- [VCM] “Performance analysis of VVC inter tools for feature map coding”, m60127, Jul.2022
- [VCM] “Performance analysis of VVC intra tools for feature map coding”, m60126, Jul.2022
*:First Order
- [출원] “영상의 화질에 따라 초해상도 딥러닝 네트워크를 적용하는 비디오 처리 방법 및 비디오 처리 장치”, 10-2022-0011541
00self-algorithm's People
Contributors
Watchers
00self-algorithm's Issues
printf 로 디버깅을 해본 결과 NULL 이 안들어간 것이 확인.. 초기 포인터노드에 NULL값을 넣어주니 됬다. 알고리즘 자체가 원래 노드의 pLink를 새로 드러온 노드이 링크로 넣다보니 에러 전파가 된 듯하다!
int addLLElement(LL *pList, int pos, LN data) {
int ret = FALSE;
LN *new_node = (LN*)malloc(sizeof(LN));
LN *pnode = NULL;
if (pList != NULL) {
//맨 처음
if (pos == 0) {
if (pList->currentdata == 0) {
pList->header_node = data;
//while문이 작동안됬던 이유!의 NULL
pList->header_node.pLink = NULL;
pList->currentdata++;
ret = TRUE;
return ret;
}
*new_node = (pList->header_node);
pnode = &data;
pnode->pLink = new_node;
pList->header_node = *pnode;
pList->currentdata++;
ret = TRUE;
return ret;
}
else if (pos >= 1 && pos <= pList->currentdata) {
if (new_node != NULL) {
*new_node = data;
new_node->pLink = NULL;
pnode = &(pList->header_node);
for (int i = 0; i < pos-1; i++) {
pnode = pnode->pLink;
}
new_node->pLink = pnode->pLink;
pnode->pLink = new_node;
pList->currentdata++;
ret = TRUE;
}
}
}
else{
printf("addLLElement_error : 리스트 동적 할당 오류\n");
return ret;
}
return ret;
}