三角网格图像重构的最大流量最小代价算法

2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI) Pub Date : 2013-05-23 DOI:10.1109/SACI.2013.6608993

Elisa Valentina Moisi, B. Nagy, V. Cretu

{"title":"三角网格图像重构的最大流量最小代价算法","authors":"Elisa Valentina Moisi, B. Nagy, V. Cretu","doi":"10.1109/SACI.2013.6608993","DOIUrl":null,"url":null,"abstract":"We present an algorithm for reconstruction of binary images represented on the triangular grid. The algorithm takes into consideration the three natural projections on the triangular grid and uses the maximum flow minimum cost algorithm for the reconstruction of the image. For testing our algorithm we used some artificial binary hexagon shaped images.","PeriodicalId":304729,"journal":{"name":"2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid\",\"authors\":\"Elisa Valentina Moisi, B. Nagy, V. Cretu\",\"doi\":\"10.1109/SACI.2013.6608993\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an algorithm for reconstruction of binary images represented on the triangular grid. The algorithm takes into consideration the three natural projections on the triangular grid and uses the maximum flow minimum cost algorithm for the reconstruction of the image. For testing our algorithm we used some artificial binary hexagon shaped images.\",\"PeriodicalId\":304729,\"journal\":{\"name\":\"2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SACI.2013.6608993\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI.2013.6608993","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

提出了一种基于三角网格的二值图像重建算法。该算法考虑了三角形网格上的三个自然投影，采用最大流量最小代价算法对图像进行重建。为了测试我们的算法，我们使用了一些人工的二值六边形图像。

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

查看原文本刊更多论文

Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid

We present an algorithm for reconstruction of binary images represented on the triangular grid. The algorithm takes into consideration the three natural projections on the triangular grid and uses the maximum flow minimum cost algorithm for the reconstruction of the image. For testing our algorithm we used some artificial binary hexagon shaped images.

求助全文

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

来源期刊

2013 IEEE 8th International Symposium on Applied Computational Intelligence and Informatics (SACI)

自引率

0.00%

发文量