Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Approximation and Rough Classification of Letter-Like Polygon Shapes
Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, Avdelningen för matematik och naturvetenskap.ORCID-id: 0000-0002-9920-7946
2013 (engelsk)Inngår i: Rough Sets and Intelligent Systems: Professor Zdzislaw Pawlak in Memoriam - Volume 1 / [ed] Skowron, Andrzej; Suraj, Zbigniew, Berlin Heidelberg: Springer , 2013, s. 455-474Kapittel i bok, del av antologi (Fagfellevurdert)
Abstract [en]

It is a privilege for the author to be involved in composing a book chapter in the anthology devoted to the life and scientific occupation of Professor Zdzisław Pawlak. The author made a personal acquaintance with the outstanding scientist Professor Pawlak and still remembers him as a warm and gentle human being. Professor Pawlak’s theory of rough sets was taught to students during the courses in Computational Intelligence established at Blekinge Institute of Technology in Karlskrona, Sweden. In some Master of Science theses, the principles of rough set theory were discussed in the aspects of technical applications. In this context, we can feel that the theory is still alive and very useful. In this work, we recall again the basics of rough sets to apply them to the classification of discrete two dimensional point sets, which form the shapes resembling some letters. These possess very irregular patterns and cannot be approximated by standard curves without committing large errors. Since the approximation of letter-like point sets is required by the latter classification of their shapes then we, due to own model, wish to find a continuous curve which fits best for each distribution of points. To accomplish the thorough approximation of finite point sets, we test parametric s-truncated functions piecewise, which warrants a high accuracy of approximating. By operating on the functions, replacing samples of points obtained during experiments carried out, we are able to adopt the rough set technique to verify decisions about the primary recognitions of the curves’ appearance as letter shapes. Even if the curves are stretched and shaped differently in the plane, we will divide them in classes gathering similar objects. Our investigations have not a character of pure art — on the contrary— their results are utilized in the classifications of internet packet streams or the analysis of wave signals typical of, e.g., medical examinations.

sted, utgiver, år, opplag, sider
Berlin Heidelberg: Springer , 2013. s. 455-474
Emneord [en]
S-truncated parametric function, Approximation of letter-like point sets, Rough classification, Indiscernibility relation, Lower approximation, Upper approximation
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-6238DOI: 10.1007/978-3-642-30344-9Lokal ID: oai:bth.se:forskinfo3893771F01A5D422C1257A7D002D261AISBN: 978-3-642-30343-2 (tryckt)OAI: oai:DiVA.org:bth-6238DiVA, id: diva2:833686
Merknad
Series: Intelligent Systems Refeence LibraryTilgjengelig fra: 2015-06-25 Laget: 2012-09-18 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Rakus-Andersson, Elisabeth

Søk i DiVA

Av forfatter/redaktør
Rakus-Andersson, Elisabeth
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 49 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf