Boolean function optimisation in binary mathematical morphology

Urszula Stańczyk; Boleslaw Pochopień

doi:10.1016/S1474-6670(17)30636-5

Boolean function optimisation in binary mathematical morphology

Katedra Grafiki, Wizji Komputerowej i Systemów Cyfrowych (RAU/RAU6)

Wyniki badań: Wkład do czasopisma › Artykuł z konferencji › recenzja

Abstrakt

Every finite window image processing operator can be defined by a logic function, giving another representation for transformations. Since logic functions can take on various forms, switching one to another can influence processing time and storage capacity requirements hence leading to the problem of finding some optimal representation for intended implementation of image transforms by their defining Boolean functions.

Język oryginału	angielski
Strony (od–do)	411-416
Liczba stron	6
Czasopismo	IFAC-PapersOnLine
Tom	37
Numer wydania	20
Identyfikatory DOI	https://doi.org/10.1016/S1474-6670(17)30636-5
Status publikacji	Opublikowano - 2004
Wydarzenie	2004 IFAC Workshop on Programmable Devices and Systems, PDS 2004 - Cracow, Polska Czas trwania: 18 lis 2004 → 19 lis 2004

Obszary tematyczne ASJC Scopus

Inżynieria sterowania i systemów

Uzyskaj dostęp do dokumentu

10.1016/S1474-6670(17)30636-5

Inne pliki i linki

Link do publikacji w Scopus

Cytowanie

@article{874692757ee742cdb23ee2d7c3a6f856,

title = "Boolean function optimisation in binary mathematical morphology",

abstract = "Every finite window image processing operator can be defined by a logic function, giving another representation for transformations. Since logic functions can take on various forms, switching one to another can influence processing time and storage capacity requirements hence leading to the problem of finding some optimal representation for intended implementation of image transforms by their defining Boolean functions.",

keywords = "Boolean functions, Function representation, Morphological image processing",

author = "Urszula Sta{\'n}czyk and Boleslaw Pochopie{\'n}",

note = "Publisher Copyright: {\textcopyright} 2004 IFAC.; 2004 IFAC Workshop on Programmable Devices and Systems, PDS 2004 ; Conference date: 18-11-2004 Through 19-11-2004",

year = "2004",

doi = "10.1016/S1474-6670(17)30636-5",

language = "English",

volume = "37",

pages = "411--416",

journal = "IFAC-PapersOnLine",

issn = "2405-8971",

publisher = "Elsevier B.V.",

number = "20",

}

TY - JOUR

T1 - Boolean function optimisation in binary mathematical morphology

AU - Stańczyk, Urszula

AU - Pochopień, Boleslaw

PY - 2004

Y1 - 2004

N2 - Every finite window image processing operator can be defined by a logic function, giving another representation for transformations. Since logic functions can take on various forms, switching one to another can influence processing time and storage capacity requirements hence leading to the problem of finding some optimal representation for intended implementation of image transforms by their defining Boolean functions.

AB - Every finite window image processing operator can be defined by a logic function, giving another representation for transformations. Since logic functions can take on various forms, switching one to another can influence processing time and storage capacity requirements hence leading to the problem of finding some optimal representation for intended implementation of image transforms by their defining Boolean functions.

KW - Boolean functions

KW - Function representation

KW - Morphological image processing

UR - https://www.scopus.com/pages/publications/85064451111

U2 - 10.1016/S1474-6670(17)30636-5

DO - 10.1016/S1474-6670(17)30636-5

M3 - Conference article

AN - SCOPUS:85064451111

SN - 2405-8971

VL - 37

SP - 411

EP - 416

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 20

T2 - 2004 IFAC Workshop on Programmable Devices and Systems, PDS 2004

Y2 - 18 November 2004 through 19 November 2004

ER -

Boolean function optimisation in binary mathematical morphology

Abstrakt

Obszary tematyczne ASJC Scopus

Uzyskaj dostęp do dokumentu

Inne pliki i linki

Fingerprint

Cytowanie