• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권1호
• /
• pp.1-9
• /
• 2004

In this paper, we proposed a hardware(H/W) structure which can compress and recontruct the input image in real time operation and implemented it into a FPGA platform using VHDL(VHSIC Hardware Description Language). All the image processing element to process both compression and reconstruction in a FPGA were considered each of them was mapped into a H/W with the efficient structure for FPGA. We used the DWT(discrete wavelet transform) which transforms the data from spatial domain to the frequency domain, because use considered the motion JPEG2000 as the application. The implemented H/W is separated to both the data path part and the control part. The data path part consisted of the image processing blocks and the data processing blocks. The image processing blocks consisted of the DWT Kernel for the filtering by DWT, Quantizer/Huffman Encoder, Inverse Adder/Buffer for adding the low frequency coefficient to the high frequency one in the inverse DWT operation, and Huffman Decoder. Also there existed the interface blocks for communicating with the external application environments and the timing blocks for buffering between the internal blocks. The global operations of the designed H/W are the image compression and the reconstruction, and it is operated by the unit or a field synchronized with the A/D converter. The implemented H/W used the 54％(12943) LAB(Logic Array Block) and 9％(28352) ESB(Embedded System Block) in the APEX20KC EP20K600CB652-7 FPGA chip of ALTERA, and stably operated in the 70MHz clock frequency. So we verified the real time operation. that is. processing 60 fields/sec(30 frames/sec).

• Structural Engineering and Mechanics
• /
• 제29권6호
• /
• pp.623-642
• /
• 2008

While spatial plastic mechanism analysis has been widely and successfully applied to thinwalled steel structures to analyse the post-failure behaviour of sections and connections, there remains some contention in the literature as to the basic capacity of an inclined yield line. The simple inclined hinge commonly forms as part of the more complex spatial mechanism, which may involve a number of hinges perpendicular or inclined to the direction of thrust. In this paper some of the existing theories are compared with single inclined yield lines that form in flange outstands, by comparing the theories with plate tests of plates simply supported on three sides with the remaining (longitudinal) edge free. The existing mechanism theories do not account for different in-plane displacement gradients of the loaded edge, nor the slenderness of the plates, and produce conservative results. A modified theory is presented whereby uniform and non-uniform in-plane displacements of the loaded edge of the flange, and the slenderness of the flange, are accounted for. The modified theory is shown to compare well with the plate test data, and its application to flanges that are components of sections in compression and/or bending is presented.

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

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

• 정보처리학회논문지D
• /
• 제11D권2호
• /
• pp.281-292
• /
• 2004

공간 질의에 대한 선택율 추정은 가장 효율적인 실행 계획을 찾는데 이용되는 매우 중요한 과정이다. 공간 도메인이 큰 경우, 기존 연구의 요약정보는 상대적으로 적은 정보로 선택율을 추정하기 때문에 좋은 선택율을 유지하기 어렵다. 따라서, 이 논문에서는 작은 저장공간에 공간요약정보를 압축하는 새로운 기법인 MW 히스토그램을 제안한다. 이 히스토그램은 MinSkew 분할 알고리즘과 웨이블릿 변환이 결합되어 적은 저장공간에서도 타당한 선택율과 압축효과를 얻을 수 있고, 동적 갱신에 대해 효율적으로 대처할 수 있는 구조를 가진다. 실험 결과를 통하여, 버켓 수가 0.3M/6인 MW 히스토그램이 5%-20% 질의에서 평균적으로 좋은 성능을 보이고 있어, MW 히스토그램이 적은 저장공간에서 더 좋은 선택율을 얻을 수 있음을 확인시켜주었다.

• Journal of Astronomy and Space Sciences
• /
• 제13권2호
• /
• pp.198-209
• /
• 1996

본 논문에서는 인공위성을 통하여 수신되는 다중대역 영상을 압축하기 위한 방법을 제시한다. 본 논문에서 제안하는 방법은 다대역 영상에서 보이는 대역간 상관성 및 대역내에서 각 화소간의 상관성을 줄이는 목표를 가지고, 화소간 상관성을 줄이기 위해서는 wavelet 변환을 사용하고, 대역간 상관성을 줄이기 위해서는 대역간 데이타블럭의 화소값간의 상관관계를 1차식으로 모델링하고 회귀(regression) 방법을 이용하여 대역간 화소 차이을 가깝게 하여 데이타 압축율을 향상시킨다. 변환계수는 데이타 압축율을 높이기 위해 변형된 힐버트 커브와 RLE 그리고 허프만 코딩을 이용하였다. 제안된 알고리듬은 우리별 1호 영상과 LANDSAT MSS 영상을 이용하여 실험하였으며, 성능평가 척도로는 원영상과 복원된 영상의 PSNR과 ISODATA를 이용할 때의 분류 능력을 비교하였다.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.95-104
• /
• 2016

