In many applications of digital video database systems such as digital library, video data is often compressed with MPEG video algorithms. It will be an important technique to insert the additional information data like indexes and contents effectively into video database which is compressed with MPEG, because we can always deal with the additional information with video data itself easily. We propose a method for inserting optional binary data such as index information of digital library into MPEG-1 and -2 bitstreams. The binary data inserted MPEG video bitstreams using our proposed scheme are also according to the specification of the MPEG video frame structure. The proposed method allows us to extract the inserted binary data perfectly though MPEG-1 and -2 video are lossy algorithms. And the quality of decoded images after extracting added information is almost the same as that of ordinary MPEG bitstreams. Furthermore, traditional standard MPEG-1 and -2 video decoder which can not extract inserted binary data can also decode images from the binary data inserted MPEG video bitstreams without obvious image degradation. There are some different points between the proposed insertion technique of the binary data and the watermarking technique. The technique of watermarking prepares to deal with alter watermarking by others. And the technique of watermarking is required for the identification of the signature and the perfect extraction of the inserted image signature is not required in the lossy MPEG video environment. On the other hand, we have to extract all of the inserted binary information data correctly with the insertion technique of the binary information. Simulations using MPEG video sequences with inserted binary data are presented to quantify some performance factors concerned. We have not heard about inserting data method which purpose is such as index and content information insertion.

We propose an image identification scheme for double-compressed encrypted JPEG images that aims to identify encrypted JPEG images that are generated from an original JPEG image. To store images without any visual sensitive information on photo sharing services, encrypted JPEG images are generated by using a block-scrambling-based encryption method that has been proposed for Encryption-then-Compression systems with JPEG compression. In addition, feature vectors robust against JPEG compression are extracted from encrypted JPEG images. The use of the image encryption and feature vectors allows us to identify encrypted images recompressed multiple times. Moreover, the proposed scheme is designed to identify images re-encrypted with different keys. The results of a simulation show that the identification performance of the scheme is high even when images are recompressed and re-encrypted.

We propose an efficient two-layer near-lossless coding method using an extended histogram packing technique with backward compatibility to the legacy JPEG standard. The JPEG XT, which is the international standard to compress HDR images, adopts a two-layer coding method for backward compatibility to the legacy JPEG standard. However, there are two problems with this two-layer coding method. One is that it does not exhibit better near-lossless performance than other methods for HDR image compression with single-layer structure. The other problem is that the determining the appropriate values of the coding parameters may be required for each input image to achieve good compression performance of near-lossless compression with the two-layer coding method of the JPEG XT. To solve these problems, we focus on a histogram-packing technique that takes into account the histogram sparseness of HDR images. We used zero-skip quantization, which is an extension of the histogram-packing technique proposed for lossless coding, for implementing the proposed near-lossless coding method. The experimental results indicate that the proposed method exhibits not only a better near-lossless compression performance than that of the two-layer coding method of the JPEG XT, but also there are no issue regarding the combination of parameter values without losing backward compatibility to the JPEG standard.

We propose two methods for avoiding the checkerboard distortion which is caused by finite word length error. The first method derives the bit length of filter coefficients required for avoiding the checkerboard distortion under a certain word length. In the second method, the checkerboard distortion can be avoided by using the cascade structure which consists of zero-hold kernel and a time-invariant filter factorized from a filter with structure for avoiding the checkerboard distortion under linear systems. It is demonstrated by simulations that we can avoid the checkerboard distortion by using these proposed methods.

In this paper, we propose a combined use of transformed images and vision transformer (ViT) models transformed with a secret key. We show for the first time that models trained with plain images can be directly transformed to models trained with encrypted images on the basis of the ViT architecture, and the performance of the transformed models is the same as models trained with plain images when using test images encrypted with the key. In addition, the proposed scheme does not require any specially prepared data for training models or network modification, so it also allows us to easily update the secret key. In an experiment, the effectiveness of the proposed scheme is evaluated in terms of performance degradation and model protection performance in an image classification task on the CIFAR-10 dataset.

This paper describes an effective technique for coding QCIF video sequences based on a JPEG2000 codec. In the proposed method, multiple frames are combined into one large picture. The larger picture enables images to be coded more efficiently. Image quality is further improved by combining the frames symmetrically. The video sequence is efficiently coded by adapting the time correlation of the video sequences to spatial correlation. We demonstrated the effectiveness of this method by encoding QCIF video sequences using JPEG2000.

JPEG2000 compression standard considers a block of wavelet coefficients, called codeblock, as the smallest coding unit that being independently entropy-coded. In this paper, we propose a codeblock-based concealment technique for JPEG2000 images to mitigate missing codeblock due to packet loss in network transmission. The proposed method creates a single JPEG2000 codestream from an image that composed of several subsampled versions of the original image and transmit the codestream over a single channel.The technique then substitutes the affected codeblock in a subsampled image with a copy of the corresponding codeblock obtained from other subsampled images. Thus, it does not require an iterative processing, which is time consuming, to construct an estimated version of the lost data. Moreover, it is applicable for a large codeblock size and can be implemented either in wavelet or codestream domain. Simulation results confirm the effectiveness of the proposed method.

In this paper, a super-resolution method based on the Discrete Cosine Transform (DCT) is proposed for a signal with some frequency damage. If the damage process can be modeled as linear convolutoin with a type 1 linear phase FIR filter, it is shown that some DCT coefficients of the damaged signal are the same as those of the original signal except for the DCT coefficients corresponding to the frequency damage. From this investigation, the proposed method is provided for the DCTs with four types as expanding the super-resolution method based on the Discrete Fourier Transform (DFT). In addition,two magnification approaches based on the proposed method are described to improve the conventional approach.

