• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.157-159
• /
• 2003

본 논문에서는 화상 통화를 위한 비디오 인코딩에서 화자의 얼굴 화질을 강화하여 인코딩 할 수 있는 동영상 인코딩 방법을 제안한다. 제안한 인코딩 방법에서는 이미지의 Cr 데이터 및 움직임벡터 정보를 이용하여 빠르게 화자 얼굴 영역을 검출하고, 이 영역에 대하여 선택적인 양자화를 통하여 상대적으로 많은 비트량을 할당하여 화자의 얼굴 화질을 상대적으로 강화한다. 이 방법을 H.263 인코더에 적용하는 경우 전체적으로 이런 방법을 적용하지 않았을 때와 비교하여 18% 정도의 추가적인 CPU 오버헤드가 필요하였지만, 얼굴 영역에 대하여서는 PSNR 3dB 정도의 화질이 개선될 수 있음을 실험을 통하여 증명하였다.

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

최근 VVC(Versatile Video Coding) 표준 완료 이후 JVET(Joint Video Experts Team)은 NNVC(Neural Network-based Video Coding) AhG(Ad-hoc Group)을 구성하고 인공지능을 이용한 비디오 압축 기술들을 탐색하고 있다. 본 논문에서는 VVC 복원 영상의 DCT 계수를 기반으로 복원 영상을 분류하고, 분류된 각 클래스에 따라 적응적으로 CNN(Convolutional Neural Network) 기반의 화질 개선을 수행하는 VVC 후처리 기법을 제안한다. 실험결과, 제안기법은 AI(All Intra) 부호화 모드에서 1.23% BD-rate 이득을 보였다.

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

MPEG-VCM(Video Coding for Machine)은 입력된 비디오 특징(feature)를 압축하는 Track1 과 입력 영상을 직접 압축하는 Track2 로 나뉘어 표준화가 진행중이다. 본 논문은 VCM Track 1 에 해당하는 Detectron2 FPN(Feature Pyramid Network)에서 추출한 다중 스케일 특징맵을 VVC 로 압축하는 MSFC(Multi-Scale Feature Compression)을 구조를 제안한다. 본 논문의 MSFC 에서는 다중 스케일 특징을 결합하여 부호화/복호화하는 기존의 구조에서 특징맵의 해상도를 줄여 압축하는 개선된 MSFC 를 제시한다. 제안 방법은 VCM 의 Track2 의 영상 앵커(image anchor) 보다 우수한 BPP-mAP 성능을 보이고 최대 -84.98%의 BD-rate 성능향상을 보인다.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.1359-1362
• /
• 2008

SVC(Scalable Video Coding)는 다양한 장치와 변화하기 쉬운 대역폭을 가지는 네트워크 환경에서 만족할 수 있는 스트리밍 환경을 제공하기 위해서 디자인되었지만, 본 논문에서는 SVC를 간단하면서도 효율적으로 채널 변경시간을 감소시킬 수 있도록 IPTV시스템에 응용하였다. 제안하는 시스템에서는 IPTV 헤드엔드와 LHR(Last Hop Router)사이의 네트워크 대역폭 일부분에 SVC 기본 계층으로 압축된 채널들을 정적 채널에 할당한다. 따라서 사용자가 정적 채널에 속하는 채널을 선택하면 짧은 네트워크 지연 시간 이내에 기본 계층을 전송 받아 동영상을 볼 수 있으며, 곧바로 향상 계층을 전송 받아 사용자는 정상 품질의 영상을 시청할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1232-1239
• /
• 2006

In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.117-124
• /
• 2004

Various multimedia systems have been developed and their application areas widely proliferate. Thus, the interoperability is getting important among various networks and devices. The video transcoding is a technology to solve this interoperability problem among various coding standards. Transcoding can be defined as the conversion of one compressed coded data to another. In this paper, MPEG-2 to MPEG-4 transcoder in the spatial domain is compared with that in the DCT domain. The transcoder is very useful when a video sequence that is originally encoded for digital TV, DVD or satellite broadcasting is served in mobile environment. In order to compare two transcoders, all modules except motion compensation and down sampling are implemented identically. In addition, both transcoders do not search for motion vector. Instead, the decoded information is reused to the encoder. The experimental results show that the transcoder in the spatial domain is usually better than that in the DCT domain with respect to PSNR (Peak Signal-to-Noise Ratio), bitrate and execution time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.634-647
• /
• 2003

In MPEG-4 FGS (fine granular scalability) video, SE (selective enhancement) function is adopted to enhance the subject quality of the region of interest (ROI). However, it has the problem of excessive bit-rate increase in the enhancement layer. We present a new rectangular region-based SE (RSE) algorithm to significantly reduce the overhead bits resulting from the standard SE. The proposed RSE is based on two new algorithms. The first is to apply the SE function to a rectangular region. By doing so, we can reduce the required bits for describing the selectively enhanced region. The second is to use constrained bit-plane scanning (CBS) to encode bit-planes of the enhancement layer. By using CBS, we can efficiently encode the ALL-ZERO symbols that are generated by applying the SE. It Is shown by simulation that the proposed RSE can provide a good visual quality for the selected rectangular region with significantly reduced overhead bits.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.1-8
• /
• 2008

In this paper, an algorithm to compensate the inter-view mismatch in the multi-view video according to the different characteristics of cameras is presented. Interview mismatches make it difficult to merge the multi-view images and decrease the coding performance. So, a preprocessing operation to compensate the mismatches is requisite in the multi-view video coding. It is shown that the mismatch in the outputs of multi-view cameras with different electro-optical transfer functions can be approximated with a linear model of a gain and an offset. In addition, a new algorithm for estimating and compensating the inter-view mismatch based on the detection of the overlapped region is presented. Experimental results using various rectified stereo images show that the proposed method compensates inter-view mismatches more accurately compared to the conventional approach.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.306-314
• /
• 2019

Since the resolutions of videos increase rapidly, there are continuing needs for effective video compression methods despite an increase in the transmission bandwidth. In order to satisfy such a demand, a reconstructive video coding (RVC) method by using a super resolution has been proposed. Since RVC reduces the resolution of the input video, when frames are compressed to the same size, the number of bits per pixel increases, thereby reducing coding artifacts caused by video coding. However, RVC method using super resolution is not effective in all target bitrates. Comparing the size of the loss generated while downsizing the resolution and the size of the loss caused by the video compression, only when the size of loss generated in the video compression is larger, RVC method can perform the improved compression performance compared to direct video coding. In particular, since HEVC has considerably higher compression performance than the previous standard video codec, it can be experimentally confirmed that the compression distortions become larger than the distortions of downsizing the resolution only in the very low-bitrate conditions. In this paper, we applied RVC based HEVC in various video types and measured the target bitrates that RVC method can be effectively applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1713-1720
• /
• 1999

This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.