Pub Date : 2007-11-26DOI: 10.1109/IIH-MSP.2007.369
Jing-Ming Guo
Block truncation coding is an efficient compression technique while offering good image quality. Nonetheless, the blocking effect inherent in BTC causes severe perceptual artifact in high compression ratio applications. In this paper, an error-diffused block truncation coding (EDBTC) is proposed to solve this problem. According to the EDBTC, the error caused by the difference between the original grayscale pixel value and the correspondingly high or low mean substitute is diffused to the predefined neighborhood, and hence the average grayscale will be maintained invariably. In addition, since the compressed data are widely distributed in the Internet transmission, the extra message conveying in a secret way also highly raises attention recently. In this paper, we propose the complementary steganography in error- diffused block truncation coding (CSEDBTC), which cooperates with error diffusion to achieve the objective of secret communication in BTC images. As documented in the experimental results, a low complexity with good image quality is obtained.
{"title":"Complementary Steganography in Error-Diffused Block Truncation Coding Images","authors":"Jing-Ming Guo","doi":"10.1109/IIH-MSP.2007.369","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.369","url":null,"abstract":"Block truncation coding is an efficient compression technique while offering good image quality. Nonetheless, the blocking effect inherent in BTC causes severe perceptual artifact in high compression ratio applications. In this paper, an error-diffused block truncation coding (EDBTC) is proposed to solve this problem. According to the EDBTC, the error caused by the difference between the original grayscale pixel value and the correspondingly high or low mean substitute is diffused to the predefined neighborhood, and hence the average grayscale will be maintained invariably. In addition, since the compressed data are widely distributed in the Internet transmission, the extra message conveying in a secret way also highly raises attention recently. In this paper, we propose the complementary steganography in error- diffused block truncation coding (CSEDBTC), which cooperates with error diffusion to achieve the objective of secret communication in BTC images. As documented in the experimental results, a low complexity with good image quality is obtained.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129252445","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}
In this paper, a hierarchical grid-based indexing method for content-based image retrieval (CBIR) is proposed to improve the retrieval performance. To develop a general retrieval scheme which is less dependent on domain-specific knowledge, the discrete cosine transform (DCT) is employed as a feature extraction method. In establishing database, quantization technique is applied to quantize the DCT coefficients of each database image, such that the feature space is partitioned into a finite number of grids, each of which corresponds to a grid code (GC). On querying an image, a reduced set of candidate images which have the same GC as that of the query image is obtained at varying levels of grid granularity. In the fine matching stage, only the remaining candidates need to be computed for the detailed similarity comparison. The experimental results show that the proposed method leads to a fast retrieval with good accuracy.
{"title":"A Hierarchical Grid-Based Indexing Method for Content-Based Image Retrieval","authors":"Te-Wei Chiang, Tienwei Tsai, Mann-Jung Hsiao","doi":"10.1109/IIH-MSP.2007.23","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.23","url":null,"abstract":"In this paper, a hierarchical grid-based indexing method for content-based image retrieval (CBIR) is proposed to improve the retrieval performance. To develop a general retrieval scheme which is less dependent on domain-specific knowledge, the discrete cosine transform (DCT) is employed as a feature extraction method. In establishing database, quantization technique is applied to quantize the DCT coefficients of each database image, such that the feature space is partitioned into a finite number of grids, each of which corresponds to a grid code (GC). On querying an image, a reduced set of candidate images which have the same GC as that of the query image is obtained at varying levels of grid granularity. In the fine matching stage, only the remaining candidates need to be computed for the detailed similarity comparison. The experimental results show that the proposed method leads to a fast retrieval with good accuracy.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129434374","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.385
Guo-Shiang Lin, Min-Kuan Chang, Shien-Tang Chiu
In this article, an efficient dissolve transition detection scheme was proposed. The proposed scheme is composed of adaptive thresholding, parameter calculation, and transition duration refinement. After adaptive thresholding, we coarsely find dissolve transition candidates. To identify dissolve transitions, a useful feature, model parameter, is extracted. Final, a transition duration refinement algorithm is utilized to search the precision duration. The experimental results demonstrate our proposed scheme can not only detect dissolve transitions well but also accurately locate their durations. Comparing with [6], our proposed scheme can provide a better performance for dissolve detection.
{"title":"Dissolve Detection Scheme with Transition Duration Refinement","authors":"Guo-Shiang Lin, Min-Kuan Chang, Shien-Tang Chiu","doi":"10.1109/IIH-MSP.2007.385","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.385","url":null,"abstract":"In this article, an efficient dissolve transition detection scheme was proposed. The proposed scheme is composed of adaptive thresholding, parameter calculation, and transition duration refinement. After adaptive thresholding, we coarsely find dissolve transition candidates. To identify dissolve transitions, a useful feature, model parameter, is extracted. Final, a transition duration refinement algorithm is utilized to search the precision duration. The experimental results demonstrate our proposed scheme can not only detect dissolve transitions well but also accurately locate their durations. Comparing with [6], our proposed scheme can provide a better performance for dissolve detection.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123872521","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}
Visual cryptography techniques have been extensively investigated since the invention and extension to numerous applications such as image encryption, visual authentication, digital watermarking and image hiding. In this paper, a new subliminal channel found in visual cryptography (SCVC) is presented. This subliminal channel is a secure way to convey an extra secret message in the plain form of an ordinary visual cryptography mechanism. To show the superioritysuperiority of the new perspective, a SCVC-based application for image hiding is demonstrated as an example. In such a way, this discovery implies the possibility of enhancing hiding capacity to image hiding. It's worthwhile to note that the extra computational cost is extremely low upon increasing the extra hiding capacity.
{"title":"A Novel Subliminal Channel Found in Visual Cryptography and Its Application to Image Hiding","authors":"Tzungher Chen, Chang-Sian Wu, Wei-Bin Lee","doi":"10.1109/IIH-MSP.2007.51","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.51","url":null,"abstract":"Visual cryptography techniques have been extensively investigated since the invention and extension to numerous applications such as image encryption, visual authentication, digital watermarking and image hiding. In this paper, a new subliminal channel found in visual cryptography (SCVC) is presented. This subliminal channel is a secure way to convey an extra secret message in the plain form of an ordinary visual cryptography mechanism. To show the superioritysuperiority of the new perspective, a SCVC-based application for image hiding is demonstrated as an example. In such a way, this discovery implies the possibility of enhancing hiding capacity to image hiding. It's worthwhile to note that the extra computational cost is extremely low upon increasing the extra hiding capacity.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116285367","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.402
Ying-Nong Chen, G. Ho, Kuo-Chin Fan, Chin-Chuan Han
Moving pedestrians are too small to grab the clear and recognizable face images in current surveillance systems. In this study, a face detection/indexing scheme has been developed using a dual-camera based capturing module in a large open space. Two cameras, a 'sense' camera and an 'object' one, are calibrated and cooperated. This device not only tracks multiple targets but also gets the close-up snapshot images. Face images with clear and high quality are grabbed and collected at the enrollment stage. A personal feature space and a threshold are constructed for effectively verifying the legality of an entrant. Some experimental results are given to show the validity of the proposed approach.
{"title":"Face Detection and Authentication in a Large Space","authors":"Ying-Nong Chen, G. Ho, Kuo-Chin Fan, Chin-Chuan Han","doi":"10.1109/IIH-MSP.2007.402","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.402","url":null,"abstract":"Moving pedestrians are too small to grab the clear and recognizable face images in current surveillance systems. In this study, a face detection/indexing scheme has been developed using a dual-camera based capturing module in a large open space. Two cameras, a 'sense' camera and an 'object' one, are calibrated and cooperated. This device not only tracks multiple targets but also gets the close-up snapshot images. Face images with clear and high quality are grabbed and collected at the enrollment stage. A personal feature space and a threshold are constructed for effectively verifying the legality of an entrant. Some experimental results are given to show the validity of the proposed approach.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121498283","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.257
Shijue Zheng, Shiqiang Wu
The question of resource management and task scheduling are very complicated in CCNU-SZHDX-Grid computing environment, it is very difficult to test the rationality of resource management and equalization of task scheduling with a kind of specific network equipment in the net. This paper proposes a model for task scheduling on the basis of the net platform, the task scheduling adopts task scheduling genetic algorithm (TSGA), this model has given consideration to resources management and task scheduling, make the two reaching organic combination, and the experimental results are perfect.
{"title":"Research and Application of an Improved Genetic Algorithm on the Net Platform of “Digitized Party School”","authors":"Shijue Zheng, Shiqiang Wu","doi":"10.1109/IIH-MSP.2007.257","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.257","url":null,"abstract":"The question of resource management and task scheduling are very complicated in CCNU-SZHDX-Grid computing environment, it is very difficult to test the rationality of resource management and equalization of task scheduling with a kind of specific network equipment in the net. This paper proposes a model for task scheduling on the basis of the net platform, the task scheduling adopts task scheduling genetic algorithm (TSGA), this model has given consideration to resources management and task scheduling, make the two reaching organic combination, and the experimental results are perfect.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029824","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.414
Li Li, Jing Wu, Xiaowei Guo, Meng Li, X. Niu
The wide application of Windows operation system people is bringing higher request for the security of the system. Identification and authorization are the most basic means to protect the resources of the computer, which is improved in security level in this paper on the logon model of the Windows. We first discuss the advantages and disadvantages of several existing logon mechanisms. To overcome the weakness of these models, we propose a framework for password function security enhancement of Windows operation system via investigating the Windows logon authentication consisting of Winlogon and GINA, authentication package and password filter. The framework can provide flexible interfaces for various types of logon models, and the password stored in the SAM database can be changed automatically while the access operation is authenticated. In the framework design, we separate the logon credential collection and validation module, which makes the system more flexible and convenient for redevelopment.
{"title":"Framework for Windows Password Function Security Enhancement","authors":"Li Li, Jing Wu, Xiaowei Guo, Meng Li, X. Niu","doi":"10.1109/IIH-MSP.2007.414","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.414","url":null,"abstract":"The wide application of Windows operation system people is bringing higher request for the security of the system. Identification and authorization are the most basic means to protect the resources of the computer, which is improved in security level in this paper on the logon model of the Windows. We first discuss the advantages and disadvantages of several existing logon mechanisms. To overcome the weakness of these models, we propose a framework for password function security enhancement of Windows operation system via investigating the Windows logon authentication consisting of Winlogon and GINA, authentication package and password filter. The framework can provide flexible interfaces for various types of logon models, and the password stored in the SAM database can be changed automatically while the access operation is authenticated. In the framework design, we separate the logon credential collection and validation module, which makes the system more flexible and convenient for redevelopment.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121914230","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.230
Jen-Chun Lee, P. Huang, Chien-Ping Chang, T. Tu
Iris recognition is regarded as the most reliable and accurate biometric identification system. Speed and accuracy of iris location are required to achieve the success of iris recognition. This paper presents a new iris location algorithm to improve speed and accuracy. The first step is to detect a point inside the pupil using the method of minimum local block mean. Then the specialized boundary detection mask (SBDM) is employed to locate three points along the inner and outer iris boundaries. Finally, Thales' theorem is applied to find the hypotenuse that is a diameter of their circumcircle and then the circle parameters can be calculated. Based on the CASIA iris image database, experiment results show that the proposed method is superior to the existing approaches on the speed and precision of iris location.
{"title":"Novel and Fast Approach for Iris Location","authors":"Jen-Chun Lee, P. Huang, Chien-Ping Chang, T. Tu","doi":"10.1109/IIH-MSP.2007.230","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.230","url":null,"abstract":"Iris recognition is regarded as the most reliable and accurate biometric identification system. Speed and accuracy of iris location are required to achieve the success of iris recognition. This paper presents a new iris location algorithm to improve speed and accuracy. The first step is to detect a point inside the pupil using the method of minimum local block mean. Then the specialized boundary detection mask (SBDM) is employed to locate three points along the inner and outer iris boundaries. Finally, Thales' theorem is applied to find the hypotenuse that is a diameter of their circumcircle and then the circle parameters can be calculated. Based on the CASIA iris image database, experiment results show that the proposed method is superior to the existing approaches on the speed and precision of iris location.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127960639","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 : 2007-11-26DOI: 10.1109/IIH-MSP.2007.252
S. El-Khamy, M. Khedr, A. Al-Kabbany
Fractal image coding has proved its efficiency as a compression technique for digital images. Recently, using fractal coding for digital image watermarking has gained considerable attention. In this paper, a novel fast image watermarking and data hiding technique is proposed. Watermark embedding is accomplished during region based fractal encoding process which confines the domain pool search space to a certain region according to the mean of the range block. Different domain blocks' regions are assigned to represent either 0 or 1. Depending on the value of the bit to be hidden, the search space is limited to the region assigned to it. In case of hiding in a range block that belongs to a region that does not represent the bit to be hidden in it, bit padding technique is used at the encoder while punching is used at the decoder. Furthermore, at the decoder extracting the watermark needs only checking the mean of the hiding range blocks rather than re-encoding the whole image which significantly enhances the time needed for watermark extraction. The proposed technique is robust against common noise signals such as additive white Gaussian noise AWGN and salt & pepper noise.
{"title":"Punched Image Watermarking: A Novel Fast Fractal Coding Based Technique","authors":"S. El-Khamy, M. Khedr, A. Al-Kabbany","doi":"10.1109/IIH-MSP.2007.252","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.252","url":null,"abstract":"Fractal image coding has proved its efficiency as a compression technique for digital images. Recently, using fractal coding for digital image watermarking has gained considerable attention. In this paper, a novel fast image watermarking and data hiding technique is proposed. Watermark embedding is accomplished during region based fractal encoding process which confines the domain pool search space to a certain region according to the mean of the range block. Different domain blocks' regions are assigned to represent either 0 or 1. Depending on the value of the bit to be hidden, the search space is limited to the region assigned to it. In case of hiding in a range block that belongs to a region that does not represent the bit to be hidden in it, bit padding technique is used at the encoder while punching is used at the decoder. Furthermore, at the decoder extracting the watermark needs only checking the mean of the hiding range blocks rather than re-encoding the whole image which significantly enhances the time needed for watermark extraction. The proposed technique is robust against common noise signals such as additive white Gaussian noise AWGN and salt & pepper noise.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"342 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121606093","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}
Chung-Hong Lee, Chih-Hong Wu, Hsiang-Hang Chung, Hsin-Chang Yang
The functions of automatically identify relationships between cancer diseases and external factors from medical records for supporting cancer diagnosis would be a valuable contribution in public health fields. Unfortunately, so far little attention has been paid on providing effective solutions to such a problem domain. In this work, we propose a framework to automating the extraction of relationships between cancer diseases and potential factors from clinical records and medical literature. We describe a platform framework integrating cancer microarray and developed data mining techniques of multimedia and multilingual, covering clustering of multimedia as well as multilingual classifiers to carry out the system development. In the implementation, we extracted the associated genes of cancers by clustering microarray data, and then exploited the resulting gene clusters to classify cancer related documents. The experimental results show that the platform is capable of extracting the potential patterns to enhancing more effective solutions for cancer diseases.
{"title":"A Unified Multilingual and Multimedia Data Mining Approach for Cancer Knowledge Discovery","authors":"Chung-Hong Lee, Chih-Hong Wu, Hsiang-Hang Chung, Hsin-Chang Yang","doi":"10.1109/IIH-MSP.2007.67","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2007.67","url":null,"abstract":"The functions of automatically identify relationships between cancer diseases and external factors from medical records for supporting cancer diagnosis would be a valuable contribution in public health fields. Unfortunately, so far little attention has been paid on providing effective solutions to such a problem domain. In this work, we propose a framework to automating the extraction of relationships between cancer diseases and potential factors from clinical records and medical literature. We describe a platform framework integrating cancer microarray and developed data mining techniques of multimedia and multilingual, covering clustering of multimedia as well as multilingual classifiers to carry out the system development. In the implementation, we extracted the associated genes of cancers by clustering microarray data, and then exploited the resulting gene clusters to classify cancer related documents. The experimental results show that the platform is capable of extracting the potential patterns to enhancing more effective solutions for cancer diseases.","PeriodicalId":385132,"journal":{"name":"Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083898","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
扫码关注我们
求助内容：
应助结果提醒方式：