A pipelined adaptive digital filter (ADF) architecture based on a two-dimensional least mean square algorithm is proposed. This architecture enables the ADF to be operated at a high clock rate and reduction of the required amount of hardware. To achieve this reduction we introduce a new building unit, called a block, and propose implementing the pipelined ADF using the block, Since the number of blocks in a cell is adjustable, we derive a condition for satisfying given specifications. We show the smallest number of blocks and the corresponding delay can be determined by using the proposed method.

This paper proposes a reversible two dimensional (2D) discrete wavelet transform (DWT) for lossless coding which is compatible with the irreversible 2D 9-7 DWT for lossy coding in the JPEG 2000. Since all the filters and scalings are factorized into a product of lifting steps, and signal values are rounded into integers, the proposed DWT is reversible and applicable to lossless coding of 2D signals. We replace a part of the separable 2D transfer function of the 2D DWT by a non separable 2D lifting structure, so that the number of rounding operations is decreased. We also investigate performance of the DWT under octave decomposition case and theoretically endorse it. As a result, reduction of the rounding errors due to the replacement was confirmed. It means that compatibility of the reversible DWT to the irreversible 2D 9-7 DWT is improved.

In this paper, we consider the selection of analysis filters used in the delayless subband adaptive digital filter (SBADF) and propose to use simple analysis filters to reduce the computational complexity. The coefficients of filters are determined using the components of the first order Hadamard matrix. Because coefficients of Hadamard matrix are either 1 or -1, we can analyze signals without multiplication. Moreover, the conditions for convergence of the proposed method is considered. It is shown by computer simulations that the proposed method can converge to the Wiener filter.

In this paper, a two-dimensional (2-D) binary-valued (BV) lapped transform (LT) is proposed. The proposed LT has basis images which take only BV elements and satisfies the axial-symmetric (AS) property. In one dimension, there is no 2-point LT with the symmetric basis vectors, and the property is achieved only with the non-overlapping basis which the Hadamard transform (HT) has. Hence, in two dimension, there is no 22-point separable ASLT, and only 2-D HT can be the 22-point separable AS orthogonal transform. By taking non-separable BV basis images, this paper shows that a 22-point ASLT can be obtained. Since the proposed LT is similar to HT, it is referred to as the lapped Hadamard transform (LHT). LHT of larger size is shown to be provided with a tree structure. In addition, LHT is shown to be efficiently implemented by a lattice structure.

The checkerboard effect is caused by the periodic time-variant property of multirate filters which consist of up-samplers and digital filters. Although the conditions for some one-dimensional (1D) multirate systems to avoid the checkerboard effect have been shown, the conditions for Multidimensional (MD) multirate systems have not been considered. In this paper, some theorems about the conditions for MD multirate filters without checkerboard effect are derived. In addition, we also consider MD multirate filter banks without checkerboard effect. Simulation examples show that the checkerboard effect can be avoided by using the proposed conditions.

We propose a reversible data hiding (RDH) method in compressible encrypted images called the encryption-then-compression (EtC) images. The proposed method allows us to not only embed a payload in encrypted images but also compress the encrypted images containing the payload. In addition, the proposed RDH method can be applied to both plain images and encrypted ones, and the payload can be extracted flexibly in the encrypted domain or from the decrypted images. Various RDH methods have been studied in the encrypted domain, but they are not considered to be two-domain data hiding, and the resultant images cannot be compressed by using image coding standards, such as JPEG-LS and JPEG 2000. In our experiment, the proposed method shows high performance in terms of lossless compression efficiency by using JPEG-LS and JPEG 2000, data hiding capacity, and marked image quality.

A global tone mapping operation (TMO) for high dynamic range (HDR) images with fixed-point arithmetic is proposed and evaluated in this paper. A TMO generates a low dynamic range (LDR) image from an HDR image by compressing its dynamic range. Since an HDR image is generally expressed in a floating-point data format, a TMO also deals with floating-point data even though a resultant LDR image is integer data. The proposed method treats a floating-point number as two 8-bit integer numbers which correspond to an exponent part and a mantissa part, and applies tone mapping to these integer numbers separately. Moreover, the method conducts all calculations in the tone mapping with only fixed-point arithmetic. As a result, the method reduces a memory cost and a computational cost. The evaluation shows that the proposed method reduces 81.25% of memory usage. The experimental results show that the processing speed of the proposed method with fixed-point arithmetic is 23.1 times faster than the conventional method with floating-point arithmetic. Furthermore, they also show the PSNR of LDR images obtained by the proposed method are comparable to those of the conventional method, though reducing computational and memory cost.

Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, ti is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of block delays.

Two schemes for fast identification of JPEG coded images are proposed in this paper. The aim is to identify the JPEG images that are generated from the same original image and have equivalent or different compression ratios. Fast identification can be achieved since the schemes work on the quantized Discrete Cosine Transform (DCT) domain. It is not required to inverse the quantization and the DCT. Moreover, only a few coefficients are commonly required for identification. The first approach can avoid identification leakage or false negative (FN), and probably result in a few false positives (FP). The second approach can avoid both FN and FP, with a slightly higher processing time. By combining the two schemes, a faster and a more perfect identification can be achieved, in which FN and FP can be avoided.

In this paper, we propose a novel QoS (Quality of Service) estimation scheme for JPEG 2000 coded image at RTP (realtime transfer protocol) layer without decoding the image. QoS of streaming video is estimated in view of several points, such as, transmission delay, or quality of received images. In this paper, we evaluate the QoS in terms of quality of received images. Generally, RTP is carried on top of UDP, and hence, quality of transmitted images could be degraded due to packet loss. To estimate the quality of received JPEG 2000 coded image without decoding, we use RTP header extension in order to send additional information to the receiver. The effectiveness of the proposed method is confirmed by the computer simulations.