정수 직교 겹침 변환을 이용한 이미지 압축

이상호,장준호,김영섭,임상민,Lee, Sang-Ho,Jang, Jun-Ho,Kim, Young-Seop,Lim, Sang-Min 한국반도체디스플레이기술학회 2009 반도체디스플레이기술학회지 Vol.8 No.3

Recently, block-based transforms, like discrete cosine transform (DCT), have been widely used in image and video coding standards, but block-based transforms have a weak point with blocking effect. However, the integer lapped orthogonal transform (ILOT) is a tool for block-based coding with bases functions that overlap near blocks, so it has a strong point against blocking effect. Although it has slightly higher arithmetic complexity than the DCT, the coding gain is significantly higher with much less blocking artifacts. This paper introduces the integer lapped orthogonal transforms and discrete cosine transform. And we compare the performance of DCT with ILOT which is proposed a new efficient method for image coding applications.

효과적인 영상 압축을 위한 웨이브렛 기저들의 응용에 관한 연구

지인호 한국전기전자학회 2017 전기전자학회논문지 Vol.21 No.1

Image compression is now essential for applications such as transmission and storage in data bases. For video and digital image applications the use of long tap filters, while not providing any significant coding gain, may increase the hardware complexity. We use a wavelet transform in order to obtain a set of bi-orthogonal sub-classes of images; First, the design of short kernel symmetric analysis is presented in 1-dimensional case. Second, the original image is decomposed at different scales using a subband filter banks. Third, this paper is presented a technique for obtaining 2-dimensional bi-orthogonal filters using McClellan transform. It is shown that suggested wavelet bases is well used on wavelet transform for image compression. From performance comparison of bi-orthogonal filter, we actually use filters close to ortho-normal filters on application of wavelet bases to image analysis. 영상 압축은 데이터베이스에서 전송과 저장의 응용에 매우 중요한 분야이다. 비디오나 디지털 영상 응용에서 긴 탭의 필터를 사용하면 의미 있는 정도의 코딩이득은 얻지만 하드웨어의 복잡도를 증가시킨다. 우리는 한 쌍의 쌍직교 성질의 부 분할의 영상을 얻기 위하여 웨이브렛 변환을 사용한다. 첫째, 짧고 주요한 대칭 분석의 구현을 1차원 경우에 제시하였다. 둘째, 원래의 영상이 부대역 필터뱅크를 사용하여 다른 스케일로 분해되었다. 셋째, 본 논문에서 McClellan 변환을 사용하여 2차원의 쌍직교 필터를 얻는 기법을 제시하였다. 제시하는 웨이브렛 기저들이 영상압축에 사용되는 웨이브렛 변환에 효과적으로 사용될 수 있음을 보였다. 쌍직교 필터들의 성능 비교표로부터 웨이브렛 기저의 영상에 대한 응용에서는 우리는 실제적으로 ortho-normal 필터에 근사한 필터를 사용한다.

3D Model Retrieval Based on Orthogonal Projections

Wei, Liu,Yuanjun, He Society for Computational Design and Engineering 2006 International Journal of CAD/CAM Vol.6 No.1

Recently with the development of 3D modeling and digitizing tools, more and more models have been created, which leads to the necessity of the technique of 3D mode retrieval system. In this paper we investigate a new method for 3D model retrieval based on orthogonal projections. We assume that 3D models are composed of trigonal meshes. Algorithms process first by a normalization step in which the 3D models are transformed into the canonical coordinates. Then each model is orthogonally projected onto six surfaces of the projected cube which contains it. A following step is feature extraction of the projected images which is done by Moment Invariants and Polar Radius Fourier Transform. The feature vector of each 3D model is composed of the features extracted from projected images with different weights. Our System validates that this means can distinguish 3D models effectively. Experiments show that our method performs quit well.

고속 M-Gold-Hadamard 시퀀스 트랜스폼

이미성(Mi Sung Lee),이문호(Moon Ho Lee),박주용(Ju Yong Park) 大韓電子工學會 2010 電子工學會論文誌-TC (Telecommunications) Vol.47 No.7

