• ETRI Journal
• /
• 제27권6호
• /
• pp.713-724
• /
• 2005

This paper focuses on the problem of key-frames coding and proposes a new promising approach based on the use of fractals. The summary, made of a set of key-frames selected from a full-length video sequence, is coded by using a 3D fractal scheme. This allows the video presentation tool to expand the video sequence in a "natural" way by using the property of the fractals to reproduce the signal at several resolutions. This feature represents an important novelty of this work with respect to the alternative approaches, which mainly focus on the compression ratio without taking into account the presentation aspect of the video summary. In devising the coding scheme, we have taken care of the computational complexity inherent in fractal coding. Accordingly, the key-frames are first wavelet transformed, and the fractal coding is then applied to each subband to reduce the search range. Experimental results show the effectiveness of the proposed approach.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2016년도 추계학술대회
• /
• pp.39-42
• /
• 2016

Since a display device such as TV or signage is getting larger, the types of media is getting changed into wider view one such as UHD, panoramic and jigsaw-like media. Especially, panoramic and jigsaw-like media is realized by stitching video clips, which are captured by different camera or devices. In order to stich those video clips, it is required to find out 2D Adjacency Matrix, which tells spatial relationships among those video clips. Discrete Cosine Transform (DCT), which is used as a compression transform method, can convert the each frame of video source from the spatial domain (2D) into frequency domain. Based on the aforementioned compressed features, 2D adjacency Matrix of images could be found that we can efficiently make the spatial map of the images by using DCT. This paper proposes a new method of generating 2D adjacency matrix by using DCT for producing a panoramic and jigsaw-like media through various individual video clips.

• 융합신호처리학회논문지
• /
• 제3권1호
• /
• pp.15-20
• /
• 2002

동영상 부호기에서 화면내 프레임 부호화는 전체 프레임의 화질에 중요한 영향을 미친다. 표준화된 동영상의 부호기는 DCT를 쓰지만, 저 비트율에서의 블록화 현상으로 화질의 열화를 가져올 수 있다. 본 논문에서는 화질의 열화를 감소시키고 인간 시각적인 측면에서의 화질 개선을 위한 비디오 코딩을 제안한다. 제한안 방법에서는 웨이브릿 변환에서 인지적 가중치를 화면내 프레임에 적용하여 SPIHT와 VLC를 이용하여 부호화하였고, 인간 시각 특성을 고려하여 시각적인 노이즈를 제거하여 주관적인 화질을 향상 시켰다.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.794-799
• /
• 2008

This paper presents a user identification method at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has convenient, economical advantages. The fingerprint watermark can also improve reliability of verification using automated fingerprint identification systems. These algorithms, however, are not robust against common video compression. To overcome this problem, we analyze H.264 compression pattern and extract watermark after restoring damaged watermark using various filters. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform and extraction after restoring. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.

• 한국컴퓨터산업학회논문지
• /
• 제2권11호
• /
• pp.1465-1476
• /
• 2001

실시간 자막 탐지는 비디오 인덱싱, 텍스트의 이해, 자동 자막 탐지시스템 등 수많은 응용 분야에서 요구된다. 본 논문은 I 프레임을 기반으로 MPEG 압축 동영상에서 자막을 탐지하는 알고리즘을 제안한다. 제안한 알고리즘은 자막 텍스춰 정보와 색체 정보를 사용하여 배경 영상으로부터 자막을 정확히 분리한다. 기존 알고리즘들은 압축 동영상으로부터 텍스트 영역을 추출하기 전에 압축을 먼저 해제하는데 제안한 알고리즘은 DCT 압축 도메인에서 직접 자막 텍스트 영역을 탐지한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.433-436
• /
• 2003

