• 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 Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.169-174
• /
• 1996

객체 인식은 대용량의 영상 데이터를 분석, 탐색하고 재구성하기 위한 내용기반 영상 검색의 매우 중요한 분야이며, 특히 인간의 얼굴은 검색 영상 내에서 대부분 주요한 장면에 위치하고 있기 때문에 그 비중이 매우 크다. 본 논문에서는 내용기반 영상 검색을 위한 실시간 얼굴 영역 추출 방법을 제안한다. 제안된 방법에서는 다층 피라미드 구조와 간단한 형태의 머리 형판을 사용하여 얼굴의 후보 영역을 추출한 후, 보다 정확한 얼굴 영역을 추출하기 위하여 후보 영역 내에서 눈의 위치를 탐색하고, 두 눈의 위치를 기준으로 최종적인 얼굴 영역을 추출하였다. 얼굴 후보 영역 추출 단계에서는 얼굴의 형태 정보를 포함하고 있는 모자이크 형판을 사용하여 머리와 턱을 포함한 얼굴 영역을 추출하였으며, 눈 위치 추출 단계에서는 눈의 위치 정보를 사용하여 눈의 탐색 영역을 결정하고, 탐색 영역 내에서 이진 영상 형판을 사용하여 눈의 위치를 추출한 후, 눈 영역의 무게 중심을 눈의 중심 위치로 설정하였다. 마지막 얼굴 영역 추출단계에서는 두 눈의 위치를 기준으로 사각형의 영역을 얼굴 영역으로 추출하였다. 제안된 방법의 성능을 검증하기 위하여 1700장의 다양한 영상에 대하여 실험하였으며, 실험 결과 한 장의 영상에서 얼굴 영역을 추출하는데 있어서, Pentium 166Mz의 PC상에서 평균 3.2초의 처리 속도와 91.7%의 추출률을 보임으로써, 실시간 얼굴 영역 추출에 매우 효과적임을 알 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.57-64
• /
• 2006

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.835-838
• /
• 2008

Many researches on hierarchical path search have been studied so far. Even though partitioning regions is essential part, the researches are not enough. This paper proposes two efficient methods to partition regions: 1)a method based on voronoi algorithm in which a major node is central point of a region, 2) a method based on fired grid that partitions regions into major and minor. The performances of the proposed methods are compared with the conventional hierarchical path search method in which a region is formed by the boundary line of nearest 4 points of a major node in terms of the path search time and the accuracy. The results obtained from the experiments show that the method based on voronoi achieves short execution time and the method based grid achieves high accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.9-15
• /
• 2007

We propose the fast full search algorithm that reduces the computation of the block matching algorithm which is used for motion estimation of the video coding. Since the conventional spiral search method starts searching at the center of the search window and then moves search point to estimate the motion vector pixel by pixel, it is good for the slow motion pictures. However the proposed method is good for the fast and slow motion because it estimates the motion in the new search order after partitioning the search window. Also, when finding the motion vector, this paper presents the method that reduces the complexity by computing the matching error in the order which is determined by local image complexity. The proposed algorithm reduces the computation up to 99% for block matching error compared with the conventional spiral full search algorithm without any loss of image quality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.436-438
• /
• 2001

본 논문에서는 기울어진 얼굴 영상에서 얼굴 구성 요소를 추출하는 방법을 제안한다. 제안하는 방법은 먼저 피부 색상 정보를 이용하여 얼굴 후보 영역을 추출한다. 이때 YIQ 색상 좌표계를 이용하고 조명의 영향을 반영하기 위하여 피부색상 영역을 다단계로 분할하여 색상 영역을 각각 결정한 뒤 적중률을 계산하여 얼굴 후보 영역을 결정하는 방법을 제안하였다. 2단계에서는 얼굴의 구성 요소중 가장 두드러진 특징인 눈동자 영역을 기준으로 한국인의 표준 얼굴 통계치를 적응하여 탐색하는 방법을 사용하였다. 이때 탐색된 눈동자 좌표로부터 얼굴의 기울기를 추정한다. 다음 단계에서는 얼굴 후보 영역에 대하여 기울어짐 보정을 수행한 뒤, 수평 수직 투영값을 이용하여 얼굴의 구성요소를 탐색한 뒤 얼굴 포함 최소 사각형을 정의하였다. 마지막으로 얼굴 영상 데이터 베이스로부터 얼굴 포함 최소 사각형에 대한 명암값 표준템플릿을 정의하고, 입력 영상에서 탐색된 최소 포함 사각형에 대하여 얼굴 영역 검증하는 방법을 제안하였다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.2
• /
• pp.12-21
• /
• 2013

This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1025-1034
• /
• 2004

This paper proposes an adaptive motion estimation algorithm using the temporal continuity of motion. We set up a squared global search region (GSR), which basically corresponds to the search region of FSA, and non-squared adaptive local search regions (LSRs), the positions for which are predicted by the motion vectors of the temporal neighbor blocks, are constructed in the GSR. The previous frame blocks that possibly have effects on the current block are to be the temporal neighbor blocks. Because motion estimation is only performed in the areas made by LSRs, we can estimate motion more correctly and reduce processing time. Experimental results show that the proposed method can enhance visual qualities with significant reductions of complexity by reducing search regions, when compared to the conventional methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.71-72
• /
• 2009

플래시 메모리은 많은 부분에서 기존의 저장장치인 HDD에 비해 좋은 성능을 지녔다. 하지만 HDD와는 달리 데이터의 덮어쓰기가 허용 되지 않는다. 이 문제를 해결하기 위해 플래시 메모리는 FTL(Flash Translation Layer)을 사용하고 있으며, FTL을 통해 기존의 저장장치와 동일하게 사용할 수 있다. FTL들 중 로그영역을 사용하여 성능을 개선한 것들이 많은데, 로그영역의 사용으로 인해 읽기/쓰기 작업시 반드시 로그영역을 탐색을 해야만 했다. 본 논문에서는 카운팅 블룸필터(Counting bloom filter)를 활용하여 불필요한 로그영역 탐색을 줄이는 기법을 제안하였고, 실험을 통해 로그영역에 최신 데이터가 없는 경우 탐색횟수를 크게 줄일 수 있는 것을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2A
• /
• pp.113-118
• /
• 2012

In this paper, we propose the removal of search point using motion vector correlation and distance between reference frames in H.264/AVC. We remove the search points in full search method and predictive motion vectors in enhanced predictive zonal search method. Since the probability that the reference frame far from the current frame is selected as the best reference frame is decreased, we apply the weighted average based on distance between the current and reference frame to determine the fianl search range. In general, the size of search range is smaller than initial search range. We reduce motion estimation time using the final search range in full search method. Also, the refinement process is adaptively applied to each reference frame. The proposed methods reduce the computational throughput of full search method by 57.13% and of enhanced predictive zonal search by 14.71% without visible performance degradation.