Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028307
M. Martínez‐Ramón, J. Arenas-García, Á. Navia-Vázquez, A. Figueiras-Vidal
In this paper, we propose to adaptively combine two LMS adaptive transversal filters for plant identification. One of the filters has a high and the other a low adaption step, in order to combine good tracking capabilities under (fast) change conditions with a reduced convergence error along stationary periods. A brief discussion of the characteristics of the combination is included, emphasizing that it allows the possibility of dealing with "intermediate" rate of change situations, in opposition to (implicit or explicit) switching mechanisms. A selected illustrative simulation example shows the effectiveness of this approach. Some complementary lines of research are indicated, from the points of view of improving the algorithm and of extending the fields of application.
{"title":"An adaptive combination of adaptive filters for plant identification","authors":"M. Martínez‐Ramón, J. Arenas-García, Á. Navia-Vázquez, A. Figueiras-Vidal","doi":"10.1109/ICDSP.2002.1028307","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028307","url":null,"abstract":"In this paper, we propose to adaptively combine two LMS adaptive transversal filters for plant identification. One of the filters has a high and the other a low adaption step, in order to combine good tracking capabilities under (fast) change conditions with a reduced convergence error along stationary periods. A brief discussion of the characteristics of the combination is included, emphasizing that it allows the possibility of dealing with \"intermediate\" rate of change situations, in opposition to (implicit or explicit) switching mechanisms. A selected illustrative simulation example shows the effectiveness of this approach. Some complementary lines of research are indicated, from the points of view of improving the algorithm and of extending the fields of application.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028249
A. Krot
Decomposition methods of nonlinear operators describing the behavior of system in state space (phase space) are very important for analysis, identification and modeling of nonlinear dynamical systems (NDS), in particular NDS with self-organization (or complex NDS). The aim of this paper is derivation and classification of matrix series describing decomposition of vector functions from phase space variables and NDS operators into state space. This paper also develops some statements of matrix decomposition and main principles for analysis of attractors of complex NDS.
{"title":"Application of expansion into matrix series to analysis of attractors of complex nonlinear dynamical systems","authors":"A. Krot","doi":"10.1109/ICDSP.2002.1028249","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028249","url":null,"abstract":"Decomposition methods of nonlinear operators describing the behavior of system in state space (phase space) are very important for analysis, identification and modeling of nonlinear dynamical systems (NDS), in particular NDS with self-organization (or complex NDS). The aim of this paper is derivation and classification of matrix series describing decomposition of vector functions from phase space variables and NDS operators into state space. This paper also develops some statements of matrix decomposition and main principles for analysis of attractors of complex NDS.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028261
Yuhua Ding, G. Vachtsevanos, A. Yezzi, Yinchuan Zhang, Y. Wardi
The segmentation accuracy is shown to be a critical factor in detection rate improvement. With accurate segmentation, results are easier to interpret, and classification performance is better. Therefore, it is required to have a performance measure for segmentation evaluation. However, a number of restrictions limit using existing segmentation performance measures. A recursive segmentation and classification scheme is proposed to improve segmentation accuracy and classification performance in real-time machine vision applications. In this scheme, the confidence level of classification results is used as a new performance measure to evaluate the accuracy of segmentation algorithm. Segmentation is repeated until a classification with desired confidence level is achieved. This scheme can be implemented automatically. Experimental results show that it is efficient to improve segmentation accuracy and the overall detection performance, especially for real-time machine vision applications, where the scene is complicated and a single segmentation algorithm cannot produce satisfactory results.
{"title":"A recursive segmentation and classification scheme for improving segmentation accuracy and detection rate in real-time machine vision applications","authors":"Yuhua Ding, G. Vachtsevanos, A. Yezzi, Yinchuan Zhang, Y. Wardi","doi":"10.1109/ICDSP.2002.1028261","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028261","url":null,"abstract":"The segmentation accuracy is shown to be a critical factor in detection rate improvement. With accurate segmentation, results are easier to interpret, and classification performance is better. Therefore, it is required to have a performance measure for segmentation evaluation. However, a number of restrictions limit using existing segmentation performance measures. A recursive segmentation and classification scheme is proposed to improve segmentation accuracy and classification performance in real-time machine vision applications. In this scheme, the confidence level of classification results is used as a new performance measure to evaluate the accuracy of segmentation algorithm. Segmentation is repeated until a classification with desired confidence level is achieved. This scheme can be implemented automatically. Experimental results show that it is efficient to improve segmentation accuracy and the overall detection performance, especially for real-time machine vision applications, where the scene is complicated and a single segmentation algorithm cannot produce satisfactory results.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"81 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131641189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028176
J. Bunch, R. L. Borne, I. Proudler
Along with its many desirable properties the fast transversal filter (FTF) algorithm suffers from explosive divergence. This type of divergence occurs when the algorithm is seemingly performing its operations normally, producing usable solutions, when the algorithm appears to suddenly produce extremely large errors and an obviously useless solution. Although it is known that a loss of backward consistency is the cause for the resultant perturbations, i.e., a violation to interrelationships between update parameters are not explicitly enforced by the update equations, it is not known why the algorithm suffers explosive divergence rather than a divergence that grows as a continuous function over time. Algorithms have been proposed to circumvent this problem but it remains to be shown through theoretical justification whether these algorithms have remedied the problem or only put it off to some later iteration. Here, we provide a rationale to explain the explosive character of divergence that is inherent to the manner in which the FTF algorithm is derived.
{"title":"Understanding the explosive divergence of the FTF algorithm","authors":"J. Bunch, R. L. Borne, I. Proudler","doi":"10.1109/ICDSP.2002.1028176","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028176","url":null,"abstract":"Along with its many desirable properties the fast transversal filter (FTF) algorithm suffers from explosive divergence. This type of divergence occurs when the algorithm is seemingly performing its operations normally, producing usable solutions, when the algorithm appears to suddenly produce extremely large errors and an obviously useless solution. Although it is known that a loss of backward consistency is the cause for the resultant perturbations, i.e., a violation to interrelationships between update parameters are not explicitly enforced by the update equations, it is not known why the algorithm suffers explosive divergence rather than a divergence that grows as a continuous function over time. Algorithms have been proposed to circumvent this problem but it remains to be shown through theoretical justification whether these algorithms have remedied the problem or only put it off to some later iteration. Here, we provide a rationale to explain the explosive character of divergence that is inherent to the manner in which the FTF algorithm is derived.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133512210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028188
C. Hsieh, Pei-Ying Sou
The synchronization problem is a serious issue in the watermark area. It happens when losing the location of the embedded watermark when cropping, shifting and so on. Therefore the detector finds it difficult to reform the copyright information. In this paper, the proposed method combines an energy-feature basis idea in the time domain to solve the synchronization problem and achieved blind audio watermarking in the cepstrum domain. The simulation results show a high security performance against the MP3 attack and the robustness improvement of several kinds of digital distortion attacks such as pitch-shifting, and cut samples.
{"title":"Blind cepstrum domain audio watermarking based on time energy features","authors":"C. Hsieh, Pei-Ying Sou","doi":"10.1109/ICDSP.2002.1028188","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028188","url":null,"abstract":"The synchronization problem is a serious issue in the watermark area. It happens when losing the location of the embedded watermark when cropping, shifting and so on. Therefore the detector finds it difficult to reform the copyright information. In this paper, the proposed method combines an energy-feature basis idea in the time domain to solve the synchronization problem and achieved blind audio watermarking in the cepstrum domain. The simulation results show a high security performance against the MP3 attack and the robustness improvement of several kinds of digital distortion attacks such as pitch-shifting, and cut samples.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131819282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028293
Min Lei, Zhizhong Wang, Zhengjin Feng
For nonlinear dynamic analysis of the experiment data, one often uses SVD decomposition to reconstruct embedding dimension of attractor because of its simpleness. However, it is hardly for singular value decomposition (SVD) decomposition to get good results in the attractor reconstruction of the experiment data. For this, symplectic geometry method is proposed to estimate embedding dimension of reconstruction attractor in this paper. We illustrate the feasibility of this method and give the embedding dimension of the action surface EMG signal.
{"title":"The application of symplectic geometry on nonlinear dynamics analysis of the experimental data","authors":"Min Lei, Zhizhong Wang, Zhengjin Feng","doi":"10.1109/ICDSP.2002.1028293","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028293","url":null,"abstract":"For nonlinear dynamic analysis of the experiment data, one often uses SVD decomposition to reconstruct embedding dimension of attractor because of its simpleness. However, it is hardly for singular value decomposition (SVD) decomposition to get good results in the attractor reconstruction of the experiment data. For this, symplectic geometry method is proposed to estimate embedding dimension of reconstruction attractor in this paper. We illustrate the feasibility of this method and give the embedding dimension of the action surface EMG signal.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122890076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028321
Jong-Myon Kim, Soojung Ryu, A. Gentile, L. Wills, D. S. Wills
Vector median filters efficiently reduce noise while preserving image details. However, their high computational complexity for color images makes them impractical for real-time systems. We propose new computationally efficient filtering algorithms, called index mapping filters (IMF). These filtering algorithms are accelerated by implementing them on a massively data parallel processor array. In addition to greater computational efficiency, these algorithms result in robust noise reduction of corrupted color images. Analyses of mean square error, signal-to-noise-ratio, and visual comparison metrics indicate that IMF are competitive with the vector median filter (VMF) in their ability to correct impulse noise in color images. These algorithms are implemented on a SIMD processor array being developed for high efficiency, high-performance portable products. Executing on a 4096 node SIMD chip operating at 50 MHz, IMF 3/spl times/3 window applied to a 256/spl times/256 color image would take 442 microseconds (22104 clock cycles) for index mapping distance filter (IMDF) and 408 microseconds (20415 clock cycles) for index mapping median filter (IMMF).
{"title":"Impulse noise removal on an embedded, low memory SIMD processor","authors":"Jong-Myon Kim, Soojung Ryu, A. Gentile, L. Wills, D. S. Wills","doi":"10.1109/ICDSP.2002.1028321","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028321","url":null,"abstract":"Vector median filters efficiently reduce noise while preserving image details. However, their high computational complexity for color images makes them impractical for real-time systems. We propose new computationally efficient filtering algorithms, called index mapping filters (IMF). These filtering algorithms are accelerated by implementing them on a massively data parallel processor array. In addition to greater computational efficiency, these algorithms result in robust noise reduction of corrupted color images. Analyses of mean square error, signal-to-noise-ratio, and visual comparison metrics indicate that IMF are competitive with the vector median filter (VMF) in their ability to correct impulse noise in color images. These algorithms are implemented on a SIMD processor array being developed for high efficiency, high-performance portable products. Executing on a 4096 node SIMD chip operating at 50 MHz, IMF 3/spl times/3 window applied to a 256/spl times/256 color image would take 442 microseconds (22104 clock cycles) for index mapping distance filter (IMDF) and 408 microseconds (20415 clock cycles) for index mapping median filter (IMMF).","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028204
Roberto López-Valcarce
The channel equalization problem for staggered (or offset) modulation formats is considered. It is shown that, due to the relative time offset of the in-phase and quadrature components, the received signal must be sampled at twice the baud rate of the corresponding non-staggered signal. This suggests that perfect zero-forcing equalization may be achievable as in standard fractionally sampled systems. To explore this feature, the MMSE linear equalizer (LE), which turns out to be a periodically time-varying filter, is obtained. It is shown that the MMSE LE can be implemented with an LTI (linear time invariant) filter and a set of periodic switches and modulators. Using this, necessary conditions for zero-forcing equalization with FIR filters are derived.
{"title":"Channel equalization with staggered modulation formats","authors":"Roberto López-Valcarce","doi":"10.1109/ICDSP.2002.1028204","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028204","url":null,"abstract":"The channel equalization problem for staggered (or offset) modulation formats is considered. It is shown that, due to the relative time offset of the in-phase and quadrature components, the received signal must be sampled at twice the baud rate of the corresponding non-staggered signal. This suggests that perfect zero-forcing equalization may be achievable as in standard fractionally sampled systems. To explore this feature, the MMSE linear equalizer (LE), which turns out to be a periodically time-varying filter, is obtained. It is shown that the MMSE LE can be implemented with an LTI (linear time invariant) filter and a set of periodic switches and modulators. Using this, necessary conditions for zero-forcing equalization with FIR filters are derived.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132096270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028136
S. Chan, K. Pun, K. Ho
This paper proposes two new methods for designing a class of 2-channel PR FlR filterbanks and wavelets with Kregularity of high order. The K-regularity constraints are expressed as a set of linear constraints in the design variables. The first method formulates the design problem as a quadratic programming problem with linear equality constraints (QPLC), which can be solved using the method of Lagrange multiplier. The second design method employs the minimax error criteria and solves the design problem as a semidefinite programming problem (SDP). By removing the redundant variablcs, the equality constraints are automatically imposed into the design problem. The optimization problem is then formulated as a linear convex objective function subject to a union of affine set which can be represented by a set of linear matrix inequalities. Hence they can be solved using existing SDP solver. Design examples are given to demonstrate the effectiveness of the proposed methods.
{"title":"The design of a class of prefect reconstruction two-channel FIR and wavelets filterbanks using constrained least squares method and semidefinite programming","authors":"S. Chan, K. Pun, K. Ho","doi":"10.1109/ICDSP.2002.1028136","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028136","url":null,"abstract":"This paper proposes two new methods for designing a class of 2-channel PR FlR filterbanks and wavelets with Kregularity of high order. The K-regularity constraints are expressed as a set of linear constraints in the design variables. The first method formulates the design problem as a quadratic programming problem with linear equality constraints (QPLC), which can be solved using the method of Lagrange multiplier. The second design method employs the minimax error criteria and solves the design problem as a semidefinite programming problem (SDP). By removing the redundant variablcs, the equality constraints are automatically imposed into the design problem. The optimization problem is then formulated as a linear convex objective function subject to a union of affine set which can be represented by a set of linear matrix inequalities. Hence they can be solved using existing SDP solver. Design examples are given to demonstrate the effectiveness of the proposed methods.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028270
I. Dokas, V. Tsagaris, V. Anastassopoulos
Higher order spectral properties of /spl Sigma/-/spl Delta/ sequences are studied. For this purpose a first-order single stage /spl Sigma/-/spl Delta/ modulator is considered having as input a pure sinusoid. The nonlinear behavior of the /spl Sigma/-/spl Delta/ modulator is examined by means of the bispectrum and the bicoherence. These functions reveal the statistical properties of the quantization noise, its dependence on the signal as well as the phase coupling between the signal and the noise. The quantizer and the integrator of the /spl Sigma/-/spl Delta/ modulator have been studied, using different functions, to simulate the deviations from the ideal behavior.
{"title":"Higher order spectral analysis of nonlinear behavior in /spl Sigma/-/spl Delta/ modulator","authors":"I. Dokas, V. Tsagaris, V. Anastassopoulos","doi":"10.1109/ICDSP.2002.1028270","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028270","url":null,"abstract":"Higher order spectral properties of /spl Sigma/-/spl Delta/ sequences are studied. For this purpose a first-order single stage /spl Sigma/-/spl Delta/ modulator is considered having as input a pure sinusoid. The nonlinear behavior of the /spl Sigma/-/spl Delta/ modulator is examined by means of the bispectrum and the bicoherence. These functions reveal the statistical properties of the quantization noise, its dependence on the signal as well as the phase coupling between the signal and the noise. The quantizer and the integrator of the /spl Sigma/-/spl Delta/ modulator have been studied, using different functions, to simulate the deviations from the ideal behavior.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133824905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：