• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.832-835
• /
• 2022

최근 딥러닝 네트워크의 피처 맵을 활용하여 머신 태스크를 수행하는 Collaborative Intelligence에 대한 관심이 증가하고 있다. CI 구조는 피처 맵을 전송함에 따라서 저사양 디바이스에서 딥러닝 기반의 머신 태스크 수행을 가능하게 하여 다양한 산업에서 활용될 것으로 기대되고 있다. 그러나 CI 구조에서 전송되는 피처 맵은 데이터 크기가 방대하기 때문에 전송에 있어 효율적인 피처 맵 압축이 필요하다. 이에 본 논문에서는 MPEG-VCM에서 제안된 리사이징 (resizing)과 보간법 (interpolation)을 활용하여 피처 맵을 압축하는 Feature Coding 기술에 대하여, 다양한 리사이징 및 보간 방법을 조합하여 가장 우수한 압축 성능 대비 머신 태스크 성능을 나타내는 조합을 실험을 통해서 확인하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.929-939
• /
• 2010

The growth of multimedia technology forces the development of video detection for large database management and illegal copy detection. To meet this demand, this paper proposes a fast video detection method to apply to a large database. The fast video detection algorithm uses spatial features using the gray value distribution from frames and temporal features using the temporal similarity map. We form the video signature using the extracted spatial feature and temporal feature, and carry out a stepwise matching method. The performance was evaluated by accuracy, extraction and matching time, and signature size using the original videos and their modified versions such as brightness change, lossy compression, text/logo overlay. We show empirical parameter selection and the experimental results for the simple matching method using only spatial feature and compare the results with existing algorithms. According to the experimental results, the proposed method has good performance in accuracy, processing time, and signature size. Therefore, the proposed fast detection algorithm is suitable for video detection with the large database.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.93-97
• /
• 2008

In this letter, a novel wavelet-based semi-fragile watermarking scheme is presented which exploiting the time-frequency feature of chaotic map. We also analyze the robustness to mild modification and fragility to malicious attack of our scheme. Its application includes tamper detection, image verification and copyright protection of multimedia content. Simulation results show the scheme can detect and localize malicious attacks with high peak signal-to-noise ratio(PSNR), while tolerating certain degree of JPEG compression and channel additive white Gaussian noise(AWGN)

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1343-1345
• /
• 2022

본 논문에서는 다해상도 피라미드 피처 맵 압축 손상 보상 방법을 제안한다. 본 논문에서 제안하는 방법은 패킹된 C-레이어 피처 맵을 비디오 코덱으로 압축할 때, 저해상도 계층의 원본 피처 맵과 복원된 피처 맵 간의 차분 값을 구해 이를 고해상도 계층의 피처 맵에 더해줌으로써 부호화 과정에서 발생하는 오차를 보상하는 방법이다. 본 논문에서 제안하는 방법의 성능을 평가하기 위하여 OpenImageV6 데이터셋 중 1000 장에 대해 객체 검출 성능을 평가하였다. 본 논문에서 제안하는 피처 맵 압축 방법은 C-레이어 피처 맵 압축 방법 대비 bpp 와 mAP 의 BD-rate 관점에서 35.10%의 성능 향상을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.7-9
• /
• 2021

본 논문은 Detectron2 [1]에서 지원하는 객체 검출 임무 수행 네트워크의 과정 중에서 추출한 피쳐 맵을 신경망 기반으로 압축하는 방법을 제안한다. 이를 위해, 신경 망 기반 영상 압축을 지원하는 공개 소프트웨어인 CompressAI [2] 모델 중 하나인 bmshj2018-hyperprior 의 압축 네트워크를 활용하여 임무 수행 네트워크의 과정 중 스탬 레이어(stem layer)에서 추출된 피쳐 맵을 압축하도록 학습시켰다. 또한, 압축 네트워크의 입력 피쳐 맵의 너비와 높이 크기가 64 의 배수가 되도록 객체 검출 네트워크의 입력 영상 보간 값을 조정하는 방법도 제안한다. 제안하는 신경망 기반 피쳐 맵 압축 방법은 피쳐 맵을 최근 표준이 완료된 차세대 압축 표준 방법인 VVC(Versatile Video Coding, [3])로 압축한 결과에 비해 큰 성능 향상을 보이고, VCM 앵커와 유사한 성능을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1258-1268
• /
• 2004

We propose a new fast, algorithm which is used for detecting frontal face in the frequency domain based on human skin-color using OCT coefficient of dynamic image compression and skin color information. The region where each pixel has a value of skin-color were extracted from U and V value based on DCT coefficient obtained in the process of Image compression using skin-color map in the Y, U, V color space A morphological filter and labeling method are used to eliminate noise in the resulting image We propose the algorithm to detect fastly human face that estimate the directional feature and variance of luminance block of human skin-color Then Extraction of face was completed adaptively on both background have the object analogous to skin-color and background is simple in the proposed algorithm The performance of face detection algorithm is illustrated by some simulation results earned out on various races We confined that a success rate of 94 % was achieved from the experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.553-563
• /
• 1996

