iosr-JCE   Volume-17 ~ Issue-3 ~ May-June 2015

Abstract: Palmprint have some basic features. These basic features are unique and unchangeable in one's life. It is constant and not easy to fake. A palmprint contains three major lines that are called principal line, secondary line, and wrinkles. These lines give rich information for personal verification and have robust discernment. In this paper a new method proposed for palmprint verification. Shock filter is used in the proposed method for preprocessing. SIFT feature matching using I-RANSAC and LPD refinement are used for feature matching. The results of the preprocessed and without preprocessed palmprint images are displayed, compared, and discussed in this paper. The experiment is carried out using IITD palmprint database and CASIA palmprint database.

Keywords - Palmprint, I-RANSAC, SIFT, Shock Filter, Touchless.

[1]. CASIA Palmprint Database, http://www.cbsr.ia.ac.cn/PalmDatabase.htm.
[2]. D. Lowe, Distinctive image features from scale-invariant keypoints, International journal of computer vision, (2004) 60 (2) 91–110.
[3]. H. P. Kramer and J. B. Bruckner. Iterations of a non-linear transformation for enhancement of digital images. Pattern Recognition, (1975)7:53 58.
[4]. IIT Delhi Touchless Palmprint Database version 1.0, http://web.iitd.ac.in/ ajaykr/Database Palm.htm.
[5]. Joachim Weickert, Coherence-Enhancing Shock Filters, Mathematical Image Analysis Group, http://www.mia.uni-saarland.de/weickert.

Abstract: Product design in the manufacturing industry is one of the most critical elements influencing consumer purchase behavior. As consumer values become increasingly diverse, design is becoming an important element for automakers as well. To address this issue, the authors took a Customer Science approach, creating supporting ideas for product development that capture the customers' sense. One original idea was creating a Vehicle Proportion, Form, and Color Matching approach method, and the effectiveness of this tool was then verified. The first step in the research process was to conduct a survey of sensory words and then perform a principal component analysis and cluster analysis to identify the elements that influence vehicle preference.

