• 전자공학회논문지 IE
• /
• v.43 no.2
• /
• pp.87-92
• /
• 2006

Many watermarking methods for protecting the intellectual property right and authentication multimedia data have been proposed in recent years. In image authentication watermarking, watermark is inserted into an image to detect any malicious alteration. So, watermark for authentication and integrity should be erased easily when the image is changed by scaling or cropping etc. We propose in this paper a fragile watermarking algorithm for image integrity verification and tamper localization proofing using special hierarchical structure. In the proposed method, the image to be watermarked is divided into blocks in a multi-level hierarchy and calculating block digital signatures in thus hierarchy. At each level of the hierarchy, a digital signature for each block is calculated using the seven most significant bit(MSBs)-plane values of all pixels within the block. And the resulting signature is incorporated into the LSBs of selected pixels within the block. We provide experimental results to demonstrate the effectiveness of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.13-20
• /
• 2003

Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

• Journal of the Korean Geosynthetics Society
• /
• v.8 no.2
• /
• pp.21-29
• /
• 2009

The connection strength between wall facing and geosynthetics should be evaluated by experimental method in the design of reinforced earth wall. However, the evaluation result of connection strength using the typical design method, FHWA(1996) and NCMA(1997), is excessively because of a safety factors. Therefore, this study is conducted in connection strength test between wall facing and geosynthetics, then the test result is applied to the design case by NCMA, FHWA and Soong & Koener(1997). The results confirmed that the evaluation method by Soong & Koener, which is used ultimate connection strength by connection strength test in allowable connection strength, is satisfied with stable in design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1036-1043
• /
• 2005

In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.721-724
• /
• 2005

본 논문은 육각 탐색에 기반한 고속 블록 정합 알고리즘의 성능 개선에 관한 것으로, 육각 탐색과정에서 추출한 정합점에 대해 정합 검증 패턴을 이용하여 정합도를 검증함으로써 국부 최소 문제를 효과적으로 개선한 고속 움직임 벡터 추정 기법에 관한 것이다. 제안된 방법은 우선, 적응형 육감 탐색에 있어서 차순위 국부 정합점을 이용하여 탐색 패턴을 확장한다. 이후 이렇게 확장된 탐색 패턴에서 추출한 임시 전역 정합점을 대상으로 정합 검증 패턴을 이용하여 정합도의 비교우위를 재차 검증한다. 이 검증 결과에 따라 추가 탐색 과정을 계속적으로 진행할 것인지 또는 현 임시 전역 정합점을 최종 전역 정합점으로 확정할 것인지 여부를 결정하는 과정을 반복적으로 수행함으로써 움직임 보상화질을 개선한 것이다. 제안된 방법에 따르면, 정합 검증 패턴을 적용한 검증 과정에서 추가적인 연산량 증가가 초래되지만 이를 상호타협적으로 보상할 수 있는 화질 측면에서의 성능 개선 효과를 기대 할 수 있다.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.221-228
• /
• 2005

The paper proposes the improved error diffusion halftoning system to enhance the edges using the spatial perceptual characteristics of the human visual system. The proposed method computes a spatial variation(SV), which is the difference between a pixel luminance and the average of its $3{\times}3$ neighborhood pixels' luminances weighted according to the spatial positioning. Information of edge enhancement(IEE) Is computed using the SV and the local average luminance. The IEE is added to the quantizer's input pixel and feeds into the halftoning quantizer. The quantizer produces the halftone image having the enhanced edge. The performance of the proposed method is compared with conventional methods by measuring the edge correlation. The halftone images by using the proposed method show better quality due to the enhanced edge. And the detailed edge is preserved in the halftone images by using the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1091-1097
• /
• 2005

In this paper, we propose fast motion estimation algorithm. Local statistics of a motion vector is highly correlated to motion vectors of its neighboring blocks. According to the property, block-based motion search range is adaptively determined in order to reduce unnecessary search points. Based on the determined search range, motion vector is obtained by variable step search motion estimation. Experimental results show that comparing to Full search motion estimation, the motion searching points of proposed algorithm is reduced as much as $98\%$. Moreover, PSNR and Bit Rate are almost same to Full search method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.931-934
• /
• 2003

본 논문에서는 동영상 내용 기반 검색을 위한 표준 인덱스인 color layout descriptor(CLD)에 기반한 새로운 장면전환검출 방법을 제안한다. 제안한 방법은 입력 영상을 $8{\times}8$ 블록으로 나누고, 그 블록을 대표하는 대표컬러를 선택하여 DCT 변환 후 추출된 DC, AC 계수에 가중치를 부여한 다음 슬라이딩 윈도우를 적용시켜 장면 전환을 검출한다. 이러한 방법은 영상의 전체적인 특성과 국부적인 특성을 동시에 반영하므로, 조명변화나 물체의 움직임에 민감했던 기존 대표적인 방법인 히스토그램 기반 방법과 에지 변화율을 이용한 방법들이 가지는 문제점을 보완할 수 있다. 또한 제안한 방법은 비디오 검색을 위한 MPEG-7 의 검색 서술자 중의 하나인 CLD를 이용하는데 이러한 CLD 는 컬러의 공간적 분포를 잘 설명하므로 MPEG-7 을 위한 검색 서술자에 적합한 장면전환검출 및 검색이 이루어질 수 있다. 제안한 방법을 실험한 결과 기존의 방법보다 장면전환 검출율이 높게 나타났다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.416-419
• /
• 2003

The cellular neural networks have the circuit structure that differs from the form of general neural network. It consists of an array of the same cell which is a simple processing element, and each of the cells has local connectivity and space invariant template property. In this paper, time-multiplex image processing technique is applied for processing large images using small size CNN cell block, and we simulate the edge detection of a large image using the simulator implemented with a c program and matlab model. A 5$\times$5 CNN hardware and pre post processor is also implemented and is under test.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.167-174
• /
• 2000

The three-step search(TSS) algorithm, a simple and gradual motion estimation algorithm, has been widely used in some low bit-rate video compression. We propose a new fast block motion estimation algorithm using the characteristics of motion in search region. Most of motion vectors exist in the center region of search area, so the notion in that region is examined more closely than TSS in this paper. Also in a search step, motion vector is estimated in the local area which is not overlapped with the search area in previous step, considering the all possible direction of motion. Therefore, we get the better motion estimation and reduce computational time in compared with the conventional methods.