Printed Numeral Recognition Using Structural and Skeleton Features
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.224-232, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.224232
Abstract
In automatic numeral digit recognition system, feature collection is most important aspect for achieving high recognition performance. To attain this, we proposes model for printed numeral digit recognition using number of contours, skeleton features such as number of end points, number of horizental and vertical crossings Number of watersheds, and ratio between the number of foreground pixels in upper half-part and lower half-part of the numerical digit image. Based on these features the present study designed user defined classification algorithm for printed numerical digit recognition. To find the effectiveness of the proposed algorithm, these features are given as an input for standard classification algorithms like k–nearest neighbor classifier and other classification algorithms to evaluate the results. The experimental results prove that the proposed features are well suited for printed digit recognition for both user and standard classification algorithms. The novelty of the proposed method is size and shape invariant.
Key-Words / Index Term
Structural ,Skeleton Features.K-nn,Classification,Watersheds,contours
References
[1] G. E. Hinton, S. Osindero, and Y.-W. Teh, “A fast learning algorithm for deep belief nets,” Neural Comput., vol. 18, no. 7, pp. 1527–1554, Jul. 2006.
[2] H. Lee, R. Grosse, R. Ranganath, and A. Y. Ng, “Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations,” in Proceedings of the 26th Annual International Conference on Machine Learning, ser. ICML ’09. New York, NY, USA: ACM, 2009, pp. 609–616.
[3] B. Wicht and J. Hennebert, “Camera-based sudoku recognition with deep belief network,” in Soft Computing and Pattern Recognition (SoCPaR), 2014 6th International Conference of, Aug 2014, pp. 83– 88.
[4] Chen, G., Li, Y. and Srihari, S.N. (2016) Word Recognition with Deep ConditionalRandom Fields. Proceedings of the IEEE International Conference on Image Processing(ICIP ), Phoenix, AZ, 25-28 September 2016, 1928-1932.
[5] arulla, G.A., Murru, N. and Rossini, R. (2016) A Fuzzy Approach for Segmentationof Touching Characters. arXiv:1612.04862v1. https://arxiv.org/abs/1612.04862
[6] Jaderberg, M., Simonyan, K., Vedaldi, A. and Zisserman, A. (2014) Reading Text inthe Wild with Convolutional Neural Networks. arXiv preprint arXiv:1412.1842
[7] Liu, Z., Li, Y., Ren, F. and Yu, H. (2016) A Binary Convolutional Encoder-DecoderNetwork for Real-Time Natural Scene Text Processing. arXiv:1612.03630v1.https://arxiv.org/abs/1612.03630v1
[8] Yin, X.C., Yin, X., Huang, K. and Hao, H.W. (2014) Robust Text Detection in NaturalScene Images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 970-983. https://doi.org/10.1109/TPAMI.2013.182
[9] Oivind Trier, Anil Jain, Torfiinn Taxt, ―A feature extraction method for character recognition-A survey pattern Recg, vol 29, No 4, pp641-662, 1996
[10] P.Nagabhushan, S.A.Angadi, B.S.Anami, ―A fuzzy statistical approach of Kannada Vowel Recognition based on Invariant Moments‖, Proc. Of NCDAR-2003, Mandy, Karnataka, India, pp275-285, 2003
[11] G. G. Rajput, Rajeswari Horakeri, Sidramappa Chandrakant “Printed and Handwritten Kannada NumeralRecognition Using Crack Codes and Fourier Descriptors Plate” RTIPPR, 2010. IJCA Special Issue on “RecentTrends in Image Processing and Pattern Recognition” pp.53-58
[12] Graham, D.N “Image transmission by two-dimensional contour coding” Proceedings of the IEEE Volume: 55,Issue: 3 Pages: March 1967 336 – 346
[13] U. Pal, T. Wakabayashi, N. Sharma and F. Kimura,"Handwritten Numeral Recognition of Six Popular IndianScripts", In Proc. 9th International Conference on Document Analysis and Recognition. pp. 749-753, Curitiba,Brazil, September 24-26, 2007
[14] Seong- W han Lee, "Multi layer cluster neural network for totally unconstrained handwriritten numeralrecognition. Neural Networks. Vo I. 8. No 5. pp.409-4 1 8, 1984
[15] Image Processing Techniques For Machine Vision [online].Available:http://www.eng.fiu.edu/me/robotics/elib/am_st_fiu_ppr_2000.pdf
Citation
R. Vijaya Kumar Reddy, Uppu Ravi Babu, "Printed Numeral Recognition Using Structural and Skeleton Features," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.224-232, 2018.
Estimation of Ratio of Two Population Means in case of Post-Stratification
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.233-236, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.233236
Abstract
Problem of estimation of ratio of two population means has been discussed resulting with a ratio and product type estimators. Expressions for the bias and mean squared error have been derived. Developed estimator under study has been compared with usual estimator theoretically as well as empirically.
Key-Words / Index Term
Two population means, Post-stratification, Bias and MSE
References
[1]. Bahl, S. and Tuteja, R. K. (1991). Ratio and product type exponential estimators. Information and optimization science. 12, 1,159-163.
[2]. Cochran, W. G. (1940). The estimation of yields of cereal experiments by sampling for ratio of grain to total produce. J. Agril. Sci., 30, 262-275.
[3]. Hansen, M.H., Hurwitz, W.N. and Madow, W.G. (1953). Sample survey methods and theory. Vol. I and II, John Wiley & Sons, New York.
[4]. Ige, F.A. and Tripathi, T.P. (1989). Estimation of population mean using post-stratification and auxiliary information. Abacus, 18, 2, 265-276.
[5]. Tailor, R., Tailor, R., and Chouhan, S. (2017). Improved ratio- and product- type exponential estimators for population mean in case of post-stratification. Communications in Statistics- Theo. & Meth. Vol 46, No. 21, 10387-10393.
Citation
Rajesh Tailor, Priya Mehta, "Estimation of Ratio of Two Population Means in case of Post-Stratification," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.233-236, 2018.
Malware Detection In Cloud Computing
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.237-241, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.237241
Abstract
In recent years the usage of cloud computing were emerged in big aspects. Hence the security of this big systems were in danger due to the intrusion and stealing of personal data. Inspite there are many primitive measures and antivirus tools were used in the cloud but they are not much effective in nature of modern malwares. Inorder to withstand or recover quickly from difficult conditions the cloud has to react towards not only to the known threats, but also to prevent against the new objection. This paper includes in about an approach in detection of malwares in cloud infrastructure. This approach provides greater efficiency in detection of malwares enhanced forensics capabilities and improved deployability. In this paper we join together detection techniques, Behavioral Blocking and Heuristic Analysis or Pro-Active Defense. Using this mechanism we find that cloud-malware detection provides better detection against recent threats compared to a single antivirus engine and a 98% detection rate across the cloud environment.
Key-Words / Index Term
Cloud computing,threats,antivirus,security,deployability,resilience,malware
References
[1] Bo Li, Eul Gyu I`m “ A signature matching optimization policy for antivirus programs” Electronics and Computer Engineering, Hanyang University, Seoul, Korea. © IEEE 2011
[2] S. Subashini, V. Kavitha s.l “A survey of security issues in service delivery models of cloud computing.” .Science Direct, Journal of Network and Computer Applications, pp. (1-11) January (2011)
[3] Scott Treadwell, Mian Zhou “A Heuristic Approach for Detection of Obfuscated Malware”, Bank of America, 1201 Main St, Dallas, TX 75202, © IEEE 2009.
[4] Lajos Nagy, Richard Ford, and William Allen, “N-version programming for the detection of zero-day exploits”, In IEEE Topical Conference on Cybersecurity, Daytona Beach, Florida, USA, 2006.
[5] A. Ibrahim, J. Hamlyn-Harris, J. Grundy, and M. Almorsy, “Cloudsec: A security monitoring appliance for virtual machines in the iaas cloud model,” in Network and System Security (NSS), 2011 5th International Conference on, Sept 2011, pp. 113–120.
[6] V. Chandola, A. Banerjee, and V. Kumar, “Anomaly detection: A survey,” ACM Computing Surveys (CSUR), vol. 41, no. 3, p. 15, 2009.
[7] A. K. Marnerides, M. R. Watson, N. Shirazi, A. Mauthe, and D. Hutchison, “Malware analysis in cloud computing: Network and system characteristics,” IEEE Globecom 2013, 2013.
[8] C. Wang, V. Talwar, K. Schwan, and P. Ranganathan, “Online detection of utility cloud anomalies using metric distributions,” in Network Operations and Management Symposium (NOMS), 2010 IEEE. IEEE, 2010, pp. 96–103.
[9] S.K. Sharma, L. Gupta, “A Novel Approach for Cloud Computing Environment”, International Journal of Computer Sciences and Engineering, Vol. 4, Issue.12, pp.1-5, 2014.
[10] S.L. Mewada, C. Srivastava, “A Novel Approach for Cloud Environment”, International Journal of Computer Sciences and Engineering, Vol. 4, No.10, pp.1-15, 2010.
Citation
Aswin Sadanandan, T .Poovarasan, V. Kavitha, N. Reavthy, "Malware Detection In Cloud Computing," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.237-241, 2018.
Performance Modelling of Secure Routing Protocol in Communication Network
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.242-251, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.242251
Abstract
A mobile ad hoc network is not a wired network it’s a wireless network that uses multiple hops, peer-to-peer routing in its place of motionless network infrastructure to present network connectivity which is used by consumer for communication. Here, we are discussing and designing newest MANET routing protocols along with is comparisons from previous routing protocol as well as discussed improve version of MANET routing protocols e. g. DYMO is the extended version of AODV and Encrypted DYMO(E-DYMO) is improved version of proposed DYMO; earlier than some routing protocols are synchronized by simulations. Network Simulator (Version 2) present a extremely modular platform intended for wired as well as wireless simulations following different - different network essentials, traffic, protocols, along with routing types. In this work, we get the simulation results in terms of various parameters like throughput, PDR, and E2E delay in terms of security of routing protocol. We also describe comparisons between Enhance DYMO, E-DYMO and proposed DYMO in terms of given parameter as well as shows that the enhance the security of various parameters along with proposed DYMO.
Key-Words / Index Term
MANET, AODV, Proposed DYMO, E-DYMO, Security
References
[1]. H. Deng, W. Li and D. P. Agrawal, “Routing Security in Wireless Ad Hoc Networks”. University of Cincinnati, IEEE Communication Magazine, October 2002.
[2]. C. Siva Ram Murthy and B. S. Manoj “ad hoc wireless network, architectures and protocol.
[3]. Perkins, Charles E. Ad hoc networking. Vol. 1. Reading: Addison-wesley, 2001.
[4]. B. Dahill, B. N. Levine, E. Royer and C. Shields. Aran: A secure routing protocol for ad hoc networks. Technical Report UMass Tech Report 02-32, University of Massachusetts, Amherst, 2002.
[5]. L. Zhou, Z.J. Haas, Securing ad hoc networks, IEEE Network 13 (6) pp.24–30, 1999.
[6]. A. Perrig, R. Szewczyk, V. Wen, D. culler, J. Tygar, SPINS: security protocols for sensor networks, in: Seventh Annual ACM InternationalConference on Mobile Computing and Networks Mobicom 2001), Rome, Italy, July 2001.
[7]. D. Carman, P. Kruus, B. Matt, Constraints and approaches for distributed sensor network security, NAI Labs T.R. #00-010, 1 June 2000.
[8]. Shrestha, Ashish, and Firat Tekiner. "On MANET routing protocols for mobility and scalability." In Parallel and Distributed Computing, Applications and Technologies, 2009 International Conference on, pp. 451-456. IEEE, 2009.
[9]. Johansson, Per, Tony Larsson, Nicklas Hedman, Bartosz Mielczarek, and Mikael Degermark. "Scenario-based performance analysis of routing protocols for mobile ad-hoc networks." In Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 195-206. ACM, 1999.
[10]. Sethi, Srinivas, and Siba K. Udgata. "Scalable Cluster Based Ad hoc On-demand distance vector routing protocol for MANET." In Wireless Communication and Sensor Networks (WCSN), 2010 Sixth International Conference on, pp. 1-6. IEEE, 2010.
[11]. Park, V and Corson, S “Temporally - Ordered Routing Algorithm (TORA) Version 1 Functional Specification”. IETF MANET Working Group, 2001.
[12]. R. Dube, C.D. Rais, K-Y.Wang and S.K. Tripathi, ―Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks‖, IEEE Personal Communications journal, February 1997.
[13]. Gupta, Jyoti. "Survey on Different Approaches of Detection of Gray Hole Attack in MANET." 2017.
[14]. Johansson, Per, Tony Larsson, Nicklas Hedman, Bartosz Mielczarek, and Mikael Degermark. "Scenario-based performance analysis of routing protocols for mobile ad-hoc networks." In Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 195-206. ACM, 1999.
[15]. Singh, Ajay Vikram, and Moushumi Chattopadhyaya. "Mitigation of DoS attacks by using multiple encryptions in MANETs." In Reliability, Infocom Technologies and Optimization (ICRITO)(Trends and Future Directions), 2015 4th International Conference on, pp. 1-6. IEEE, 2015.
[16]. Shengming Jiang, Dajiang He and Jianqiang Rao “A Prediction-Based Link Availability Estimation for Routing Metrics in MANETs”, IEEE Transactions on Networking, Vol. 13, No. 6, December 2005.
[17]. A. Perrig, R. Szewczyk, V. Wen, D. culler, J. Tygar, SPINS: security protocols for sensor networks, in: Seventh Annual ACM InternationalConference on Mobile Computing and Networks Mobicom 2001), Rome, Italy, July 2001.
[18]. Gowda, Sumati Ramakrishna, and P. S. Hiremath. "Review of security approaches in routing protocol in mobile adhoc network." International Journal of Computer Science Issues (IJCSI) 10, no. 1 (2013).
Citation
Mukesh Dixit, Sarvottam Dixit, Ajay Kumar Sachan, "Performance Modelling of Secure Routing Protocol in Communication Network," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.242-251, 2018.
Oppurtunistic Routing Through Delay Analytical Methods in Ad-Hoc Wireless Networks
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.252-258, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.252258
Abstract
Many researchers are showing a keen interest in opportunistic routing and are becoming very popular. This is mainly due to its specific characteristic that it posses for improving the performance and efficiency of the wireless ad-hoc networks. A broadcasting feature of wireless ad-hoc networks is made use in opportunistic routing which increases the network`s overall reliability and throughput. This research paper focuses on an efficient analytical model which is capable of transmitting the data packets both in known and unknown topologies. This is done by making use of single and multiple forwarders. The proposed approach is designed in such a way that it reduces the probability of packet loss in the network. Furthermore this paper concentrates on the security aspects of the network and provides a proper authentication mechanism before the data packets are delivered to the receiver.
Key-Words / Index Term
Wireless ad-hoc networks, Opportunistic Routing, encryption, decryption, analytical model
References
[1]. Royer, E.M.,andToh, C.K., 1999. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Commun., 6(2), pp.46-55[1].
[2]. Ballardie, "Core Based Trees (CBT Version 2) Multicast Routing - Protocol
Specification," RFC-2189, September 1997[2].
[3]. Li, J., Blake, C., De Couto, D.S., Lee, H.I. and Morris, R., 2001, July. The capacity of ad hoc wireless networks. In Proceedings of the 7th annual international conference on Mobile computing and networking (pp. 61-69). ACM[3].
[4]. Westphal, C., 2006, October. Opportunistic routing in dynamic ad hoc networks: The OPRAH protocol. In Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on (pp. 570-573). IEEE[4].
[5]. Nassr, M.S., Jun, J., Eidenbenz, S.J., Hansson, A.A. and Mielke, A.M., 2007, May. Scalable and reliable sensor network routing: Performance study from field deployment. In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE (pp. 670-678). IEEE[5].
[6]. Yuan, Y., Yang, H., Wong, S.H., Lu, S. and Arbaugh, W., 2005, September. ROMER: resilient opportunistic mesh routing for wireless mesh networks. In IEEE workshop on wireless mesh networks (WiMesh) (Vol. 12)[6].
[7]. Jain, S. and Das, S.R., 2008. Exploiting path diversity in the link layer in wireless ad hoc networks. Ad Hoc Networks, 6(5), pp.805-825[7].
[8]. Biswas, S. and Morris, R., 2004. Opportunistic routing in multi-hop wireless networks. ACM SIGCOMM Computer Communication Review, 34(1), pp.69-74[8].
[9]. Zhou, X. and Tang, X., 2011, August. Research and implementation of RSA algorithm for encryption and decryption. In Strategic Technology (IFOST), 2011 6th International Forum on (Vol. 2, pp. 1118-1121). IEEE[9].
[10]. Issariyakul, T. and Hossain, E., 2012. Introduction to Network Simulator 2 (NS2). An Introduction to Network Simulator NS2(pp. 21-40). Springer, Boston, MA[10].
Citation
M. Thenmozhi, N. Tamilarasi, "Oppurtunistic Routing Through Delay Analytical Methods in Ad-Hoc Wireless Networks," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.252-258, 2018.
Fault Tolerant Parity Preserving Reversible Logic
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.259-264, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.259264
Abstract
Reversible logic is the promising design methodology for the future quantum circuits. Since there is no loss in information in reversible circuits, it can be used to create the low power design for super computers. Fault Tolerance in reversible logic is required to ensure the design work correctly even in presence of any faults. A majority voter is proposed which achieves the passive hardware redundancy for any reversible circuit, thereby making the circuit Fault Tolerant. Parity preserving feature induced in the majority voter helps to test the voter for any occurrence of faults. A comparative analysis is done for the available reversible benchmark circuits using the proposed Fault Tolerant approach. A fault diagnosis technique to increase the reliability of the majority voter is also proposed.
Key-Words / Index Term
Fault Tolerance, Quantum, Reversible Logic, Parity Preserving Logic
References
[1] Michael P. Frank, “Introduction to Reversible Computing: Motivation, Progress, and Challenges”, International Workshop on Reversible Computing, ACM press, Italy, pp385-390, 2005.
[2] Marek Perkowski and Pawel Kerntopf, “Reversible Logic``, invited tutorial, Proc. EURO-MICRO, Warsaw, Poland, September 2001.
[3] J. E. Rice, “Reversible Logic as a stepping stone to Quantum Computing”, Encyclopedia of Information Science and Technology, Third Edition, IGI Global, Chapter 715, pp 7271-7279, 2015.
[4] Robert Wille, Anupam Chattopadhyay, Rolf Drechsler, “From Reversible Logic to Quantum Circuits: Logic Design for an Emerging Technology”, International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS), July 2016.
[5] Ketan N. Patel, John P. Hayes, Igor L. Markov, “Fault Testing for Reversible Circuits”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume: 23, Issue: 8, Aug. 2004.
[6] Parag K. Lala, “Fault tolerant and Fault Testable Hardware Design”, Prentice Hall Inc, New Jersey, 1985.
[7] R. Landauer, “Irreversibility and heat generation in the computing process”, IBM J. Research and Development, vol. 5, pp. 183-191, 1961.
[8] C. H. Bennett, "Logical Reversibility of Computation," IBMJ. Research and Development, Vol. 17, pp. 525-532, November 1973.
[9] Web lectures from http://web.cecs.pdx.edu/~mperkows about “Quantum Computing”, by M Perkowski.
[10] A. Barenco, C. H. Bennett, R. Cleve, D. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, “Elementary gates for quantum computation”, The American Physical Society vol. 52, pp. 3457–3467, 1995.
[11] Mehdi Saeedi, Igor L. Markov, “Synthesis and Optimization of Reversible Circuits - A Survey”, ACM Computing Surveys, 45, 2, Article 21 (34 pages), 2013.
[12] D. Maslov, Reversible logic synthesis benchmarks. [Online]. Available: http://www.cs.uvic.ca/dmaslov/.
[13] Mona Arabzadeh, Mehdi Saeedi, Morteza Saheb Zamani, "Rule-Based Optimization of Reversible Circuits," The 15th Asia and South Pacific Design Automation Conference (ASPDAC), pp. 849 - 854, 2010.
[14] R. P. Feynman. Quantum mechanical computers. Optics News, 11:11,20, 1985.
[15] T. Toffoli, "Reversible computing", In Automata, Languages and Programming, Springer-Verlag, pp. 632-644, 1980.
[16] E. Fredkin and T. Toffoli, "Conservative logic", Intl. Journal of Theoretical Physics, pp. 219-253, 1982.
[17] A. Peres, “Reversible logic and quantum computers”, Physical Review: A, vol. 32, no. 6, pp. 3266-3276, 1985.
[18] Himanshu Thapliyal, Nagarajan Ranganathan and Ryan Ferreira, “Design of a Comparator Tree Based on Reversible Logic”, 10th IEEE International Conference of Nanotechnology joint Symposium with Nano Korea 2010.
[19] Majid Haghparast and Keivan Navi, “A Novel Fault Tolerant Reversible Gate for Nanotechnology Based Systems”, American Journal of Applied Sciences 5 (5): 519-523, ISSN 1546-9239 (2008).
[20] M. S. Islam and Z. Begum, "Reversible logic synthesis of fault tolerant carry skip BCD adder", Bangladesh Academy of Science Journal, vol. 32, no. 2,pp. 193-200, 2008.
[21] Bruce JW, Thornton MA, Shivakumaraiah L, Kokate PS, Li X “Efficient adder circuits based on a conservative reversible logic gates”, Proceedings of IEEE computer society annual symposium on VLSI, Pittsburg, PA, pp 83–88, 2002.
[22] Cuccaro, S. A., Draper, T. G., Kutin, S. A., and Moulton, D. P. “A new quantum ripple-carry addition circuit”, workshop on quantum information Processing, Cambridge 2005.
[23] Bhagyalakshmi HR, Venkatesha MK “Optimized reversible BCD adder using new reversible logic gates”, Journal of Computing, volume 2, issue 2, ISSN: 2151-9617, February 2010.
[24] Kaur P, Dhaliwal BS, “Design of fault tolerant full Adder/Subtractor using reversible gates”, IEEE conference international conference on computer communication and informatics (ICCCI) Coimbatore, India, pp 1–5, Jan 2012.
[25] Elena Dubrova, “Fault Tolerant Design”, ISBN 978-1-4614-2113-9, Springer 2013.
[26] Behrooz Parhami, “Fault-Tolerant Reversible Circuits”, Proc. 40th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, October 2006.
[27] Sajib Kumar Mitra, Ahsan Raja Chowdhury, “Minimum Cost Fault Tolerant Adder Circuits in Reversible Logic Synthesis”, 25th International Conference on VLSI Design, 1063-9667/12 IEEE computer society 2012.
[28] Sinha HP, Syal N, “Design of fault tolerant reversible multiplier”, International Journal of Soft Computing and Engineering (IJSCE) 1(6):120–124 ISSN: 2231-2307, 2012.
[29] Rakshith Saligram, T. R. Rakshith, “Parity preserving logic based fault tolerant reversible ALU”, IEEE Conference on Information & Communication Technologies, April 2013.
[30] Pankaj Bhardwaj, Maninder Singh, “An Improved Design of a Fault Tolerant Reversible Binary Parallel Multiplier”, International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-9, September2014.
[31] Nils Przigoda, Gerhard Dueck, Robert Wille, Rolf Drechsler, “Fault Detection in Parity Preserving Reversible Circuits”, IEEE 46th International Symposium on Multiple-Valued Logic, 2016.
[32] P. Oscar Boykin, Vwani P. Roychowdhury, “Reversible Fault-Tolerant Logic”, IEEE International Conference on Dependable Systems and Networks (DSN`05), 2005.
[33] Md. Asif Nashiry, Jacqueline E. Rice, “A Reversible Majority Voter Circuit and Applications”, IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM), Aug 2017.
[34] Masoud Zamani, Navid Farazmand, Mehdi B. Tahoori, “Fault Masking and Diagnosis in Reversible Circuits”, Sixteenth IEEE European Test Symposium, 2014.
Citation
Poornima M., M. S. Suma, "Fault Tolerant Parity Preserving Reversible Logic," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.259-264, 2018.
System Implementation and Testing of Proposed Language Independent Stemmer
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.265-273, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.265273
Abstract
Information Retrieval (IR) is an emerging discipline that involves methods, models and patterns to find the documents of an unstructured nature in the dynamic environment. Information Retrieval System (IRS) retrieves the user required information over billions of documents stored in millions of computers. Search Engine is playing a major role in Information Retrieval Systems (IRS) to identify the morphological variants of the language using Stemming. Stemming is an important pre-processing step in query-based systems such as IRS, Web Search Engine, Natural Language Processing (NLP), Big Data Analysis, etc. The purpose of stemming is to diminish different grammatical or word forms to a common base form. In this digital era, most of the web pages are designed using English and European languages. Similarly, the web pages designed with Indian and other Asian languages are also increasing. Search Engines available in Information Retrieval Systems required for dealing with the morphologically different languages in every fraction of a second. The study reveals that the approaches for developing the stemmer involve rule-based, machine learning and hybrid approach. However, each one of them has its own limitations. Therefore, it has been proposed to design the model for Language Independent Stemmer using Dynamic Programming (DP) to retrieve the multi-linguistic web documents with the greater speed and accuracy. However, this research paper presents system implementation and testing of Proposed Language Independent Stemmer (PLIS). The performance of the proposed LIS has been analyzed using a test bed.
Key-Words / Index Term
Information Retrieval, Stemming, EMILLE, Language Independent Stemmer, Dynamic Programming
References
[1] Mohd. Shahid Husain, “An Unsupervised Approach to Develop Stemmer”, In: International Journal on Natural Language Computing (IJNLC), Vol.1, Issue.2, pp.15-23, ISSN: 2278-1307, India, 2012.
[2] Sajjad Ahmad Khan, WaqasAnwarl, UsamaIjaz Bajwa1, and Xuan Wang, “A Light Weight Stemmer for Urdu Language: A Scarce Resourced Language”, In: Proceedings of the 3rd Workshop on South and Southeast Asian Natural Language Processing (SANLP), pp.69–78, India, 2012.
[3] Dhabal Prasad Sethi, “Design of Lightweight Stemmer for Odia Derivational Suffixes”, In: International Journal of Advanced Research in Computer and Communication Engineering, Vol.2, Issue.12, pp. 4594-4597, ISSN (Print): 2319-5940, ISSN (Online): 2278-1021, India, 2013.
[4] Sundar Singh, R K Pateriya, “Enhanced Suffix Stripping Algorithm to Improve Information Retrieval”, In: International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.115-119, E-ISSN: 2347-2693, India, 2015.
[5] Karaa WBA. “A New Stemmer to Improve Information”, In: International Journal of Network Security and Its Applications (IJNSA), Vol.5, Issue.4, pp.143–154, ISSN: 0974-9330, India, 2013.
[6] M. Kasthuri, Dr. S. Britto Ramesh Kumar, “A Framework for Language Independent Stemmer Using Dynamic Programming”, In: International Journal of Applied Engineering Research (IJAER), Vol.10, Number.18, pp.39000-39004, Online ISSN: 1087-1090, Print ISSN: 0973-4562, India, 2015.
[7] M. Kasthuri, Dr. S. Britto Ramesh Kumar, “PLIS: Proposed Language Independent Stemmer for Information Retrieval Systems Using Dynamic Programming”, In: 2016 World Congress on Computing and Communication Technologies, IEEE, pp.132-135, ISBN: 978-1-5090-5573-9, India, 2016.
[8] M.Kasthuri, “Proposed Architecture for Language Independent Stemmer”, In: International Open Access Journal of Emerging Technologies and Innovative Research (JETIR), Vol.5, Issue.10, pp.943-948, ISSN: 2349-5162, October 2018.
[9] NavanathSaharia, KishoriKonwar, M., Utpal Sharma, and JugalKalita, K., “An Improved Stemming Approach Using HMM for a Highly Inflected Language”, In: Springer-Verlag Berlin, ISBN: 9783642372476, Vol.7816, Issue.1, pp.164-173, Heidelberg, 2013.
[10] Garima Joshi, and Kamal Deep Garg, “Enhanced Version of Punjabi Stemmer Using Synset”, In: International Journal of Advanced Research in Computer Science and Software Engineering, Vol.4, Issue.5, pp.1060-1065, ISSN: 2277-128X, India, 2014.
[11] Anshu Sharma, Rakesh Kumar and VibhakarMansotra, “Proposed Stemming Algorithm for Hindi Information Retrieval”, In: International Journal of Innovative Research in Computer and Communication Engineering, Vol.4, Issue.6, pp. 11449-11455, ISSN(Online): 2320-9801, ISSN (Print): 2320-9798, June 2016.
[12] Abebe Belay Adege, YibeltalChanieManie, “Designing a Stemmer for Ge’ez Text Using Rule Based Approach”, In: International Journal of Scientific & Engineering Research, Vol.8, Issue.1, pp.1574-1578, ISSN: 2229-5518, Ethiopia, 2017.
[13] Robert A. N. de Oliveira and Methanias C. Junior “Experimental Analysis of Stemming on Jurisprudential Documents Retrieval”, In: Information, Vol.9, Issue.28, pp.1-34, Brazil, 2018.
[14] AttiaNehar, DjelloulZiadi, and HaddaCherroun, “Rational Kernels for Arabic Stemming and Text Classification”, In: Springer-Verlag Berlin Heidelberg, Vol.1, Issue.1, pp. 176–187, Algerie, 2015.
[15] M. Kasthuri, Dr. S. Britto Ramesh Kumar, “PLIS: Proposed Language Independent Stemmer Performance Evaluation”, In: International Journal of Advanced Research in Computer Science & Technology (IJARCST), Vol.5, Issue.4, pp.943-948, ISSN: 2347-8446 (Online), ISSN: 2347-9817 (Print), India, 2015.
[16] Gunadeep Chetia, Gopal Chandra Hazarika, “Pre-processing Phase of Automatic Text Summarization for the Assamese Language”, In: International Journal of Computer Sciences and Engineering, Vol.6, Issue.10, pp.159-163, E-ISSN: 2347-2693, India, 2018.
[17] Dharmendra Sharma, Suresh Jain, “Evaluation of Stemming and Stop Word Techniques on Text Classification Problem”, In: International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.2, pp.1-4, ISSN: 2320-7639, India, 2015.
[18] John Bosco.P, S.K.V.Jayakumar, “A Study on Web Based Image Search by Re-Ranking Techniques”, In: International Journal of Scientific Research in Network Security and Communication, Vol.5, Issue.3, pp.19-26, ISSN: 2321-3256, India, 2017.
Citation
M. Kasthuri, "System Implementation and Testing of Proposed Language Independent Stemmer," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.265-273, 2018.
Energy Efficient Compressive Sensing based Multi-focus Image Fusion Scheme for WVSN
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.274-280, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.274280
Abstract
Wireless Visual Sensor Networks (WVSN) is the enhanced version of WSN that captures and processes visual data from the environment. Owing to the numerous advantages, the WVSN is widely applicable in several real-time applications. The main considerations of WVSN are energy efficiency and quality. This work intends to propose an energy efficient compressive sensing based multi-focus image fusion scheme for WVSN. The image fusion is carried out by contourlet and curvelet, as these have multi-scale and multi-directional properties. The image fusion rule is framed by considering the energy of the pixels. Finally, the image reconstruction is carried out by CoSaMP (Compressive Sampling Matching Pursuit) algorithm. The performance of the proposed approach is tested in terms of image quality, energy and time consumption and the results are compared with the existing approaches. The proposed image fusion scheme outperforms the existing approaches, while proving better quality.
Key-Words / Index Term
WVSN, multi-focus image fusion, energy efficiency
References
[1] J.L. Starck, E.J. Candes, D.L. Donoho, “The curvelet transform for image denoising”, IEEE Transactions on Image Processing, Vol.11, No.6, pp.670-684, 2002.
[2] M.N. Do, M.Vetterli, "The contourlet transform: an efficient directional multi-resolution image representation", IEEE Transactions on Image Processing, Vol.14, No.12, pp. 2091-2106, 2005.
[3] G. Easley, D.Labate,W.Q.Lim, "Sparse directional image representations using the discrete shearlet transform, Appl.Comput.Harmon.Anal, Vol.25, No.1, pp.25-46, 2008.
[4] A.Khare, R.Srivastava, R.Singh, "Edge preserving image fusion based on contourlet transform,in: Proceedings of the 5th International Conference on Image and Signal Processing, Agadir, Morocco, pp.93–102, 2012.
[5] Atul Divekar ; Okan Ersoy, "Image fusion by compressive sensing", 17th International Conference on Geoinformatics, Fairfax, USA, 12-14 Aug, 2009.
[6] Morteza Ghahremani ; Hassan Ghassemian, "Remote Sensing Image Fusion Using Ripplet Transform and Compressed Sensing", IEEE Geoscience and Remote Sensing Letters, Vol.12, No.3, pp. 502-506, 2015.
[7] Jingbo Wei ; Lizhe Wang ; Peng Liu ; Xiaodao Chen ; Wei Li ; Albert Y. Zomaya, "Spatiotemporal Fusion of MODIS and Landsat-7 Reflectance Images via Compressed Sensing", IEEE Transactions on Geoscience and Remote Sensing, Vol. 55, No.12, pp.7126-7139, 2017.
[8] Zhen-Zhen Yang ; Zhen Yang, "Novel multifocus image fusion and reconstruction framework based on compressed sensing", IET Image Processing, Vol.7, No.9, pp. 837-847, 2013.
[9] V. Harikumar ; Prakash P. Gajjar ; Manjunath V. Joshi ; Mehul S. Raval, "Multiresolution Image Fusion: Use of Compressive Sensing and Graph Cuts", IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, Vol.7, No.5, pp. 1771-1780, 2014.
[10] Fuzhen Zhu ; Hongchang He ; Xiaofei Wang ; Qun Ding, "A New Multi-spectral Image Fusion Algorithm Based on Compressive Sensing", Fifth International Conference on Instrumentation and Measurement, Computer, Communication and Control, Qinhuangdao, China, 18-20 Sep, 2015.
[11] Vahdat Kazemi ; Hadi Seyedarabi ; Ali Aghagolzadeh, "Multifocus image fusion based on compressive sensing for visual sensor networks", 22nd Iranian Conference on Electrical Engineering, Tehran, Iran, 20-22 May, 2014.
[12] Tao Wan ; Nishan Canagarajah ; Alin Achim, "Compressive image fusion", 15th IEEE International Conference on Image Processing, 12-15 Oct, San Diego, USA, 2008.
[13] B. Sathyabama ; S.G. Siva Sankari ; S. Nayagara, "Fusion of satellite images using Compressive Sampling Matching Pursuit (CoSaMP) method", Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG), 18-21 Dec, Jodhpur, India, 2013.
[14] Yang Senlin ; Li Yuanyuan ; Wan Guobin, "Remote-sensing images fusion by compressed sensing in contourlet transform domain", IEEE Workshop on Advanced Research and Technology in Industry Applications (WARTIA), Ottawa, ON, Canada, 29-30 Sep, 2014.
[15] Xu Wei ; Wen Jianguo ; Chen Yinzhu, "Fusion of Remote Sensing Image with Compressed Sensing Based on Wavelet Sparse Basis", Sixth International Conference on Measuring Technology and Mechatronics Automation, Zhangjiajie, China, 10-11 Jan, 2014.
[16] Ye Zhang ; Jian Zhang, "The Image Fusion of Compressive Sensing with Adaptive Deviation Feature", International Conference on Intelligent Transportation, Big Data & Smart City, Xiamen, China, 25-26 Jan, 2018.
[17] P.G.Jaywantrao, S.Hasan, "Application of image fusion using wavelet transform in target tracking system", Int.J.Eng.Res.Technol., Vol.1, No.8, pp. 1-6, 2012.
[18] S.R. Bijitha, L.Mohan, M.M.Kartha, A.P.Kurian, K.P.Soman, "Modified wavelet image fusion based on SVD", Int.J.Eng.Res.Technol., Vol.1, No.9, pp. 1-8, 2012.
[19] L.Y.Du,Y.Jie,Z.Xu, "A new adaptive image fusion technique of CT and MRI images based on dual-tree complex wavelet transform", Appl.Mech.Mater., Vol. 411–414, pp.1189–1192, 2013.
[20] Do, Minh N., and Martin Vetterli. "The contourlet transform: an efficient directional multiresolution image representation." IEEE Transactions on image processing 14.12 (2005): 2091-2106.
[21] Subbulakshmi T.C., Dr. Gnanadurai, D., Dr. Muthulakshmi I., “Energy Conserving Forepart Detection Scheme with Dynamic Compressive Measurements based on Compressive Sensing for WVSN”, Journal of Internet Technology, Accepted, 2018.
[22] http://www.imagefusion.org
Citation
T. C. Subbu Lakshmi, D. Gnanadurai, I. Muthulakshmi, "Energy Efficient Compressive Sensing based Multi-focus Image Fusion Scheme for WVSN," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.274-280, 2018.
Scaling and Testing Refactoring Preconditions in Refactoring Engines
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.281-287, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.281287
Abstract
Demonstrating refactoring sound as for a formal semantics is viewed as a test. Designers compose test cases to check their refactoring implementations. However, it is troublesome and time expending to have a decent test suite since it requires complex sources of info (programs) and a prophet to check whether it is conceivable to apply the transformation. In the event that it is conceivable, the subsequent program must save the perceptible conduct. There are some computerized strategies for testing refactoring motors. In any case, they may have impediments identified with the program generator (comprehensiveness, setup, expressiveness), automation (sorts of prophets, bug classification), time utilization or sorts of refactoring that can be tried. This paper stretches out past system to test refactoring engines. It likewise clarifies the enhancement expressiveness of the program generator for testing more kinds of refactoring`s, such as Extract Function. Moreover, developers simply need to determine the information`s structure in an explanatory dialect. They may likewise set the system to skip some continuous test contributions to enhance performance. This additionally assesses strategy in 18 kinds of refactoring implementations of Java and distinguishes 35 bugs identified with aggregation blunders, behavioral changes, and overly strong conditions. This paper thinks about the effect of the skip on the time utilization and bug detection in this proposed method. By using a skip of 25 in the program generator, it decreases in 96%the times to test the refactoring implementations while missing only 3.9% of the bugs. In almost no time, it finds the principal failure related to aggregation blunder or behavioral change.
Key-Words / Index Term
Refactoring, overly strong preconditions, automated testing, program generation
References
[1] M. Schafer, T. Ekman, and O. de Moor, “Challenge proposal: verification of refactorings,” In PLPV, 2008, pp. 67–72.
[2] G. Soares, M. Mongiovi, and R. Gheyi, "Identifying overly strong conditions in refactoring implementations," in ICSM, 2011, pp. 173–182.
[3] G. Soares, R. Gheyi, and T. Massoni, "Automated behavioral testing of refactoring engines,” IEEE Transactions on Software Engineering, vol. 39, pp. 147–162, 2013.
[4] B. Daniel, D. Dig, K. Garcia, and D. Marinov, “Automated testing of refactoring engines,” in FSE, 2007, pp. 185–194.
[5] M. Gligoric, T. Gvero, V. Jagannath, S. Khurshid, V. Kuncak, and. Marinov, “Test generation through programming in UDITA,” in ICSE,2010, pp. 225–234.
[6] M. Gligoric, F. Behrang, Y. Li, J. Overbey, M. Hafiz, and D. Marinov, on reals"Systematic testing of refactoring engines software projects," inECOOP, 2013, pp. 629–653.
[7] D. Jackson, “Software Abstractions: Logic, Language, and Analysis.Revised edition. “The MIT Press, 2012.
[8] V. Jagannath, Y. Lee, B. Daniel, and D. Marinov, “Reducing the costs of bounded-exhaustive testing,” in FASE, 2009, pp. 171–185.
[9] M. Sch¨afer and O. Moor, “Specifying and implementing refactorings," in OOPSLA, 2010, pp. 286–301.
[10] D. Jackson, I. Schechter, and H. Shlyahter, “Alcoa: the Alloy constraint analyzer,” in ICSE, 2000, pp. 730–733.
[11] M. Mongiovi, R. Gheyi, G. Soares, L. Teixeira, and P. Borba, “Makingrefactoring safer through impact analysis,” SCP, 2014, In press.
[12] G. Soares, R. Gheyi, D. Serey, and T. Massoni, “Making program refactoring safer,” IEEE Software, vol. 27, pp. 52–57, 2010.
[13] W. Mckeeman, “Differential testing for software,” Digital TechnicalJournal, vol. 10, no. 1, pp. 100–107, 1998.
[14] E. Torlak and D. Jackson, “Kodkod: A relational model finder,” inTACAS. Wiley, 2007, pp. 632–647.
[15] G. Soares, R. Gheyi, E. Murphy-Hill, and B. Johnson, “comparing approaches to Analyze Refactoring Activity on Software Repositories, "JSS, pp. 1006–1022, 2013.
[16] W. Opdyke, “Refactoring Object-Oriented frameworks,” Ph.D. dissertation, the University of Illinois at Urbana-Champaign, 1992.
[17] L. Tokuda and D. Batory, “Evolving object-oriented designs with refactorings,” ASE, vol. 8, pp. 89–120, 2001.
[18] A. Garrido and R. Johnson, “Refactoring C with conditional compilation," in ASE, 2003, pp. 323–326.
[19] A. Garrido and R. E. Johnson, “Analyzing multiple configurations of a program,” in ICSM, 2005, pp. 379–388.
[20] F. Steinmann and A. Thies, “From public to private to absent: RefactoringJava programs under constrained accessibility,” in ECOOP, 2009, pp.419–443.
[21] P. Borba, A. Sampaio, A. Cavalcanti, and M. Cornelio, “Algebraic reasoning for Object-Oriented programming,” “SCP, vol. 52, pp. 53–100,2004.
[22] L. Silva, A. Sampaio, and Z. Liu, “Laws of Object-Orientation with reference semantics,” in SEFM, 2008, pp. 217–226.
[23] H. Li and S. Thompson, “Testing ErlangRefactorings withQuickCheck,” in IFL, 2008, pp. 19–36.
[24] M. Vakilian and R. E. Johnson, “Alternate refactoring paths reveal usability problems,” in ICSE, 2014, pp. 1–11.
[25] Melina Mongiovi Member, Rohit Gheyi, Gustavo Soares, Márcio Ribeiro, Paulo Borba, "Detecting overly strong preconditions in refactoring engines" IEEE 2017.
[26] Geeta Bagade, Shashank Joshi “Analysis of Aspect-Oriented Systems: Refactorings using AspectJ”
Vol.4, Issue .5, pp.76-80, May-2016
[27] ]Nagaveni, A. Ananda Rao, P. Radhika Raju, “Testing Refactoring Implementations of Object-Oriented Systems”
International Journal of Computer Sciences and Engineering, Vol.6 , Issue.7,pp.530-534, Jul-2018
Citation
Padakanti Divya, Karanam Madhavi, "Scaling and Testing Refactoring Preconditions in Refactoring Engines," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.281-287, 2018.
A Relative exploration of dark and bright lesions Segmentation techniques for early detection of Diabetic Retinopathy in retinal fundus images
Research Paper | Journal Paper
Vol.6 , Issue.11 , pp.288-298, Nov-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i11.288298
Abstract
Popular medical arena, Diabetic Retinopathy stands an oddity that arises into eyes which is gradually expanded and its diagnosis at a primary phase is very critical for retaining vision of several patients. A computerized mass screening of diabetic retinopathy in retinal pictures can assist in diminishing the probability of widespread blindness because of DR together with dropping the work-pressure on ophthalmologists. An automatic identification systems are also accessible which lead to explore numerous eye wounds like micro-aneurysms, haemorrhages , hard exudates and cotton wool exudates by means of colour fundus images. The existence of micro-aneurysms in the retinal images is the most indicative signal of diabetic retinopathy. Stable identification and classification of numerous lesions handle as an important criteria towards automatic grading and severity of the disease. Now we review the diverse previous studies which help in spontaneous diagnose the eye diseases with the intent of affording decision approval in extension to lessening the load of an ophthalmologist.
Key-Words / Index Term
Retinal coloured fundus images, Diabetic Retinopathy, optic disk, Red and bright lesions, image processing techniques, classification
References
[1] M. Usman Akram, Shehzad Khalid, Anam Tariq, Shoab A. Khan, Farooque Azam, “Detection and classification of retinal lesions for grading of diabetic retinopathy”, proceeding in Computers in Biology and Medicine. Elsevier 45(2014), pp: 161–171, Doi: 10.1016/j.compbiomed.2013.11.014
[2] Franklin SW, Rajan SE (2014) “Diagnosis of diabetic retinopathy by employing image processing technique to detect exudates in retinal images”, IET Image Proc 8(10), pp: 601–609, Doi: 10.1049/iet-ipr.2013.0565
[3] Usman Akram, Anam Tariq, Shoab A. Khan, M. Younus Javed, “Automated detection of exudates and macula for grading of diabetic macular edema” proceeding in computer methods and programs in Biomedicine 114 Elsevier (2014), pp: 141-152, Doi: 10.1016/j.cmpb.2014.01.010
[4] S. Wilfred Franklin, S. Edward Rajan, Computerized screening of diabetic retinopathy employing blood vessel segmentation in retinal images, Bio-cybernetics and Biomedical Engineering, Elsevier 34 (2014), pp: 117–124, Doi: 10.1016/j.bbe.2014.01.004
[5] Carla Pereira, Luís Gonçalves, Manuel Ferreira,” Exudate segmentation in fundus images using an ant colony Optimization approach” proceedings in Information Sciences, Elsevier 296 (2015) pp:14–24, Doi: 10.1016/j.ins.2014.10.059
[6] Dutta MK, Partha Sarathi M, Ganguly S, Ganguly S, Srivastava K (2015) An efficient image processing based technique for comprehensive detection and grading of non-proliferative diabetic retinopathy from fundus images, Computer Methods in Biomechanics & Biomedical Engineering: Imaging & Visualization 5(3), pp: 195–207, Doi: 10.1080/21681163.2015.1051187
[7] Amanjot Kaur, Prabhpreet Kaur, “An Integrated Approach for Diabetic Retinopathy Exudate Segmentation by Using Genetic Algorithm and Switching Median Filter” , proceeding in Image, Vision and Computing, Inter. Conf. IEEE (2016), Doi: 10.1109/ICIVC.2016.7571284
[8] Sarni Suhaila Rahim, Vasile Palade, James Shuttleworth, Chrisina Jayne, “Automatic screening and classification of diabetic retinopathy and maculopathy using fuzzy image processing”, Springer (2016), Doi: 10.1007/s00521-015-1929-5
[9] Sengar N, Dutta MK, “Automated method for hierarchal detection and grading of diabetic retinopathy” Computer methods in biomechanics and biomedical engineering: imaging and visualization. Taylor & Francis Publishers (2017), pp 1–11, Doi: 10.1080/21681163.2017.1335236
[10] Javeria Amin, Muhammad Sharif, Mussarat Yasmin, Hussam Ali, Steven Lawrence Fernandes , “A Method for the Detection and Classification of Diabetic Retinopathy Using Structural Predictors of Bright Lesions” proceedings in Journal of Computational Science, Elsevier 19 (2017), pp: 153-164, Doi: 10.1016/j.jocs.2017.01.002
[11] Sudeshna Sil Kar and Santi P. Maity , “Automatic Detection of Retinal Lesions for Screening of Diabetic Retinopathy” proceedings in IEEE Transactions on Biomedical Engineering, (2017), Doi: 10.1109/TBME.2017.2707578
[12] M.M. Habi, R.A. Welikala, A. Hoppe, C.G. Owen, A.R. Rudnicka, S.A. Barman, “Detection of microaneurysms in retinal images using an ensemble classifier” proceedings in Informatics in Medicine Unlocked, Elsevier 9 (2017), pp: 44–57, Doi: 10.1016/j.imu.2017.05.006
[13] Sumathi Thangaraj, Vivekanandan Periyasamy, Ravikanth Balaji, “Retinal vessel segmentation using neural network” proceedings in IET image processing (2017), Doi: 10.1049/iet-ipr.2017.0284
[14] Pedro Costa, Adrian Galdran, Asim Smailagic, and Aurelio Campilho, “A Weakly-Supervised Framework for Interpretable Diabetic Retinopathy Detection on Retinal Images”, IEEE (2017), Doi: 10.1109/ACCESS.2018.2816003
[15] Ashish Issac, Malay Kishore Dutta, Carlos M., “Automatic computer vision-based detection and quantitative analysis of indicative parameters for grading of diabetic retinopathy” proceedings in advances in bio-inspired intelligent systems: Neural Computing and Applications. Springer (2018), Doi: 10.1007/s00521-018-3443-z
[16] Yanhui Guo, Umit Budak, Lucas J.Vespa, Eiham Khorasani, Abdulkadir Sengur, “ A retinal vessel detection approach using convolution neural network with reinforcement sample learning strategy”, Measurement , Elsevier 125 (2018),pp:586–591,Doi: 10.1016/j.measurement.2018.05.003
[17] Jaskirat Kaur, Deepti Mittal, “Estimation of severity level of non-proliferative diabetic retinopathy for clinical aid” Biocybernetics and Biomedical Engineering , Elsevier, 38(2018), pp: 708-732, Doi: 10.1016/j.bbe.2018.05.006
[18] Manish Sharma, Praveen Sharma, Ashwini Saini and Kirti Sharma, “Modular Neural Network for Detection of Diabetic Retinopathy in Retinal Images” proceedings in Innovations and Computing, Smart Innovation, Systems and Technologies 79, Inter. Conf. on smart systems, Springer (2018), Doi:10.1007/978-3-319-67934-1_2
Citation
Jaspreet Kaur, Prabhpreet Kaur, "A Relative exploration of dark and bright lesions Segmentation techniques for early detection of Diabetic Retinopathy in retinal fundus images," International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.288-298, 2018.