Multiresolution permutation filter implementations based on acyclic connected graphs

Permutation filters are a broad class of nonlinear selection filters that utilize the complete spatial and rank order information of observation samples. This use of joint spatial-rank information has proven useful in numerous applications. The application of permutation filters, however, is limited...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 12(2003), 2 vom: 28., Seite 140-52
1. Verfasser: Aguirre, Marcela D (VerfasserIn)
Weitere Verfasser: Barner, Kenneth E
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2003
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000caa a22002652 4500
001 NLM177265728
003 DE-627
005 20250209041213.0
007 cr uuu---uuuuu
008 231223s2003 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2002.807357  |2 doi 
028 5 2 |a pubmed25n0591.xml 
035 |a (DE-627)NLM177265728 
035 |a (NLM)18237895 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Aguirre, Marcela D  |e verfasserin  |4 aut 
245 1 0 |a Multiresolution permutation filter implementations based on acyclic connected graphs 
264 1 |c 2003 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 15.12.2009 
500 |a Date Revised 01.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Permutation filters are a broad class of nonlinear selection filters that utilize the complete spatial and rank order information of observation samples. This use of joint spatial-rank information has proven useful in numerous applications. The application of permutation filters, however, is limited by the factorial growth in the number of spatial-rank orderings. Although M-permutation filters have been developed to address the growth in orderings, their a priori uniform selection of samples is not appropriate in most cases. Permutation filter implementations based on acyclic connected graphs provide a more general approach that allows the level of ordering information utilized to automatically adjust to the problem at hand. In addition to developing and analyzing graph implementations of permutation filters this paper presents a LNE based optimization of the graph structure and filter operation. Simulation results illustrating the performance of the optimization technique and the advantages of the graph implementation are presented 
650 4 |a Journal Article 
700 1 |a Barner, Kenneth E  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 12(2003), 2 vom: 28., Seite 140-52  |w (DE-627)NLM09821456X  |x 1057-7149  |7 nnns 
773 1 8 |g volume:12  |g year:2003  |g number:2  |g day:28  |g pages:140-52 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2002.807357  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 12  |j 2003  |e 2  |b 28  |h 140-52