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

Q4 Computer Science 模式识别与人工智能 Pub Date : 1992-08-30 DOI:10.1109/ICPR.1992.201741
M. Pelillo, M. Refice
{"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}
引用次数: 6

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.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种确定松弛标记过程相容系数的优化算法
确定松弛标记过程的相容性系数的问题受到了相当大的关注,并提出了许多不同的方法。作者提出了一种在优化框架内开发的方法。在将确定系数的问题表述为一个非线性规划问题之后,他们开发了一种梯度下降算法来求解它。给出了松弛过程应用的结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
模式识别与人工智能
模式识别与人工智能 Computer Science-Artificial Intelligence
CiteScore
1.60
自引率
0.00%
发文量
3316
期刊介绍:
期刊最新文献
Pattern Recognition and Artificial Intelligence: 5th Mediterranean Conference, MedPRAI 2021, Istanbul, Turkey, December 17–18, 2021, Proceedings Pattern Recognition and Artificial Intelligence: Third International Conference, ICPRAI 2022, Paris, France, June 1–3, 2022, Proceedings, Part I Pattern Recognition and Artificial Intelligence: Third International Conference, ICPRAI 2022, Paris, France, June 1–3, 2022, Proceedings, Part II Conditional Graph Pattern Matching with a Basic Static Analysis Ensemble Classification Using Entropy-Based Features for MRI Tissue Segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1