Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: To Andrzej Skowron on His 70th Birthday
Article type: Research Article
Authors: Peters, James F. | Ramanna, Sheela
Affiliations: Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, E1-526 EITC, 75A Chancellor's Circle, Winnipeg, MB R3T 5V6, Canada. james.peters3@ad.umanitoba.ca; s.ramanna@uwinnipeg.ca
Note: [] Address for correspondence: Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, E1-526 EITC, 75A Chancellor's Circle, Winnipeg, MB R3T 5V6, Canada. This research has been supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grants 185986 and 194376 as well as Network of Excellence grants, 2008-2013, from the Province of Manitoba.
Note: [] Also is a Professor in: Department of Applied Computer Science, University of Winnipeg, 515 Portage Ave., Winnipeg, R3B 2E9, Canada
Abstract: This paper introduces descriptive set patterns that originated from our visits with Zdzisław Pawlak and Andrzej Skowron at Banacha and environs in Warsaw. This paper also celebrates the generosity and caring manner of Andrzej Skowron, who made our visits to Warsaw memorable events. The inspiration for the recent discovery of descriptive set patterns can be traced back to our meetings at Banacha. Descriptive set patterns are collections of near sets that arise rather naturally in the context of an extension of Solomon Leader's uniform topology, which serves as a base topology for compact Hausdorff spaces that are proximity spaces. The particular form of proximity space (called EF-proximity) reported here is an extension of the proximity space introduced by V. Efremovič during the first half of the 1930s. Proximally continuous functions introduced by Yu.V. Smirnov in 1952 lead to pattern generation of comparable set patterns. Set patterns themselves were first considered by T. Pavlidis in 1968 and led to U. Grenander's introduction of pattern generators during the 1990s. This article considers descriptive set patterns in EF-proximity spaces and their application in digital image classification. Images belong to the same class, provided each image in the class contains set patterns that resemble each other. Image classification then reduces to determining if a set pattern in a test image is near a set pattern in a query image.
Keywords: Descriptive set pattern, EF-proximity, Grenander pattern generator, near sets, proximally continuous function, proximity space, uniform topology
DOI: 10.3233/FI-2013-914
Journal: Fundamenta Informaticae, vol. 127, no. 1-4, pp. 357-367, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl