Pub Date : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852959
Yu-Wei Hsu, Kuang-Hsuan Chen, Jing-Jung Yang, F. Jaw
The danger of falling among the elderly is a public concern and is becoming an important issue that needs further attention. Sensors embedded in smartphones provide information about user activity, such as the accelerometer which is widely used in fall detection. In this paper, we propose a fall detection algorithm which is formed by feature extraction processing and recognition processing. A total of six features were calculated in feature extraction processing. Four of them are related to the gravity vector which is extracted from accelerometer data by using low-pass filtering. As falling mostly occurs in a vertical direction, the gravity-related features are useful. In recognition processing, a set of six features was clustered by support vector machine. The main feature - acceleration in the gravity vector direction - contains the vertical directional information and provides a distinct pattern of fall-related activity. This feature acts as a trigger-key in recognition processing to avoid false alarms which lead to excessive computation. The results show that our algorithm could achieve a sensitivity of 96.67% and specificity of 95%.
{"title":"Smartphone-based fall detection algorithm using feature extraction","authors":"Yu-Wei Hsu, Kuang-Hsuan Chen, Jing-Jung Yang, F. Jaw","doi":"10.1109/CISP-BMEI.2016.7852959","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852959","url":null,"abstract":"The danger of falling among the elderly is a public concern and is becoming an important issue that needs further attention. Sensors embedded in smartphones provide information about user activity, such as the accelerometer which is widely used in fall detection. In this paper, we propose a fall detection algorithm which is formed by feature extraction processing and recognition processing. A total of six features were calculated in feature extraction processing. Four of them are related to the gravity vector which is extracted from accelerometer data by using low-pass filtering. As falling mostly occurs in a vertical direction, the gravity-related features are useful. In recognition processing, a set of six features was clustered by support vector machine. The main feature - acceleration in the gravity vector direction - contains the vertical directional information and provides a distinct pattern of fall-related activity. This feature acts as a trigger-key in recognition processing to avoid false alarms which lead to excessive computation. The results show that our algorithm could achieve a sensitivity of 96.67% and specificity of 95%.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151878","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852816
Jun Ni, Gen Luo, Tao Yu, NingChuan Li
Image sharpness is an important aspect of image quality. It used to measure the degree of focus at the time of image acquisition. It also play an important role for video compression. Here, one new sharpness algorithm based on gradient shape is introduced in this paper. which is used for no-reference Image .The algorithm gets region of Interest in image firstly, then search the edge which can present sharpness information in selected region . It calculates edge transition zone width, then gets gray contrast in edge region, finally a probability summation algorithm model be set by these factors. This algorithm can calculate the sharpness degree of different images. A lot of experimental results show that this sharpness algorithm is effective and keep consistency with human subjective judgment. It can be used to describe the no-reference image sharpness effectively.
{"title":"No-reference image sharpness Algorithm based on gradient shape","authors":"Jun Ni, Gen Luo, Tao Yu, NingChuan Li","doi":"10.1109/CISP-BMEI.2016.7852816","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852816","url":null,"abstract":"Image sharpness is an important aspect of image quality. It used to measure the degree of focus at the time of image acquisition. It also play an important role for video compression. Here, one new sharpness algorithm based on gradient shape is introduced in this paper. which is used for no-reference Image .The algorithm gets region of Interest in image firstly, then search the edge which can present sharpness information in selected region . It calculates edge transition zone width, then gets gray contrast in edge region, finally a probability summation algorithm model be set by these factors. This algorithm can calculate the sharpness degree of different images. A lot of experimental results show that this sharpness algorithm is effective and keep consistency with human subjective judgment. It can be used to describe the no-reference image sharpness effectively.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121029516","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7853034
Bo Suo, Zhanhuai Li, Wei Pan
While numerous applications, such as social networks, protein-protein interaction networks, and bibliographic networks, mainly consist of graph-structured data, massive graphs, of which the scales range from million nodes to billion nodes, are common-place. Searching within these kinds of graphs is urged to be efficient. Unfortunately, since the subgraph isomorphism problem is NP-complete, querying on large graphs is still challenging.
{"title":"Parallel subgraph matching on massive graphs","authors":"Bo Suo, Zhanhuai Li, Wei Pan","doi":"10.1109/CISP-BMEI.2016.7853034","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7853034","url":null,"abstract":"While numerous applications, such as social networks, protein-protein interaction networks, and bibliographic networks, mainly consist of graph-structured data, massive graphs, of which the scales range from million nodes to billion nodes, are common-place. Searching within these kinds of graphs is urged to be efficient. Unfortunately, since the subgraph isomorphism problem is NP-complete, querying on large graphs is still challenging.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121265301","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852971
Ye Xu, Jin Li, Xiang Chen, Jianxin Wei
At present, the diagnosis of sleep apnea syndrome requires patients to wear the PSG sensors all night long in hospital, which is so inconvenient and expensive that millions of sleep apnea patients can't receive diagnosis and treatment. We propose a low-cost sleep monitoring device to be used at the comfort of home based on photoplethysmography (PPG) with only single photoelectric sensor, which can simultaneously obtain oxygen saturation, pulse rate, respiration rate, heart rate variability analysis and body motions to realize the basic monitoring of circulatory, respiratory, nervous system and motor system. The device consists of two light emitting diodes, a probe-drive module, an optical - frequency converter, a microcontroller MSP430F5438A, a wireless transceiver module and a Micro SD card module. The evaluations by commercial BIOPAC systems demonstrate the feasibility of our proposed device.
{"title":"A low-cost PPG-based device for monitoring sleep apnea syndrome","authors":"Ye Xu, Jin Li, Xiang Chen, Jianxin Wei","doi":"10.1109/CISP-BMEI.2016.7852971","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852971","url":null,"abstract":"At present, the diagnosis of sleep apnea syndrome requires patients to wear the PSG sensors all night long in hospital, which is so inconvenient and expensive that millions of sleep apnea patients can't receive diagnosis and treatment. We propose a low-cost sleep monitoring device to be used at the comfort of home based on photoplethysmography (PPG) with only single photoelectric sensor, which can simultaneously obtain oxygen saturation, pulse rate, respiration rate, heart rate variability analysis and body motions to realize the basic monitoring of circulatory, respiratory, nervous system and motor system. The device consists of two light emitting diodes, a probe-drive module, an optical - frequency converter, a microcontroller MSP430F5438A, a wireless transceiver module and a Micro SD card module. The evaluations by commercial BIOPAC systems demonstrate the feasibility of our proposed device.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069221","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852703
Wei-lan Wang, Youguang Chen
Images captured in foggy weather often suffer from bad visibility, because of bad atmospheric visibility. The existence of particles, dust and water impurities always fade the color and lead to a bad contrast of the observed objects. And then, we will feel indistinct by our eyes. We introduce a novel algorithm of single image that based on hybrid filter in this paper. The algorithm is based on an advanced median filter, and combined with average filter. The visibility of photos has been greatly improved by use of iteration. Experimental results on a variety of haze images demonstrate the effectiveness of the advanced method, which contains the fast speed of Median filter and also gets more distinct in details compared with other algorithms. The main advantage of the proposed algorithm compared with others is its speed. This speed allows visibility restoration to be applied for the first time within real-time processing applications such as sign, lane-marking and obstacle detection.
{"title":"A single image de-hazing algorithm based on hybrid filter","authors":"Wei-lan Wang, Youguang Chen","doi":"10.1109/CISP-BMEI.2016.7852703","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852703","url":null,"abstract":"Images captured in foggy weather often suffer from bad visibility, because of bad atmospheric visibility. The existence of particles, dust and water impurities always fade the color and lead to a bad contrast of the observed objects. And then, we will feel indistinct by our eyes. We introduce a novel algorithm of single image that based on hybrid filter in this paper. The algorithm is based on an advanced median filter, and combined with average filter. The visibility of photos has been greatly improved by use of iteration. Experimental results on a variety of haze images demonstrate the effectiveness of the advanced method, which contains the fast speed of Median filter and also gets more distinct in details compared with other algorithms. The main advantage of the proposed algorithm compared with others is its speed. This speed allows visibility restoration to be applied for the first time within real-time processing applications such as sign, lane-marking and obstacle detection.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137411","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852815
Teng Wan, Ce Li, Yachao Zhang
The research in the field of the localization and navigation of mobile robot is becoming more and more significant. Among them, the local real-time path planning for robot autonomous navigation in complex environment is particularly important. However, the current local path planning algorithms are all planning the local path in the same plan-scope. Sometimes, this situation leads to a waste of time and computing resources. Therefore, in this article, a new path planning method called the variable planning size (VPS) for robot in static workspace is presented. In this paper, the graph theory is the basic algorithm of path planning. In addition, the mobile robot using this algorithm could autonomous to decide the planning scope according to the complexity of the surrounding environment. Therefore, in a complex environment, the robot is more efficient to find a local optimal path. As a result, the VPS path planning algorithm can plan out of the local optimal path preferably.
{"title":"A local path planning algorithm under the variable planning size","authors":"Teng Wan, Ce Li, Yachao Zhang","doi":"10.1109/CISP-BMEI.2016.7852815","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852815","url":null,"abstract":"The research in the field of the localization and navigation of mobile robot is becoming more and more significant. Among them, the local real-time path planning for robot autonomous navigation in complex environment is particularly important. However, the current local path planning algorithms are all planning the local path in the same plan-scope. Sometimes, this situation leads to a waste of time and computing resources. Therefore, in this article, a new path planning method called the variable planning size (VPS) for robot in static workspace is presented. In this paper, the graph theory is the basic algorithm of path planning. In addition, the mobile robot using this algorithm could autonomous to decide the planning scope according to the complexity of the surrounding environment. Therefore, in a complex environment, the robot is more efficient to find a local optimal path. As a result, the VPS path planning algorithm can plan out of the local optimal path preferably.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778680","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852872
Ce Li, Hao Wei, Tian Lan
For the 3D perception problem of mobile robots in unknown indoor environments, a practical approach to building 3D maps using a low-cost Kinect sensor is proposed. Successive frames of RGB-D information are captured during the robots movements. First, SIFT(Scale-invariant Feature Transform)detector is applied to color images for extracting and matching stable feature points. Then, combined with the GTM(Graph Transformation Matching) algorithm to eliminate the possible existence of false matching points and complete the initial registration, so as to estimate the rough relative transfer between the image frames. Finally, using the ICP(Iterative Closest Point) algorithm, the robot's motion parameters are continuously updated to update the robot posture, and based on this, the 3D map of the indoor environment is created based on the combination of depth information. Experimental results validate the feasibility and effectiveness of the approach
{"title":"Research and implementation of 3D SLAM algorithm based on Kinect depth sensor","authors":"Ce Li, Hao Wei, Tian Lan","doi":"10.1109/CISP-BMEI.2016.7852872","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852872","url":null,"abstract":"For the 3D perception problem of mobile robots in unknown indoor environments, a practical approach to building 3D maps using a low-cost Kinect sensor is proposed. Successive frames of RGB-D information are captured during the robots movements. First, SIFT(Scale-invariant Feature Transform)detector is applied to color images for extracting and matching stable feature points. Then, combined with the GTM(Graph Transformation Matching) algorithm to eliminate the possible existence of false matching points and complete the initial registration, so as to estimate the rough relative transfer between the image frames. Finally, using the ICP(Iterative Closest Point) algorithm, the robot's motion parameters are continuously updated to update the robot posture, and based on this, the 3D map of the indoor environment is created based on the combination of depth information. Experimental results validate the feasibility and effectiveness of the approach","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115340128","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852737
Qi Huang, Shaoqiang Chen
In the past thirty years, with the tremendous development of computer graphics, various techniques have been proposed to solve problem of medical images, like CT and MRI data, visualization[1][2]. These techniques include iso-surface rendering [3][4], volume ray casting[5][6], texture-based volume rendering and so on. Sometimes it is necessary to perform medical grinding work to cure a person in operation like otitis. The corresponding parts around ears in application cannot display on the screen like it disappeared in real world. This paper will present a basic surgical navigation framework and provide a method to display the medical data volume dynamic in surgical navigation system. The visualization technique is direct volume rendering that do not extract any polygon meshes from volumetric data and can easily implement on GPU by OpenGL shader program. It also employs a mask to control whether this part of input model should display on the screen. The mask is as the same dimensions as the input volumetric data. To eliminate the jagged edges and achieve iterative rate, a 3D Gaussian filter loaded in shader program executed by GPU (Graphics Processing Unit).
{"title":"High-quality intraoperative volume rendering in surgical navigation","authors":"Qi Huang, Shaoqiang Chen","doi":"10.1109/CISP-BMEI.2016.7852737","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852737","url":null,"abstract":"In the past thirty years, with the tremendous development of computer graphics, various techniques have been proposed to solve problem of medical images, like CT and MRI data, visualization[1][2]. These techniques include iso-surface rendering [3][4], volume ray casting[5][6], texture-based volume rendering and so on. Sometimes it is necessary to perform medical grinding work to cure a person in operation like otitis. The corresponding parts around ears in application cannot display on the screen like it disappeared in real world. This paper will present a basic surgical navigation framework and provide a method to display the medical data volume dynamic in surgical navigation system. The visualization technique is direct volume rendering that do not extract any polygon meshes from volumetric data and can easily implement on GPU by OpenGL shader program. It also employs a mask to control whether this part of input model should display on the screen. The mask is as the same dimensions as the input volumetric data. To eliminate the jagged edges and achieve iterative rate, a 3D Gaussian filter loaded in shader program executed by GPU (Graphics Processing Unit).","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116171534","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7852828
Qun Chen, Yang Song, F. Hu, Chaoshi Cai
Power amplifiers (PAs) are important components in OFDM systems which can efficiently uses the spectrum but very sensitive to constellation error. The nonlinearity of PAs causes in-band distortion and spectral regrowth, thereby increasing the constellation error. To overcome the PA's nonlinearity, Digital predistortion is a highly cost-effective way to linearize PAs. When modeling of digital predistorter, there are many coefficients that determining the predistorter's characteristics which are affecting the effect of predistortion. Different values of the coefficients lead to a large gap in the effect of predistortion, thus constructing the predistorter with appropriate coefficients is complex and necessary. Many research when estimating the coefficients by minimizing mean square error (MMSE) of the signal amplified by the amplifier. But the MSE can't indicate the constellation error rate, furthermore, OFDM rely on the constellation map to transfer message, so that the coefficients corresponding to MMSE method may not the most appropriate. In this paper we propose a novel method to estimate the predistorter coefficients by maximizing the Modulation Error Ration (MER) which can directly indicate the degree of constellation error, and we introduce the quasi-Newton method which can help us find the optimum coefficient to maximize MER. The proposed predistorter can better reduce the constellation error.
{"title":"A novel method for adjusting Digital predistortion with Modulation Error Ratio in OFDM System","authors":"Qun Chen, Yang Song, F. Hu, Chaoshi Cai","doi":"10.1109/CISP-BMEI.2016.7852828","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7852828","url":null,"abstract":"Power amplifiers (PAs) are important components in OFDM systems which can efficiently uses the spectrum but very sensitive to constellation error. The nonlinearity of PAs causes in-band distortion and spectral regrowth, thereby increasing the constellation error. To overcome the PA's nonlinearity, Digital predistortion is a highly cost-effective way to linearize PAs. When modeling of digital predistorter, there are many coefficients that determining the predistorter's characteristics which are affecting the effect of predistortion. Different values of the coefficients lead to a large gap in the effect of predistortion, thus constructing the predistorter with appropriate coefficients is complex and necessary. Many research when estimating the coefficients by minimizing mean square error (MMSE) of the signal amplified by the amplifier. But the MSE can't indicate the constellation error rate, furthermore, OFDM rely on the constellation map to transfer message, so that the coefficients corresponding to MMSE method may not the most appropriate. In this paper we propose a novel method to estimate the predistorter coefficients by maximizing the Modulation Error Ration (MER) which can directly indicate the degree of constellation error, and we introduce the quasi-Newton method which can help us find the optimum coefficient to maximize MER. The proposed predistorter can better reduce the constellation error.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116427558","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 : 2016-10-01DOI: 10.1109/CISP-BMEI.2016.7853031
Qiao Sun, Lan-mei Fu, Bu-qiao Deng, Jiasong Sun
Distributed system have shown its good robustness, extensibility and effectiveness in the processing, storage and transmission of large data. Now with the expansion of the amount of data and application, it has become a challenging task to ensure its transaction in a distributed and heterogeneous environment. The sub transactions of a distributed transaction not only need to be coordinated with the local other transactions, but also with other sub transactions that generated in the global manager. Based on the discussion of distributed transaction processing model and its transaction commit protocol, the failure reasons with the model analysis of general distributed transaction processing in the practical application in our information database system are given, based on the interface in a relational database management system and super text pre-treatment language of distributed transaction processing implementation method. The research results show that this distributed transaction processing method is reliable, and can simplify the implementation of global program.
{"title":"An efficient transaction processing method on the distributed database","authors":"Qiao Sun, Lan-mei Fu, Bu-qiao Deng, Jiasong Sun","doi":"10.1109/CISP-BMEI.2016.7853031","DOIUrl":"https://doi.org/10.1109/CISP-BMEI.2016.7853031","url":null,"abstract":"Distributed system have shown its good robustness, extensibility and effectiveness in the processing, storage and transmission of large data. Now with the expansion of the amount of data and application, it has become a challenging task to ensure its transaction in a distributed and heterogeneous environment. The sub transactions of a distributed transaction not only need to be coordinated with the local other transactions, but also with other sub transactions that generated in the global manager. Based on the discussion of distributed transaction processing model and its transaction commit protocol, the failure reasons with the model analysis of general distributed transaction processing in the practical application in our information database system are given, based on the interface in a relational database management system and super text pre-treatment language of distributed transaction processing implementation method. The research results show that this distributed transaction processing method is reliable, and can simplify the implementation of global program.","PeriodicalId":275095,"journal":{"name":"2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122502998","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
扫码关注我们
求助内容：
应助结果提醒方式：