In this paper, the efficient motion estimation and compensation method for 3 dimensional wavelet transform is proposed. Recently, since the compression performance and scalable functionality are provided by wavelet transform, many researches have been carried out for applying to the video compression. For the temporal filtering, motion estimation and compensation techniques are used, but the unconnected pixels, which are produced by motion compensation result into the degradation of coding performance and quality of the picture. For the efficient motion compensated temporal filtering by reducing the number of these unconnected pixels, we propose the variable block size motion estimation and compensation method. Also we propose a method that determines the block size using rate-distortion optimization technique according to the local characteristics of the frame. The simulation results show the improved performances than the MPEG-4 scalable coding methods and the 3 dimensional wavelet coding methods using fixed block size motion estimation and compensation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.417-420
• /
• 2003

Most Embedded Web Camera Server products currently deployed on the market adopt JPEG for compression of video data continuously acquired from the cameras. However, JPEG does not efficiently compress the continuous video stream, and is not appropriate for the Internet where the transmission bandwidth is not guaranteed. In our previous work, we presented the result of designing and implementing an embedded web camera streaming server using MPEG4 codec. But the server in our previous work did not show good performance since one CPU had to both compress and process the network transmission. In this paper, we present our efforts to improve our previous result by using dual CPUs, where DSP is employed for data compression and StrongARM is used for network processing. Better performance has been observed, but it is found that still more time is needed to optimize the performance.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.23-25
• /
• 2007

The partial distortion elimination (PDE) scheme is used to decrease the sum of absolute difference (SAD) computational complexity, since the SAD calculation has been taken much potion of the video compression. In motion estimation (ME) based on PDE, it is ideal that the initial value of SAD in summing performance has large value. The traditional scan order methods have many operation time and high operational complexity because these adopted the division or multiplication. In this paper, we introduce the new scan order and search order by using only adder. We define the average value which is called to rough average value (RAVR). Which is to reduce the computational complexity and increase the operational speed and then we can obtain the improvement of SAD performance. And also this RAVR is used to decide the search order sequence, since the difference RAVR between the current block and candidate block is small then this candidate block has high probability to suitable candidate. Thus, our proposed algorithm combines above two main concepts and suffers the improving SAD performance and the easy hardware implementation methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4160-4176
• /
• 2015

Data compression like image and video compression has come a long way since the introduction of Compressive Sensing (CS) which compresses sparse signals such as images, videos etc. to very few samples i.e. M < N measurements. At the receiver end, a robust and efficient recovery algorithm estimates the original image or video. Many prominent algorithms solve least squares problem (LSP) iteratively in order to reconstruct the signal hence consuming more processing time. In this paper non-iterative threshold based recovery algorithm (NITRA) is proposed for the recovery of images and videos without solving LSP, claiming reduced complexity and better reconstruction quality. The elapsed time for images and videos using NITRA is in ㎲ range which is 100 times less than other existing algorithms. The peak signal to noise ratio (PSNR) is above 30 dB, structural similarity (SSIM) and structural content (SC) are of 99%.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2020년도 하계학술대회
• /
• pp.505-509
• /
• 2020

포인트 클라우드 콘텐츠는 3 차원 공간에 수십만 개가 넘는 점들의 집합으로 이루어진 3D 데이터로 각 점들은 3 차원 공간의 좌표 데이터를 필요로 하고 추가적으로 색 (color), 반사율 (reflectance), 법선 벡터 (normal vector) 등과 같은 속성으로 구성되어 있다. 기존 2D 영상보다 한단계 높은 차원을 가진 3D 포인트 클라우드를 사용자에게 효율적으로 제공하기 위해서 고효율의 압축 기술 연구가 진행되고 있는데, 다양한 장치에서 발생하는 성능 차이에 구애 받지 않고 사용자에게 알맞은 서비스를 제공하기 위해서는 다양한 확장성에 대한 연구가 필요하다. 이에 본 논문에서는 포인트 클라우드 압축에 사용되는 Video-based Point Cloud Compression (V-PCC) 구조에 SHVC 코덱을 적용하여, 밀도 확장성을 갖는 포인트 클라우드 압축 비트스트림을 생성하는 방안을 제안하였다.