任何颜色空间的数学形态学

O. Lézoray, A. Elmoataz, C. Meurie
{"title":"任何颜色空间的数学形态学","authors":"O. Lézoray, A. Elmoataz, C. Meurie","doi":"10.1109/ICIAPW.2007.33","DOIUrl":null,"url":null,"abstract":"In this paper, a new graph-based ordering of color vectors is presented for mathematical morphology purposes. An attractive propoerty of the proposed ordering is its color space independence. A complete graph is defined over a filter window and its structure is analyzed to construct an ordering of color vectors by finding a Hamiltonian path in a two-step algorithm.","PeriodicalId":114866,"journal":{"name":"14th International Conference of Image Analysis and Processing - Workshops (ICIAPW 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Mathematical Morphology in Any Color Space\",\"authors\":\"O. Lézoray, A. Elmoataz, C. Meurie\",\"doi\":\"10.1109/ICIAPW.2007.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new graph-based ordering of color vectors is presented for mathematical morphology purposes. An attractive propoerty of the proposed ordering is its color space independence. A complete graph is defined over a filter window and its structure is analyzed to construct an ordering of color vectors by finding a Hamiltonian path in a two-step algorithm.\",\"PeriodicalId\":114866,\"journal\":{\"name\":\"14th International Conference of Image Analysis and Processing - Workshops (ICIAPW 2007)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"14th International Conference of Image Analysis and Processing - Workshops (ICIAPW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIAPW.2007.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th International Conference of Image Analysis and Processing - Workshops (ICIAPW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIAPW.2007.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

本文提出了一种新的基于图的颜色向量排序方法。所提出的排序的一个吸引人的特性是它与颜色空间无关。在过滤窗口上定义了一个完全图,分析了完全图的结构,并通过两步算法寻找哈密顿路径来构造颜色向量的排序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mathematical Morphology in Any Color Space
In this paper, a new graph-based ordering of color vectors is presented for mathematical morphology purposes. An attractive propoerty of the proposed ordering is its color space independence. A complete graph is defined over a filter window and its structure is analyzed to construct an ordering of color vectors by finding a Hamiltonian path in a two-step algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信