• Journal of Internet Computing and Services
• /
• v.7 no.3
• /
• pp.107-118
• /
• 2006

Recently, network infra grows rapidly and the digital image compression technique have made remarkable progress, and therefore the demand of the real-time image surveillance system which uses a network camera server is increasing. Network Camera Server has emerged as an attractive alternative to the CCTV for the real-time image surveillance. From this reason, the demand regarding the development of the real-time image surveillance system which uses a network camera server is increasing as well. In this paper, we will provide a model for JPEG Streamer which is used in real-time image surveillance system. And we will design and implement this model. For the stability and efficiency of the JPEG Streamer, we'll use the thread pool and shared memory. We will also introduce the concept of double buffering for increasing the quality of real-time image, Using the JPEG Streamer, a raising of the productivity, reliability and stability will be able to secure to development of real-time image surveillance system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1457-1470
• /
• 2015

In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.134-137
• /
• 2009

최근 마이크로소프트 (Microsoft)에서 발표된 후 주목 받고 있는 JPEG XR 은 압축 효율 면에서 뛰어난 장점을 가지고 있다. 일반적으로 JPEG XR 은 기존의 JPEG 과는 다른 압축 과정과 주파수 성분 분포를 가지고 있다고 알려져 있다. 하지만 JPEG 압축 방식과 비교하여 JPEG XR 의 압축영역에서의 영상 필터 처리의 연구는 아직 미흡한 실정이다. 본 논문에서는 JPEG XR 의 압축과정과 주파수 성분 분포의 분석을 기반으로 효율적인 저역/고역통과 필터 함수를 제안하고, 체계적인 실험을 통해 제안한 필터함수의 효율성을 입증하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.58-60
• /
• 2019

Double JPEG compression detection is one of the most important ways of exposing the integrity of the JPEG image in image forensics. Several methods have been proposed for discriminating against the double JPEG image. In this paper, we propose a new method for restoring the JPEG compressed image and making the detector confused by introducing a Generative Adversarial Network (GAN). First, a generator network is designed for restoring the JPEG compressed image and analyzed the quality. Then, the restored image is tested with the double compression detector for evaluating the robustness of the proposed GAN model. The detection accuracy reduces from 98% to 58%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4467-4486
• /
• 2016

Discrete cosine transform (DCT) based JPEG standard significantly improves the coding efficiency of image compression, but it is unacceptable event in serious blocking artifacts at low bit rate and low efficiency of high-definition image. In the light of all phase digital filtering theory, this paper proposes a novel transform based on discrete sine transform (DST), which is called all phase discrete sine biorthogonal transform (APDSBT). Applying APDSBT to JPEG scheme, the blocking artifacts are reduced significantly. The reconstructed image of APDSBT-JPEG is better than that of DCT-JPEG in terms of objective quality and subjective effect. For improving the efficiency of JPEG coding, the structure of JPEG is analyzed. We analyze key factors in design and evaluation of JPEG compression on the massive parallel graphics processing units (GPUs) using the compute unified device architecture (CUDA) programming model. Experimental results show that the maximum speedup ratio of parallel algorithm of APDSBT-JPEG can reach more than 100 times with a very low version GPU. Some new parallel strategies are illustrated in this paper for improving the performance of parallel algorithm. With the optimal strategy, the efficiency can be improved over 10%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1790-1806
• /
• 2016

Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.219-226
• /
• 2007

An efficient block based two-layer JPEG encoding algorithm is proposed to compress high dynamic range (HDR) images in this work. The proposed algorithm separates an input HDR image into a tone-mapped low dynamic range (LDR) image and a ratio image, which represents the quotients of the original HDR pixels divided by the tone-mapped LDR pixels. Then, the tone-mapped LDR image is compressed using the standard JPEG scheme to preserve backward compatibility and the ratio image is encoded to minimize a cost function that models the perception of each block with different quantization parameters in the human visual system (HVS). Simulation results show that the proposed algorithm provides better performance than the conventional method, which encodes the ratio image without any prior information of blocks.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.1
• /
• pp.29-35
• /
• 2010

In this paper, we introduce a novel entropy coding method to improve the JPEG image compression standard. JPEG is one of the most widely used image compression methods due to its high visual quality for the compression ratio, and especially because of its high efficiency. Based on the observation that the blocks of data fed to the entropy coder usually contain consecutive sequences of numbers with small magnitudes including 0, 1, and -1, we separate those sequences from the data and encode them using a method dedicated to those values. We further improve the compression ratio based on the fact that this separation makes the lengths of blocks much shorter. In our experiment, we show that the proposed method can outperform the JPEG standard preserving its visual characteristics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.425-428
• /
• 2005

This paper is made up Advanced Image Coding(AIC) that combines algorithms from next generation image coding standard, H.264/MPEG-4 Part 10 advanced video coding(AVC) and still image compression standard, JPEG(Joint Photographic Experts Group). AIC combines intra frame block prediction from H.264 with a JPEG style discrete cosine transform and quantization, followed by Context-based Adaptive Binary Arithmetic Coding(CABAC) as used in H.264. In this paper, we analyzes the efficiency of the AIC algorithm and JPEG and JPEG-2000, and it presents of result.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.165-168
• /
• 2013

Image distortions, such as quantization errors, can have a severe negative impact on the performance of computer vision algorithms, and, more specifically, on object detection algorithms. State-of-the-art implementations of the JPEG-2000 image coder commonly allocate the available bits to minimize the Mean-Squared-Error (MSE) distortion between the original image and the resulting compressed image. However, considering that some state-of-the-art object detection methods use the gradient information as the main image feature, an improved object detection performance is expected for JPEG-2000 image coders that allocate the available bits to minimize the distortions on the gradient content. Accordingly, in this work, the Gradient Mean-Squared-Error (GMSE) based JPEG-2000 coder presents an improved object detection performance over the MSE based JPEG-2000 image coder when the object of interest is located at the same spatial location of the image regions with the strongest gradients and also for high bit-rates. For low bit-rates (e.g. 0.07bpp), the GMSE based JPEG-2000 image coder becomes overly selective in choosing the gradients to preserve, and, as a result, there is a greater chance of mismatch between the spatial locations of the gradients that the coder is trying to preserve and the spatial locations of the objects of interest.