J. Varghese, S. Saudia, K. Nallaperumal, S. P. Mathew, S. Arumugaperumal, Julie Joy
{"title":"基于重叠线分量的有效形态可逆轮廓/边缘表示","authors":"J. Varghese, S. Saudia, K. Nallaperumal, S. P. Mathew, S. Arumugaperumal, Julie Joy","doi":"10.1109/ICETET.2008.43","DOIUrl":null,"url":null,"abstract":"The paper proposes a new morphological reversible contour/edge representation algorithm for the representation of 2D binary shapes of digital images. The concise representation algorithm uses representative lines of different sizes and types to cover all the significant features of the binary contour/edge image. These well-characterized representative line segments, which may overlap among different types, take minimum representative points than that of most other prominent shape representation algorithms including MST and MSD. The new algorithm is computationally efficient than most other algorithms in the literature and is also capable of approximating edge images. The approximated outputs produced by the proposed algorithm by using minimal number of representative points are more natural to the original shapes than that of MST and MSD.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Morphological Reversible Contour/Edge Representation Using Overlapping Line Components\",\"authors\":\"J. Varghese, S. Saudia, K. Nallaperumal, S. P. Mathew, S. Arumugaperumal, Julie Joy\",\"doi\":\"10.1109/ICETET.2008.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a new morphological reversible contour/edge representation algorithm for the representation of 2D binary shapes of digital images. The concise representation algorithm uses representative lines of different sizes and types to cover all the significant features of the binary contour/edge image. These well-characterized representative line segments, which may overlap among different types, take minimum representative points than that of most other prominent shape representation algorithms including MST and MSD. The new algorithm is computationally efficient than most other algorithms in the literature and is also capable of approximating edge images. The approximated outputs produced by the proposed algorithm by using minimal number of representative points are more natural to the original shapes than that of MST and MSD.\",\"PeriodicalId\":269929,\"journal\":{\"name\":\"2008 First International Conference on Emerging Trends in Engineering and Technology\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 First International Conference on Emerging Trends in Engineering and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICETET.2008.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 First International Conference on Emerging Trends in Engineering and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICETET.2008.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Morphological Reversible Contour/Edge Representation Using Overlapping Line Components
The paper proposes a new morphological reversible contour/edge representation algorithm for the representation of 2D binary shapes of digital images. The concise representation algorithm uses representative lines of different sizes and types to cover all the significant features of the binary contour/edge image. These well-characterized representative line segments, which may overlap among different types, take minimum representative points than that of most other prominent shape representation algorithms including MST and MSD. The new algorithm is computationally efficient than most other algorithms in the literature and is also capable of approximating edge images. The approximated outputs produced by the proposed algorithm by using minimal number of representative points are more natural to the original shapes than that of MST and MSD.