In this paper a new watermarking technique which is combined with joint photographic experts group (JPEG) encoding system is presented. This method operates in the frequency domain by embedding a pseudo-random sequence of real numbers in a selected set of discrete cosine transform (DCT) coefficients. The embedded sequence is extracted without restoring the original image to fit the trend in the digital still camera (DSC) system. The proposed technique represents a major improvement on methods relying on the comparison between the watermarked and original images. Experimental results show that the proposed watermarking method is robust to several common image processing techniques, including JPEG compression, noise, and blurring. We also implement the whole design by synthesizing with TSMC 1P4M 0.35 µm standard cell. The chip size is 3.0643.064 mm2 for 46374 gate counts. The simulation speed can reach 50 MHz. The power dissipation is 69 mW at 3.3 V 50 MHz.

This paper proposes a new steganographic method utilizing features of JPEG compression. The method embeds secret information using the number of zeroes in a block of quantized DCT coefficients in minimum coding units (MCU) of JPEG images. In the method, we can embed secret information into JPEG images with degradation like that by JPEG compression. Furthermore, the method causes little change of the histogram of quantized DCT coefficients, so it is hard to perceive secret information embedded by the method. The method mainly modifies boundaries between zero and non-zero DCT coefficients, so we can use the low frequency side of DCT coefficients for another steganographic method.

Discrete cosine transform (DCT) coding has been proven to be an efficient means of image compression coding. A lot of efforts have been made to improve the coding efficiency of DCT based coding. This paper presents an adaptive DCT coding based on geometrical edge representation. This scheme is designed to properly exploit the correlation between edge direction and distribution of DCT coefficients. Edges are extracted from original images first. Then, sub-optimal block-size and scanning order are determined at each block based on the extracted edges. In this way an adaptive DCT scheme taking account of local characteristics of image can be achieved. It is shown through the simulations that the proposed algorithm outperforms a conventional coding scheme in terms of coding efficiency by 10-15%.

We have classified parenchymal echo patterns of cirrhotic liver into four types, according to the size of hypo echoic nodular lesions. The NN (neural network) technique has been applied to the characterization of hepatic parenchymal diseases in ultrasonic B-scan texture. We employed a multilayer feedforward NN utilizing the back-propagation algorithm. We extracted 1616 pixels in the two-dimensional regions. However, when a large area is used, input data becomes large and much time is needed for diagnosis. In this report, we used DCT (discrete cosine transform) for the feature extraction of input data, and compression. As a result, DCT was found to be suitable for compressing ultrasonographic images.

Compatibility of conventional lossless discrete cosine transforms (LDCTs) with the discrete cosine transform (DCT) is not high due to rounding operations. In this paper, we design an LDCT which has high compatibility with the DCT. We first design an 8-point DCT (DCT3) by changing the order of row of the transform matrix and also the way of decomposing the DCT in order to obtain an 8-point LDCT which has high compatibility with the DCT. Next we design an 88-point nonseparable 2D LDCT based on a 4-point lossless Walsh-Hadamard Transform (LWHT) which is multiplier-free. The DCT3 is used, when the nonseparable 2D LDCT is designed. Simulation results show that compatibility of the nonseparable 2D LDCT with the separable 2D DCT is high. We also design an 88-point nonseparable 2D LWHT which is multiplier-free and indicate that its compatibility with the separable 2D Walsh-Hadamard Transform is high.

This letter proposes a method which can embed index data such as memos into JPEG images. The method embeds digital watermarks using the quantitative relation between quantized DCT coefficients in JPEG images. In the method, we can embed extra data to represent index data and can extract the index data without parameters used in embedding process. Furthermore, the method is tolerant of JPEG recompression and prevents the degradation of image quality by rewriting index data.

In this paper, we propose a bit-rate adaptive coding system based on lossless DCT (L-DCT). Our adaptive coding system consists of three different operation modes: lossless, near-lossless and lossy coding modes. Quantization is applied in transform domain (after the L-DCT) and spatial domain (before the L-DCT) in lossy mode and near-lossless mode, respectively. Our adaptive coding system can automatically select its operation mode at a given bit rate because it contains a function to calculate the turning point between near-lossless mode and lossy mode from characteristic of input signal. Existence of the turning point is mathematically proved in this paper. Simulation results confirm not only effectiveness of our adaptive coding system but also accuracy of our theoretical analysis.

