利用熵度量的下界对数字图像进行快速对齐

2004 International Conference on Image Processing, 2004. ICIP '04. Pub Date : 2004-10-24 DOI:10.1109/ICIP.2004.1421454

M. Sabuncu, P. Ramadge

{"title":"利用熵度量的下界对数字图像进行快速对齐","authors":"M. Sabuncu, P. Ramadge","doi":"10.1109/ICIP.2004.1421454","DOIUrl":null,"url":null,"abstract":"We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edge alignment, is fast to compute, and compares well in experiments with competing approaches.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast alignment of digital images using a lower bound on an entropy metric\",\"authors\":\"M. Sabuncu, P. Ramadge\",\"doi\":\"10.1109/ICIP.2004.1421454\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edge alignment, is fast to compute, and compares well in experiments with competing approaches.\",\"PeriodicalId\":184798,\"journal\":{\"name\":\"2004 International Conference on Image Processing, 2004. ICIP '04.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 International Conference on Image Processing, 2004. ICIP '04.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.2004.1421454\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Conference on Image Processing, 2004. ICIP '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2004.1421454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们提出了一种基于逐次细化量化的配准算法和基于最小生成树熵估计的对齐度量。该度量有利于边缘对齐，计算速度快，并且在实验中与竞争方法比较好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast alignment of digital images using a lower bound on an entropy metric

We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edge alignment, is fast to compute, and compares well in experiments with competing approaches.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2004 International Conference on Image Processing, 2004. ICIP '04.

自引率

0.00%

发文量