Robust logarithmic hyperbolic cosine adaptive filtering over graph signals
Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal wi...
Ausführliche Beschreibung
Autor*in: |
Cai, Peng [verfasserIn] Wang, Shiyuan [verfasserIn] Zheng, Yunfei [verfasserIn] Guo, Zhongyuan [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Digital signal processing - Orlando, Fla. : Academic Press, 1991, 146 |
---|---|
Übergeordnetes Werk: |
volume:146 |
DOI / URN: |
10.1016/j.dsp.2023.104356 |
---|
Katalog-ID: |
ELV066972973 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | ELV066972973 | ||
003 | DE-627 | ||
005 | 20240210093126.0 | ||
007 | cr uuu---uuuuu | ||
008 | 240210s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.dsp.2023.104356 |2 doi | |
035 | |a (DE-627)ELV066972973 | ||
035 | |a (ELSEVIER)S1051-2004(23)00451-7 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |q VZ |
084 | |a 53.73 |2 bkl | ||
100 | 1 | |a Cai, Peng |e verfasserin |4 aut | |
245 | 1 | 0 | |a Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
264 | 1 | |c 2023 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. | ||
650 | 4 | |a Adaptive filtering | |
650 | 4 | |a Graph signal processing | |
650 | 4 | |a Hyperbolic function | |
650 | 4 | |a Non-Gaussian noise | |
650 | 4 | |a Steady-state performance analysis | |
700 | 1 | |a Wang, Shiyuan |e verfasserin |0 (orcid)0000-0002-5028-5839 |4 aut | |
700 | 1 | |a Zheng, Yunfei |e verfasserin |4 aut | |
700 | 1 | |a Guo, Zhongyuan |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Digital signal processing |d Orlando, Fla. : Academic Press, 1991 |g 146 |h Online-Ressource |w (DE-627)254910319 |w (DE-600)1463243-3 |w (DE-576)114818002 |x 1051-2004 |7 nnns |
773 | 1 | 8 | |g volume:146 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 53.73 |j Nachrichtenübertragung |q VZ |
951 | |a AR | ||
952 | |d 146 |
author_variant |
p c pc s w sw y z yz z g zg |
---|---|
matchkey_str |
article:10512004:2023----::outoaihihproicsnaatvflei |
hierarchy_sort_str |
2023 |
bklnumber |
53.73 |
publishDate |
2023 |
allfields |
10.1016/j.dsp.2023.104356 doi (DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 DE-627 ger DE-627 rda eng 620 VZ 53.73 bkl Cai, Peng verfasserin aut Robust logarithmic hyperbolic cosine adaptive filtering over graph signals 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis Wang, Shiyuan verfasserin (orcid)0000-0002-5028-5839 aut Zheng, Yunfei verfasserin aut Guo, Zhongyuan verfasserin aut Enthalten in Digital signal processing Orlando, Fla. : Academic Press, 1991 146 Online-Ressource (DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 1051-2004 nnns volume:146 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 53.73 Nachrichtenübertragung VZ AR 146 |
spelling |
10.1016/j.dsp.2023.104356 doi (DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 DE-627 ger DE-627 rda eng 620 VZ 53.73 bkl Cai, Peng verfasserin aut Robust logarithmic hyperbolic cosine adaptive filtering over graph signals 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis Wang, Shiyuan verfasserin (orcid)0000-0002-5028-5839 aut Zheng, Yunfei verfasserin aut Guo, Zhongyuan verfasserin aut Enthalten in Digital signal processing Orlando, Fla. : Academic Press, 1991 146 Online-Ressource (DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 1051-2004 nnns volume:146 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 53.73 Nachrichtenübertragung VZ AR 146 |
allfields_unstemmed |
10.1016/j.dsp.2023.104356 doi (DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 DE-627 ger DE-627 rda eng 620 VZ 53.73 bkl Cai, Peng verfasserin aut Robust logarithmic hyperbolic cosine adaptive filtering over graph signals 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis Wang, Shiyuan verfasserin (orcid)0000-0002-5028-5839 aut Zheng, Yunfei verfasserin aut Guo, Zhongyuan verfasserin aut Enthalten in Digital signal processing Orlando, Fla. : Academic Press, 1991 146 Online-Ressource (DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 1051-2004 nnns volume:146 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 53.73 Nachrichtenübertragung VZ AR 146 |
allfieldsGer |
10.1016/j.dsp.2023.104356 doi (DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 DE-627 ger DE-627 rda eng 620 VZ 53.73 bkl Cai, Peng verfasserin aut Robust logarithmic hyperbolic cosine adaptive filtering over graph signals 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis Wang, Shiyuan verfasserin (orcid)0000-0002-5028-5839 aut Zheng, Yunfei verfasserin aut Guo, Zhongyuan verfasserin aut Enthalten in Digital signal processing Orlando, Fla. : Academic Press, 1991 146 Online-Ressource (DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 1051-2004 nnns volume:146 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 53.73 Nachrichtenübertragung VZ AR 146 |
allfieldsSound |
10.1016/j.dsp.2023.104356 doi (DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 DE-627 ger DE-627 rda eng 620 VZ 53.73 bkl Cai, Peng verfasserin aut Robust logarithmic hyperbolic cosine adaptive filtering over graph signals 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis Wang, Shiyuan verfasserin (orcid)0000-0002-5028-5839 aut Zheng, Yunfei verfasserin aut Guo, Zhongyuan verfasserin aut Enthalten in Digital signal processing Orlando, Fla. : Academic Press, 1991 146 Online-Ressource (DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 1051-2004 nnns volume:146 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 53.73 Nachrichtenübertragung VZ AR 146 |
language |
English |
source |
Enthalten in Digital signal processing 146 volume:146 |
sourceStr |
Enthalten in Digital signal processing 146 volume:146 |
format_phy_str_mv |
Article |
bklname |
Nachrichtenübertragung |
institution |
findex.gbv.de |
topic_facet |
Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
Digital signal processing |
authorswithroles_txt_mv |
Cai, Peng @@aut@@ Wang, Shiyuan @@aut@@ Zheng, Yunfei @@aut@@ Guo, Zhongyuan @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
254910319 |
dewey-sort |
3620 |
id |
ELV066972973 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV066972973</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240210093126.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240210s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dsp.2023.104356</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV066972973</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1051-2004(23)00451-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cai, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust logarithmic hyperbolic cosine adaptive filtering over graph signals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adaptive filtering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hyperbolic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-Gaussian noise</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steady-state performance analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Shiyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-5028-5839</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zheng, Yunfei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Zhongyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Digital signal processing</subfield><subfield code="d">Orlando, Fla. : Academic Press, 1991</subfield><subfield code="g">146</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)254910319</subfield><subfield code="w">(DE-600)1463243-3</subfield><subfield code="w">(DE-576)114818002</subfield><subfield code="x">1051-2004</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:146</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="j">Nachrichtenübertragung</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">146</subfield></datafield></record></collection>
|
author |
Cai, Peng |
spellingShingle |
Cai, Peng ddc 620 bkl 53.73 misc Adaptive filtering misc Graph signal processing misc Hyperbolic function misc Non-Gaussian noise misc Steady-state performance analysis Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
authorStr |
Cai, Peng |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)254910319 |
format |
electronic Article |
dewey-ones |
620 - Engineering & allied operations |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1051-2004 |
topic_title |
620 VZ 53.73 bkl Robust logarithmic hyperbolic cosine adaptive filtering over graph signals Adaptive filtering Graph signal processing Hyperbolic function Non-Gaussian noise Steady-state performance analysis |
topic |
ddc 620 bkl 53.73 misc Adaptive filtering misc Graph signal processing misc Hyperbolic function misc Non-Gaussian noise misc Steady-state performance analysis |
topic_unstemmed |
ddc 620 bkl 53.73 misc Adaptive filtering misc Graph signal processing misc Hyperbolic function misc Non-Gaussian noise misc Steady-state performance analysis |
topic_browse |
ddc 620 bkl 53.73 misc Adaptive filtering misc Graph signal processing misc Hyperbolic function misc Non-Gaussian noise misc Steady-state performance analysis |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Digital signal processing |
hierarchy_parent_id |
254910319 |
dewey-tens |
620 - Engineering |
hierarchy_top_title |
Digital signal processing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)254910319 (DE-600)1463243-3 (DE-576)114818002 |
title |
Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
ctrlnum |
(DE-627)ELV066972973 (ELSEVIER)S1051-2004(23)00451-7 |
title_full |
Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
author_sort |
Cai, Peng |
journal |
Digital signal processing |
journalStr |
Digital signal processing |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
zzz |
author_browse |
Cai, Peng Wang, Shiyuan Zheng, Yunfei Guo, Zhongyuan |
container_volume |
146 |
class |
620 VZ 53.73 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Cai, Peng |
doi_str_mv |
10.1016/j.dsp.2023.104356 |
normlink |
(ORCID)0000-0002-5028-5839 |
normlink_prefix_str_mv |
(orcid)0000-0002-5028-5839 |
dewey-full |
620 |
author2-role |
verfasserin |
title_sort |
robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
title_auth |
Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
abstract |
Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. |
abstractGer |
Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. |
abstract_unstemmed |
Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms. |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
title_short |
Robust logarithmic hyperbolic cosine adaptive filtering over graph signals |
remote_bool |
true |
author2 |
Wang, Shiyuan Zheng, Yunfei Guo, Zhongyuan |
author2Str |
Wang, Shiyuan Zheng, Yunfei Guo, Zhongyuan |
ppnlink |
254910319 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.dsp.2023.104356 |
up_date |
2024-07-06T19:38:38.084Z |
_version_ |
1803859754311745536 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV066972973</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240210093126.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240210s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dsp.2023.104356</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV066972973</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S1051-2004(23)00451-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cai, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust logarithmic hyperbolic cosine adaptive filtering over graph signals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Graph signal processing (GSP) has two methods including graph Fourier transform (GFT) and graph shift-operator (GSO) for dealing with the graph signal used for adaptive filtering (AF). However, in order to perform feature decomposition, GFT requires the availability of a band-limited graph signal with a known bandwidth in advance. Therefore, a general model based on GSO is then derived for AF by introducing a mixture coefficient to combine the advantages of different GSOs, comprehensively. Since the existing algorithms using the mean square error and other robust error criteria in GSP cannot effectively fight against non-Gaussian noises, a robust logarithmic hyperbolic cosine adaptive filter over graph (GLHCAF) algorithm is proposed by applying the logarithmic hyperbolic cosine loss function to the designed general model. The significant performance improvement of GLHCAF in non-Gaussian noises is obtained by simply controlling the scaling parameter. To avoid the parameter selections including scaling parameter and step size, the adaptive GLHCAF (AGLHCAF) algorithm is therefore proposed to further improve the performance of GLHCAF. Moreover, the mean square performance analysis of GLHCAF is given. Simulations in the real-world data are provided to assess the reliability and accuracy for theoretical analysis, the universality of the designed general model, and superiorities of proposed algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adaptive filtering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hyperbolic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-Gaussian noise</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Steady-state performance analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Shiyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-5028-5839</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zheng, Yunfei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guo, Zhongyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Digital signal processing</subfield><subfield code="d">Orlando, Fla. : Academic Press, 1991</subfield><subfield code="g">146</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)254910319</subfield><subfield code="w">(DE-600)1463243-3</subfield><subfield code="w">(DE-576)114818002</subfield><subfield code="x">1051-2004</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:146</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="j">Nachrichtenübertragung</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">146</subfield></datafield></record></collection>
|
score |
7.3984165 |