{"title":"基于尺度空间滤波的鲁棒关系树","authors":"J. Stach, S. Shaw","doi":"10.1109/TFTSA.1992.274209","DOIUrl":null,"url":null,"abstract":"A relational tree (RT) is a signal representation used to discriminate between multidimensional signals with arbitrary nonlinear monotonic distortion. The use of RTs is limited by noise. Scale-space filtering takes advantage of the inherently scale-like properties of an RT to provide a more robust signal representation across distortions. Some methods and properties of Gaussian scale-space filtering of RTs are examined. Scale trees (STs) and conventionally filtered (fixed-scale) RTs have been shown to be subsets of this process. Since the effect of scale-space filtering is to move segmentation uncertainty toward the leaves of the tree, other operations performed in the tree domain, such as filtering, can be optimized as well.<<ETX>>","PeriodicalId":105228,"journal":{"name":"[1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Robust relational trees by scale-space filtering\",\"authors\":\"J. Stach, S. Shaw\",\"doi\":\"10.1109/TFTSA.1992.274209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A relational tree (RT) is a signal representation used to discriminate between multidimensional signals with arbitrary nonlinear monotonic distortion. The use of RTs is limited by noise. Scale-space filtering takes advantage of the inherently scale-like properties of an RT to provide a more robust signal representation across distortions. Some methods and properties of Gaussian scale-space filtering of RTs are examined. Scale trees (STs) and conventionally filtered (fixed-scale) RTs have been shown to be subsets of this process. Since the effect of scale-space filtering is to move segmentation uncertainty toward the leaves of the tree, other operations performed in the tree domain, such as filtering, can be optimized as well.<<ETX>>\",\"PeriodicalId\":105228,\"journal\":{\"name\":\"[1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TFTSA.1992.274209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TFTSA.1992.274209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A relational tree (RT) is a signal representation used to discriminate between multidimensional signals with arbitrary nonlinear monotonic distortion. The use of RTs is limited by noise. Scale-space filtering takes advantage of the inherently scale-like properties of an RT to provide a more robust signal representation across distortions. Some methods and properties of Gaussian scale-space filtering of RTs are examined. Scale trees (STs) and conventionally filtered (fixed-scale) RTs have been shown to be subsets of this process. Since the effect of scale-space filtering is to move segmentation uncertainty toward the leaves of the tree, other operations performed in the tree domain, such as filtering, can be optimized as well.<>