• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.179-188
• /
• 2008

In this paper, knowledge based text to facial sequence image system for interaction of lecturer and learner in cyber universities is studied. The system is defined by the synthesis of facial sequence image which is synchronized the lip according to the text information based on grammatical characteristic of hangul. For the implementation of the system, the transformation method that the text information is transformed into the phoneme code, the deformation rules of mouse shape which can be changed according to the code of phonemes, and the synthesis method of facial sequence image by using deformation rules of mouse shape are proposed. In the proposed method, all syllables of hangul are represented 10 principal mouse shape and 78 compound mouse shape according to the pronunciation characteristics of the basic consonants and vowels, and the characteristics of the articulation rules, respectively. To synthesize the real time facial sequence image able to realize the PC, the 88 mouth shape stored data base are used without the synthesis of mouse shape in each frame. To verify the validity of the proposed method the various synthesis of facial sequence image transformed from the text information is accomplished, and the system that can be applied the PC is implemented using the proposed method.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.592-608
• /
• 2016

Recently, many researches on digital holograms, which retain almost perfect 3 dimensional image information, have been performed actively that it seems for them to be serviced soon. Accordingly, this paper proposes a data compression technique for a digital hologram video for this service. It uses H.265/HEVC, the most recent international 2 dimensional video compression standard, for which we consider various domain transform methods to increase the correlation among the pixels in a digital hologram. Also we consider the various parameters on H.265/HEVC. The purpose of this paper is to find empirically the optimal condition for the domain transform method, the size of transform unit, and the H.265/HEVC parameters. The proposed method satisfying the optimal parameter set found is compared to the existing methods to prove that ours shows better performance.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.525-534
• /
• 2001

Generally, compression and encryption procedures are performed independently in lossless image compression and encryption. When compression is followed by encryption, the compressed-stream should have the property of randomness because its entropy is decreased during the compression. However, when full data is compressed using image compression methods and then encrypted by encryption algorithms, real-time processing is unrealistic due to the time delay involved. In this paper, we propose to combine compression and encryption to reduce the overall processing time. It is method decomposing gray-scale image by means of quadtree compression algorithms and encrypting the structural part. Moreover, the lossless compression ratio can be increased using a transform that provides an decorrelated image and homogeneous region, and the encryption security can be improved using a reconstruction of the unencrypted quadtree data at each level. We confirmed the increased compression ratio, improved encryption security, and real-time processing by using computer simulations.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.619-628
• /
• 2003

