• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

• Journal of the Korean Professional Engineers Association
• /
• v.20 no.1
• /
• pp.14-20
• /
• 1987

The development of the FHT (fast Hadamard transform) was presented and based on the derivation by Cooley-Tukey algorithm. Alternately, it can be derived by matrix partitioning or matrix factorization techniques. This paper proposes a simple sparse matrix technique by Kronecker product of successive lower Hadamard matrix. The following shows how the Kronecker product can be mathematically defined and efficiently implemented using a matrix factorization methods.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.68-72
• /
• 1983

The Hadamard matrix is a symmetric matrix made of plus and minus ones as entries. There fore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, However, certain degradation aspects have been reported. In this paper we propose a WH matrix which retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assigment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of $\pm$1, $\pm$2, $\pm$3, and the unitform is 8$\times$8 matrix.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.1
• /
• pp.64-71
• /
• 1994

In this paper, we propose orthogonal integer transform(OIT) with general form. Considering the orthogonality and magnitude value order of the DCT Matrix whose performance is found to be close to that of the KLT, known to be optimal. The proposed OIT matrix is composed of values minimizing Hibert-Schmidt norm among integer values which satisfy the condition of orthogonality and the relative magnitudes of the DCT matrix. Comparing the OIT with the DCT, CMT, and ICT in error characteristics, transform efficiency, and maximum reducible bit, it is shown that the performance of the OIT compares more closely to that of the KLT relative to the performances of the DCT, CMT, and ICT when N=8.

• Computers and Concrete
• /
• v.4 no.3
• /
• pp.243-257
• /
• 2007

A novel method for recognition, characterization, and quantification of deterioration in bridge components and laboratory concrete samples is presented in this paper. The proposed scheme is based on grey level co-occurrence matrix texture analysis using Haar's discrete wavelet transform on concrete imagery. Each image is described by a subset of band-filtered images containing wavelet coefficients, and then reconstructed images are employed in characterizing the texture, using grey level co-occurrence matrices, of the different types and degrees of damage: map-cracking, spalling and steel corrosion. A comparative study was conducted to evaluate the efficiency of the supervised maximum likelihood and unsupervised K-means classification techniques, in order to classify and quantify the deterioration and its extent. Experimental results show both methods are relatively effective in characterizing and quantifying damage; however, the supervised technique produced more accurate results, with overall classification accuracies ranging from 76.8% to 79.1%.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.595-598
• /
• 1988

In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.2
• /
• pp.93-103
• /
• 1985

The digital signal processing technique by bandwidth compression has been grown up ragidly owing to integrated circuit developments. In this project, we have proposed the Lee Weighted Hadamard (LWH) transform which retains the main properties of Hadamard matirx. The LWH matrix was weighted in the center of the spatial domain. The human visual of the mid spatial are emphasized more than the low and high spatial frequencies. The fast algorithms of the LWH transform has been studied for hardware realization. The result of this project are availabel to airplane photograph, X-Ray, CATV and the artificial satellite of the digital image processing.

• Journal of the Korean Professional Engineers Association
• /
• v.16 no.4
• /
• pp.15-19
• /
• 1983

Therefore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, however, certain degradation aspects have been reported. In this paper we propose a WH matrixtwhich retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transforms such as Hadamard transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assignment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of ${\pm}$1, ${\pm}$2, ${\pm}$3, ${\pm}$4, and the unitform is 8${\times}$8 matrix.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1795-1796
• /
• 2007

본 논문은 DWT(Discrete Wavelet Transform)기반의 블라인드 워터마킹 기법을 제안 하였다. DWT를 하였을 때, 두 개의 서브밴드들의 계수 값을 변환하여 워터마크를 삽입한다. 기존에는 워터마크를 로고나 signature등을 많이 사용 하였으나, 여기서는 이차원 바코드인 Data Matrix를 워터마크로 사용 하였다. Data Matrix자체가 오류 검출 및 복원 알고리즘을 가지고 있어, 워터마크 추출 시 비교적 작은 에러는 Data Matrix의 복원 알고리즘에 의해 Data Matrix의 암호화된 정보를 복원 할 수 있다.