Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/47492
Title: Distributed computing and NURBS in computer-assisted in-betweening
Authors: Zhang, Jian Feng
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2005
Source: Zhang, J. F. (2005). Distributed computing and NURBS in computer-assisted in-betweening. Master’s thesis, Nanyang Technological University, Singapore.
Abstract: Producing in-between frames in 2D animation is a labor-intensive process in current cartoon production. An existing Modified Feature Based Algorithm (MFBA) automatically generates in-between frames between two key frames based on feature matching. This is referred to as MFBA-IB. However, the MFBA is computationally intensive. Even with current compute power, it is difficult to have massive in-between frame production by running the algorithm in a single computer. In order to speed up the processing of key frames, a distributed algorithm is proposed. The distributed algorithm has the potential to increase MFBA-IB processing throughput and it is implemented with our distributed communication model in Linux platform. The proposed distributed communication model is a transparent interface for underlying machine architecture or parallel programming and it eases the building of a distributed MFBA-IB system. A graphical user interface program is designed to demonstrate the use of these library routines for a distributed MFBA-IB system and in-between results and throughput of such a system are analyzed.
Description: 117 p
URI: https://hdl.handle.net/10356/47492
DOI: 10.32657/10356/47492
Rights: Nanyang Technological University
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Theses

Files in This Item:
File Description SizeFormat 
SCE_THESES_33.pdf12.84 MBAdobe PDFThumbnail
View/Open

Page view(s) 50

295
Updated on Jun 23, 2021

Download(s) 20

228
Updated on Jun 23, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.