{"title":"一种有效的图像边缘连接弹性网方法","authors":"Junyan Yi, Gang Yang, Yuki Todo, Zheng Tang","doi":"10.1109/APCCAS.2008.4746041","DOIUrl":null,"url":null,"abstract":"Edge linking is a fundamental computer-vision task, viewed as a constrained optimization problem, it is NP hard- being isomorphic to the classical traveling salesman problem. In this paper, we propose an efficient Elastic Net method for edge linking of images. A dynamic parameter strategy is introduced into the Elastic Net, which enable the network to have superior search ability for edge points and converge sooner to optimal or near-optimal solutions. Simulations are conducted on a series of artificial images. The results confirm that this method effectively improves both the solution quality and convergence speed of the classical Elastic Net.","PeriodicalId":344917,"journal":{"name":"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient Elastic Net method for edge linking of images\",\"authors\":\"Junyan Yi, Gang Yang, Yuki Todo, Zheng Tang\",\"doi\":\"10.1109/APCCAS.2008.4746041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Edge linking is a fundamental computer-vision task, viewed as a constrained optimization problem, it is NP hard- being isomorphic to the classical traveling salesman problem. In this paper, we propose an efficient Elastic Net method for edge linking of images. A dynamic parameter strategy is introduced into the Elastic Net, which enable the network to have superior search ability for edge points and converge sooner to optimal or near-optimal solutions. Simulations are conducted on a series of artificial images. The results confirm that this method effectively improves both the solution quality and convergence speed of the classical Elastic Net.\",\"PeriodicalId\":344917,\"journal\":{\"name\":\"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.2008.4746041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.2008.4746041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient Elastic Net method for edge linking of images
Edge linking is a fundamental computer-vision task, viewed as a constrained optimization problem, it is NP hard- being isomorphic to the classical traveling salesman problem. In this paper, we propose an efficient Elastic Net method for edge linking of images. A dynamic parameter strategy is introduced into the Elastic Net, which enable the network to have superior search ability for edge points and converge sooner to optimal or near-optimal solutions. Simulations are conducted on a series of artificial images. The results confirm that this method effectively improves both the solution quality and convergence speed of the classical Elastic Net.