• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.915-916
• /
• 2017

본 연구에서는 X-ray 영상에서 산란선의 영향을 보정하는 소프트웨어 기법을 제시한다. 영상에서 픽셀값과 에지 요소가 연관된 에너지함수를 정의하고 이를 최적화 하는 방법을 통하여 X-ray 영상을 개선한다. 영상개선 과정에서 추출하는 에지정보의 신뢰성은 응용의 특성과 연관하여 성능에 민감한 영향을 준다. 이에 본 연구에서는 기존의 에지 추출 기법을 통합한 에지 정보 개선 기법을 적용하였으며 실제 X-ray 영상을 사용한 실험결과로부터 제안된 이론의 타당성을 고찰하였다. 이는 X-ray를 사용한 의료진단에서 산란선 보정을 위한 하드웨어의 기능을 대치할 수 있는 방법으로서 의미를 갖는다.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1610-1620
• /
• 2010

This paper proposes a motion-adaptive 3-D deinterlacing algorithm based on an adaptive-thresholded motion detection and an interpolation method using binary patterns to compensate motion missing and false motion errors. For efficient motion detection, we adaptively decided a threshold value according to the complexity of image. Many edge-based interpolation algorithms have been proposed to improve the subjective quality. Recently, to efficiently interpolate low angle edge and line, a method using predefined binary patterns has been proposed. In this paper, we propose an improved method by modifying the binary patterns. Simulation results have shown that the proposed method provides better performance than the existing methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.161-164
• /
• 2003

n-차원 스타 그래프와 펜케익 그래프의 노드 개수는 n!개로서, 하이퍼큐브가 갖는 좋은 성질을 가지면서 하이퍼큐브 보다 망 비용이 적은 값을 갖는 상호연결망이다. 본 논문에서는 스타 그래프와 팬케익 그래프가 동일한 노드 개수를 가질 때, 두 그래프의 에지 정의를 이용하여 스타 그래프 $S_n$을 팬케익 그래프 $P_n$에 연장율 4, 확장율 1에 임베딩 가능함을 보이고. 펜케익을 매크로-스타에 임베딩 하는 비용이 O(n)임을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.262-270
• /
• 2008

We propose a technique to protect digital images using the magnitude and orientation of their edges. The proposed technique uses the content-associated copyright message generated by combining the original copyright message with the magnitude and orientation of some edges of a digital image. It enables the distribution of the original copyright message without any distortion of original digital images by avoiding embedment of the original copyright message into images. In addition to the advantage in the image quality, it also has a relatively low computational complexity by using simple operations to generate the content-associated copyright message. To verify the proposed technique, we performed experiments on its robustness to the external attacks such as histogram equalization, median filtering, rotation, and cropping. Experimental results on restoring the copyright message from images distorted by attacks show that more than 90%, on the average, can be recovered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1546-1552
• /
• 1993

We proposed an adaptive block truncation coding(BTC) using gradient and a new initial value. We used gradient of sobel operator as a new category classification coefficient to reduce Jagged appearance at edge part. We defined a new initial value to reduce large quantization error in the 4-level quantizer block including edge part. By computer simulations, we showed that the proposed method less computation load, reduced jagged appearance at edge part, also improved PSNR more than the conventional adaptive BTC.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.23-25
• /
• 2021

포화 이진 트리를 기반으로 하는 상수 분지수 3의 새로운 그래프 TG_n를 제안한다. TG_n의 노드 주소는 n개의 비트로 나타내며, 노드 수는 2ⁿ개이고 지름은 2n-2다. 에지는 3가지로 분류할 수 있으며, 루트 노드와 연결된 에지, 중간 노드와 연결된 에지, 말단 노드와 연결된 에지가 있다. 트리를 기반으로 한 TG_n의 깊이는 편의상 index N으로 나타낸다. index는 노드 주소를 S라 할 때, S가 0이면 0이고 1 이상이면 ⌊log₂S+1⌋이다. 본 연구에서는 상수 분지수를 갖는 TG_n을 정의하고, 라우팅 알고리즘과 지름을 분석한다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.123-131
• /
• 1999

In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1573-1576
• /
• 2003

스타 그래프와 팬케익 그래프는 하이퍼큐브가 갖는 좋은 성질을 가지면서 하이퍼큐브보다 망 비용이 적은 값을 갖는 상호연결망이다. 본 논문에서는 그래프의 에지 정의를 이용하여 스타 그래프 S/sub n/은 팬케익 그래프 P/sub n/에 연장율 4, 확장율 1에 임베딩 가능함을 보인다.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.28-36
• /
• 2002

In general, triangular meshes have been used for modeling geometric objects such as virtual game characters. The dense meshes give us considerable advantages in representing complex, highly detailed objects, while they are more expensive for storing, transmitting and rendering the objects. Therefore, several researches have been performed for producing a high quality approximation in place of detailed objects, that is, a simplification of triangular meshes. In this paper, we propose a new measure with respect to edges and vertices, which is called an approximate mean curvature and is used as criteria to simplify an original mesh. An edge mean curvature is computed by considering its neighboring edges, and a vertex mean curvature is defined as an average of its incident edges' mean curvatures. And we apply the proposed measure to simplify the models such as a bunny, dragon and teeth. As a result, we can see that the mean curvatures can be used as good criteria for providing much better approximation of models.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.549-559
• /
• 2023

As mobile edge computing (MEC) is gaining attention as a core technology of 5G networks, edge AI technology of 5G network environment based on mobile user data is recently being used in various fields. However, as in traditional AI security, there is a possibility of adversarial interference of standard 5G network functions within the core network responsible for edge AI core functions. In addition, research on data poisoning attacks that can occur in the MEC environment of standalone mode defined in 5G standards by 3GPP is currently insufficient compared to existing LTE networks. In this study, we explore the threat model for the MEC environment using NWDAF, a network function that is responsible for the core function of edge AI in 5G, and propose a feature selection method to improve the performance of detecting data poisoning attacks for Leaf NWDAF as some proof of concept. Through the proposed methodology, we achieved a maximum detection rate of 94.9% for Slowloris attack-based data poisoning attacks in NWDAF.