• 기술사
• /
• 제20권1호
• /
• pp.14-20
• /
• 1987

고속아다마르변환은 Cooley-Tukey 알고리즘에 의해서 발표되어졌고, 그것은 메트릭스 분할 또는 계승의 기술에 의한 것이다. 본 보문은 단순한 기생메트릭스를 크로넥커 적에 의해 앞단과 연결시켜가면서 고속아다마르 변환을 보였다. 이것은 기존에 발표된 방법에 비해 쉽게 기생메트릭스를 구할 수 있는 것을 확인했고 수학적으로 완전함을 증명했다.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1983년도 추계학술발표회논문집
• /
• 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.

• 전자공학회논문지B
• /
• 제31B권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
• /
• 제4권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%.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 B
• /
• 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.

• 한국통신학회논문지
• /
• 제10권2호
• /
• pp.93-103
• /
• 1985

대역폭 압축에 의한 디지털 신호처리 기술은 최근 몇 년동안 집적회로 기술의 발달에 따라 급성장해왔다. 본 연구에서는 화면의 중앙에 시야가 돋보이며 눈의 감각과 일치하는 Hadamard Matrix의 중앙에 Weight를 준 Nonorthogonal 변환인 Weighted Handamard Matrix를 구하여 실시간처리를 위한 고속계산방법과 Hardware system을 연구하였다. 따라서 본 연구는 항공사진, X-Ray, CATV, 인공위성통신 등 디지탈영상신호처리에 사용할 수 있을 것이다.

• 기술사
• /
• 제16권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 제38회 하계학술대회
• /
• pp.1795-1796
• /
• 2007

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

• 방송공학회논문지
• /
• 제22권3호
• /
• pp.366-374
• /
• 2017

TV나 디지털 사이니지와 같은 화면표시장치들이 점점 커져감에 따라, 미디어의 종류가 UHD, 파노라마, 퍼즐형 미디어와 같은 광각의 미디어로 변하고 있다. 특히, 파노라마 및 퍼즐형 미디어는 스티칭을 통해 복수개의 카메라로 촬영된 비디오 클립을 합성한 형태로 구성된다. 그러나, 스티칭 과정의 처리 시간이 오래 걸리기 때문에 실시간 서비스에는 적용하기 어려운 문제가 있다. 따라서 본 논문에서는 스티칠 처리 시간을 감소하기 위한 방법으로, 영상간의 공간적 연관관계를 알려주는 2D Adjacency Matrix를 생성하는 것을 제안한다. Discrete Cosine Transform (DCT)를 사용하여, 비디오 소스의 각 프레임을 공간 영역에서 주파수 영역으로 변환 시킨다. 앞서 언급한 DCT 계수를 기반으로 효과적으로 이미지들의 공간적 연관관계를 알려주는 2D Adjacency Matrix를 생성한다. 본 논문에서는 각각의 비디오 클립들로부터 파노라마 영상과, 퍼즐형 미디어를 생성하기 위해 DCT를 이용한 2D Adjacency matrix 생성 방법을 제안한다.