본 논문에서는 GF(2)에서의 두 생성다항식에 의해 생성된 M-sequence로 Gold-Sequence를 생성한 후, Permutation을 해줌으로써 Hadamard 행렬의 특성을 가지게 됨을 살펴보았다. M-sequence는 선형 귀환 천이 레지스터 부호 생성기(Linear feedback shift register code generator)에 의해 생성되었으며, 두 개의 M-sequence에 의해 생성된 Gold-sequence의 첫 열에 8×1의 영행렬을 추가하고 Permutation을 시켜줌으로써 Hadamard 행렬의 주요 성질인 직교성(Orthogonal)과 한 행렬과 이 행렬의 Transpose시킨 행렬의 결과가 단위행렬이 되고, 역행렬은 element-wise Inverse가 되며, 고속 Jacket행렬의 성질을 만족한다. 또한 선형 귀환 축차 생성기를 통하여 생성된 M-sequence의 1행과 1열을 추가함으로써 위에서 언급한 Hadamard 행렬의 주요 성질을 만족하고 L-matrix 와 S-matrix 를 통하여 고속변환이 가능함을 보인다. In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

직교변환에 의한 Walsh 및 Golay 코드의 상호상관 제어방식과 수정된 코드를 사용한 비동기 CDMA 시스템의 비트오율 성능에 관한 연구

이원창,김명진,Lee, Won-Chang,Kim, Myoung-Jin 한국융합신호처리학회 2008 융합신호처리학회 논문지 (JISPS) Vol.9 No.4

Walsh 코드나 Golay 코드와 같은 직교 코드는 동기가 맞지 않은 경우 상호상관 값이 커질 수 있으므로 CDMA 시스템의 역방향 링크와 같이 사용자간 동기가 맞지 않는 경우 직교성이 손상되어 사용자간 간섭이 발생하기 때문에 사용자 구별용으로 거의 사용되지 않는다. Wysocki는 기존의 Walsh-Hadamard 행렬에 직교변환 행렬을 곱함으로써 생성된 코드들이 직교성을 유지하면서 코드간 상호상관 값이 커지지 않도록 할 수 있음을 보였다. Soberly와 Wysocki는 Golay 코드에 대해서 유사한 상호상관 함수의 제어방식을 제안하였다. 이것은 적절한 직교변환을 사용하면 Walsh 코드나 Golay 코드의 상호상관 값을 감소시킬 수 있고, 따라서 CDMA 역방향 링크에서 사용자 구별용으로 사용될 수 있음을 의미한다. 본 논문에서는 비동기 CDMA 링크의 성능에 영향을 주는 코드간의 상호상관 관련 파라미터들을 알아보고, 직교변환에 의해 이들 파라미터들이 어떻게 변화되는지 분석하였다. Walsh 코드와 Golay 코드에 대한 직교변환 행렬을 설계함에 있어 수정된 Walsh 또는 Golay 코드의 직교성을 유지하면서 결과 코드의 비주기 상호상관 피크치의 최대값($ACC_{max}$) 또는 비주기 상호상관의 제곱평균($R_{cc}$)을 최소화하도록 하였다. 직교변환에 의해 생성된 코드집합을 사용한 CDMA 시스템에 대하여 사용자간 동기가 맞지 않은 경우에 대해 비트오율 성능을 시뮬레이션을 통해 분석하여 성능을 개선시킬 수 있음을 확인하였다. Orthogonal codes like Walsh and Golay codes may have large correlation value when they are not synchronized, hence they are seldom used in asynchronous CDMA systems. Wysocki[1] showed that by multiplying the original Walsh-Hadamard matrix with an orthogonal transformation matrix the resultant matrix sustains orthogonality between row vectors and their cross-correlation can be reduced. Soberly and Wysocki[2] proposed similar scheme on Golay codes. This implies that using the proper orthogonal transformation cross-correlation of Walsh and Golay codes can be reduced, and the transformed codes can be used for user separation in the CDAM reverse link. In this paper we discuss cross-correlation related parameters which affect the performance of an asynchronous CDMA link, and we investigate the correlation properties of the transformed codes. When we designed orthogonal transformation matrices for Walsh and Golay codes, we minimized the maximum value of aperiodic cross-correlation of the codes ($ACC_{max}$) or the mean square value of the aperiodic cross-correlation($R_{cc}$) with preserving the orthogonality of the modified codes. We also evaluate the asynchronous CDMA system that uses the transformed Walsh and Golay codes.

