• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.77-80
• /
• 2006

본 논문에서는 블록 기반의 영상압축에 있어서 선택적 방향성 보간을 이용하는 공간적 에러 은닉 기법을 제안한다. 기존의 공간적 경계 정합 기법은 에지가 단순한 영역에서는 좋은 성능을 보이지만, 손실 블록 내에서 에지의 변화가 큰 영역에서는 좋지 못한 성능을 보인다. 제안된 기법은 이웃한 상하 블록들을 이용하여 에지의 연결성을 추정하고, 이에 따라 공간적 경계정합 기법과 이동 스트라이프 정합 기법을 선택적으로 이용한다. 따라서 에지변화에 적응적으로 대응함으로써 우수한 복원영상을 구할 수 있다. 제안된 기법은 슬라이스 단위의 에러에 대해 적합한 방식으로써, 복잡도가 낮을 뿐만 아니라 객관적 주관적으로 우수한 복원 화질을 얻게 해준다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.460-463
• /
• 2015

본 논문에서는 인간의 시각 인지 특성 중 하나인 돌출영역(saliency region) 응시 특성을 고려한 LCD 디스플레이의 백라이트 제어 방법을 제안한다. 제안된 방법은 입력 영상의 화소 분포를 분석하고 주된 응시 영역 검출 결과를 가중치 함수로 이용하여 영역별로 분할된 영상의 블록에 대응하는 백라이트를 증폭 혹은 감소시킨다. 소비전력의 증가 없는 백라이트 블록별 증폭 기법 구현을 위하여 백라이트 증폭 총량은 백라이트 감소 총량으로 제한하고 블록 별로 증폭 양 결정을 위하여 MPEG2 TM-5 Rate Control 모델을 도입하여 적응적 백라이트 레벨 결정 방식을 적용하였다. 백라이트 증폭 시뮬레이션 결과를 바탕으로 제안된 방법이 소비전력 증가 없이 인간 시각이 주로 응시하는 돌출 영역의 화질을 개선함을 보였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.47-50
• /
• 2003

본 논문에서는 동영상을 효율적으로 부호화하기 위한 새로운 다중해상도 움직임 보상 방법과 잉여 양자화 방법을 제안한다. 본 논문에서 제안하는 동영상 부호화기는 다단계 이산웨이브렛 분해 움직임 예측 및 움직임 보상 블록 Tree 의 구성 및 블록 분할. 적응적 산술 부호화기로 구성된다 제안된 동영상 부호화기는 단순하면서도 낮은 연산량을 필요로 하며, 임베디드 특성과 SNR 계위 부호화 특성과 같은 좋은 기능을 제공한다. 또한 기존에 제안되었던 이산웨이브렛변환을 이용하는 동영상 부호화 방법과 비교하여 우수한 성능을 제공한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1254-1259
• /
• 2010

In this paper, Low Computational Adaptive Expanded Block Search Motion Estimation Method is proposed. Proposed method classifies ME blocks as Average Motion Block(AMB) and Local Motion Block(LMB) according to correlation of reference frame. It could reduce the computational complexity with performing Modified Fast Search(MFS). And accuracy of MV is also increased by 4 sub-blocks on LMB and Block Expansion(BE). The experimental results show that the proposed method has better performance that increased 1.8dB than Diamond Search and 0.6dB than Full Search with 7.5 % computation of Full Search. The proposed method could be applied to video compression and Frame Rate Conversion(FRC).

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.322-330
• /
• 2009

In order to utilize NAND flash memory as storage media which does not allow update-in-place and limits the number of block erase count, various garbage collection policies supporting wear-leveling have been investigated. Conventional garbage collection policies require cleaning-index calculation for the entire blocks to choose a block to be garbage-collected to support wear-leveling whenever a garbage collection is required, which results in performance degradation of system. This paper proposes a garbage collection policy which supports wear-leveling using a threshold value, which is in fact a variance of erase counts and by the maximum erase count of all blocks, without calculating the cleaning-index. During garbage collection, the erase cost is minimized by using the Greedy Policy if the variance is less than the threshold value. It achieves wear-leveling by excluding the block with the largest erase count from erase target blocks if the variance is larger than threshold value. The proposed scheme shows that a standard deviation approaches to zero as the erase count of blocks approaches to its upper limit and the measured speed of garbage collection is two times faster than the conventional schemes.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2013.06a
• /
• pp.270-272
• /
• 2013