[1]. Amasaka, K., （2002）, New JIT, A New Management Technology Principle at Toyota, International Journal of Production Economics, Vol. 80, pp.135-144.
[2]. Amasaka, K., (2005), Constructing a Customer Science Application System ―CS-CIANS‖- Development of a Global Strategic Vehicle ―Lexus‖ Utilizing New JIT –, WSEAS (World Scientific and Transactions on Business and Economics, Issue3, Vol.2, pp.135-142.
[3]. Asami, H., Owada, H., Murata, Y., Takebuchi, S. and Amasaka, K. (2008), The A-VEDAM Model for Approaching Vehicle Exterior Design, Journal of Business Case Studies, Vol. 7, No. 5,.pp.1－8．
[4]. Asami, H., Ando, T., Yamaji，M. and Amasaka, K. (2010), A Study on Automobile Form Design Support Method ―AFD-SM‖, The Journal of Business & Economics Research, Vol.8, No.11, pp. 13-19.
[5]. Muto, M., Miyake, R. and Amasaka, K. (2011), Constructing an Automobile Body Color Development Approach Model, Journal of Management Science, Vol.2, pp. 175-183.

Abstract: The secured exchange of message was the main concern. To overcome this, message authentication schemes were developed, to maintain the privacy of message. Message authentication schemes are based on symmetric key or public key cryptosystem. This resulted in lack of scalability, delayed authentication, communication overhead, high computation, etc. To address these issues we propose a new system called Secured Authentication and Source Privacy (SASP) for Message based on Elliptic curve cryptography (ECC). This scheme adopts Polynomial-based technique for the elimination of computational overhead, increasing the scalability, fastening the authentication and exchange of unlimited number of messages. This analysis and simulation depending on our proposed system is far more efficient than previously existing Source Anonymous Message Authentication (SAMA) in terms of computation and communication overhead and also provides high level of security and source privacy.

Keywords: Signature, Authentication, Elliptic Curve Cryptography (ECC)

[1]. W. Zhang, N. Subramanian, and G. ang, "Lightweight and compromise resilient message authentication in sensor networks," in IEEE INFOCOM, (Phoenix, AZ.), April 15-17 2008.
[2]. S.S. Manavi, M.S. Kakkasageri, D.G.Adiga, "Message Authentication in Vehicular Ad hoc Networks: ECDSA Based Approach," in ICFCC, 2009.120, 2009 IEEE.
[3]. Mojtaba Gorbanaliadeh, Mahmood Javadi, Kiomars Abdi, Ali Hosseinalipour, "Error detection in wireless sensor networks based on Assertion functions," Volume 4, Issue 5, May 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineerinng.
[4]. Yun Li, Jie Wu, Jian Li, Jian Ren, "Providing Hop-by-Hop Authentication and Source Privacy in Wireless Sensor Networks,"2012 IEEE.

Abstract: Different techniques have been used to develop result prediction systems. In particular, football match result prediction systems have been developed with techniques such as artificial neural networks, naïve Bayesian system, k-nearest neighbor algorithms (k-nn), and others. The choice of any technique depends on the application domain as well as the feature sets. The priority of a system developer or designer in most cases is to obtain a high prediction accuracy. The objective of this study is to investigate the performance of a Support Vector Machine (SVM) with respect to the prediction of football matches. Gaussian combination kernel type is used to generate 79 support vectors at 100000 iterations. 16 example football match results (data sets) were trained to predict 15 matches. The findings showed 53.3% prediction accuracy, which is relatively low. Until proven otherwise by other studies, an SVM-based system (as devised here) is not good enough in this application domain.

Keywords: Gaussian combination kernel, machine learning, prediction system, support vector machine

[1]. F. Akhtar and C. Hahne. Rapid Miner 5 Operator Reference. Rapid-I GmbH, 2012, Retrieved February 13, 2015 from: http://rapidminer.com/wpcontent/uploads/2013/10/RapidMiner_OperatorReference_en.pdf .
[2]. A. Malaise, A. Malibari, M. Alkhozae, "Student Performance Prediction System Using Multi-agent Technique," International Journal of Data Mining and Knowledge Process (IJDKP), vol. 4(5), 2014, 1–20.
[3]. C.P. Igiri, E.O. Nwachukwu, "An Improved Prediction System for a Football Match Result," IOSR Journal of Engineering (IOSRJEN), 4(12), 2014, 12–20.
[4]. S. A. Kumar, J.P. Kuma, J. Rajeev, "Application of Machine Learning to Predict Soaked CBR of Remolded Soils," International Journal of Engineering Research and Technology (IJERT), 4(6), 2013, 3019–3024.
[5]. R. Palaniappan, K. Sundaraj, and S. Sundaraj, "A Comparative Study of SVM and K-NN Machine Algorithms for Diagnosis of Respiratory Pathologies using Pulmonary Acoustic Signal," BMCC Bioformatics, 15, 2014, 223.

Abstract: A wireless sensor network (WSN) consists of inexpensive power constrained sensor nodes collecting data from the sensing area and transmits data towards the base station in a synergetic way. The basic goal of wireless sensor network is to enhance the node lifespan, stability period and throughput of network. The WSN nodes are restricted by energy, storage capacity, and computing power. So clustering is used to improve lifetime and stability. Cluster routing protocol plays an important role for improvement of energy and stability of the network. In this paper a new technique Enhance Threshold Sensitive Stable Election Protocol (ETSEP) is proposed and evaluated for heterogeneous wireless sensor network. In this technique cluster head election probability dynamically changes. The ETSEP is simulated using MATLAB and found that it performs better than Stable Election Protocol (SEP) ,Threshold Sensitive Stable Election protocol (TSEP) and Zonal Stable Election Protocol(ZSEP) in terms of stability and network lifetime. ETSEP builds more stable routing environment as compared to SEP, TSEP and ZSEP. Simulation results shows that our protocol performs better than SEP, TSEP and ZSEP.

Keywords: Clustering, Data aggregation, Stable-aware routing protocol, Heterogeneous environment, Wireless sensor network.

[1]. Al-Karaki, J.N.; Kamal, AE. "Routing Techniques In Wireless Sensor Networks: A Survey," Wireless Communications, IEEE, Vol.11, No.6, Pp.6,28, Dec. 2004.
[2]. Heinzelman, W. B. Application-Specific Protocol Architectures For Wireless Networks.Ph.D.Thesis, Massachusetts Institute Of Technology, 2000.
[3]. Heinzelman, W.R.; Chandrakasan, A.; Balakrishnan, H., "Energy-Efficient Communication Protocol For Wireless Microsensor Networks," System Sciences, Proceedings Of The 33rd Annual Hawaii International Conference On , Vol., No., Pp.10 Pp. Vol.2,, 4-7 Jan. 2000
[4]. T. J. Shepard, "A Channel Access Scheme For Large Dense Packet Radionetworks." In Proccedings Of ACM SIGCOMM, Pp.219230, September 1996.
[5]. Smaragdakis, G., Matta, I., &Bestavros, A. SEP: A Stable Election Protocol For Clustered Heterogeneous Wireless Sensor Networks. In Second International Workshop On Sensor And Actornetwork Protocols And Applications (SANPA 2004), Boston, MA, Aug. 2004.

Abstract: This paper deals with the design and development of an electronic voting (e-voting) system with Global Positioning System (GPS) device for client service authentication and poll centre co-ordinates monitoring to solve the problem of identifying votes with their corresponding poll centres during and after voting exercise so that voters are assured that their votes are secured. The architecture of the system has three phases; the GPS client service which is interfaced with the system to determine poll centre co-ordinates as well as to serve as the access code to the developed server. The second phase of the system is the client station where eligible voters can register and vote with their captured fingerprint and facial image as unique identity while the third phase of the system is the server where results from various clients are accommodated and processed.

Keywords: Election, Electronic voting, Facial Image, Fingerprint, Global Positioning System (GPS) device.

[1]. Diamond L. (2002). Free and Fair? The Administration and Conduct of the 1983 Nigerian Elections. In: A. A. Akinsanya, G. J. Idang (Eds.): Nigerian Government and Politics: 1979-1983. Calabar: Wusen Publishers.
[2]. Anwar Adi, Wael Adi, Martin Schuler, and Peter H. Frohlich (2006). Secure paper-assisted voting system with omr-based counting and open verification scheme, International Symposium on System and Information Security, Sao Paulo, Brazil, November 2006.
[3]. Muir H, Laville S. and Gillan A., (2005), "New Fears over Postal Vote Fraud", http://politics.guardian.co.uk/election/story/0,15803,1458341,00.html
[4]. Alan, D.S. and John, S.C. (2005). Revolutionalising the voting process through online strategies, U.S.A Journal on online voting, 29(5): 513-530.
[5]. Gibson, R. (2001). Elections online: Assessing internet voting in light of the Arizona Democratic Primary, Political Science Quarterly 116(4): 561-583.

Abstract: Trinity is a structure for automatically fetch or extract or segment the content from the website or the webpages by the source of internet. The required applications are done by the trinity nature in order to group the data in the form of sequential or linear tree structure. Multiple users will be searching for the effective and efficient device in order to perform the optimized solution without any major outcome or problem. In this system an automatic parser is placed at the back end of the complete ternaryformat. Hence it performs the action or task of sub-segmenting the extracted web content in the form of small pieces of web content which has three main categories as suffix, prefix and separator. Once the action of fetching is completed, now the extracted content in the corresponding webpages data will be cleaned and formatted for the calculation which results in an effective and efficient cost comparative system.

[1]. Yanhong Zhai and Bing Liu, ―Web Data Extraction Based on Partial Tree Alignment‖ IEEE Trans. Knowl. Data Eng., vol. 18, no. 10, pp. 1411–1428, Oct. 2010.
[2]. Andrew Carlson and Charles Schafer ―Bootstrapping Information Extraction from Semi-structured Web Pages‖ IN ECML PKDD 2008, Part I, LNAI 5211, pp. 195–210, 2008. c Springer-Verlag Berlin Heidelberg 2008
[3]. H. A. Sleiman and R. Corchuelo, ―An unsupervised technique to extract information from semi-structured web pages,‖ in Proc. 13th Int. Conf. WISE, Paphos, Cyprus, 2012, pp. 631–637.
[4]. FatimaAshraf,TanselO¨zyer,and Reda Alhajj ―Employing Clustering Techniques for Automatic Information Extraction From HTML Documents ''in IEEE transactions on systems, man, and cybernetics—part c: applications and reviews, vol. 38, no. 5, September 2008

Abstract: Impulsive noise is sometimes called salt-and-pepper noise or spike noise is most oftenly occuring image detoriation. An image containing salt-and-pepper noise will have dark pixels in bright regions and bright pixels in dark regions at random space. This type of noise can be caused by almost lost value of pixels, analog-to-digital converter deficiencies, bit errors in transmission, fault in communication etc. The traditional filtering techniques such as mean median and average are available to remove the noise from an image one of the most oftenly used is Gaussian filtering technique. But these filtering techniques are not generic, where as such techniques are useful in preparing adaptive algorithm for the general purpose filters.

[1]. K. Shahriar, R. Sakib, Jubayer, and R. Mizanur, "Salt and pepper noise detection and removal by tolerance based selective
arithmetic mean filtering technique for image restoration," IJSNS International journal of computer science and network security.
Vol8.No.6, pp. 271–278, 2009.
[2]. A. N. Rao, B. Rao, J. kiran, and L.S.S.Reddy, "A robust optimal morphological filter to remove impulse noise in images,"
International journal of Information Technology and knowledge Management Vol.2, No.2, pp. 237– 239, Dec. 2010.
[3]. M. Alasdair, "An introduction to digital image processing with matlab(scm2511)," Victoria University of Technology, 2004.
[4]. P. Rajoo, "An improved switching median filter for uniformly distributed impulse noise removal," World academy of science,
Engineering and technology 38, pp. 349–351, 2008.

Abstract: Biometric technique consists of uniquely identifying person based on their physical characteristic or behavioral characteristic. It is mainly used for authentication. Iris sacnning is one of the most secure techniques among all biometrics because of its uniqueness and stability i.e. no two persons in the world can have same iris. For authentication, the feature template in the database and the user template should be the same. Storing the template in the database securely is not a secure approach, because it can be stolen. To deal with this security issue, in our paper a new method for securely storing the template in the database is proposed.

1]. PDont Blink:Iris Recognition for Biometric Identication", SANS Institute InfoSec Reading Room
[2]. L.Masek, P Kovesi, "Recognition of human iris patterns for biometric identification". Tech. Rep., The School of Computer Science and Software Engineering, The University of Western Australia.
[3]. Libor Masek ,"Recognition of Human Iris Patterns for Biometric Identication", The University of Western Australia, 2003.
[4]. Moni Nair and Adi Shamir, "Visual cryptography" .In Proceedings of the advances in cryptology- Eurocrypt, 1- 12,1995.
[5]. S. Lim K. Lee O. Byeon and T. Kim, "Ecient Iris Recognition through Improvement of Feature Vector and Classier." ETRI J., vol. 23, no. 2,pp. 61-70, 200l