Quasi-Orthogonal Space-Time Block Codes Designs Based on Jacket Transform

Song, Wei,Lee, Moon-Ho,Matalgah, Mustafa M.,Guo, Ying The Korea Institute of Information and Commucation 2010 Journal of communications and networks Vol.12 No.3

Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

Quasi-Orthogonal Space-Time Block Codes Designs Based on Jacket Transform

Wei Song,이문호,Mustafa M. Matalgah,Ying Guo 한국통신학회 2010 Journal of communications and networks Vol.12 No.3

Jacket matrices1, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications,image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

Sequences Feature Vectors Extracting Method for Similarity Measurement Based on Wavelet and Matrix Transforming

Zhi-kun Hu,Wei-hua Gui,Chun-hua Yang,Fei Xu 제어·로봇·시스템학회 2010 International Journal of Control, Automation, and Vol.8 No.2

A feature vectors extracting method for similarity measurement between a referenced sequence and an analyzed sequence is proposed. The referenced sequence and analyzed sequence are compressed into two wavelet matrices by Discrete Orthogonal Wavelet Transform (DOWT), respectively. A singular value vector and the multi-subspaces of the referenced matrix are derived from wavelet matrices by singular value decomposition (SVD). Consequently, a uniform subspace of which all sequences are mutual orthogonal can be constructed by serializing multi-subspaces, and the analyzed feature vectors can also be obtained by inner product transformation between analyzed sequence and all sequences derived from the multi-subspaces. The similarity is measured between the analyzed feature vector and the singular value vector of the referenced sequence. The simulation results show that the proposed method is improved in the dimension, accuracy and anti-noise ability with little sensitivity sacrifice.

SLM 기반의 OFDM 통신 시스템을 위한 계산 복잡도 저감 기법

조수범 ( Soobum Cho ),현광민 ( Kwangmin Hyun ),박상규 ( Sang Kyu Park ) 한국인터넷정보학회 2012 인터넷정보학회논문지 Vol.13 No.2

OFDM (Orthogonal Frequency Division Multiplexing) 시스템에서 SLM (Selected Mapping)은 전송신호의 왜곡 없이 PAPR(Peak-to-Average Power Ratio)을 효율적으로 줄일 수 있는 기법이다. 하지만, 충분한 후보 OFDM 신호를 생성하기 위해서는 많은 양의 IFFT (Inverse Fast Fourier Transform) 연산을 필요로 하고, 이는 SLM 기법을 매우 복잡하게 만든다. 따라서 본 논문에서는 첫 번째 후보 OFDM 신호를 변환하여 나머지 IFFT 연산들을 대체하는 새로운 SLM 기법을 제안한다. 제안된 기법은 기존의 SLM 기법과 비교하여 거의 같은 PAPR 저감 성능을 보임과 동시에 계산 복잡도는 크게 감소 시킬 수 있다. SLM (Selected Mapping) is an efficient PAPR (Peak-to-Average Power Ratio) reduction scheme without transmitted signal distortion in OFDM (Orthogonal Frequency Division Multiplexing) systems. However, enormous IFFTs (Inverse Fast Fourier Transforms) are needed to generate sufficient candidate OFDM signals, which cause the SLM to become quite complex. In this paper, we propose a new SLM scheme that replaces the IFFT operations with a conversion of the first candidate OFDM signal. The proposed scheme significantly reduces computational complexity, while it shows almost the same PAPR performance as the conventional SLM scheme.

DARBOUX TRANSFORMS AND ORTHOGONAL POLYNOMIALS

Yoon, Gang-Joon Korean Mathematical Society 2002 대한수학회보 Vol.39 No.3

We give a new interpretation of Darboux transforms in the context of orthogonal polynomials and find conditions in or-der for any Darboux transform to yield a new set of orthogonal polynomials. We also discuss connections between Darboux trans-forms and factorization of linear differential operators which have orthogonal polynomial eigenfunctions.