一种确定松弛标记过程相容系数的优化算法

Q4 Computer Science

模式识别与人工智能 Pub Date : 1992-08-30 DOI:10.1109/ICPR.1992.201741

M. Pelillo, M. Refice

{"title":"一种确定松弛标记过程相容系数的优化算法","authors":"M. Pelillo, M. Refice","doi":"10.1109/ICPR.1992.201741","DOIUrl":null,"url":null,"abstract":"The problem of determining compatibility coefficients for relaxation labeling processes has received considerable attention and a number of different methods have been suggested. The authors propose a method developed within an optimization framework. After formulating the problem of determining the coefficients as a nonlinear programming problem, they develop a gradient-descent algorithm for solving it. Results on an application of relaxation processes are given.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"79 1","pages":"145-148"},"PeriodicalIF":0.0000,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An optimization algorithm for determining the compatibility coefficients of relaxation labeling processes\",\"authors\":\"M. Pelillo, M. Refice\",\"doi\":\"10.1109/ICPR.1992.201741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of determining compatibility coefficients for relaxation labeling processes has received considerable attention and a number of different methods have been suggested. The authors propose a method developed within an optimization framework. After formulating the problem of determining the coefficients as a nonlinear programming problem, they develop a gradient-descent algorithm for solving it. Results on an application of relaxation processes are given.<<ETX>>\",\"PeriodicalId\":34917,\"journal\":{\"name\":\"模式识别与人工智能\",\"volume\":\"79 1\",\"pages\":\"145-148\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"模式识别与人工智能\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1992.201741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"模式识别与人工智能","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICPR.1992.201741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 6

摘要

确定松弛标记过程的相容性系数的问题受到了相当大的关注，并提出了许多不同的方法。作者提出了一种在优化框架内开发的方法。在将确定系数的问题表述为一个非线性规划问题之后，他们开发了一种梯度下降算法来求解它。给出了松弛过程应用的结果

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

查看原文本刊更多论文

An optimization algorithm for determining the compatibility coefficients of relaxation labeling processes

The problem of determining compatibility coefficients for relaxation labeling processes has received considerable attention and a number of different methods have been suggested. The authors propose a method developed within an optimization framework. After formulating the problem of determining the coefficients as a nonlinear programming problem, they develop a gradient-descent algorithm for solving it. Results on an application of relaxation processes are given.<>

求助全文

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

来源期刊

模式识别与人工智能 Computer Science-Artificial Intelligence

CiteScore

1.60

自引率

0.00%

发文量

3316

期刊介绍：