In this paper, an effective watermark detection technique in the wavelet transform domain is proposed. In this proposed method, the image is 2-level wavelet transformed, and then the watermark with a binary logo is embedded into middle band except baseband and high band to consider Invisibility and robustness. In this paper, we use an asymmetric thresholds watermarking (ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. In watermark detection phase, the detection value is not changed when the difference of the selected wavelet neighboring coefficient pairs Is smaller than specific value. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.773-781
• /
• 2013

The Hough transform for line detection is widely used in many machine vision applications due to its robustness against data loss and distortion. However, it is not appropriate for real-time embedded vision systems, because it has inefficient computation structure and demands a large number of memory accesses. Thus, this paper proposes an improved voting scheme of the Hough transform, and then applies this scheme to a Hough transform hardware architecture so that it can provide real-time performance with less hardware resource. The proposed voting scheme reduces computation overhead of the voting procedure using correlation between adjacent pixels, and improves computational efficiency by increasing reusability of vote values. The proposed hardware architecture, which adopts this improved scheme, maximizes its throughput by computing and storing vote values for many adjacent pixels in parallel. This parallelization for throughput improvement is accomplished with little hardware overhead compared with sequential computation.

• The Journal of the Korea Contents Association
• /
• v.3 no.1
• /
• pp.58-63
• /
• 2003

In this paper, an object tracking system in a known environment is proposed. It extracts moving area shaped on objects in video sequences and decides tracks of moving objects. Color invarianoe features are exploited to extract the plausible object blocks and the degree of radial homogeneity, which is utilized as local block feature to find out the block correspondences. The experimental results are given.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.101-108
• /
• 2008

건물의 3차원 모델링은 3차원 공간정보를 구축하는데 있어서 매우 중요한 요소이다. 기존의 3차원 건물 모델링은 대부분 입체 항공사진을 이용하여 도화사에 의해 수동으로 진행되어 많은 시간과 비용이 소요된다. 이러한 한계를 극복하기 위한 방안으로 최근에는 항공라이다(LiDAR) 데이터를 이용한 모델링 방법에 대한 연구가 활발히 진행되고 있다. 기존의 항공라이다 데이터를 이용한 3차원 모델링 연구는 항공라이다 점 데이터를 보간 과정을 통하여 픽셀구조로 변환하거나 수치지도, 항공영상 등의 이종 데이터간의 융합을 통하여 건물을 모델링하는 방안 등을 제시하였다. 본 논문은 기존 건물 모델링 기법에서 사용되었던 점 데이터의 픽셀구조로의 변환 및 이종 데이터간의 융합 등의 방법을 배제하고 항공라이다 데이터만을 이용한 건물의 자동 모델링 방법을 제안하였다. 건물지붕에 대한 항공라이다 데이터를 3차원 공간상에서 재귀적으로 분할하여 패치(patch)를 구성하고, 동일한 속성을 갖는 패치들을 병합하여 건물의 구성요소를 추출한다. 추출되어진 건물의 구성요소를 대표하는 모델을 생성하여 전체적인 건물의 3차원 모델을 구성한다. 항공라이다 데이터를 이용하여 제안된 방법으로 실험한 결과, 다양한 형태의 건물 모델을 자동으로 구성할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.481-483
• /
• 2004

다양한 동영상 압축표준에서 압축효율을 높이기 위해 1/2 화소를 이용한다. 1/2 화소는 프레임 간 참조시 압축 효율을 높이기 위한 프레임 내 화소를 연산하여 생성되는 가상의 값이며 이 연산식은 표준에 따라 다르다. MPEG-2에서 H.264로의 포맷 변환시 이 1/2 화소값의 차이로 인해 MPEG-2의 모션벡터와 움직임 보상된 값을 그대로 사용할 수 없게 된다. 본 논문에서는 MPEG-2의 모션벡터를 그대로 사용하고 DCT(Discrete Cosine Transform) 도메인에서 두 표준의 화소값의 차이를 보정하는 기법을 제안한다. 제안된 기법은 픽셀 도메인의 창조 블록을 이용하여 보정 할 위치를 찾고 두 표준의 1/2 화소 계산식의 차이를 이용하여 보정 할 값을 구하게 된다. 구해진 보정 값을 DCT하여 DCT 도메인의 현재 블록에 더하여 보정하게 된다. 이 기법은 모든 블록의 값을 완벽하게 보정할 수는 없지만 두 표준 간 차이값이 큰 1/2 화소를 보정할 수 있으며 IDCT라 DCT로 인한 화질 열화도 감소된다 또한, DCT 상태에서 보정을 수행하므로 픽셀 도메인에서 보다 약 7%의 계산복잡도도 낮출 수 있다.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2010

The Generalized Hough Transform(GHT) is the most used algorithm for circle detection with high accuracy. However, it requires many computation time, because many different templates are applied in order to find circles of various size. In the case of circle detection and tracking in video, the classical approach applies GHT for each frame in video and thus needs much high processing time for all frames. This paper proposes the fast GHT algorithm in video, using two consecutive frames are similar. In the proposed algorithm, a change-driven method conducts GHT only when two consecutive frames have many changes, and trajectory-based method does GHT in candidate areas and with candidate radius using circles detected in a previous frame. The algorithm can reduce computation time by reducing the number of frames, the edge count, and the number of searching circles, as factors which affects the speed of GHT. Our experimental results show that the algorithm successfully detects circles with less processing time and no loss of accuracy in video acquisited by a fixed camera and a moving camera.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.18-23
• /
• 2004

In this paper, we propose a new visual feature extraction method for content-based image retrieval(CBIR) based on wavelet transform which has both spatial-frequency characteristic and multi-resolution characteristic. We extract visual features for each frequency band in wavelet transformation and use them to CBIR. The lowest frequency band involves spacial information of original image. We extract L feature vectors using fuzzy homogeneity in the wavelet domain, which consider both the wavelet coefficients and the spacial information of each coefficient. Also, we extract 3 feature vectors wing the energy values of high frequency bands, and store those to image database. As a query, we retrieve the most similar image from image database according to the 10 largest homograms(normalized fuzzy homogeneity vectors) and 3 energy values. Simulation results show that the proposed method has good accuracy in image retrieval using 90 texture images.