- 1、本文档共29页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
毕 业 设 计(论文)
外 文 文 献 翻 译
文献、资料中文题目:弹性图像匹配
文献、资料英文题目:Elastic image matching
文献、资料来源:
文献、资料发表(出版)日期:
院 (部):
专 业:
班 级:
姓 名:
学 号:
指导教师:
翻译日期: 2017.02.14
Elastic image matching
Abstract
One fundamental problem in image recognition is to establish the resemblance of two images. This can be done by searching the best pixel to pixel mapping taking into account monotonicity and continuity constraints. We show that this problem is NP-complete by reduction from 3-SAT, thus giving evidence that the known exponential time algorithms are justified, but approximation algorithms or simplifications are necessary.
Keywords: Elastic image matching; Two-dimensional warping; NP-completeness
1. Introduction
In image recognition, a common problem is to match two given images, e.g. when comparing an observed image to given references. In that pro-cess, elastic image matching, two-dimensional (2D-)warping (Uchida and Sakoe, 1998) or similar types of invariant methods (Keysers et al., 2000) can be used. For this purpose, we can define cost functions depending on the distortion introduced in the matching and search for the best matching with respect to a given cost function. In this paper, we show that it is an algorithmically hard problem to decide whether a matching between two images exists with costs below a given threshold. We show that the problem image matching is NP-complete by means of a reduction from 3-SAT, which is a common method of demonstrating a problem to be intrinsically hard (Garey and Johnson, 1979). This result shows the inherent computational difficulties in this type of image comparison, while interestingly the same problem is solvable for 1D sequences in polynomial time, e.g. the dynamic time warping problem in speech recognition (see e.g. Ney et al., 1992). This has the following implications: researchers who are interested in an exact solution to this problem cannot hope to find a polynomial time algorithm, unless P=NP. Fur
您可能关注的文档
- Android-Application-Fundamentals安卓应用基础大学毕业论文外文文献翻译及原文.doc
- Engineering-Cost-Management-and-Control工程造价管理控制大学毕业论文外文文献翻译及原文.doc
- Industrial-Robots工业机器人大学毕业论文外文文献翻译及原文.doc
- Interior-Design室内设计大学毕业论文外文文献翻译及原文.doc
- Optical-fiber-access-network-technology光纤接入网技术大学毕业论文外文文献翻译及原文.doc
- Process-and-Development-of-Laser-Forming激光成形工艺方法及其发展前景大学毕业论文外文文献翻译及原文.doc
- Spring的web-MVC构架模式大学毕业论文外文文献翻译及原文.doc
- Strategic-marketing营销策略大学毕业论文外文文献翻译及原文.doc
- The-Dilemma-of-Performance-Appraisal绩效考核的困境大学毕业论文外文文献翻译及原文.doc
- The-Position-Control-System位置控制系统大学毕业论文外文文献翻译及原文.doc
文档评论(0)