结合距离和强度数据与隐马尔可夫模型

Q4 Computer Science

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

R. B. Huseby, G. Høgåsen, G. Storvik, K. Aas

{"title":"结合距离和强度数据与隐马尔可夫模型","authors":"R. B. Huseby, G. Høgåsen, G. Storvik, K. Aas","doi":"10.1109/ICPR.1992.201737","DOIUrl":null,"url":null,"abstract":"The paper treats the analysis of an industrial inspection problem, namely the segmentation and discrimination of similar-looking bottles based on a multispectral image consisting of both range and intensity data. A contextual pixel classification is performed using a whole line as neighborhood. The framework of hidden Markov models together with a fast algorithm from control engineering makes this possible. The method is compared to J. Haslett's method (1985) for contextual classification, and performs significantly better.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"1 1","pages":"128-131"},"PeriodicalIF":0.0000,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Combining range and intensity data with a hidden Markov model\",\"authors\":\"R. B. Huseby, G. Høgåsen, G. Storvik, K. Aas\",\"doi\":\"10.1109/ICPR.1992.201737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper treats the analysis of an industrial inspection problem, namely the segmentation and discrimination of similar-looking bottles based on a multispectral image consisting of both range and intensity data. A contextual pixel classification is performed using a whole line as neighborhood. The framework of hidden Markov models together with a fast algorithm from control engineering makes this possible. The method is compared to J. Haslett's method (1985) for contextual classification, and performs significantly better.<<ETX>>\",\"PeriodicalId\":34917,\"journal\":{\"name\":\"模式识别与人工智能\",\"volume\":\"1 1\",\"pages\":\"128-131\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"模式识别与人工智能\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1992.201737\",\"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.201737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 2

摘要

本文分析了一个工业检测问题，即基于包含距离和强度数据的多光谱图像对相似外观的瓶子进行分割和识别。使用整条线作为邻域执行上下文像素分类。隐马尔可夫模型的框架和控制工程中的快速算法使这成为可能。该方法与J. Haslett的方法(1985)进行上下文分类比较，表现明显更好

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

查看原文本刊更多论文

Combining range and intensity data with a hidden Markov model

The paper treats the analysis of an industrial inspection problem, namely the segmentation and discrimination of similar-looking bottles based on a multispectral image consisting of both range and intensity data. A contextual pixel classification is performed using a whole line as neighborhood. The framework of hidden Markov models together with a fast algorithm from control engineering makes this possible. The method is compared to J. Haslett's method (1985) for contextual classification, and performs significantly better.<>

求助全文

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

来源期刊

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

CiteScore

1.60

自引率

0.00%

发文量

3316

期刊介绍：