Image processing in transform domain has many advantages but it could be suffered from local effects such as a blocking artifact. In this paper, an image processing is performed by weighting coefficients in the compressed domain, i.e., filtering coefficients are appropriately selected according to the processing. Since we find the appropriate factors according to global image enhancement, blocking artifacts are reduced between inter-blocks. Experimental results show that the proposed technique has the advantages of simple computation and easy implementation.

In this paper, we propose new approaches to speech enhancement based on soft decision. In order to enhance the statistical reliability in estimating speech activity, we introduce the concept of a global speech absence probability (GSAP). First, we compute the conventional speech absence probability (SAP) and then modify it according to the newly proposed GSAP. The modification is made in such a way that the SAP has the same value of GSAP in the case of speech absence while it is maintained to its original value when the speech is present. Moreover, for improving the performance of the SAP's at voice tails (transition periods from speech to silence), we revise the SAP's using a hang-over scheme based on the hidden Markov model (HMM). In addition, we suggest a robust noise update algorithm in which the noise power is estimated not only in the periods of speech absence but also during speech activity based on soft decision. Also, for improving the SAP determination and noise update routines, we present a new signal to noise ratio (SNR) concept which is called the predicted SNR in this paper. Moreover, we demonstrate that the discrete cosine transform (DCT) enhances the accuracy of the SAP estimation. A number of tests show that the proposed method which is called the speech enhancement based on soft decision (SESD) algorithm yields better performance than the conventional approaches.

A flexible noise generation algorithm using DCT is proposed. The proposed method outperforms the conventional methods when a noise model requires complicated PSD (Power Spectral Density) specifications. Also, it is shown that the proposed system can be used for the test of VDSL (Very high-speed Digital Subscriber Line).

In this paper, a novel adaptive digital watermarking approach based upon human visual system model and fuzzy clustering technique is proposed. The human visual system model is utilized to guarantee that the watermarked image is imperceptible. The fuzzy clustering approach has been employed to obtain the different strength of watermark by the local characters of image. In our experiments, this scheme allows us to provide a more robust and transparent watermark.

This paper discusses recognition up to intensities of mix of primary facial expressions in real time. The proposed recognition method is compatible with the MPEG-4 high level expression Facial Animation Parameter (FAP). In our method, the whole facial image is considered as a single pattern without any block segmentation. As model features, an expression vector, viz. low global frequency coefficient (DCT) changes relative to neutral facial image of a person is used. These features are robust and good enough to deal with real time processing. To construct a person specific model, apex images of primary facial expression categories are utilized as references. Personal facial expression space (PFES) is constructed by using multidimensional scaling. PFES with its generalization capability maps an unknown input image relative to known reference images. As PFES possesses linear mapping characteristics, MPEG-4 high level expression FAP can be easily calculated by the location of the input face on PFES. Also, temporal variations of facial expressions can be seen on PFES as trajectories. Experimental results are shown to demonstrate the effectiveness of the proposed method.

This paper presents the design of a modulated complex lapped transform (MCLT) processor and its complex programmable logic device (CPLD) implementation. The MCLT is a 2x oversampled DFT filter bank; it performs well in applications that require a complex filter bank, such as noise reduction and acoustic echo cancellation. First, we show that the MCLT can be mapped to a Fast Fourier Transform (FFT). Then efficient implementation for fast MCLT computation is realized on the CPLD hardware using pipelining techniques. Detailed circuit design for the MLCT processor is presented, as well as timing diagrams for design verification and performance evaluation.

Digital watermarking schemes have been discussed to solve the problem associated with copyright enforcement. Previously, we proposed a method using inter-block correlation of DCT coefficients. It has the features that the embedded watermark can be extracted without the original image nor the parameters used in embedding process and that the amount of modification, the strength of embedded watermark, depends on the local feature of an image. This feature makes it difficult for pirate to predict the position in which the watermark signal is embedded. In this paper, we propose a method which can embed/extract watermark with high speed by utilizing this watermarking method for JPEG file format.

In this paper, a technique to reduce the overhead of Vector Quantization (VQ) coding is developed here. Our method exploits the inter-index correlation property to reduce the overhead to transmit encoded indices. Discrete Cosine Transform (DCT) is the tool to decorrelate the above correlation to get further bit rate reduction. As we know, the codewords in the codebook that generated from conventional LBG algorithm do not have any specified orders. Hence, the indices for selected codewords to represent respective adjacent blocks are random distributions. However, due to the homogeneous property existing among adjacent regions in original image, we re-arrange the codebook according to our predefined weighting criterion to enable the selected neighboring indices capable of indicating the homogeneous feature as well. Then, DCT is used to compress those VQ encoded indices. Because of the homogeneous characteristics existing among the selected adjacent indices after codebook permutation, DCT can achieve better compression efficiency. However, as we know, DCT introduces distortion by the quantization procedure, which yield error-decoded indices. Therefore, we utilize an index residue compensation method to make up that error decoded indices which have high complexity deviation to reduce those unpleasant visual effects caused by distorted indices. Statistics illustrators and table are addressed to demonstrate the efficient performance of proposed method. Experiments are carried out to Lena and other natural gray images to demonstrate our claims. Simulation results show that our method saves more than 50% bit rate to some images while preserving the same reconstructed image qualities as standard VQ coding scheme.

