http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
김성철 ( Sung Chul Kim ),오일균 ( Il Kyun Oh ),장종환 ( Jong Whan Jang ) 한국정보처리학회 2000 정보처리학회논문지 Vol.7 No.4
In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of the sequential searching method.
이해문(Lee Hae Moon),오일균(Oh Il Kyun),이재연(Lee Jae Yeon),배영래(Bae Young Rae),장종환(Jang Jong Whan) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.9
Histogram-based methods have been used generally for retrieving an image to be searched in the video database. In this paper, we present an algorithm to retrieve an image incorporating the HVS. Comparing the performance of the previous algorithm with that of the proposed one, the new and better algorithm is proposed than the previous algorithm.