Pub Date : 2014-11-05DOI: 10.1109/SMARTCOMP.2014.7043873
Marco E. Pérez Hernández, S. Reiff-Marganiec
The Internet Of Things has emerged, providing an umbrella for the increasing number of heterogeneous Smart Objects that are becoming part of our daily activities. In this scenario, classification approaches are useful to understand differences and identify opportunities of generalization and common solutions, especially when different disciplines are coming together and bringing their individual terms and concepts. We propose a novel model for classifying Smart Objects using capabilities. This five-level model, inspired in the Capability Maturity Models, aims to be simple and inclusive, separating objects with basic capabilities from those with complex ones. In addition, examples of objects for each level are provided as validation of the proposal. The model is useful to identify requirements that Smart Objects have to cover externally as they cannot themselves support them and thus it allows for clear understanding of the external support system (or Middleware) into which the smart object is embedded.
{"title":"Classifying Smart Objects using capabilities","authors":"Marco E. Pérez Hernández, S. Reiff-Marganiec","doi":"10.1109/SMARTCOMP.2014.7043873","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043873","url":null,"abstract":"The Internet Of Things has emerged, providing an umbrella for the increasing number of heterogeneous Smart Objects that are becoming part of our daily activities. In this scenario, classification approaches are useful to understand differences and identify opportunities of generalization and common solutions, especially when different disciplines are coming together and bringing their individual terms and concepts. We propose a novel model for classifying Smart Objects using capabilities. This five-level model, inspired in the Capability Maturity Models, aims to be simple and inclusive, separating objects with basic capabilities from those with complex ones. In addition, examples of objects for each level are provided as validation of the proposal. The model is useful to identify requirements that Smart Objects have to cover externally as they cannot themselves support them and thus it allows for clear understanding of the external support system (or Middleware) into which the smart object is embedded.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"51 3S 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130909144","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043847
Huaqiang Xu, Lei Ju, Chongxian Guo, Zhiping Jia
Gateway discovery algorithm is a fundamental protocol for interconnecting mobile ad hoc network (MANET) with the Internet. In most existing schemes, each gateway node broadcasts gateway advertisements to announce its presence. The decision of when to emit advertisements can influence the performance of the network. Traditional gateway discovery schemes adopt the method of periodically emitting advertisements with a time interval. However, this method does not fulfill the actual needs of the source nodes. This paper proposes a novel adaptive scheme for gateway discovery, in which the gateway broadcasts advertisements only on-demand instead of periodic emission. In order to obtain the network's actual demands for gateway advertisement, routes to the gateway are monitored. In particular, if any route is predicted to be broken, the source node requires fresh gateway advertisements to update routes, and then the gateway will be triggered to broadcast to fulfill such demands. We study the performance of on-demand gateway discovery scheme by a comparison approach. The results show that the proposed adaptive gateway discovery scheme greatly outperforms the conventional solutions: it is capable of achieving higher packet delivery ratio and lower end-to-end delay, while minimizing the routing overhead.
{"title":"On-demand gateway broadcast scheme for connecting mobile ad hoc networks to the Internet","authors":"Huaqiang Xu, Lei Ju, Chongxian Guo, Zhiping Jia","doi":"10.1109/SMARTCOMP.2014.7043847","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043847","url":null,"abstract":"Gateway discovery algorithm is a fundamental protocol for interconnecting mobile ad hoc network (MANET) with the Internet. In most existing schemes, each gateway node broadcasts gateway advertisements to announce its presence. The decision of when to emit advertisements can influence the performance of the network. Traditional gateway discovery schemes adopt the method of periodically emitting advertisements with a time interval. However, this method does not fulfill the actual needs of the source nodes. This paper proposes a novel adaptive scheme for gateway discovery, in which the gateway broadcasts advertisements only on-demand instead of periodic emission. In order to obtain the network's actual demands for gateway advertisement, routes to the gateway are monitored. In particular, if any route is predicted to be broken, the source node requires fresh gateway advertisements to update routes, and then the gateway will be triggered to broadcast to fulfill such demands. We study the performance of on-demand gateway discovery scheme by a comparison approach. The results show that the proposed adaptive gateway discovery scheme greatly outperforms the conventional solutions: it is capable of achieving higher packet delivery ratio and lower end-to-end delay, while minimizing the routing overhead.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121947561","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043844
Zhen Hong, Wei Cai, Xiaofei Wang, Victor C. M. Leung
Cloud gaming systems host the game in the cloud, and stream players' gaming videos to the terminals in the form of encode video frames. To address the high bandwidth issue of real-time gaming video transmission, a cloudlet-assisted multiplayer cloud gaming system was proposed to encourage cooperative video sharing via a secondary ad-hoc network, on the purpose of exploiting the similarities of video frames among multiple players in a same game. However, the video cooperative sharing among players also introduces fairness problems. In this paper, we complete the ad hoc cloudlet-assisted cloud gaming system by further considering the mobility of terminal devices and the diversity of network quality for distinct players. With mathematical formulation, we study the players' behavior in cooperative sharing patterns and propose a reputation-based multiplayer fairness scheme in terms of frame encoding. Experimental results illustrate the impact of mobility on the system performance and evaluate that the proposed solution provides better fairness gaming ecosystem compared to the existing platform.
{"title":"Reputation-based multiplayer fairness for ad-hoc cloudlet-assisted cloud gaming system","authors":"Zhen Hong, Wei Cai, Xiaofei Wang, Victor C. M. Leung","doi":"10.1109/SMARTCOMP.2014.7043844","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043844","url":null,"abstract":"Cloud gaming systems host the game in the cloud, and stream players' gaming videos to the terminals in the form of encode video frames. To address the high bandwidth issue of real-time gaming video transmission, a cloudlet-assisted multiplayer cloud gaming system was proposed to encourage cooperative video sharing via a secondary ad-hoc network, on the purpose of exploiting the similarities of video frames among multiple players in a same game. However, the video cooperative sharing among players also introduces fairness problems. In this paper, we complete the ad hoc cloudlet-assisted cloud gaming system by further considering the mobility of terminal devices and the diversity of network quality for distinct players. With mathematical formulation, we study the players' behavior in cooperative sharing patterns and propose a reputation-based multiplayer fairness scheme in terms of frame encoding. Experimental results illustrate the impact of mobility on the system performance and evaluate that the proposed solution provides better fairness gaming ecosystem compared to the existing platform.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131936","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043842
Q. Tong, Bo Yuan, Xiu Li
This paper presents a comprehensive review of Cyberinfrastructure (CI), an emerging collaborative research environment, including its representative applications in four science communities around the world. An in-depth analysis is also conducted to reveal the key functions and desired features that can be expected from modern CI systems.
{"title":"Cyberinfrastructure: Applications and challenges","authors":"Q. Tong, Bo Yuan, Xiu Li","doi":"10.1109/SMARTCOMP.2014.7043842","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043842","url":null,"abstract":"This paper presents a comprehensive review of Cyberinfrastructure (CI), an emerging collaborative research environment, including its representative applications in four science communities around the world. An in-depth analysis is also conducted to reveal the key functions and desired features that can be expected from modern CI systems.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121221025","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043832
Chi-Yi Lin, Shih-Wen Huang, Hui-Huang Hsu
Visually impaired people have difficulty in walking freely because of the obstacles or the stairways along their walking paths, which can lead to accidental falls. Many researchers have devoted to promoting safe walking for visually impaired people by using smartphones and computer vision. In this research we propose an alternative approach to achieve the same goal - we take advantage of the power of crowdsourcing with machine learning. Specifically, by using smartphones carried by a vast amount of visually normal people, we can collect the tri-axial accelerometer data along with the corresponding GPS coordinates in large geographic areas. Then, machine learning techniques are used to analyze the data, turning them into a special topographic map in which the regions of outdoor stairways are marked. With the map installed in the smartphones carried by the visually impaired people, the Android App we developed can monitor their current outdoor locations and then enable an acoustic alert whey they are getting close to the stairways.
{"title":"A crowdsourcing approach to promote safe walking for visually impaired people","authors":"Chi-Yi Lin, Shih-Wen Huang, Hui-Huang Hsu","doi":"10.1109/SMARTCOMP.2014.7043832","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043832","url":null,"abstract":"Visually impaired people have difficulty in walking freely because of the obstacles or the stairways along their walking paths, which can lead to accidental falls. Many researchers have devoted to promoting safe walking for visually impaired people by using smartphones and computer vision. In this research we propose an alternative approach to achieve the same goal - we take advantage of the power of crowdsourcing with machine learning. Specifically, by using smartphones carried by a vast amount of visually normal people, we can collect the tri-axial accelerometer data along with the corresponding GPS coordinates in large geographic areas. Then, machine learning techniques are used to analyze the data, turning them into a special topographic map in which the regions of outdoor stairways are marked. With the map installed in the smartphones carried by the visually impaired people, the Android App we developed can monitor their current outdoor locations and then enable an acoustic alert whey they are getting close to the stairways.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960236","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043834
Hua Ma, Zhi-gang Hu
Owing to the deficiency of usage experiences and the information overload of QoE (quality of experience) evaluations from consumers, how to discover the trustworthy cloud services is a challenge for potential users. This paper proposed a cloud service recommendation approach based on trust measurement using ternary interval numbers for potential user. The concept of ternary interval number is introduced. The user feature maybe affecting the QoE evaluations are analyzed and the client-side feature similarity between consumers and potential user is calculated. The transform mechanism from trust evaluations to ternary interval number is presented by employing the K-means clustering algorithm. On the basis of multi-attributes trust aggregation based On FAHP (fuzzy analytic hierarchy process) method, a new possibility degree formula is designed for ranking ternary interval numbers and selecting trustworthy service. Finally, the experiments and results show that this approach is effective to improve the accuracy of the trustworthy service recommendation.
{"title":"Cloud service recommendation based on trust measurement using ternary interval numbers","authors":"Hua Ma, Zhi-gang Hu","doi":"10.1109/SMARTCOMP.2014.7043834","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043834","url":null,"abstract":"Owing to the deficiency of usage experiences and the information overload of QoE (quality of experience) evaluations from consumers, how to discover the trustworthy cloud services is a challenge for potential users. This paper proposed a cloud service recommendation approach based on trust measurement using ternary interval numbers for potential user. The concept of ternary interval number is introduced. The user feature maybe affecting the QoE evaluations are analyzed and the client-side feature similarity between consumers and potential user is calculated. The transform mechanism from trust evaluations to ternary interval number is presented by employing the K-means clustering algorithm. On the basis of multi-attributes trust aggregation based On FAHP (fuzzy analytic hierarchy process) method, a new possibility degree formula is designed for ranking ternary interval numbers and selecting trustworthy service. Finally, the experiments and results show that this approach is effective to improve the accuracy of the trustworthy service recommendation.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132234090","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043869
Yi-hua Zhu, Ji Xu, Ertao Li, Lin Xu
In Wireless Sensor Network (WSN), nodes are usually powered by battery and the wireless links of the nodes suffer from packet loss. It is extremely significant to develop an energy-efficient reliable data gathering scheme for WSN applications. In this paper, the Enhanced Reed-Solomon (E-RS) code, together with the intra-segment coding and the inter-segment coding, are designed. The E-RS code based data gathering scheme called the E-RS scheme is presented that adopts the intra-segment coding or the inter-segment coding. The Overall Energy Consumption (OEC) of the E-RS scheme is derived and minimized in the Optimization Problem (OP) with the constraint of data gathering ratio. The OP is able to find the optimal number of segments each carrying original information symbols, the maximum number of retransmissions in IEEE 802.15.4 Medium Access Control (MAC) layer, and the redundant degree of the E-RS code, so that the E-RS scheme achieves the minimum energy consumption while keeping data gathering ratio over a preset threshold.
{"title":"Energy-efficient reliable data gathering scheme based on Enhanced Reed-Solomon code for wireless sensor networks","authors":"Yi-hua Zhu, Ji Xu, Ertao Li, Lin Xu","doi":"10.1109/SMARTCOMP.2014.7043869","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043869","url":null,"abstract":"In Wireless Sensor Network (WSN), nodes are usually powered by battery and the wireless links of the nodes suffer from packet loss. It is extremely significant to develop an energy-efficient reliable data gathering scheme for WSN applications. In this paper, the Enhanced Reed-Solomon (E-RS) code, together with the intra-segment coding and the inter-segment coding, are designed. The E-RS code based data gathering scheme called the E-RS scheme is presented that adopts the intra-segment coding or the inter-segment coding. The Overall Energy Consumption (OEC) of the E-RS scheme is derived and minimized in the Optimization Problem (OP) with the constraint of data gathering ratio. The OP is able to find the optimal number of segments each carrying original information symbols, the maximum number of retransmissions in IEEE 802.15.4 Medium Access Control (MAC) layer, and the redundant degree of the E-RS code, so that the E-RS scheme achieves the minimum energy consumption while keeping data gathering ratio over a preset threshold.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130388900","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043874
M. Kim, Soo Dong Kim
Context-aware computing is to provide situation-specific services, the situation is inferred from the available contexts, and the contexts are acquired from various sources such as sensors, environments, and SNS contents. However, building inference systems is costly due to the overhead of maintaining contexts repositories, transform contexts into machine-readable knowledge models, running suitable inference algorithms and learning from the inference results for further applications of inference tasks. In this paper, we present a cloud form of a situation inference platform, INFerence-as-a-Service (INFaaS), which provides a core set of common functionality required to develop various context-aware apps. A key challenge in developing such platforms is to manage variability on inference algorithms and inference requirements by applications. INFaaS provides novel approaches to handle the variability by constructing generic models among various inference methods, providing flexible adaptation mechanisms, and defining generic interfaces for invoking various algorithms. The key benefit of INFaaS is a significant reduction of efforts to develop contexts repositories and context-aware applications.
{"title":"Inference-as-a-service: A situation inference service for context-aware computing","authors":"M. Kim, Soo Dong Kim","doi":"10.1109/SMARTCOMP.2014.7043874","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043874","url":null,"abstract":"Context-aware computing is to provide situation-specific services, the situation is inferred from the available contexts, and the contexts are acquired from various sources such as sensors, environments, and SNS contents. However, building inference systems is costly due to the overhead of maintaining contexts repositories, transform contexts into machine-readable knowledge models, running suitable inference algorithms and learning from the inference results for further applications of inference tasks. In this paper, we present a cloud form of a situation inference platform, INFerence-as-a-Service (INFaaS), which provides a core set of common functionality required to develop various context-aware apps. A key challenge in developing such platforms is to manage variability on inference algorithms and inference requirements by applications. INFaaS provides novel approaches to handle the variability by constructing generic models among various inference methods, providing flexible adaptation mechanisms, and defining generic interfaces for invoking various algorithms. The key benefit of INFaaS is a significant reduction of efforts to develop contexts repositories and context-aware applications.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128674193","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043862
Xiaowen Feng, Hai Jin, Ran Zheng, Lei Zhu
With the rapid growth of data, near-duplicate documents bearing high similarity are abundant. Elimination of near-duplicates can reduce storage cost and improve the quality of search indexes in data mining. A challenging problem is to find near-duplicate records in large-scale collections efficiently. There have already been several efforts on implementing near-duplicate detection on different architectures. In this paper, a new implementation, using a special hash function namely simhash, is proposed to identify near-duplicate documents on CUDA enabled devices. Two mechanisms are designed to achieve higher performance, including swapping and dynamic allocating. Experimental results show that our parallel implementation outperforms the serial CPU version, achieving up to 18 times.
{"title":"Near-duplicate detection using GPU-based simhash scheme","authors":"Xiaowen Feng, Hai Jin, Ran Zheng, Lei Zhu","doi":"10.1109/SMARTCOMP.2014.7043862","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043862","url":null,"abstract":"With the rapid growth of data, near-duplicate documents bearing high similarity are abundant. Elimination of near-duplicates can reduce storage cost and improve the quality of search indexes in data mining. A challenging problem is to find near-duplicate records in large-scale collections efficiently. There have already been several efforts on implementing near-duplicate detection on different architectures. In this paper, a new implementation, using a special hash function namely simhash, is proposed to identify near-duplicate documents on CUDA enabled devices. Two mechanisms are designed to achieve higher performance, including swapping and dynamic allocating. Experimental results show that our parallel implementation outperforms the serial CPU version, achieving up to 18 times.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125523721","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 : 2014-11-01DOI: 10.1109/SMARTCOMP.2014.7043839
Zizhu Fan, Ming Ni, Qi Zhu, Yuwu Lu
Sparse representation for classification (SRC) has attracted much attention in recent years. It usually performs well under the following assumptions. The first assumption is that each class has sufficient training samples. In other words, SRC is not good at dealing with the undersampled problem, i.e., each class has few training samples, even single sample. The second one is that the sample vectors belonging to different classes should not distribute on the same vector direction. However, the above two assumptions are not always satisfied in real-world problems. In this paper, we propose a novel SRC based algorithm, i.e., kernel sparse representation based classifier for undersampled problem (KSRC-UP) to perform classification. It does not need the above assumptions in principle. KSRC-UP can deal well with the small scale and high dimensional real world data sets. Experiments on the popular face databases show that our KSRC-UP method can perform better than other SRC methods.
{"title":"Kernel sparse representation based classification for undersampled problem","authors":"Zizhu Fan, Ming Ni, Qi Zhu, Yuwu Lu","doi":"10.1109/SMARTCOMP.2014.7043839","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2014.7043839","url":null,"abstract":"Sparse representation for classification (SRC) has attracted much attention in recent years. It usually performs well under the following assumptions. The first assumption is that each class has sufficient training samples. In other words, SRC is not good at dealing with the undersampled problem, i.e., each class has few training samples, even single sample. The second one is that the sample vectors belonging to different classes should not distribute on the same vector direction. However, the above two assumptions are not always satisfied in real-world problems. In this paper, we propose a novel SRC based algorithm, i.e., kernel sparse representation based classifier for undersampled problem (KSRC-UP) to perform classification. It does not need the above assumptions in principle. KSRC-UP can deal well with the small scale and high dimensional real world data sets. Experiments on the popular face databases show that our KSRC-UP method can perform better than other SRC methods.","PeriodicalId":169858,"journal":{"name":"2014 International Conference on Smart Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546849","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
扫码关注我们
求助内容：
应助结果提醒方式：