{"title":"Robust visual tracking with occlusion detection using compressive sensing","authors":"Mehdi Khodadadi, A. Raie","doi":"10.1109/ICCKE.2014.6993365","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993365","url":null,"abstract":"In this paper, tracking problem is considered as a sparse approximation of target by templates created during video process. In addition, some trivial templates are used to avoid the effects of noise and illumination changes. Each candidate is sparsely represented by the template set. This goal is achieved by solving an l1- regularized least-square equation. To find tracking result, a candidate with the minimum reconstruction error was adopted. Then, tracking was continued in particle filter framework. Two ideas were used to improve the algorithm performance. Firstly, the dictionary set was adaptively updated according to appearance changes. Secondly, using the area around the target, occlusion was diagnosed and subsequently the template set was updated. This technique prevented the occluded part of the target getting into the template set. The proposed approach shows a better performance than other previous tracker against full occlusion problem.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114997306","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}
{"title":"A novel framework, based on fuzzy ensemble of classifiers for intrusion detection systems","authors":"Saman Masarat, H. Taheri, Saeed Sharifian","doi":"10.1109/ICCKE.2014.6993345","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993345","url":null,"abstract":"By developing technology and speed of communications, providing security of networks becomes a significant topic in network interactions. Intrusion Detection Systems (IDS) play important role in providing general security in the networks. The major challenges with IDSs are detection rate and cost of misclassified samples. In this paper we introduce a novel multistep framework based on machine learning techniques to create an efficient classifier. In first step, the feature selection method will implement based on gain ratio of features. Using this method can improve the performance of classifiers which are created based on this features. In classifiers combination step, we will present a novel fuzzy ensemble method. So, classifiers with more performance and lower cost have more effect to create the final classifier.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130654319","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}
{"title":"A novel Artificial Bee Colony algorithm for global optimization","authors":"Donya Yazdani, M. Meybodi","doi":"10.1109/ICCKE.2014.6993393","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993393","url":null,"abstract":"Artificial Bee Colony (ABC) algorithm is a swarm-based optimization algorithm with advantages like simplicity and proper exploration ability. However, it suffers from improper exploitation in solving complicated problems. In order to overcome this disadvantage, modifications on all three bee types are proposed. By introducing a new procedure for the scout bees and modifying the search patterns of both employed and onlooker bees, the capabilities of all three bee types are utilized properly. These modifications lead to better exploitation and exploration abilities. Experiments are conducted on 12 different benchmark functions including standard, shifted, rotated, and shifted-rotated multimodal problems. The results confirm the superiority of the proposed algorithm compared with some other well-known algorithms in this field.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133868583","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}
Masoumeh Rezaei Jam, L. M. Khanli, M. S. Javan, M. Akbari
{"title":"A survey on security of Hadoop","authors":"Masoumeh Rezaei Jam, L. M. Khanli, M. S. Javan, M. Akbari","doi":"10.1109/ICCKE.2014.6993455","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993455","url":null,"abstract":"Trusted computing and security of services is one of the most challenging topics today and is the cloud computing's core technology that is currently the focus of international IT universe. Hadoop, as an open-source cloud computing and big data framework, is increasingly used in the business world, while the weakness of security mechanism now becomes one of the main problems obstructing its development. This paper first describes the hadoop project and its present security mechanisms, then analyzes the security problems and risks of it, pondering some methods to enhance its trust and security and finally based on previous descriptions, concludes Hadoop's security challenges.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133315216","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}
{"title":"Visual object tracking using Kalman filter, mean shift algorithm and spatiotemporal oriented energy features","authors":"Amir Ghahremani, A. Mousavinia","doi":"10.1109/ICCKE.2014.6993433","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993433","url":null,"abstract":"Many multimedia applications need to track moving objects. Consequently, designing a robust tracking system is a vital requirement for them. This paper proposes a new method for visual object tracking, which uses the mean shift tracking algorithm to derive the most similar target candidate to the target model. Bhattacharyya coefficient is employed to determine the similarities. Target's structure is represented by multiscale oriented energy feature set, which presents extra robustness by including dynamic information of the pixels. Likewise, the Kalman filtering framework is employed to predict the location of the moving objects. Experimental results demonstrate the proposed algorithm's superior performance, chiefly when encountering with the full occlusion situation.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133647080","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}
{"title":"Strategic agents for multi-resource negotiation using learning automata and case-based reasoning","authors":"Monireh Haghighatjoo, B. Masoumi, M. R. Meybodi","doi":"10.1109/ICCKE.2014.6993342","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993342","url":null,"abstract":"In electronic commerce markets, agents often should acquire multiple resources to fulfill a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. During recent years, many strategies have been used for negotiation; but, their performance and success are not the same in different conditions. This paper presents a method base on case-based reasoning method and learning automata for agent negotiations. In the proposed method, case-based reasoning method and learning automata are used for selecting an efficient seller and successful strategy, respectively. Results of the experiments indicated that the proposed method has caused an improvement in some performance measures such as success rate and expected utility.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114214185","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}
{"title":"2-D DOA estimation in wireless location system via sparse representation","authors":"Zavareh Bozorgasl, M. Dehghani","doi":"10.1109/ICCKE.2014.6993435","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993435","url":null,"abstract":"In this paper 2D direction of arrivals(DOAs) of signals in wireless location estimated based on sparse representation of signals. The array sensor is uniform circular array, and azimuth and elevation of sources are estimated in beamspace domain. We use the beamspace transformation by employing phase mode excitation in circular arrays. This beamspace process transform complex manifold to real one, so that our computations complexity is decreased by a factor of at least four, also with this transformation our approach simultaneously benefits beamspace domain advantages such as robustness to array imperfections. Finally our approach will compared with conventional methods of DOAs estimation. Simulation results validate better performance of our approach, especially in low SNRs.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053022","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}
{"title":"A rendezvous-based data collection algorithm with mobile sink in wireless sensor networks","authors":"Leila Bagheri, M. Fooladi","doi":"10.1109/ICCKE.2014.6993373","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993373","url":null,"abstract":"The main objective of wireless sensor networks is collecting data from ambient and transmitting achieved data to sink node. Limited energy resource for sensor node has posed so many challenges to these networks. The main constraint on wireless sensor networks is energy consumption which directly affects network lifetime. Lots of methods are proposed to improve these two parameters among which mobile sink method has shown considerable effects comparing to other presented methods. Indeed, using such method, several challenges of static sink methods are addressed such as funneling effect (non uniform energy consumption in the nodes located in the proximity of the sink node) and hot spot. As a result energy consumption decreases significantly which in turn prolongs network lifetime. In this paper, some nodes called rendezvous nodes are utilized to collect data. Source nodes transmit their sensed data to rendezvous nodes and sink node use traveling salesman algorithm and meet only these points in order to collect data. The use of Rendezvous Points allow the sink to collect amount of data at energy cost of multi-hop data communication at a time in the absence of traveling a long distance and thus extremely reduces data collection delay. If the virtual infrastructure of rendezvous-based protocol is properly designed, one can achieve scalability and energy efficiency. Simulation results, which are obtained in ns-2 environment, confirm the effectiveness of our method from energy saving and prolonged network lifetime in comparison with other methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133377300","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}
Mohsen Shakeri, Nasim Mehri, Hassan Khotanlou, Y. Masoumi
{"title":"Image contrast enhancement using optimum sub-histograms modification and preserving brightness levels mean without losing image specification","authors":"Mohsen Shakeri, Nasim Mehri, Hassan Khotanlou, Y. Masoumi","doi":"10.1109/ICCKE.2014.6993370","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993370","url":null,"abstract":"Histogram modification is one of the well- known and most effective techniques in increasing contrast and image quality enhancement. But, in some cases, traditional histogram modification would increase image contrast too much and cause image details to be lost. In this article, a new histogram modification method has been proposed that contains a combination of histogram division part and brightness level transferring part. In histogram division part, image histogram will be divide into smaller optimum subunits according to mean value and standard deviation. This division is controlled automatically by using PSNR criterion. In the second part, with applying local cumulative probability distribution function for each of subunits of histogram, we will reach the enhanced image. Experimental results shows that, this method would not only keep visual details of histogram, but also enhance image contrast.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542750","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}
{"title":"Cipher-text only attack on hopping window time domain scramblers","authors":"Hamzeh Ghasemzadeh, H. Mehrara, Mehdi Tajik Khas","doi":"10.1109/ICCKE.2014.6993428","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993428","url":null,"abstract":"Wireless channels are highly prone to eavesdropping. To mitigate this problem encryption systems are used. Analog scrambling systems achieve confidentiality through modification of analog signals. Unfortunately, current literatures lack a thorough security analysis of these systems. In this paper security of hopping window time domain scrambler is investigated. It is shown that cipher-text of these systems is highly redundant. Based on this observation, a cryptanalysis system is proposed. Firstly, audio signal is mapped into a set of puzzles. Later, scrambling keys are found by solving these pictorial puzzles. Proposed method is compared with FWLSD which, to our best knowledge, is the only existing cryptanalysis method for these systems. Objective and subjective tests show that voices descrambled by the proposed method achieve intelligibility scores of 0.739 and 0.82 respectively. These scores are 0.37 and 0.25 higher than scores achieved by FWLSD method.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487534","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}