• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.2
• /
• pp.133-138
• /
• 2015

This paper presents a performance improvement of gray level co-occurrence matrix(GLCM) based on the nonuniform quantization, which is generally used to analyze the texture of images. The nonuniform quantization is given by Lloyd algorithm of recursive technique by minimizing the mean square error. The nonlinear intensity levels by performing nonuniformly the quantization of image have been used to decrease the dimension of GLCM, that is applied to reduce the computation loads as a results of generating the GLCM and calculating the texture parameters by using GLCM. The proposed method has been applied to 30 images of $120{\times}120$ pixels with 256-gray level for analyzing the texture by calculating the 6 parameters, such as angular second moment, contrast, variance, entropy, correlation, inverse difference moment. The experimental results show that the proposed method has a superior computation time and memory to the conventional 256-level GLCM method without performing the quantization. Especially, 16-gray level by using the nonuniform quantization has the superior performance for analyzing textures to another levels of 48, 32, 12, and 8 levels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2340-2354
• /
• 2011

A new and secure image steganographic scheme based on nonuniform discrete Fourier transform (NDFT) is proposed in this paper. First, the chaotic system is introduced to select embedding points randomly in NDFT domain suitable range, and NDFT is implemented on every non-overlapping block of eight consecutive pixels. Second, the secret messages are scrambled by chaotic systems, and embedded into frequency coefficients by quantization method. The stego-image is obtained by inverse NDFT (INDFT). Besides, in order to discriminate tampers, the low frequency wavelet coefficients of 7 most significant bits (MSBs) of the stego-image are converted into the binary sequence after nonuniform scalar quantization. Then the obtained binary sequence is scrambled by the chaotic systems, and embedded into the least significant bit (LSB) of the stego-image. Finally, the watermarked stego-image can be obtained by a new improved LSB steganographic method. The embedded secret messages can be extracted from the watermarked stego-image without the original cover image. Experimental results show the validity of the proposed scheme, and dual statistics attacks are also conducted to indicate the security.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.792-797
• /
• 2013

This paper has derived the conversion loss according to the synchronized condition between the transmitted and locally generated spreading signals for the civil global positioning system (GPS) receiver in the heavy wideband Gaussian noise environments. From this, the outputs of the 2-bit nonuniform quantizer, which has the minimum conversion loss, is set to ${\pm}1$ and ${\pm}2$, while the quantization step size is approximated to the jamming-to-signal power ratio.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.41-45
• /
• 1985

A suboptimum block quantization method is investigated for efficent transform coding. In our study the following method has appeared as suboptimum. At first, optimum bit allocation is done assuming the varances of the transform coefficients are known. Secndly, a varance estimation algorithm which results from the approximate equations governing the optimum vit alllocation is applied. The better performance of the proposed block quantization method has been confirmed by simulations based on varous pdf assumptions. the results indicate that the proposed method yields overall improvements of about 25% in NMSE for both the symmetric nonuniform and uniform quantizer at the coding rate of 1 bit/pel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1217-1233
• /
• 2015

The paper studies characteristics of the minimum mean-square error symmetric scalar quantizers for the generalized gamma, Bucklew-Gallagher and Hui-Neuhoff probability density functions. Toward this goal, asymptotic formulas for the inner- and outermost thresholds, and distortion are derived herein for nonuniform quantizers for the Bucklew-Gallagher and Hui-Neuhoff densities, parallelling the previous studies for the generalized gamma density, and optimal uniform and nonuniform quantizers are designed numerically and their characteristics tabulated for integer rates up to 20 and 16 bits, respectively, except for the Hui-Neuhoff density. The assessed asymptotic formulas are found consistently more accurate as the rate increases, essentially making their asymptotic convergence to true values numerically acceptable at the studied bit range, except for the Hui-Neuhoff density, in which case they are still consistent and suggestive of convergence. Also investigated is the uniqueness problem of the differentiation method for finding optimal step sizes of uniform quantizers: it is observed that, for the commonly studied densities, the distortion has a unique local minimizer, hence showing that the differentiation method yields the optimal step size, but also observed that it leads to multiple solutions to numerous generalized gamma densities.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.655-665
• /
• 2012