Lossless block transforms and filter banks that map integers to integers are important for unified lossless and lossy image coding systems. In this paper, we present simple yet effective methods for designing lossless versions of block transforms and FIR filter banks. First, an N-point lossless transform and a lossless interpolative prediction are introduced. Next, we demonstrate that filter banks can be decomposed into 2-point transforms or interpolative predictions. Lastly, lossless versions of block transforms and filter banks are obtained by replacing every constituent module by the corresponding lossless version. Lossless versions of 8-point discrete cosine transform (DCT), 8-point Walsh-Hadamard transform (WHT) and several filter banks are designed and their lossless compression performance is evaluated.

Multi-input floating gate differential amplifier (FGDA) is proposed which can perform any convolution operation with differential structure and feedback loop. All operations are in the voltage mode. Only one terminal is required for the negative feedback which can suppress distortions due to mismatches of active elements. Possible applications include intelligent image sensor, where fully parallel DCT operation can be performed. A prototype chip is fabricated which is functional. A preliminary test result is reported.

Research in very low-bit rate coding has made significant advancements in the past few years. Most recently, the introduction of the MPEG-4 proposal has motivated a wide variety of a approaches aimed at achieving a new level of video compression. In this paper we review progress in VLBV categorized into 3 main areas. (1) Waveform coding, (2) 2D Content-based coding, and (3) Model-based coding. Where appropriate we also described proposals to the MPEG-4 committee in each of these areas.

While high compression ratio has been achieved using recently developed image coding algorithm, the noise removal technique is considered as an important subject. This still holds for very low bitrate video coding, that is, MPEG-4 has defined it as a core experiment which is mainly concerned with block based discrete cosine transform (DCT) coding such as H.263 and MPEG-1. This paper describes a novel and practical technique which attempts to accomplish both noise suppression and detail preservation at the same time. Some of the conventional adaptive filters are designed to search a homogeneous region among the predetermined polygonal subregions, then to apply a smoothing operation within the selected subregion. It shall be, however noted that sometimes the predetermined subregion finally selected may still be hererogeneous. This fact leads us to a novel idea; instead of examining the predetermined regions, define a lot more flexible region likely to be homogeneous. In order to achieve this, we introduce the binary index. each pixel is classified into either the lower intensity group or higher intensity group based on a local statistics. Then a smoothing operation is applied within the pixels having the same group index as the pixel to be processed. Thus our scheme can search a homogeneous region appropriately. The adaptive smoothing adopted in the proposed scheme is also designed to be consistent with an important property of human visual system, i.e., the spatial masking. noise visibility decreases at spatial details such as edges and textures. Another advantage is that it can be realized with significantly low computations. The simulation results show that his approach can suppress the visible artifacts while retaining the fine details such as edge and texture.

In this article, a new multiplication type D/A conversion system using CCD is proposed and the result of simulations for evaluating its performance is reported. The system consists of a recursive charge divider which divides input charge-packet Qin sequentially into output charge-packets Qin2-i and two charge-packet accumulators which accumulates output charge-packets from the recursive divider selectively according to digital input signal bits atarting from MSB. The system converts input digital signal bit by bit, fully in chargedomain, thus the power consumption for this system is supposed to be very low. Also in this article, an effective method to achieve higher accuracy for splitting a charge-packet into two equal-sized packets using very simple hard-ware structure is proposed. As the result of simulations, we have found that the upper limit of accuracy for the conversion is determined by transfer efficiency of CCD, and within this range a trade-off relationship exists among conversion-accuracy, circuit-size and conversion-rate. This unique relationship enables to reduce the circuit size of D/A converter significantly maintaining the accuracy of conversion by slowing down the conversion-rate. This D/A converter is appropriate especially for the system integration because of its simple structure, tolerance to the fabrication error and low power consumption inherrent in the nature of CCD. By using of this system, it is expected to be possible to realize a focal plane image processor performing parallel analog operations such as DCT conversion with CCD imager incorporated on the same Si chip by the same MOS process technology.