• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.528-539
• /
• 2005

The H.264 has been adopted as the video codec for various multimedia services such as DMB and next-generation DVD because of its superior coding performance. However, the reference codec of the standard, the joint model (JM) contains quite a few algorithms which are too complex to be used for the resource-constraint embedded environment. This paper introduces very low-complexity H.264 encoding algorithm which is applicable for the embedded environment. The proposed algorithm was realized by restricting some coding tools on the basis that it should not cause too severe degradation of RD-performance and adding a few early termination and bypass conditions during the motion estimation and mode decision process. In case of encoding of 7.5fps QCIF sequence with 64kbpswith the proposed algorithm, the encoder yields worse PSNRs by 0.4 dB than the standard JM, but requires only $15\%$ of computational complexity and lowers the required memory and power consumption drastically. By porting the proposed H.264 codec into the PDA with Intel PXA255 Processor, we verified the feasibility of the H.264 based MMS(Multimedia Messaging Service) on PDA.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.503-518
• /
• 2012

In this paper, we propose a complexity-based parallelization method of the sample adaptive offset (SAO) algorithm which is one of HEVC in-loop filters. The SAO algorithm can be regarded as region-based process and the regions are obtained and represented with a quad-tree scheme. A offset to minimize a reconstruction error is sent for each partitioned region. The SAO of the HEVC can be parallelized in data-level. However, because the sizes and complexities of the SAO regions are not regular, workload imbalance occurs with multi-core platform. In this paper, we propose a LCU-based SAO algorithm and a complexity prediction algorithm for each LCU. With the proposed complexity-based LCU processing, we found that the proposed algorithm is faster than the sequential implementation by a factor of 2.38 times. In addition, the proposed algorithm is faster than regular parallel implementation SAO by 21%.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.36 no.2
• /
• pp.69-79
• /
• 2008

Landscape indices are effective tools to explain the spatial structure and patterns of ecological landscape including area/density, shape, core area, isolation/proximity, contagion/interspersion, and connectivity. More than 100 indices have been developed and an increasing amount of research explains changes in urban spaces using the indices. However, landscape indices have a high level of sensitivity to the scale of analysis - grain size and extent. If the scale sensitivity of indices is not considered, the research may produce inaccurate results. This study examines the scale sensitivity of landscape indices to find relatively stable indices in the complex geographical features of Korea. The scale sensitivity was analyzed using 20 categories of grain size and 41 categories of extent change. Landsat TM and ETM+ images of five years - 1985, 1991, 1996, 2000 and 2003 - were used, and 54 class level indices mounted on the FRAGSTATS program were examined. The results are as follows: First, according to the analysis of the scale sensitivity, 19 out of 54 class level indices were found to be stable to scale change. Second, the scale sensitivity was closely related to the green area ratio, and the typical threshold of change was $40{\sim}50%$. Third, among the 16 indices which were frequently used in the research in Korea, only 6 indices were relatively stable to the scale change. These results can be an effective basis for the selection of indices in the landscape ecology research in Korea.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.108-121
• /
• 2012

As Scalable Video Coding (SVC) is a video compression standard extended from H.264/AVC, it is a way to provide scalability in terms of temporal, spatial and quality. Although the compression efficiency of SVC is increased due to the scalability in many aspect, it is essential to reduce the complexity in order to efficiently use because the complexity is relatively increased. To reduce the complexity of SVC in the paper, we propose fast mode decision algorithm to reduce the complexity of encoding process using direction information of B-picture by efficiently performing inter-layer prediction. The proposed algorithm is a fast mode decision algorithm that makes different from detection mode number of forward and backward, bi-direction in the way using best mode of base-layer up-sampled after simply SKIP mode detection using the direction information of best mode of base-layer up-sampled. The experimental results show that the proposed algorithm approach can achieve the maximum computational time saving about 53% with almost no loss of rate distortion (RD) performance in the enhancement layer.

• Database Research
• /
• v.34 no.3
• /
• pp.148-158
• /
• 2018

The optical character recognition (OCR) is a technique to extract and recognize texts from images. It is an important preprocessing step in data analysis since most actual text information is embedded in images. Many OCR engines have high recognition accuracy for images where texts are clearly separable from background, such as white background and black lettering. However, they have low recognition accuracy for images where texts are not easily separable from complex background. To improve this low accuracy problem with complex images, it is necessary to transform the input image to make texts more noticeable. In this paper, we propose a method to segment an input image into text lines to enable OCR engines to recognize each line more efficiently, and to determine the final output by comparing the recognition rates of CLAHE module and Two-step module which distinguish texts from background regions based on image processing techniques. Through thorough experiments comparing with well-known OCR engines, Tesseract and Abbyy, we show that our proposed method have the best recognition accuracy with complex background images.

• Smart Media Journal
• /
• v.12 no.11
• /
• pp.48-56
• /
• 2023

The technology of Three-dimensional human posture estimation is used in sports, motion recognition, and special effects of video media. Among various methods for this, multi-view 3D human pose estimation is essential for precise estimation even in complex real-world environments. But Existing models for multi-view 3D human posture estimation have the disadvantage of high order of time complexity as they use 3D feature maps. This paper proposes a method to extend an existing monocular viewpoint multi-frame model based on Transformer with lower time complexity to 3D human posture estimation for multi-viewpoints. To expand to multi-viewpoints our proposed method first generates an 8-dimensional joint coordinate that connects 2-dimensional joint coordinates for 17 joints at 4-vieiwpoints acquired using the 2-dimensional human posture detector, CPN(Cascaded Pyramid Network). This paper then converts them into 17×32 data with patch embedding, and enters the data into a transformer model, finally. Consequently, the MLP(Multi-Layer Perceptron) block that outputs the 3D-human posture simultaneously updates the 3D human posture estimation for 4-viewpoints at every iteration. Compared to Zheng[5]'s method the number of model parameters of the proposed method was 48.9%, MPJPE(Mean Per Joint Position Error) was reduced by 20.6 mm (43.8%) and the average learning time per epoch was more than 20 times faster.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.9
• /
• pp.137-144
• /
• 2024

