QQ客服 官方微博 反馈留言

	Correspondence construction for cartoon animation via sparse coding
	Wang, Jianming ; Yu, Jun ; Yu J(俞俊)
	2013
关键词	Internet Pattern recognition
英文摘要	Conference Name:5th International Conference on Internet Multimedia Computing and Service, ICIMCS 2013. Conference Address: Huangshan, China. Time:August 17, 2013 - August 19, 2013.; Hefei University of Technology; National Natural Foundation of China; SIGMM China Chapter; In 2D animation, it is a tedious task and time-consuming that drawing in-betweens for the animator. Correspondence construction between two key frames is a necessary condition for auto-inbetween in the computer animation auxiliary system. In this paper, we combine patch alignment framework (PAF) with the idea of sparse coding for correspondence construction. Specifically, local patches construction can have a large impact on the accuracy of correspondence. Therefore, in our framework, in order to construct local patches in each point on an object and align these patches in a new feature space, we adopt sparse coding instead of k-nearest neighbor method in patch construction. The correspondences between two objects can be detected by subsequent clustering method. This approach can efficiently improves the performance of correspondence construction. To optimize the proposed framework, we use least angle regression (LARS) method to overcome the slow operating efficiency problem of lasso. Experimental results on our cartoon data set which is built on industrial production suggest the advanced accuracy of correspondence construction in our improved framework, and is even better than the framework of using k-nearest neighbor algorithm to construct local patches. ? 2013 ACM.
语种	英语
出处	http://dx.doi.org/10.1145/2499788.2499861
出版者	Association for Computing Machinery
内容类型	其他
源URL	[http://dspace.xmu.edu.cn/handle/2288/86645]
专题	信息技术－会议论文
推荐引用方式 GB/T 7714	Wang, Jianming,Yu, Jun,Yu J. Correspondence construction for cartoon animation via sparse coding. 2013-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。