{"title":"Development of a kinect-based physical rehabilitation system","authors":"Param Uttarwar, Deepak Mishra","doi":"10.1109/ICIIP.2015.7414802","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414802","url":null,"abstract":"Shoulder injuries are very common in sports and certain labour intensive occupations. While some injuries are minor and full recovery is within 1-2 weeks, some major injuries requires the person to consult a physiotherapist and follow an exercise plan for months for full recovery. With the advent of consumer accessible motion capture (MoCap) technologies, the task of conducting daily rehabilitation routine and evaluation which was previously done by a trained physiotherapist can be now done with computers which can be set up in home. In this paper, we propose a system for medical rehabilitation of patients suffering from shoulder injuries. We use Hidden Markov Models (HMM) for recognition and a histogram-based comparison for computing the accuracy score. The Microsoft Kinect sensor is used to obtain 3D coordinates of human joints. Important features are extracted from the skeletal coordinates which are then quantized into 16 intermediate upper-body poses. The temporal patterns of these upper-body poses are modelled by training an HMM for each exercise. Our system recognizes different exercises performed by the patient and assigns an accuracy score for each exercise carried out in a session. It intends to help the patient by keeping track of daily exercise routine, advising for improvements and maintaining records for doctor to access.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117354537","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":"Biometric watermarking using partial DCT-Walsh wavelet and SVD","authors":"H. B. Kekre, T. Sarode, S. Natu","doi":"10.1109/ICIIP.2015.7414752","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414752","url":null,"abstract":"Biometric has ever increasing demand in the field of security. However, integrity and security of biometric used to authenticate a legal user are the inherited problems of it. Since watermarking hides one form of digital data into other, its use in securing biometric data gives an added advantage. This concept has led to biometric watermarking technique in which one biometric can be embedded into another biometric feature of user to enhance security. In this paper a robust biometric watermarking technique using face images as host and iris images as watermark has been proposed with the combination of hybrid wavelet and Singular Value Decomposition. DCT-Walsh hybrid wavelet transform is used in its partial form (column transform) on host and watermark images. Low frequency coefficients of partially transformed hosts are subjected to SVD. Singular values of partially transformed watermark are adaptively scaled and are embedded in these singular values of host. Robustness of proposed technique is evaluated against compression, selective and random cropping, noise addition and resizing attack. Average absolute pixel difference between embedded and extracted watermark is used as similarity measure between them. Proposed technique is observed to be highly robust against these attacks except selective cropping. However this limitation is eliminated when iris images are embedded in middle frequency coefficients of host.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126826500","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 Nystrom method for low rank approximation and error analysis","authors":"L. Patel, S. Sana, S. P. Ghrera","doi":"10.1109/ICIIP.2015.7414831","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414831","url":null,"abstract":"Kernel methods suffer from the high time and space complexity because kernel methods having large kernel matrix for training data. So we have to speed up the kernel method. That problem is solved by the low rank approximation. In this paper, we compare the two sampling based low rank approximation techniques implement for the large kernel matrix. First one is standard Nystrom method and the second is our proposed efficient Nystrom method. In the proposed approach we extract the low dimension form the high dimensional data using low rank approximation. We have shown the quality of low rank approximation based on Frobenius norm and spectral norm. Our experimental results show efficient Nystrom method is superior as compared to standard Nystrom method. We show the comparison based on the various error bounds. We perform the efficient Nystrom method on variety of data sets.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114260791","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":"Image enhancement using combined ICA and PCA based filtering in HSV domain","authors":"Nidhi Chahal, Sakshi Sharma","doi":"10.1109/ICIIP.2015.7414709","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414709","url":null,"abstract":"Image enhancement is mostly expanding the perception of data in pictures for individual viewers and giving enhanced information to other image processing techniques. Image enhancement is a digital processing method which does its best to improve image vision and makes the image adapt to be processed by computer. As well, the need for contrast enhancement also arises from the fact that current softcopy display devices are incapable of displaying as many different discernible levels of luminance as can be recorded in a digital image. It really enhances some information inside the image selectively and restrains the other ones. In this way, it is easy to detect and recognize useful information. It generally yields satisfactory results if the proper technique is selected for a given application along with the proper processing parameters. In the presented paper, first section gives a brief introduction to the image enhancement, the second section contains a brief literature about the previous work done and the third section contains proposed issue and related proposed method to enhance the image. The proposed system works by tracking the edges using ICA and PCA based filtering by firstly transforming the image into HSV domain and then applying the filtering and contrast change, after that the image is again converted to visible form and analyzed under PSNR, MSE and Standard Deviation.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128425495","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}
Tayeba Qazi, Prerana Mukherjee, Siddharth Srivastava, Brejesh Lall, N. Chauhan
{"title":"Automated ball tracking in tennis videos","authors":"Tayeba Qazi, Prerana Mukherjee, Siddharth Srivastava, Brejesh Lall, N. Chauhan","doi":"10.1109/ICIIP.2015.7414772","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414772","url":null,"abstract":"Sports video analysis tools are gaining enormous popularity as they enable enhanced visualization and analysis of the game. An intriguing problem is localizing and tracking the ball in a game of tennis. However, achieving a practically suitable tradeoff between high detection accuracy and speed of the ball is a challenging problem in automatic ball tracking algorithms. In this paper, we propose a machine learning based automated ball tracking algorithm in tennis match videos acquired by a camera mounted on a quadcopter. We begin with applying a video stabilization technique followed by random forest segmentation for detecting tennis ball candidates in the video frames. The yellow color plane intensity and Phase Quaternion Fourier Transform (PQFT) saliency are used as features for random forest segmentation. The effectiveness of the proposed algorithm is demonstrated on datasets from real-world tennis videos. The experimental results show that our algorithm is robust and achieves 94% accuracy in best case and successfully detects the ball even in cases of partial occlusion by net or racket.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121687999","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":"An optical character recognition of machine printed Oriya script","authors":"A. Raj","doi":"10.1109/ICIIP.2015.7414832","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414832","url":null,"abstract":"Character recognition research is one of the most challenging research areas which put many of the research areas of Digital Image processing like Noise Removal, Machine Learning, and Object Recognition under one roof. If we focus on India particularly, the field has huge amount of work to be done. In current technological era OCR systems for Indian scripts has great application opportunities with their significant use like digital libraries of literatures written in different Indian scripts. Oriya is one of the officially recognized languages of India, and is the official language of the state Orissa. Through this paper I am introducing a Character Recognition System for machine printed Oriya symbols. Paper describes in detail the Feature extraction process, which is carried out by some conventional with two novel enhancements to Structural Features like detection of vertical line in a character and detection of open space in lower zone of a character. Classification process is completed by implementing a novel combination of Binary tree and Naïve Bayesian classifier, which has never been used for Oriya script earlier.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038514","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":"Power aware resource allocation policy for hybrid cloud","authors":"Ravi Shankar Jha, Punit Gupta","doi":"10.1109/ICIIP.2015.7414791","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414791","url":null,"abstract":"Cloud computing is now trending and more popular in these days for the computation and adopted by many companies like google, amazon, Microsoft etc., As the cloud size increases with increase in number of data center power consumption over a data center increases. As number of request over the data center increase with increase in load and power consumption of the data center. So the requests need to be balanced in such manner which having more effective strategy for utilization of resources and reduction in power consumption. Hybrid cloud computing made it more complicated with respective to requests type that may increase or decrease power consumption. A recent survey on cloud computation shows that the power consumption of a server, increasing in a linear way due to utilization of resource (processors). Request balancing in such manner without having knowledge of load over server maximize resource utilization but also increasing power consumption at server. So to overcome these issues in cloud Infrastructure as a service (IaaS), we have proposing a load balancing algorithm to minimize the power consumption and cost over a data center. Proposed algorithm has proven to have better performance in term of load and power efficiency as compared to previously proposed load balancing algorithm for cloud IaaS.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115876784","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":"Detection of Sudoku puzzle using image processing and solving by Backtracking, Simulated Annealing and Genetic Algorithms: A comparative analysis","authors":"Snigdha Kamal, S. Chawla, Nidhi Goel","doi":"10.1109/ICIIP.2015.7414762","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414762","url":null,"abstract":"In this paper, we propose the digital detection and decryption of a sudoku puzzle using vision based techniques and subsequent solving of the puzzle using three algorithms-Backtracking, Simulated Annealing and Genetic Algorithm. The proposed method can recognize any sudoku puzzle captured from a digital camera and after employing appropriate pre-processing algorithms which include adaptive thresholding, Hough Transform and geometric transformation, the digits are recognized using Optical Character Recognition (OCR), and based on their pixel locations in the image, they are stored in corresponding locations in the 9×9 matrix. The detected puzzles of varying complexity levels are then solved using the three algorithms and the results are compared and contrasted, indicating the relative efficiencies of the three techniques in accurately solving Sudoku puzzles. Simulated Annealing performed the best amongst the three algorithms, whereas, genetic algorithm performed the worst in the comparison.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134439010","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":"Evaluation of cost function for the oct tree segmentation of video cube","authors":"Rupesh Kumar, Sumana Gupta, K. Venkatesh","doi":"10.1109/ICIIP.2015.7414806","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414806","url":null,"abstract":"Segmentation is the pre-processing step of the various video processing applications like compression, foreground and background segmentation etc. It is a method of partitioning a video into uniform regions. Oct tree segmentation method which is explained in this paper assumes video as a cube and segments entire video cube into eight shorter size video cube. Segmentation has been formulated with the help of cost function. Whether the region is uniform or not is decided by the cost function. Cost function estimates uniform and non-uniform regions of video cube and if region is non-uniform, then they split otherwise they merge. A good selection of cost function is the aim of this paper. SPREF model has been used for the estimation of the cost function and it gives energy based cost function. The advantage of SPREF based cost function is that it incorporates both the texture properties and the motion of frames. performance of the proposed method has been evaluated with the other cost function and improved result obtained from proposed method validates its effectiveness.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560002","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":"Power aware resource virtual machine allocation policy for cloud infrastructure","authors":"Ravi Shankar Jha, Punit Gupta","doi":"10.1109/ICIIP.2015.7414776","DOIUrl":"https://doi.org/10.1109/ICIIP.2015.7414776","url":null,"abstract":"Cloud computing is now trending and more popular in these days for the computation and adopted by many companies like google, amazon, Microsoft etc., As the cloud size increases with increase in number of data center power consumption over a data center increases. As number of request over the data center increase with increase in load and power consumption of the data center. So the requests need to be balanced in such manner which having more effective strategy for utilization of resources and reduction in power consumption. A recent survey on cloud computation shows that the power consumption of a server, increasing in a linear way due to utilization of resource (processors). Request balancing in such manner without having knowledge of load over server maximize resource utilization but also increasing power consumption at server. So to overcome these issues in cloud Infrastructure as a service (IaaS), we have proposing a load balancing algorithm to minimize the load, power consumption and cost over a server. Proposed algorithm has proven to have better performance in term of load and power efficiency as compared to previously proposed load balancing algorithm for cloud IaaS.","PeriodicalId":144495,"journal":{"name":"2015 Third International Conference on Image Information Processing (ICIIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134591309","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}