Pub Date : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577188
I. Ahmad, P. Mondal, R. Kanhirodan
Image filtering techniques have potential applications in image processing such as image restoration and image enhancement. The potential of these filters largely depends on the apriori knowledge about the type of noise corrupting the images. This makes the standard filters to be application specific. The widely used proximity based filters help in removing the noise by over-smoothing the edges. On the other hand, sharpening filters enhance the high frequency details making the image non-smooth. In this paper, we have introduced a new finite impulse response (FIR) filter for image restoration where, the filter undergoes a learning procedure. The FIR filter coefficients are adaptively updated based on correlated Hebbian learning. This algorithm exploits the inter pixel correlation in the form of Hebbian learning and hence performs optimal smoothening of the noisy images. The proposed filter uses an iterative process for efficient learning from the neighborhood pixels. Evaluation result shows that the proposed FIR filter is an efficient filter compared to average and Wiener filters for image restoration applications
{"title":"Hebbian learning based FIR filter for image restoration","authors":"I. Ahmad, P. Mondal, R. Kanhirodan","doi":"10.1109/ISSPIT.2005.1577188","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577188","url":null,"abstract":"Image filtering techniques have potential applications in image processing such as image restoration and image enhancement. The potential of these filters largely depends on the apriori knowledge about the type of noise corrupting the images. This makes the standard filters to be application specific. The widely used proximity based filters help in removing the noise by over-smoothing the edges. On the other hand, sharpening filters enhance the high frequency details making the image non-smooth. In this paper, we have introduced a new finite impulse response (FIR) filter for image restoration where, the filter undergoes a learning procedure. The FIR filter coefficients are adaptively updated based on correlated Hebbian learning. This algorithm exploits the inter pixel correlation in the form of Hebbian learning and hence performs optimal smoothening of the noisy images. The proposed filter uses an iterative process for efficient learning from the neighborhood pixels. Evaluation result shows that the proposed FIR filter is an efficient filter compared to average and Wiener filters for image restoration applications","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126383661","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577180
Serhiy Kosinov, S. Marchand-Maillet, T. Pun
This work concerns the problem of asymmetric classification and provides the following contributions. First, it introduces the method of KDDA - a kernelized extension of the distance-based discriminant analysis technique that treats data asymmetrically and naturally accommodates indefinite kernels. Second, it demonstrates that KDDA and other asymmetric nonlinear projective approaches, such as BiasMap and KFD are often prone to an adverse condition referred to as the false positive projection effect. Empirical evaluation on both synthetic and real-world data sets is carried out to assess the degree of performance degradation due to false positive projection effect, determine the viability of some schemes for its elimination, and compare the introduced KDDA method with state-of-the-art alternatives, achieving encouraging results
{"title":"Countering the false positive projection effect in nonlinear asymmetric classification","authors":"Serhiy Kosinov, S. Marchand-Maillet, T. Pun","doi":"10.1109/ISSPIT.2005.1577180","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577180","url":null,"abstract":"This work concerns the problem of asymmetric classification and provides the following contributions. First, it introduces the method of KDDA - a kernelized extension of the distance-based discriminant analysis technique that treats data asymmetrically and naturally accommodates indefinite kernels. Second, it demonstrates that KDDA and other asymmetric nonlinear projective approaches, such as BiasMap and KFD are often prone to an adverse condition referred to as the false positive projection effect. Empirical evaluation on both synthetic and real-world data sets is carried out to assess the degree of performance degradation due to false positive projection effect, determine the viability of some schemes for its elimination, and compare the introduced KDDA method with state-of-the-art alternatives, achieving encouraging results","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631020","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577212
M. Moghaddam, M. Jamzad
Motion blur is one of the most common blurs that degrades images. Restoration of such images are highly dependent to estimation of motion blur parameters. Many researchers have developed algorithms to estimate linear motion blur parameters. These algorithms are different in their performance, time complexity, precision and their robustness in noisy environments. In this paper we have presented a novel algorithm to estimate linear motion blur parameters such as direction and extend by using Radon transform to find direction and fuzzy set concepts to find its extend. The most benefit of this algorithm is its robustness and precision in noisy images. Our method was tested on a wide range of different type of standard images that were degraded with different directions (between 0deg and 180deg) and different motion lengths (between 10 to 50 pixel). Experimental results showed in average SNR > 22 db that is highly satisfactory
{"title":"Motion blur identification in noisy images using fuzzy sets","authors":"M. Moghaddam, M. Jamzad","doi":"10.1109/ISSPIT.2005.1577212","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577212","url":null,"abstract":"Motion blur is one of the most common blurs that degrades images. Restoration of such images are highly dependent to estimation of motion blur parameters. Many researchers have developed algorithms to estimate linear motion blur parameters. These algorithms are different in their performance, time complexity, precision and their robustness in noisy environments. In this paper we have presented a novel algorithm to estimate linear motion blur parameters such as direction and extend by using Radon transform to find direction and fuzzy set concepts to find its extend. The most benefit of this algorithm is its robustness and precision in noisy images. Our method was tested on a wide range of different type of standard images that were degraded with different directions (between 0deg and 180deg) and different motion lengths (between 10 to 50 pixel). Experimental results showed in average SNR > 22 db that is highly satisfactory","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132053151","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577141
N. Asokan, Lauri Tarkkala
Initialization of security in a system must correctly capture the underlying prior context of trust assumptions. Technical security mechanisms like security protocols and cryptographic algorithms cannot be effective unless the initialization is done properly. We identify three sources of difficulty in initializing security: (1) basing initialization on real-world identities is expensive, (2) some usage scenarios require new types of indexical prior contexts, and (3) in certain systems, there may not be any real world prior context to link to. We provide an overview of these difficulties and how some recent research work is attempting to address them
{"title":"Issues in initializing security","authors":"N. Asokan, Lauri Tarkkala","doi":"10.1109/ISSPIT.2005.1577141","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577141","url":null,"abstract":"Initialization of security in a system must correctly capture the underlying prior context of trust assumptions. Technical security mechanisms like security protocols and cryptographic algorithms cannot be effective unless the initialization is done properly. We identify three sources of difficulty in initializing security: (1) basing initialization on real-world identities is expensive, (2) some usage scenarios require new types of indexical prior contexts, and (3) in certain systems, there may not be any real world prior context to link to. We provide an overview of these difficulties and how some recent research work is attempting to address them","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871732","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577223
A. Desoky
Recent years have witnessed an increasing interest in the subject of cryptography. A typical cryptography discussion includes encryption, decryption, and attack algorithms for a number of symmetric (or single key) and asymmetric (or two-key) techniques. Performance evaluation of these techniques deals with algorithm complexity and security. The central idea of cryptography is to develop and implement an invertible transform function over the space of coded information. Classical algorithms have survived for many years, but other ideas are coming quickly forward because of the advancement in computer technology. To design and understand cryptography we need to know the fundamentals of information coding, number theory, and some simple probabilistic models, as well as fast computational algorithms for integer arithmetic. This tutorial presents various cryptography techniques in a unified way, including classical and recent algorithms. Some software implementations are given for the purpose of illustration.
{"title":"Cryptography: algorithms and standards","authors":"A. Desoky","doi":"10.1109/ISSPIT.2005.1577223","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577223","url":null,"abstract":"Recent years have witnessed an increasing interest in the subject of cryptography. A typical cryptography discussion includes encryption, decryption, and attack algorithms for a number of symmetric (or single key) and asymmetric (or two-key) techniques. Performance evaluation of these techniques deals with algorithm complexity and security. The central idea of cryptography is to develop and implement an invertible transform function over the space of coded information. Classical algorithms have survived for many years, but other ideas are coming quickly forward because of the advancement in computer technology. To design and understand cryptography we need to know the fundamentals of information coding, number theory, and some simple probabilistic models, as well as fast computational algorithms for integer arithmetic. This tutorial presents various cryptography techniques in a unified way, including classical and recent algorithms. Some software implementations are given for the purpose of illustration.","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"03 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131935956","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577147
S. Ragusa, J. Palicot, C. Roland, C. Lereau
The nonlinear power amplification of multi-carriers signals generates a lot of perturbations. Among them the power increase in the adjacent channels is studied in this paper. This phenomenon is characterized by the adjacent channel power ratio (ACPR) parameter. The analysis we perform in this paper allows us to find a general expression of ACPR versus the number of signal's sub-carriers, N. Then, we propose a new ACPR definition which permits to better characterize the increase of the shoulders (spectral regrowth). Another interest of our derivation is that we can find the parameters a1 and a3 of the amplifier's polynomial model for a desired ACPR
{"title":"Adjacent channel power ratio analysis for an OFDM signal","authors":"S. Ragusa, J. Palicot, C. Roland, C. Lereau","doi":"10.1109/ISSPIT.2005.1577147","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577147","url":null,"abstract":"The nonlinear power amplification of multi-carriers signals generates a lot of perturbations. Among them the power increase in the adjacent channels is studied in this paper. This phenomenon is characterized by the adjacent channel power ratio (ACPR) parameter. The analysis we perform in this paper allows us to find a general expression of ACPR versus the number of signal's sub-carriers, N. Then, we propose a new ACPR definition which permits to better characterize the increase of the shoulders (spectral regrowth). Another interest of our derivation is that we can find the parameters a1 and a3 of the amplifier's polynomial model for a desired ACPR","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132627366","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577113
H. Senevirathna, K. Yamashita
Multi-user detection in a fading channel environment is a challenging problem in mobile communication systems like multicarrier code-division multiple access (MC-CDMA). In this paper we propose a multi-user detector using a nonorthogonal wavelet neural network. The proposed method operates in frequency domain to detect multi-users in a frequency selective fading channel environment. Kalman filter algorithm is used to estimate the parameters of the neural network adaptively. Nonorthogonal bases have a good resolution when constructing a wavelet network than orthogonal basis. It is due to the difficulty of obtaining an analytical solution to generate orthogonal basis to constrict a wavelet network with better resolution. The performance of the proposed detector shows the ability of adaptive multi-user detection in a Rayleigh fading channel
{"title":"Multi-user detector for MC-CDMA using nonorthogonal wavelet neural networks","authors":"H. Senevirathna, K. Yamashita","doi":"10.1109/ISSPIT.2005.1577113","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577113","url":null,"abstract":"Multi-user detection in a fading channel environment is a challenging problem in mobile communication systems like multicarrier code-division multiple access (MC-CDMA). In this paper we propose a multi-user detector using a nonorthogonal wavelet neural network. The proposed method operates in frequency domain to detect multi-users in a frequency selective fading channel environment. Kalman filter algorithm is used to estimate the parameters of the neural network adaptively. Nonorthogonal bases have a good resolution when constructing a wavelet network than orthogonal basis. It is due to the difficulty of obtaining an analytical solution to generate orthogonal basis to constrict a wavelet network with better resolution. The performance of the proposed detector shows the ability of adaptive multi-user detection in a Rayleigh fading channel","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129212070","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577077
P. Chambers, C. Downing, H. Baher
A multiple-input/multiple-output (MIMO) communications system model is described with reference to antenna measurements from a microwave network analyser. Results are presented which indicate the effect of a measurement error in a MIMO communications system. These results offer an indication of the degree of measurement accuracy required for a MIMO communications system to be a viable alternative to a conventional antenna communications system
{"title":"Effect of measurement error on the capacity of a MIMO wireless system","authors":"P. Chambers, C. Downing, H. Baher","doi":"10.1109/ISSPIT.2005.1577077","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577077","url":null,"abstract":"A multiple-input/multiple-output (MIMO) communications system model is described with reference to antenna measurements from a microwave network analyser. Results are presented which indicate the effect of a measurement error in a MIMO communications system. These results offer an indication of the degree of measurement accuracy required for a MIMO communications system to be a viable alternative to a conventional antenna communications system","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123843851","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577162
Qu Xian-jie, Wang Zhao-qi, Xia Shi-hong, Liao Jin-tao
Recovery of 3D body pose is a fundamental problem for human motion analysis in many applications such as motion capture, vision interface, visual surveillance, and gesture recognition. In this paper, we present a new image-based approach to infer 3D human structure parameters from uncalibrated video. The estimation is example based. First, we acquire a special motion database through an off-line motion capture process. Second, given an uncalibrated motion video, we abstract the viewpoint and then the silhouettes database associated with 3D poses is built by projecting each data of the 3D motion database into 2D plane. Next, with the image silhouettes, the unknown structure parameters are inferred by performing a similarity search in the silhouettes database. We pay more attention on how to retrieving 3D body pose by matching 2D silhouette based on shape context. Through a lot of experiments, the results we got are really satisfying. To accelerate the process of calculating the distance in shape context, we use PCA (principal components analysis) to reduce the computation of complexity. We use trampoline sport, which is an example of complex human motion, to demonstrate the effectiveness of our approach and compare the results with those obtained with Hu moments method
{"title":"Estimating articulated human pose from video using shape context","authors":"Qu Xian-jie, Wang Zhao-qi, Xia Shi-hong, Liao Jin-tao","doi":"10.1109/ISSPIT.2005.1577162","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577162","url":null,"abstract":"Recovery of 3D body pose is a fundamental problem for human motion analysis in many applications such as motion capture, vision interface, visual surveillance, and gesture recognition. In this paper, we present a new image-based approach to infer 3D human structure parameters from uncalibrated video. The estimation is example based. First, we acquire a special motion database through an off-line motion capture process. Second, given an uncalibrated motion video, we abstract the viewpoint and then the silhouettes database associated with 3D poses is built by projecting each data of the 3D motion database into 2D plane. Next, with the image silhouettes, the unknown structure parameters are inferred by performing a similarity search in the silhouettes database. We pay more attention on how to retrieving 3D body pose by matching 2D silhouette based on shape context. Through a lot of experiments, the results we got are really satisfying. To accelerate the process of calculating the distance in shape context, we use PCA (principal components analysis) to reduce the computation of complexity. We use trampoline sport, which is an example of complex human motion, to demonstrate the effectiveness of our approach and compare the results with those obtained with Hu moments method","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121365794","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 : 2005-12-21DOI: 10.1109/ISSPIT.2005.1577063
S. Uhrig, S. Maier, T. Ungerer
This paper proposes a processor core that allows to support the autonomic computing principles in embedded hard-real-time systems. The simultaneous multithreaded CAR-core processor features hardware-integrated scheduling schemes that isolate the hard-real-time thread from non-real-time threads. It is binary compatible with Infineon's TriCore processor and designed as IP core for a system-on-chip. The challenge for the processor design is to implement simultaneous multithreading such that a thread cannot influence the timing behavior of another thread in order to allow predictable thread execution times. Therefore new instruction issue and data memory access techniques are proposed. The autonomic computing requirements shall be implemented by autonomic managers running as helper threads in own thread slots concurrent to the real-time application. The autonomic manager threads monitor the application and decide if self-configuration, self-healing, self-optimization, or self-protection must be triggered
{"title":"Toward a processor core for real-time capable autonomic systems","authors":"S. Uhrig, S. Maier, T. Ungerer","doi":"10.1109/ISSPIT.2005.1577063","DOIUrl":"https://doi.org/10.1109/ISSPIT.2005.1577063","url":null,"abstract":"This paper proposes a processor core that allows to support the autonomic computing principles in embedded hard-real-time systems. The simultaneous multithreaded CAR-core processor features hardware-integrated scheduling schemes that isolate the hard-real-time thread from non-real-time threads. It is binary compatible with Infineon's TriCore processor and designed as IP core for a system-on-chip. The challenge for the processor design is to implement simultaneous multithreading such that a thread cannot influence the timing behavior of another thread in order to allow predictable thread execution times. Therefore new instruction issue and data memory access techniques are proposed. The autonomic computing requirements shall be implemented by autonomic managers running as helper threads in own thread slots concurrent to the real-time application. The autonomic manager threads monitor the application and decide if self-configuration, self-healing, self-optimization, or self-protection must be triggered","PeriodicalId":421826,"journal":{"name":"Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122382086","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
扫码关注我们
求助内容：
应助结果提醒方式：