Based on wideband precoding (WBP) in the multiple-input multiple-output orthogonal frequency division multiplexing system, an adaptive nonuniform codebook is presented in this paper. The relationship between the precoder distribution and spatial correlation is analyzed at first. A closed-form expression based on overlapped isosceles triangles is proposed as an approximation of the precoder distribution. Then, the adaptive codebook design is derived with the approximate distribution to minimize quantization errors. The capacity and bit error rate performance demonstrate that the adaptive codebook with WBP outperforms the conventional fixed uniform codebook.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.498-504
• /
• 2009

A high-performance low-complexity decoding algorithm for LDPC codes is proposed in this paper, which has the advantages of both bit-flipping (BF) algorithm and sum-product algorithm (SPA). The proposed soft bit-flipping algorithm requires only simple comparison and addition operations for computing the messages between bit and check nodes, and the amount of those operations is also small. By increasing the utilization ratio of the computed messages and by adopting nonuniform quantization, the signal-to-noise ratio (SNR) gap to the SPA is reduced to 0.4dB at the frame error rate of 10-4 with only 5-bit assignment for quantization. LDPC codes with high column or row weights, which are not suitable for the SPA decoding due to the complexity, can be practically implemented without much worsening the error performance.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.489-492
• /
• 1995

This paper has represented the new system for a multibit oversampled sigma-delta A/D convertor. The novel digital correction scheme with the ROM-Table is employed to enhance SNR without requiring accurate precision of the analogue components. This architectures have a good features compared with the 1-bit approach, including significantly lower quantization noise for a given oversampling ratio, as well as improved stability characteristics. Then we have shown the validity of the proposed system by use of the software for the performance evaluation and by realizing the system with SCFs(switched capacitor filter).

• Proceedings of the KAIS Fall Conference
• /
• 2008.05a
• /
• pp.278-281
• /
• 2008

본 논문은 그림자 밝기의 선형적 변화를 비균일하게 양자화하여 그림자를 검출하는 기법을 제안한다. 그림자의 밝기의 선형성 적용은 기하학 정보, 광원의 종류 및 방위에 독립적일 수 있다는 장점이 있다. 이 기법은 그림자 밝기가 점진적으로 변하거나 변화가 없다는 가정과 그림자는 어둡다는 공리를 기반한다. 먼저, 전처리를 통하여 그림자 후보영상을 검출한다. 다음으로, 인접화소들 사이의 선형의존성을 낮추기 위하여 유사 밝기를 대표 밝기로 표현하기 위해 양자화 한다. 이때 선형성을 증가시키 위해 등비수열을 이용하여 비균일 양자화한다. 마지막으로, 그림자 밝기의 선형적 변화 특성을 이용하여 선형의존성이 높은 그림자를 검출한다. 임의의 단일 자연영상의 실험에서, 제안한 알고리즘은 본영과 단색 배경을 갖는 반영 및 셀프그림자의 검출에 강건함을 보였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.22-30
• /
• 2015

For long-term evolution (LTE) MIMO transmission, codebooks are used to utilize the estimated channel information under the limited feedeback environment, and related study has been actively performed. Existing codebooks include codevectos constructed based on vector quantization (VQ) and discrete Fourier transform (DFT), and the LTE standard specifies codebooks modified from these examples to support up to 8 transmit antennas. As the number of antennas increases and as the spatial channel model is used as a standard environment to evaluate the LTE transmission performance, new beamforming methods as well as codebook designs are needed. In this paper, we implement the 3-dimensional spatial channel model (3D-SCM) to analyze the key statistical characteristics of the generated channel, and present efficient ways of determining corresponding codebooks. In particular, we propose a nonuniform-phase DFT-based codebook to improve the existing uniform-phase DFT-based codebook, and evaluate its performance under the given SCM transmission environment. There exists a strong tendancy in statistical distributions of the phase difference between adjacent antenna elements for the SCM, which can be appropriately exploited in codebook design to produce a performance gain over the existing design.