Massive multiple-input multiple-output (MIMO) is a promising approach for cellular communication due to its energy efficiency and high achievable data rate. These advantages, however, can be realized only when channel state information (CSI) is available at the transmitter. Since there are many antennas, CSI is too large to feed back without compression. To compress CSI, prior work has applied compressive sensing (CS) techniques and the fact that CSI can be sparsified. The adopted sparsifying bases fail, however, to reflect the spatial correlation and channel conditions or to be feasible in practice. In this paper, we propose a new sparsifying basis that reflects the long-term characteristics of the channel, and needs no change as long as the spatial correlation model does not change. We propose a new reconstruction algorithm for CS, and also suggest dimensionality reduction as a compression method. To feed back compressed CSI in practice, we propose a new codebook for the compressed channel quantization assuming no other-cell interference. Numerical results confirm that the proposed channel feedback mechanisms show better performance in point-to-point (single-user) and point-to-multi-point (multi-user) scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권3호
• /
• pp.331-343
• /
• 2009

Many types of sensor data exhibit strong correlation in both space and time. Both temporal and spatial suppressions provide opportunities for reducing the energy cost of sensor data collection. Unfortunately, existing clustering algorithms are difficult to utilize the spatial or temporal opportunities, because they just organize clusters based on the distribution of sensor nodes or the network topology but not on the correlation of sensor data. In this paper, we propose a novel clustering algorithm based on the correlation of sensor data. We modify the advertisement sub-phase and TDMA schedule scheme to organize clusters by adjacent sensor nodes which have similar readings. Also, we propose a spatio-temporal suppression scheme for our clustering algorithm. In order to show the superiority of our clustering algorithm, we compare it with the existing suppression algorithms in terms of the lifetime of the sensor network and the size of data which have been collected in the base station. As a result, our experimental results show that the size of data is reduced and the whole network lifetime is prolonged.

• ETRI Journal
• /
• 제39권5호
• /
• pp.672-682
• /
• 2017

Video compression exploits statistical, spatial, and temporal redundancy, as well as transform and quantization. In particular, the transform in a frequency domain plays a major role in energy compaction of spatial domain data into frequency domain data. The high efficient video coding standard uses the type-II discrete cosine transform (DCT-II) and type-VII discrete sine transform (DST-VII) to improve the coding efficiency of residual data. However, the DST-VII is applied only to the Intra $4{\times}4$ residual block because it yields relatively small gains in the larger block than in the $4{\times}4$ block. In this study, after rearranging the data of the residual block, we apply the DST-VII to the inter-residual block to achieve coding gain. The rearrangement of the residual block data is similar to the arrangement of the basis vector with a the lowest frequency component of the DST-VII. Experimental results show that the proposed method reduces the luma-chroma (Cb+Cr) BD rates by approximately 0.23% to 0.22%, 0.44% to 0.58%, and 0.46% to 0.65% for the random access, low delay B, and low delay P configurations, respectively.

• 전자공학회논문지CI
• /
• 제37권1호
• /
• pp.55-63
• /
• 2000

본 논문은 영상 프레임간 차분 성분을 이용한 3D-DCT의 부영역 분할에 따르는 압축효과를 고찰하였다. 제안한 알고리즘은 연속되는 9개의 프레임 그룹단위를 이용하여 8개의 차분 성분을 큐빅블록(8${\times}$8${\times}$8) 형태로 나타낸 정보를 3차원 DCT를 취한 후 부대역으로 분할하려 압축하는 방법이다. 프레임간 시${\cdot}$공간의 주파수 성분을 가지고 8개의 차분 프레임을 DCT한 주파수 영역에서 영상 정보는 저주파 영역인 큐빅블록의 모서리 부분에 집중하므로 효율적인 압축데이터를 얻기 위해 시간축 방향의 프레임 성분블록( 8${\times}$8 블록)을 4${\times}$4 부블록으로 나누었다. 여기서, 이 부블록의 가중치를 이용하여 저주파 부분에 대한 가변적 부영역을 적용시켜 압축율을 높였다. 모의실험에서 비교적 단순한 영상과 고주파 성분을 많이 포함하는 복잡한 영상을 이용하여 복원된 영상의 해상도와 압축율로 비교 평가하였다. 그 결과 평균 0.04-0.05bpp의 압축범위에서 각각의 영상에 대하여 평균적으로 34.75dB와 30.36dB의 높은 압축효과를 얻을 수 있었다.

• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.1396-1403
• /
• 2009

The Ministry of Construction and Transportation (MOCT) has been constructing a nationwide soil information DB since 2000, as basic data for the construction of 'underground geographical information,' a project under the 2nd National Geo-spatial Information System (NGIS) master plan. The inputted soil information includes not only underground conditions such as the layer depth, type, color, and groundwater level, but also engineering information that can be applied to construction work design, such as on the standard penetration test and the compression test. It is difficult to use this information in soil analysis and design, however, because only the test results are currently available. A web-based geo-spatial information system was developed in this study to facilitate the effective application of the soil information database (DB). First, the space information, layer information, and engineering test information were loaded from the soil information DB in real time, and the earth volume, bearing capacity, and settlement were calculated to develop a web client that will evaluate the ground softness and liquefaction. It seems that the soil information DB can be actively applied to the planning and design of construction works using this system.