Digital advertising, both indoors and outdoors, is evolving from traditional 2D formats to more immersive 3D forms. 3D advertising involves creating 3D content and displaying it through large LED installations on two sides of a building's corner, or using 3D hologram projectors indoors. This study examines the production process of 3D hologram projectors used indoors and LED-based 3D content used outdoors, analyzing potential issues and considerations when creating 3D digital advertising content. The findings reveal that while indoor hologram projector content provides 3D effects, the low resolution of the devices makes it challenging to implement complex content. However, they are cost-effective and easy to operate. On the other hand, LED-based 3D advertising content, produced in high resolution, requires more time for content creation and incurs higher hardware installation costs. Despite this, it effectively represents complex content and maximizes visibility due to its enhanced 3D effects. In conclusion, it is crucial to create tailored content that matches the resolution of the display device to maximize 3D effects in advertising. Specifically, when producing 3D billboard-style outdoor advertising content, the structure of the building on which it will be installed must be carefully considered.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.213-216
• /
• 2005

자동차 번호판의 이미지에서 번호의 추출이나, 직물 이미지에서 오염 또는 훼손부분의 추출 또는 방사성 폐기물이나 기타 독극물 보관함의 이미지에서 오염이나 산화에 의한 훼손부위 등과 같은 목표물 이미지 추출은 흑백 이미지에서 명암의 차이를 이용하는 것보다는 컬러 이미지에서 색상의 차이를 이용하는 것이 더 효율적일 때가 많으며, 특히 배경과 목표물의 명암차이가 크지 않은 경우에 효과적이다. 배경과 목표물이 갖는 색상의 차이를 이용하여 분리하기 위해서 적색(R), 녹색(G), 청색(B) 의 RGB 평면 또는 순도(H), 포화도(S), 휘도(I)를 사용하는 HSI 컬러 평면 등이 많이 사용되며, 이 때 배경과 목표물의 색상의 히스토그램을 구해보면 보면 많은 경우 유사한 색 정보가 배경과 목표물에 공통으로 포함되어 분리에 어려움을 겪게 된다. 본 논문에서는 Fisher 선형 분리자(Fisher's linear discriminant)[1] 함수를 이용하여 3차원의 색상 특징 벡터를 1차원 직선에 투사하여 변환된 1차원 공간상에서 복잡성을 줄이고 효과적으로 분류할 수 있는 기법을 제안하였으며, 이를 도축된 식용 가금류의 영상에 적용하고 변질된 부분이 포함되어 식용으로 사용할 수 없는 것들을 효과적으로 분류할 수 있음을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.389-391
• /
• 1999

영상 압축 기법에는 여러 가지 알고리즘을 적용되고 있다. 이런 알고리즘들에는 주파수 영역 중복을 제거하기 위한 DCT, 시간 중복성 제거를 위한 움직임 측정, 압축기법에 의해서 만들어진 정보를 부호화하는 VLC들이 있다. 이런 부호화 알고리즘들은 부호화기를 구현하는데 많은 시간을 요구하며 특히 움직임 추정은 부호화기의 절반에 가까운 시간을 소비한다. 움직임 측정 기술의 복잡도는 search algorithm, cost function, search range parameter의 요인으로 나타낼 수 있다. 본 논문에서는 기존의 Full Search 알고리즘 대신에 three-step 알고리즘을 사용하여 움직임 측정 시간을 줄였다. Full Search 알고리즘은 search area에서 모든 지역에 대해 cost function을 사용하여 이전 블록과 얼마나 유사한지를 조사한다. 따라서 이전 블록과 가장 유사한 부분을 찾는 좋은 방법이지만 그만큼 시간이 많이 사용한다. Three-step 알고리즘은 search area의 일정 지역에 대해 cost function를 사용하여 이전 블록과의 유사성을 찾는 fast 알고리즘이다. Three-step 알고리즘을 사용한 경우 기존의 full search 알고리즘을 사용할 때 보다 60% 정도의 시간이 단축되었다. 그리고 생성되는 압축 데이터의 크기는 full search 알고리즘을 사용할 때 보다 많이 차지한다. 생성되는 H.263파일의 화질에서는 Three-step 알고리즘을 사용한 경우일지라도 full search 알고리즘을 사용한 경우와 거의 비슷한 화질을 보여준다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.104-105
• /
• 2010

H.264/AVC는 기존의 동영상 압축 표준안보다 훨씬 뛰어난 압축 효율을 보이나 상대적으로 높은 계산 복잡도를 보인다. 또한 최근 모바일 어플리케이션 및 DTV 등에서의 실시간 구현의 수요가 급증함에 따라 하드웨어 구현보다 상대적으로 flexible한 구조인 DSP 환경에서의 최적화 연구가 활발히 진행 중이다. 본 논문에서는 기존의 다중 참조 픽처 고속 움직임 보상 알고리즘에 대하여 DSP 환경에 맞게 구현 및 최적화를 통하여 실시간 구현 및 최적화 경향파악을 하고 있다. 수행된 DSP 최적화를 통하여 움직임 추정 평균 계산량을 픽셀 당 약 56.17%로 크게 감소시켰다.