Abstract: In this paper, we propose a new color visual cryptography scheme which is based on modified visual cryptography. Visual Cryptography is based on cryptography where n images are encoded in a way that only the human visual system can decrypt the hidden message without any cryptographic computations when all shares are stacked together. In this scheme sender can share n-1 natural images and one secrete image of variable size with the server and it make the encryption with extraction of feature of natural images without altering the contents of natural images. When the receiver identification is done that time server make the decryption process and send the secrete image with transmitted by highly secure secret channel. Moreover, this approach avoids the pixel expansion problem and makes it possible to recover secret images without any distortion.

Keywords: Color image, Natural Image, Transmission risk, Visual Cryptograph

[1]. NAOR M, SHAMIR A. Visual cryptography[C]. Proceedings of Eurocypto'94. New York, 1995. 1-12.
[2]. JIM CAI 2003. A Short Survey on Visual Cryptography Schemes, www.wisdom.weizmann.ac.il/naor/ PUZZLES /visual.html.
[3]. Pooja and Dr.Lalitha Y. S,"Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication", International Journal of Engineering Research and Development , Vol. 10, PP.01-08, June 2014.
[4]. Xiao-Yi Liu, Ming-Song Chen, and Ya-Li Zhang ,"A New Color Visual Cryptography Scheme with Perfect Contrast ",2013 8th International Conference on Communications and Networking in China (CHINACOM)
[5]. Néelima. Guntupalli, Mr: P.D.Ratna Raju and Mr.Suresh cheekaty, "AN INTRODUCTION TO DIFFERENT TYPES OF VISUAL CRYPTOGRAPHY SCHEMES" , International Journal of Science and Advanced Technology (ISSN 2221-8386), Vol. 1,Sept.2011
[6]. C.C. Wu, L.H. Chen, "A Study On Visual Cryptography", Master Thesis, Institute of Computer and Information Science, National Chiao Tung University, Taiwan, R.O.C., 1998.