{"title":"SIFT & MRLBP Descriptors Based Age Invariant Face Recognition","authors":"K. Hina, K. Jondhale","doi":"10.1145/2983402.2983425","DOIUrl":"https://doi.org/10.1145/2983402.2983425","url":null,"abstract":"Automatic face recognition is an important problem, but age invariant face recognition is a major challenge. The face appearance of a person is subject to significant change due to age progression over time. In this paper, the discriminative model is proposed to match face images of a subject at different ages. To develop a discriminative model for age invariant face recognition based on an appropriate feature representation and classification. Where Local Feature Description is used for feature representation and classification is done using MFDA. In this approach, each face is represented by designing a local feature description scheme. It consists of Scale Invariant Feature Transform (SIFT) and Multi-scale Robust Local Binary Patterns (MRLBP) which serve as local descriptors. In MFDA, multiple LDA-based classifiers are constructed and these classifiers are combined to generate a robust decision by using a fusion rule. The superiority of proposed method is examined and demonstrated through FGNET database. For the discriminative model with SIFT and MRLBP, the recognition accuracy is 92.38%.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130773623","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":"Query Adaptive Search System Based On Hamming Distance for Image Retrieval","authors":"Sonal Vijay Kesare, Bela Joglekar","doi":"10.1145/2983402.2983443","DOIUrl":"https://doi.org/10.1145/2983402.2983443","url":null,"abstract":"The most recent active topic of research for image retrieval is scalable image search based on visual similarity. The main motivation for image retrieval is based on image ranking, given by multiple retrieval methods without affecting their scalability. This paper describes ranking and retrieval as graphs of candidate images and proposes a graph-based query specific rank fusion approach, in which graphs are created by using nearest neighbour node and multiple graphs are merged together and re-ranked them by conducting link analysis on the fused graph. Then rank fusion maintains the efficiency and scalability of image retrieval by applying the rank aggregation method. The proposed system will add the query adaptive image to the search system. In this system, hamming distance is calculated and query adaptive weights are computed between query image and database image. Based on these weights, images are ranked. A finer-grained ranking of search results is produced by query --adaptive approach. The proposed will improve the efficiency and scalability of image retrieval.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134424019","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":"Extraction of Roads from Remotely Sensed Images using a Multi-Angled Template Matching Technique","authors":"S. Pudaruth","doi":"10.1145/2983402.2983412","DOIUrl":"https://doi.org/10.1145/2983402.2983412","url":null,"abstract":"The extraction of road networks from satellite or aerial images has profound applications in the fields of urban planning, setting up of transportation networks, disaster management, cartography and in Geographical Information Systems. In this paper, we have developed a multi-shaped and multi-angled template matching algorithm in order to extract the road network from medium and high-resolution satellite images. We used a quadruple orthogonal line filter to extract lines from four different directions. Small isolated points and edges are removed using appropriately designed clearing filters. Gaps in the road network are bridged using our edge linking algorithm, which is based primarily on the spectral property of the original image pixels. The four images are cleared again using directional clearing filters to remove broken edges that cannot be linked to the road network. Finally, the output from these four separate images are fused into a single image in order to get the final output image which represents the road network. The results obtained demonstrate the practicability of our proposed method in rural and semi-urban regions.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122386155","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":"Proposed Hybrid Color Histogram based Obstacle Detection Technique","authors":"Preetjot Kaur, Sumandeep Kaur","doi":"10.1145/2983402.2983426","DOIUrl":"https://doi.org/10.1145/2983402.2983426","url":null,"abstract":"Assistive innovations for visually impaired persons are demonstrating a quick development, letting valuable devices to bolster their everyday exercises, therefore enhancing social consideration. This paper intends to propose a technique for helping blind persons in detecting obstacles in their path. Keypoint matching is an imperative feature of Computer vision obstacle detection. In this paper two techniques QC-LBP (Quantized Color based LBP) & QC-CSLBP (Quantized color based CS-LBP) are proposed based on hybrid features of LBP/CS-LBP, Gabor & HSV color Histograms. Then, these are compared to the already existing techniques such as SIFT, hybrid of SIFT with LBP & Gabor Filter. We grasp CS-LBP into our system due to its computational effectiveness & LBP due to its state-of-art execution in various issues. Gabor filter is coupled into our system due to its invariant nature. Color of each image is extracted using HSV, which on splitting undergoes different quantization levels & respective histograms are obtained. These obtained histograms are compared based on chi-square distance & matching object is obtained. In this paper, we present framework for detecting obstacles in the way of blind persons & also compare its efficiency with various existing algorithms. The output of the proposed system is the shape of obstacle or object in front of the blind user, which is intimated to the user in the form of sound. We show that our framework outperforms the other existing techniques.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115728558","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":"Spoofed Video Detection Using Histogram of Oriented Gradients","authors":"Aparna Maurya, S. Tarar","doi":"10.1145/2983402.2983408","DOIUrl":"https://doi.org/10.1145/2983402.2983408","url":null,"abstract":"Nowadays face recognition system usage is increasing day by day to provide better security mechanism. But with the face recognition system, there are some spoofing methods also attached using which the system can be befooled easily. These attacks are simple and easy as they cost less and the images can also be easily retrieved from social sites; therefore there are high chances of them to be successful. Still there is a scarcity of a productive anti-spoofing algorithm to resolve this issue. The aim of this paper is to present a method which can be used for identification of the spoof. A method is proposed which takes the live video streaming input from the user and perform Liveness detection on the user based on the eye blinking movement and for face feature extraction Histogram of Oriented Gradient (HOG) is used as it proves to be an effective feature descriptor in the face recognition. Two classifiers k Nearest Neighbour (kNN) and Neural Network (NN) are used for the classification purpose. The work is performed on the self created Database and implementation is performed in MATLAB for better understanding, visualization and programming. The performance results of the kNN and NN classifier are compared and finally it is concluded that which classifier outperforms the other one.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126219188","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":"Preserving Confidentiality and Integrity of DICOM Images Using Cryptographic Algorithms","authors":"Harshvardhan Tiwari, S. K., S. G","doi":"10.1145/2983402.2983418","DOIUrl":"https://doi.org/10.1145/2983402.2983418","url":null,"abstract":"Digital watermarking scheme is used to hide information in digital documents, images and multimedia files such as video or audio. It embeds a bit-pattern and influences the digital data by modifying its content. Telemedicine is an area where medicine and I&T (information and telecommunications) technology meets and its having the greatest impact on health care delivery. This paper proposed a watermarking scheme based on different security techniques to preserve basic security features such as confidentiality and integrity of DICOM images. The performance of proposed technique has been tested on different criterion and results prove that proposed technique fulfill all the security criterions.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125962290","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":"Collaboration of IoT devices using semantically Enabled Resource Oriented Middleware","authors":"S. Sasirekha, S. Swamynathan","doi":"10.1145/2983402.2983428","DOIUrl":"https://doi.org/10.1145/2983402.2983428","url":null,"abstract":"The use of explicit semantics for the web services as pioneered by many semantic web service projects has enabled us to overcome the heterogeneity of data and resources and to improve the tasks like data sharing, resource discovery, and integration among them. As a result, the semantic web service has also attracted tremendous interests of various research communities and industry to tackle the challenging problem of heterogeneity, interoperability and flexibility in Internet of Things (IoT), which characteristically interconnects and communicates among the extremely large number of highly distributed and heterogeneous devices. The IoT sources are typically resource constraint in nature and for the clients to fetch the list of services offered by the devices, a lightweight mechanism should also be adapted. Hence, in this research work, to facilitate efficient use of information generated from the IoT devices and automatically drive entities to meet the needs of human beings a semantically enabled resource oriented middleware solution based on RESTful web service is proposed. The middleware solution drives us to locate, find, select and invoke the appropriate services in an autonomic and a flexible way. It also serves as a platform to create context-aware and personalized IoT-based services and applications.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497732","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":"New Approach for Advanced Cooperative Learning Algorithms using RL Methods (ACLA)","authors":"D. Vidhate, P. Kulkarni","doi":"10.1145/2983402.2983411","DOIUrl":"https://doi.org/10.1145/2983402.2983411","url":null,"abstract":"We explore a new approach for dynamic products availability in a three retailer shops in the market. Retailers can cooperate with each other and can get benefit from cooperative information by their own policies that accurately represent their goals and interests. The retailers are the learning agents in the system and use RL to learn cooperatively from the environment. The system becomes Markov decision process model on the basis of logical theory on the seller's inventory policy, the arrival process of the customers and refill times. Cooperation in learning (CL) can be understood in a multiagent system. The agents are capable of learning from both their own trials and other agents' knowledge. In this paper, we proposed a new approach for Advanced Cooperative Learning Algorithms using RL methods (ACLA). We have shown the performance comparison between cooperative learning algorithms and advanced cooperative learning algorithms using RL method with expertness measure. Expertness measuring criteria which were used in earlier work is further enhanced & improved in proposed method. Four methods for measuring the agents' expertness are used i.e. Normal (Nrm), Absolute (Abs), Positive (P), Negative (N). The novelty of this approach lies in the implementation of the RL algorithms with expertness measuring criteria by means of Sarsa learning and Sarsa(λ) learning algorithms. The paper shows implementation results and performance comparison of all these algorithms.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"R-30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126629801","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 Hybrid Distance Metric Learning for Image Ranking","authors":"Rasika Subhash Dhawane, Bela Joglekar","doi":"10.1145/2983402.2983442","DOIUrl":"https://doi.org/10.1145/2983402.2983442","url":null,"abstract":"The Distance Metric Learning (DML) has been in attentive on image retrieval, but many of the previous methods are used for classification and clustering of the images. In this paper, we are focusing on designing the ordinal DML algorithms for image ranking purpose, hence the rank levels among the images can be well measured by us. A new hybrid approach is proposed in this paper in order to improve efficiency of existing system. Proposed approach is a hybrid algorithm of linear and nonlinear distance metric learning methods. First of all we present a linear ordinal Mahalanobis DML model which tries to preserve the local geometry information as well as the ordinal relationship of the data. Then a nonlinear DML method by kernelizing the above model is developed, here most of the real-world image data with nonlinear structures is considered. for further improvemrnt of the ranking performance, we derive a multiple kernel DML approach taken by the idea of multiple-kernel learning which performs different kernel operations on different kinds of features of image. Extensive experimental analysis demonstrates the relevant results.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128134263","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":"Efficient Batch Processing of Related Big Data Tasks using Persistent MapReduce Technique","authors":"R. K. Sidhu, Charanjiv Singh Saroa","doi":"10.1145/2983402.2983431","DOIUrl":"https://doi.org/10.1145/2983402.2983431","url":null,"abstract":"The data generated by today's enterprises has been increasing at exponential rates in size from most recent couple of years. Also, the need to process and break down the substantial volumes of data has likewise expanded. In order to handle this enormous amount of data and to analyze the same, an open-source usage of Apache system, Hadoop is utilized now-a-days. Hadoop presented a utility computing model which offer replacement of traditional databases and processing techniques. Scalability and high availability of MapReduce makes it the first choice for big data analysis. This paper provides a brief introduction to HDFS and MapReduce. After studying them in detail, it later made to work on related tasks and store the cached result of mapper function which can be used as an input for general reducers. By this additional triggering agent, we were able to achieve the analysis result in approximately half the actual time.","PeriodicalId":283626,"journal":{"name":"Proceedings of the Third International Symposium on Computer Vision and the Internet","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121035005","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}