Detecting edges is one of issues with essentialimprotance in the area of image analysis. An edge in an image is a boundary or contour at which a significant change occurs in image intensity. Edge detection has been studied in many addlications such as imagesegmentation, robot vision, and image compression. In this paper, we propose an automatic threshold selection scheme for edge detection and show its application to noise elimination. The scheme suggested here applied statistical properties of the noise estimated from a noisy image to threshold selection. Since a selected threshold value in the scheme depends on not the characgreistic of an orginal image but the statistical feature of added noise, we can remove ad-hoc manners used for selecting the threshold value as well as decide the value theoretically. Furthermore, that shceme can reduce the number of edge pixels either generated or lost by noise. an application of the scheme to noise elimination is shown here. Noise in the input image can be eliminated with considering the direction of each edge pixedl on the edge map obtained by applying the threshold selection scheme proposed in this paper. Achieving significantly improved results in terms of SNR as well as subjective quality, we can claim that the suggested method works well.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.27-29
• /
• 2021

인공지능 기반 머신 비전 응용이 증가함에 따라 사람이 아닌 기계에서 소비되는 영상 정보를 전송하는 요구가 발생하고 있다. 일반적으로 영상 정보를 전송할 때는 전송 비용을 고려하여 정보를 압축하며 기존 영상 압축 방법은 사람의 시각 인지적 특성을 반영하여 설계되었다. 따라서 기존 영상 압축 방법은 기계에서 소비되는 영상 정보를 압축하는 방법으로 적절하지 않다고 판단하여 2019년 7월, 기계를 위한 영상 부호화 기술의 표준화가 시작되었다. 본 논문에서는 머신 비전 태스크 중, 객체 탐지를 수행하는 네트워크의 피처 맵을 압축하는 방법을 제안한다. 제안하는 방법은 피처 맵의 채널 간 중복성을 제거하기 위해 PCA 기반의 변환을 적용하여 피처 맵의 차원을 축소하며 특히 해상도 계층 구조를 갖는 네트워크의 피처 맵을 압축하기 위해 각 해상도 계층간 변환 기저를 예측하여 추가로 압축률을 높인다. 제안하는 방법을 적용하여 객체 탐지 결과의 큰 성능 하락 없이 약 92.3%에 데이터양 감소를 달성하였다.

• The Journal of the Petrological Society of Korea
• /
• v.28 no.3
• /
• pp.171-193
• /
• 2019

This study aims to identify the geometry and internal structures of the Yeongdeok Fault, a branch fault of the Yangsan Fault, by detailed mapping and to characterize its kinematics by analyzing the attitudes of sedimentary rocks adjacent to the fault, slip data on the fault surfaces, and anisotropy of magnetic susceptibility (AMS) of the fault gouges. The Yeongdeok Fault, which shows a total extension of 40 km on the digital elevation map, cuts the Triassic Yeongdeok Granite and the Cretaceous sedimentary and volcanic rocks with about 8.1 km of dextral strike-slip offset. The NNW- or N-S-striking Yeongdeok Fault runs as a single fault north of Hwacheon-ri, Yeongdeok-eup, but south of Hwacheon-ri it branches into two faults. The western one of these two faults shows a zigzag-shaped extension consisting of a series of NNE- to NE- and NNW-striking segments, while the eastern one is extended south-southeastward and then merged with the Yangsan Fault in Gangu-myeon, Yeongdeok-gun. The Yeongdeok Fault dips eastward with an angle of > $65^{\circ}$ at most outcrops and shows its fault cores and damage zones of 2~15 m and of up to 180 m wide, respectively. The fault cores derived from several different wall rocks, such as granites and sedimentary and volcanic rocks, show different deformation patterns. The fault cores derived from granites consist mainly of fault breccias with gouge zones less than 10 cm thick, in which shear deformation is concentrated. While the fault cores derived from sedimentary rocks consist of gouges and breccia zones, which anastomose and link up each other with greater widths than those derived from granites. The attitudes of sedimentary rocks adjacent to the fault become tilted at a high angle similar to that of the fault. The fault slip data and AMS of the fault gouges indicate two main events of the Yeongdeok Fault, (1) sinistral strike-slip under NW-SE compression and then (2) dextral strike-slip under NE-SW compression, and shows the overwhelming deformation feature recorded by the later dextral strike-slip. Comparing the deformation history and features of the Yeongdeok Fault in the study area with those of the Yangsan Fault of previous studies, it is interpreted that the two faults experienced the same sinistral and dextral strike-slip movements under the late Cretaceous NW-SE compression and the Paleogene NE-SW compression, respectively, despite the slight difference in strike of the two faults.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.