In order to protect coastal facilities mainly from wave and current actions, the self-locking bio blocks constituting component elements of protecting structures against scouring were designed. These blocks are adapted to the sloping bottom, coastal dunes, and submerged coastal base counteracting the destructive and erosive impulse action. A series of laboratory experiments is necessary to investigate the reflection of water waves over and against a train of protruded or submerged shore structures and compare the reflecting capabilities of incident waves including wave forces. In this study the hydraulic model experiment was conducted to identify the performance of newly designed water affinity bio blocks to keep the coast slope and bottom mound from scouring by reduction of the reflection coefficient and to convince stability of the placements. Revised design of each element of blocks were also tested for field conditions. From the result of experiment, the field applicability of the developed blocks and placement is to be discussed afterward.

• Convergence Security Journal
• /
• v.19 no.1
• /
• pp.67-78
• /
• 2019

Most existing facial expression recognition methods use a uniform grid method that divides the entire facial image into uniform blocks when describing facial features. The problem of this method may include non-face backgrounds, which interferes with discrimination of facial expressions, and the feature of a face included in each block may vary depending on the position, size, and orientation of the face in the input image. In this paper, we propose a variable-size block method which determines the size and position of a block that best represents meaningful facial expression change. As a part of the effort, we propose the way to determine the optimal number, position and size of each block based on the facial feature points. For the evaluation of the proposed method, we generate the facial feature vectors using LDTP and construct a facial expression recognition system based on SVM. Experimental results show that the proposed method is superior to conventional uniform grid based method. Especially, it shows that the proposed method can adapt to the change of the input environment more effectively by showing relatively better performance than exiting methods in the images with large shape and orientation changes.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.127-133
• /
• 1999

The conventional fractal image compression based on discrete wavelet transform uses the fixed block size in fractal coding and reduces PSNR at low bit rate. This paper proposes a fractal image coding based on discrete wavelet transform which improves PSNR by using variable block size in fractal coding. In the proposed method. the absolute values of discrete wavelet transform coefficients are computed. and the discrete wavelet transform coefficients of different highpass subbands corresponding to the same spatial block are assembled. and the fractal code for the range block of each range block level is assigned. and then a decision tree C. the set of choices among fractal coding. "0" encoding. and scalar quantization is generated and a set of scalar quantizers q is chosen. And then the wavelet coefficients. fractal codes. and the choice items in the decision tree are entropy coded by using an adaptive arithmetic coder. This proposed method improved PSNR at low bit rate and could achieve a blockless reconstructed image. As the results of experiment. the proposed method obtained better PSNR and higher compression ratio than the conventional fractal coding method and wavelet transform coding.rm coding.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.186-191
• /
• 2019

In this paper, we propose a implementation approach of the high-speed feature extraction algorithm. The proposed method is based on the block type classification algorithm which reduces the computation time when target macro block is divided to smooth block type that has no image features. It is quantitatively identified that occurs at 29.5% of the total image using 200 standard test images with $64{\times}64$ macro block size. This means that within a standard test image containing various image information, 29.5% can reduce the complexity of the operation. When the proposed approach is applied to the Canny edge detection, the required latency of the edge detection can be completely eliminated, such as 2D derivative filter, gradient magnitude/direction computation, non-maximal suppression, adaptive threshold calculation, hysteresis thresholding. Also, it is expected that operation time of the feature detection can be reduced by applying block type classification algorithm to various feature extraction algorithms in this way.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.441-452
• /
• 2000

이동 컴퓨팅 환경에서 멀티미디어 트래픽을 효율적으로 지원하기 위해서 가장 중요한 이슈는 이동호스트(클라이언트)에게 QoS(Quality of Service)를 지속적으로 보장하는 것이다. 그러나 핸드-오프를 필요로하는 클라이언트의 이동성으로 인해 클라이언트와 네트워크간에 협상된 QoS가 보장되지 못할 수도 있다. 본 논문은 이동 컴퓨팅 환경에서 클라이언트에게 지속적으로 QoS를 지원하기 위한 ARMM을 제안하였다. 각 셀은 핸드-오프 호를 위해 이웃 셀에게 대역폭을 예약하며 예약된 대역폭은 단지 핸드-오프 호들만이 사용할 수 있다 만약 핸드-오프 호를 위해 대역폭을 너무 많이 예약한다면 신규 호의 블록킹 확률이 증가하므로 예약할 대역폭의 크기를 정확히 결정하는 것이 중요하다 본 논문에서는 이 대역폭의 정확한 크기를 결정하고 네트워크 상태에 따라 크기를 적응적으로 조정하기 위해 MPP와 2-계층 셀 구조를 기반으로 한 기법을 제안하였다. 본 논문에서 제시된 대역폭 예약 메커니즘의 성능을 평가하기 위해 신규 호블록킹률, 핸트-오프 호 종료율 대역폭 이용률을 측정하였다. 시뮬레이션 결과 본 논문의 대역폭 예약 메커니즘의 성능이 No Reservation Fixed Reservation Adaptive Reservation과 같은 기존의 메커니즘보다 우수함을 알수 있었다.