The performance and speed of the interframe motion estimation method for sequencial frame sequence compression are the important issues especially in networking application such as video conference and video on demand. In this paper, we proposed a new fast search algorithm for motion estimation on block matching technique called the cocktail search algorithm (CTS). This new algorithm takes advantages of prior search algorithms proposed in the literature and improves at our observations. The experiment results show that the proposed CTS algorithm can provide the better performance and require less computational costs than others. In other words, the CTS can obtain the accurate motion vector efficiently and fast. The fruitful results is achieved by not only holding the original benefit but also constructively improving the existing drawbacks.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0629101-144047 |
| Date | 29 June 2001 |
| Creators | Wei, Sheng-Li |
| Contributors | Wen-Shyong Hsieh, Jyh-Horng Jeng, Trieu-Kien Truong, Yau-Hwang Kuo |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629101-144047 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0017 seconds