Andreea Lavinia Popescu, D. Popescu, Radu Tudor Ionescu, N. Angelescu, Romeo Cojocaru
{"title":"纹理分类的高效分形方法","authors":"Andreea Lavinia Popescu, D. Popescu, Radu Tudor Ionescu, N. Angelescu, Romeo Cojocaru","doi":"10.1109/IcConSCS.2013.6632021","DOIUrl":null,"url":null,"abstract":"This paper presents an alternative approach to classical box counting algorithm for fractal dimension estimation. Irrelevant data are eliminated from input sequences of the algorithm and a new fractal dimension, called efficient fractal dimension (EFD), which is based on the remaining sequences is calculated. The discriminating capacity and the time efficiency of EFD are evaluated in comparison with fractal dimension (FD) computed by box counting both theoretically and empirically. The results revealed that EFD is better than FD for texture identification and classification.","PeriodicalId":265358,"journal":{"name":"2nd International Conference on Systems and Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Efficient fractal method for texture classification\",\"authors\":\"Andreea Lavinia Popescu, D. Popescu, Radu Tudor Ionescu, N. Angelescu, Romeo Cojocaru\",\"doi\":\"10.1109/IcConSCS.2013.6632021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an alternative approach to classical box counting algorithm for fractal dimension estimation. Irrelevant data are eliminated from input sequences of the algorithm and a new fractal dimension, called efficient fractal dimension (EFD), which is based on the remaining sequences is calculated. The discriminating capacity and the time efficiency of EFD are evaluated in comparison with fractal dimension (FD) computed by box counting both theoretically and empirically. The results revealed that EFD is better than FD for texture identification and classification.\",\"PeriodicalId\":265358,\"journal\":{\"name\":\"2nd International Conference on Systems and Computer Science\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2nd International Conference on Systems and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IcConSCS.2013.6632021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2nd International Conference on Systems and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IcConSCS.2013.6632021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient fractal method for texture classification
This paper presents an alternative approach to classical box counting algorithm for fractal dimension estimation. Irrelevant data are eliminated from input sequences of the algorithm and a new fractal dimension, called efficient fractal dimension (EFD), which is based on the remaining sequences is calculated. The discriminating capacity and the time efficiency of EFD are evaluated in comparison with fractal dimension (FD) computed by box counting both theoretically and empirically. The results revealed that EFD is better than FD for texture identification and classification.