• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.383-384
• /
• 2007

In this paper, we propose the new and simple method for sub-pixel block search algorithm by only using integer-pixel for motion estimation and compensation. In many papers, the fast search block match algorithms based on TSS have been proposed. However, these methods could be achieved a little reduction of the computational complexity. All of searching points by 1/4-pixel have own predicted integer-pixel SAD array. Therefor, if we know initial nine SAD values by integer, which is on the searching area of the reference frame, then we can find optimal searching point by 1/4-pixel, directly.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• ETRI Journal
• /
• 제41권4호
• /
• pp.483-493
• /
• 2019

Considering the high dimensions of video sequences, it is often challenging to acquire a sufficient dataset to train the tracking models. From this perspective, we propose to revisit the idea of hand-crafted feature learning to avoid such a requirement from a dataset. The proposed tracking approach is composed of two phases, detection and tracking, according to how severely the appearance of a target changes. The detection phase addresses severe and rapid variations by learning a new appearance model that classifies the pixels into foreground (or target) and background. We further combine the raw pixel features of the color intensity and spatial location with convolutional feature activations for robust target representation. The tracking phase tracks a target by searching for frame regions where the best pixel-level agreement to the model learned from the detection phase is achieved. Our two-phase approach results in efficient and accurate tracking, outperforming recent methods in various challenging cases of target appearance changes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.123-126
• /
• 2000

In this paper, we propose new watermarking technique using weighting factor decision method in the watermark embedding step and adaptive threshold decision method in the watermark extracting step. In our method, we are determined weighting factor in simple by calculating distance between pixel coefficient and neighborhood pixel coefficients and threshold is adaptively determined by searching the minimized extract error value using histogram of difference value.

• 인터넷정보학회논문지
• /
• 제18권1호
• /
• pp.21-26
• /
• 2017

본 논문에서는 홍채정보로 개인인증을 위한 USB-OTG(Uiversal Serial Bus On-the-go) 영상인식 모듈을 설계한다. 개인인증을 위해 사용자가 스마트 폰 버튼을 누를 필요가 없도록 스마트 기기를 안면주위의 여러 장의 안면영상을 획득 후, 눈 깜박임에 의한 화소 값 차로 안면과 홍채영역을 검색하는 영상인식 알고리듬을 제안한다. 본 연구에서는 인접한 눈을 뜬 영상과 눈을 감은 영상을 감지한 안면과 홍채 영상의 프레임 화소 값의 차이를 사용한다. 또한, 홍채 영역분할에 의한 동공과 홍채영역 위치를 빠르게 찾을 수 방법을 활용한다. 제안한 빠른 홍채영역의 위치탐색은 눈 영역의 적정한 그리드 크기에 의해 결정할 수 있다. 안면과 홍채영역의 제한된 영역을 탐색하는 홍채인식 카메라 모듈의 USB-OTG 인터페이스 통한 인접영상의 프레임 차이에 의해 검출할 수 있도록 설계하였다. 이로서 스마트 디바이스 사용자가 홍채 인식을 위해 눈을 깜빡이지 않고 대기해야 하는 불편함을 제거함으로써 사용자 편의성을 증대시킬 것으로 기대한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity

• 한국콘텐츠학회논문지
• /
• 제3권2호
• /
• pp.11-18
• /
• 2003

본 논문에서는 비트패턴을 기반으로 한 고속의 가변 블록 움직임 예측 알고리즘을 제안한다. 제안된 방법은 블록내의 평균값을 기준으로 8bit 화소값을 0과 1의 비트패턴으로 변환한 후 블록의 움직임 예측을 수행한다. 비트변환을 통한 영상의 단순화는 움직임 추정의 계산적 부담을 감소시켜 빠른 탐색을 가능하게 한다. 그리고 블록 내의 움직임 정도를 미리 판별하여 이를 기반으로 한 적응적 탐색이 불필요한 탐색을 제거하고 움직임이 큰 블록에서는 정합(matching) 과정을 심화시켜 보다 빠르고 정확한 움직임 예측을 수행한다. 본 제안된 방식을 가지고 실험한 결과, 한 프레임(frame)당 적은 수의 블록으로 고정된 크기의 블록을 가진 전역탐색 블록 정합 알고리즘(full search block matching algorithm； FS-BMA)보다 예측 에러를 적게 발생시켜 평균적으로 0.5dB 정도의 PSNR 개선을 가져왔다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.974-977
• /
• 1999

In this paper, we have proposed the hardware architecture which implements the algorithm for retaining the connectivity which prevents disconnecting in the gray-scale image thinning To perform the image thinning in a real time which find a skeleton in image, it is necessary to examine the connectivity of the skeleton in a real time. The proposed architecture finds the connectivity number in the 4-clock period. The architecture is consists of three blocks, PS(Parallel to Serial) Converter and State Generator and Ridge Checker. The PS Converter changes the 3$\times$3 gray level image to four sets of image pixels. The State Generator examine the connectivity of the central pixel by searching the data from the PS Converter. the 3$\times$3 gray level image determines. The Ridge Checker determines whether the central pixel is on the skeleton or not The proposed architecture finds the connectivity of the central pixel in a 3$\times$3 gray level image in the 4-clocks. The total circuits are verified by the design tools and operate correctly.

• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1331-1346
• /
• 2018

Aiming at the problem that the gradient-based edge detection operators are sensitive to the noise, causing the pseudo edges, a triqubit-state measurement-based edge detection algorithm is presented in this paper. Combing the image local and global structure information, the triqubit superposition states are used to represent the pixel features, so as to locate the image edge. Our algorithm consists of three steps. Firstly, the improved partial differential method is used to smooth the defect image. Secondly, the triqubit-state is characterized by three elements of the pixel saliency, edge statistical characteristics and gray scale contrast to achieve the defect image from the gray space to the quantum space mapping. Thirdly, the edge image is outputted according to the quantum measurement, local gradient maximization and neighborhood chain code searching. Compared with other methods, the simulation experiments indicate that our algorithm has less pseudo edges and higher edge detection accuracy.

• 한국통신학회논문지
• /
• 제33권11C호
• /
• pp.917-924
• /
• 2008

공간 영역에서의 움직임 예측은 이전 영상에서 지정된 크기의 탐색 영역을 검색하여 현재 블록과 최소 오차를 갖는 블록을 찾는 방법으로, 탐색 영역을 검색하는 과정에서 많은 부호화 시간이 소비된다. 이러한 문제점은 공간 영역에서의 움직임 예측을 주파수 영역에서의 이동 행렬을 사용함으로써 해결할 수 있다. 본 논문에서는 기존의 이동 행렬을 새로운 재귀방정식으로 유도하여 계산량을 줄이는 동시에 영상의 화질은 기존 방식과 유사하게 유지하고자 한다. 또한 반화소 정밀도의 움직임 예측을 위하여 주파수 영역에서의 수직, 수평 이동 행렬을 간단히 수정함으로써 공간 영역에서의 양선형 보간법에 의해 더욱 증대되는 계산량 문제를 해결하고자 한다. 실험 결과 제안된 알고리듬에 의한 DCT 기반 주파수 영역에서의 움직임 예측이 공간 영역에 비하여 적은 비트량을 이용하여 보다 높은 PSNR을 제공함으로 증명한다.