{"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}
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.