Volume-1 Issue-7

  • Version
  • Download 0
  • File Size 0.00 KB
  • File Count 1
  • Create Date August 27, 2017
  • Last Updated September 6, 2017

Volume-1 Issue-7

Download Abstract Book

S. No

Volume-1 Issue-7, June 2013, ISSN: 2319–6386 (Online)
Published By: Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd. 

Page No.



Mohd Omar Fatehah, Md. Sohrab Hossain, Tjoon Tow Teng

Paper Title:

Comparative Study on Natural and Commercial Coagulants: Treatment of Semiconductor Wastewater in Sludge Production and Removal of Heavy Metals

Abstract: The objective of this study is to determine the coagulation efficiencies on total solids (TS) removal from semiconductor wastewater by applying various locally available starches as natural coagulants. Two commercial coagulants such as alum [Al2(SO4)3•18H2O] and polyaluminium chloride (PAC) were also utilized in this study in order to compare the coagulation efficiency with the natural coagulants. The EDX analysis of the raw semiconductor wastewater showed that it contained silica dioxide (SiO2) with a concentration of 90%.   It appeared that the natural coagulants employed in the study have similar coagulation characteristics with the commercial coagulants. However, the natural coagulants possess better metal adsorption capability than the commercial coagulants. A 3 level factorial experimental design was used in the Response Surface Methodology (RSM) analysis and indicated that starches are capable to remove TS from the semiconductor wastewater and the removal performance were almost similar to alum and higher than PAC.

Keywords: Heavy metals, natural coagulants, response surface methodology, semiconductor wastewater, total solids.


1.        M. I. Aguilar, J. Sáez, M. Lloréns, A. Soler, J. F. Ortuño, “Microscopic observation of particle reduction in slaughterhouse wastewater by coagulation–flocculation using ferric sulphate as coagulant and different coagulant aids,” Water Research, vol. 37(9), 2003, pp. 2233-2241.
2.        J. Beltrán-Heredia, J. Sánchez-Martín, “Improvement of water treatment pilot plant with Moringa oleifera extract as flocculant agent,” Environmental Technology, vol. 30(6), 2009, pp. 525-534.

3.        J. Beltrán-Heredia, J. Sánchez-Martín, A. Delgado-Regalado, C. Jurado-Bustos, “Removal of Alizarin Violet 3R (anthraquinonic dye) from aqueous solutions by natural coagulants,” Journal of Hazardous Materials, vol. 170(1), 2009, pp. 43-50.

4.        S. Bhatia, Z. Othman, A. L. Ahmad, “Pretreatment of palm oil mill effluent (POME) using Moringa oleifera seeds as natural coagulant,” Journal of Hazardous Materials, vol. 145, 2007,  pp.120-126.

5.        W. -L. Chou, C. -T. Wang, S. -Y. Chang, “Study of COD and turbidity removal from real oxide-CMP wastewater by iron electrocoagulation and the evaluation of specific energy consumption,” Journal of Hazardous Materials, vol. 168, (2009, pp.1200-1207.

6.        M. F. Chang, J. C. Liu, “Precipitation removal of fluoride from semiconductor wastewater,” Journal of Environmental Engineering, vol. 133(4), 2007, pp.419-425.

7.        T. –C. Chuang, C. J. Huang, J. C. Liu, “Treatment of semiconductor wastewater by dissolved air flotation,” Journal of Environmental Engineering, vol. 128(10), 2002, pp.974-980.

8.        M. D. G. de Luna, Warmadewanthi, J. C. Liu, “Combined treatment of polishing wastewater and fluoride-containing wastewater from a semiconductor manufacturer,” Colloids and Surfaces A: Physicochemical and Engineering Aspects, vol. 347, 2009, pp.64-68.

9.        M. O. Fatehah, M. S. Hossain, T. T. Teng,  “Semiconductor wastewater treatment using tapioca starch as a natural coagulant,” Journal of Water Resource and Protection, to be published.

10.     D. M. Greenlee, “An Electron Microprobe Evaluation of diagenetic alteration in archaeological bone,” Archaeological Chemistry, vol. 5, 1996, pp.334-354.

11.     J. Hollingsworth, R. Sierra-Alvarez, M. Zhou, K. L. Ogden, J. A. Field, “Anaerobic biodegradability and methanogenic toxicity of key constituents in copper chemical mechanical planarization effluents of the semiconductor industry,” Chemosphere, vol. 59, 2005, pp.1219-1228.

12.     S. -C. Hsu, H. -L. Hsieh, C. -P. Chen, C. -M. Tseng, S. -C. Huang, C. -H. Huang, Y. -T. Huang, V. Radashevsky, S. -H. Lin, “Tungsten and other heavy metal contamination in aquatic environments receiving wastewater from semiconductor manufacturing,” Journal of Hazardous Materials, vol. 189, 2011, pp.193-202.

13.     C. J. Huang, B. M. Yang, K. S. Chen, C. C. Chang, C. M. Kao, “Application of membrane technology on semiconductor wastewater reclamation: A pilot-scale study,” Desalination, vol. 278, 2011, pp.203-210.

14.     W. -H. Kuan, C. -Y. Hu, “Chemical evidences for the optimal coagulant dosage and pH adjustment of silica removal from chemical mechanical polishing (CMP) wastewater,” Colloids and Surfaces A: Physicochemical and Engineering Aspects, vol. 342(1–3), 2009, pp.1-7.

15.     C. L. Lai, S. H. Lin, “Treatment of chemical mechanical polishing wastewater by electrocoagulation: system performances and sludge settling characteristics,” Chemosphere, vol. 54(3), 2004, pp.235-242.

16.     C. Y. Lien, T. C. Liu, “Treatment of polishing wastewater from semiconductor manufacturer by dispersed air flotation,” Journal of Environmental Engineering, vol. 132, 2006, pp.51-57.

17.     S. H. Lin, C. D. Kiang, “Combined physical, chemical and biological treatments of wastewater containing organics from a semiconductor plant,” Journal of Hazardous Materials, vol. 97, 2003, pp.159-171.

18.     S. H. Lin, C. R. Yang, “Chemical and physical treatments of chemical mechanical polishing wastewater from semiconductor fabrication,” Journal of Hazardous Materials, vol. 108, 2004, pp.103-109.

19.     M. Malakootian, A. Almasi, H. Hossaini, “Pb and Co removal from paint industries effluent using wood ash,” International Journal of Environmental Science and Technology, vol. 5(2), 2010, pp.217-222.

20.     F. M. Omar, N. A. Nik Norulaini, A. Ahmad, “COD reduction in semiconductor wastewater by natural and commercialized coagulants using response surface methodology,” Water Air Soil Pollution, vol. 195, 2008, pp.345-352.

21.     P. K. Raghuwanshi, M. Mandloi, A. J. Sharma, H. S. Malviya, S. Chaudhari, “Improving filtrate quality using agrobased materials as coagulant aids,” Water Quality Research Journal Canada, vol. 37, 2002, pp.745-756.

22.     H. -D. Ryu, D. Kim, S. -I. Lee, “Application of struvite precipitation in treating ammonium nitrogen from semiconductor wastewater,” Journal of Hazardous Materials, vol. 156, 2008, pp. 163-169.

23.     M. Sciban, M. Klasnja, J. Stojimirovic, “Investigation of coagulation activity of natural coagulants from seeds of different leguminose species,” Acta Periodica Technologica, vol. 36, 2005, pp. 81-87.

24.     S. -H. You, D. -H. Tseng, G. -L. Guo, “A case study on the wastewater reclamation and reuse in the semiconductor industry,” Resources, Conservation and Recycling, vol. 32(1), 2001, pp. 73-81.

25.     J. Zhang, F. Zhang, Y. Luo, H. Yang, “A preliminary study on cactus as coagulant in water treatment,” Process Biochemistry, vol. 41(3), 2006, pp. 730-733.





S. Sri Abirami, S. J Grace Shoba

Paper Title:

Glaucoma Images Classification Using Fuzzy Min-Max Neural Network Based On Data-Core

Abstract: Glaucoma is the major cause of blindness in worldwide. It is an ophthalmologist disease characterized by an increase in Intraocular Pressure (IOP). The types of glaucoma are primary open angle or chronic glaucoma (POAG) and closed angle (or) acute glaucoma (CAG) which causes a slow (or) rapid rise in Intraocular Pressure (IOP). The iridocorneal angle between the iris and the cornea is the key used to differentiate OAG and CAG. The stratus Anterior Optical Coherence Tomography (AS-OCT) images with these diseases are detected and classified from the normal images using the proposed fuzzy min-max neural network based on Data-Core (DCFMN). Data-core fuzzy min-max neural network (DCFMN) has strong robustness and high accuracy in classification. DCFMN contains two classes of neurons: classifying neurons (CNs) and overlapping neurons (OLNs).CNs are used to classify the patterns of data. The OLN can handle all kinds of overlap in different hyper boxes. A new type of membership function considering the characteristics of data and the influence of noise is designed for CNs in the DCFMN. The membership function of Overlapping Neurons (OLNs) deals with the relative position of data in the hyper boxes. This algorithm is performed on a batch of 39 anterior segment- Optical Coherence Tomography (AS-OCT) images obtained from the Vasan Eye Care Hospital, Chennai. The performance of the proposed system is excellent and a classification rate of 97% is achieved. Hence using this neural network, the performance of classification of normal or abnormal (glaucoma affected images) is improved. This method also reduces the time taken for the diagnosis by the ophthalmologist.  

Glaucoma, DCFMN, AS-OCT image.


1.        Swindale, N.V., Stjepanovic, G., Chin, A., Mike berg, F.S.: “Automated analysis of normal and glaucomatous optic nerve head topography images” Investing Ophthalmic Vis Sci 41(7) (2000) 1730{1742}.
2.        Jun Cheng, Jiang Liu, Beng Hai Lee, Damon Wing Kee Wong, Fengshou YinTin Aung, Mani Baskaran, Perera Shamira, Tien Yin Wong “ Closed Angle Glaucoma Detection in RetCam Images” International Conference of the IEEE EMBS Buenos Aires, Argentina, August 31 - September 4, 2010.

3.        Rudiger Bocka, b,*, Jorg Meiera, Laszlo G.Nyulc, Joachim Horneggera, b, Georg Michelsond, b, e, “Glaucoma risk index: “Automated glaucoma detection from color fundus images” Medical image analysis 14(2010)471-481.

4.        Journal of Theoretical and Applied Information Technology k.narasimhan, 2 dr.k.vijayarekha “An efficient automated system for glaucoma detection using fundus image” November 15, 2011 vol. 33 no.1.

5.        IEEE transactions on neural networks, vol. 22, no. 12, December 2011 2339 “Data-core-based fuzzy min–max neural network for pattern classification” huaguang zhang, senior member, ieee, dazhong ma,and zhanshan wang, member, ieee.

6.        J. Meier, R. Bock, G. Michelson, J. Honegger, and L. G. Nyquil, “Effects of preprocessing eye fundus images on appearance based glaucoma classification,” 12th International Conference on Computer Analysis of Images and Patterns, Lect Notes Computer Science 4673, CAIP,  pp. 165–173, (Berlin), 2007.

7.        I. I. K. Ahmed AND L. D. Mackeen, “A new approach for imaging the angle”, Glaucoma Today, pp. 27-30, JULY/AUGUST 2007.

8.        M. Wolf a, R. Chrastek a, K. Donath,“Automated segmentation of the optic nerve head for diagnosis of glaucoma”, Medical Image Analysis in Elsevier, journal of  Functional Imaging and Modeling of the Heart, August 2005, pp 297-314.

9.        Bryan S. Morse. Lecture 15: “Segmentation” (edge based, Hough transform). Brigham Young University: Lecture Notes, (2000).

10.     Lester, M., Galway-Heath, D., Lemij, and H.: “Optic Nerve Head and Retinal Nerve Fibber Analysis” European Glaucoma Society (2005)

11.     Alsbirk PH. “Primary angle-closure glaucoma”: coulometer, epidemiology and genetics in a high risk population. Acta Ophthalmic 1976; 54:5-31.

12.     D Minckler, P Foster and PT Hung, “Angle Closure Glaucoma Classification and Racial Variation”, Asian Journal of Ophthalmology, vol. 3, no. 3, 4, 2001.

13.     P. Simpson, “Fuzzy min-max neural networks,” in Proc. 1991 Int. Joint Con Neural Networks (Singapore), Nov. 18-21, 1991, pp. 1658-1669.

14.     John F. Salmon, The diagnostic importance of gonioscopy,http://www.glaucomaworld.net/english/019/e019a01t.html.

15.     Zhou Zhang, Jiang Liu, Wing Kee Wong, “Neuro-Retinal Optic Cup Detection in Glaucoma Diagnosis”, IEEE Proceedings of the 2nd International Conference on Biomedical Engineering and Informatics, Oct 2009, pp 1-4.





Vijay Kumar, Sunil Kumar, Ajay Kumar Singh 

Paper Title:

Outlier Detection: A Clustering-Based ApproachOutlier Detection: A Clustering-Based Approach

Abstract: Outlier detection is a fundamental issue in data mining; specifically it has been used to detect and remove anomalous objects from data. It is an extremely important task in a wide variety of application domains. In this paper, a proposed method based on clustering approaches for outlier detection is presented. We first perform the Partitioning Around Medoids (PAM) clustering algorithm. Small clusters are then determined and considered as outlier clusters. The rest of outliers (if any) are then detected in the remaining clusters based on calculating the absolute distances between the medoid of the current cluster and each one of the points in the same cluster. Experimental results show that our method works well.

 PAM, Clustering, Clustering-based outliers, Outlier detection.


1.        J. Queen Mac, “Some methods for classification and analysis of multivariate observations”, Proc. 5th Berkeley Symp. Math. Stat. and Prob, pp. 281-97, 1967.
2.        J. Zhang and H. Wang, “Detecting outlying subspaces for high-dimensional data: the new Task, Algorithms, and Performance”, Knowledge and Information Systems, vol. 10, no. 3,  pp. 333-355, 2006.

3.        K. Yoon, O. Kwon and D. Bae, “An approach to Outlier Detection of Software Measurement Data using the K-means Clustering Method”, First International Symposium on Empirical Software Engineering and Measurement (ESEM 2007), Madrid, pp. 443-445, 2007.

4.        T. Velmurugan and T. Santhanam, “A Survey of Partition based Clustering Algorithms in Data Mining: An Experimental Approach”, Information Technology, Journal, vol. 10, no. 3, pp. 478-484, 2011.

5.        M. Laan, K. Pollard and J. Bryan, “A New Partitioning Around Medoids Algorithms”, Journal of Statistical Computation and Simulation, vol. 73, no. 8, pp. 575-584, 2003.

6.        J. Han and M. Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2nd Ed., 2006.

7.        P. Bradley, U. Fayyad and O. Mangasarian, “Mathematical Programming for Data Mining: Formulations and Challenges”, INFORMS Journal on Computing vol. 11, no. 3, pp. 217–238, 1999.

8.        F. Angiulli and C. Pizzuti, “Outlier Mining in Large High-Dimensional Data Sets”, IEEE Trans. on Knowledge and Data Engineering, vol. 17, no. 2, pp. 203-215, 2005.

9.        K. Niu, C. Huang, S. Zhang, and J. Chen, T. Washio et al. “ODDC: Outlier Detection Using Distance Distribution Clustering”, (PAKDD 2007) Workshops, Lecture Notes in Artificial Intelligence (LNAI), pp. 332–343, Springer-Verlag, 2007.

10.     J. Chiang and Z. Yin, “Unsupervised minor prototype detection using an adaptive population partitioning algorithm”, Pattern Recognition, pp. 3132 – 3145, 2007.





S. M. Nandhagopal, S. N. Sivanandam

Paper Title:

Analysis of Data Delivery Issues in MANET Using Implementation of MTOOR Algorithm

Abstract: This research paper addresses the issues of reliable data delivery in mobile ad- hoc network and implies a new (Moving Target Oriented Opportunistic Routing) Algorithm for which existing routing protocols are not suitable. This algorithm is implemented in Wireless Routing protocol (WRP) which is good in delivering the data in highly dynamic MANETs. This WRP has an issue in the over heading problem and less data security. So I propose a new proactive routing algorithm known as MTOOR routing algorithm. This algorithm provides good result for delivering data in highly dynamic ad-hoc networks by searching the target node and updating all the information for delivering data without over heading. This proposed scheme works efficiently in a large network of high mobility nodes and this concept is implemented using OMNeT++ environment. The main Objective of the paper is to reduce the high overheads and improve the routing performance in a proactive protocol WRP by reducing the Overheads.

Moving Target oriented Opportunistic Routing, WRP, and Data Delivery.


1.        International Journal of Distributed Sensor Networks Volume 2013 (2013), Article ID 692146—the concept of any moving node
2.        J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, 1998.

3.        B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, pp. 243- 254, 2000.

4.        S. Biswas and R. Morris, “EXOR: Opportunistic Multi-Hop Routing for Wireless Networks,” Proc. ACM SIGCOMM, pp. 133-144, 2005.

5.        J. Pelissier. “Providing quality of service over InfinibandT M architecture fabrics”. In Proceedings de Hot Interconnects,2000.

6.        E. Bommai ah, M. Liu, A. McAuley, and R. Talpade, AMRoute: Ad Hoc Multicast Routing Protocol, Internet Draft,

7.        S. Chakrabarti and A. Mishra, QoS Issues in Ad Hoc Networks, IEEE Communications Magazine, Feb. 2001, pp. 142–148.

8.        S. Chen, Routing Support for Providing Guaranteed End-to-EndQuality-of-Service, http://www.cs.uiuc.edu/Dienst/UI/2.0/Describe/ncstrl.uiuc_cs/UIUCDCS-R-99–2090, UIUCDCS-R- 99–2090, University of Illinois at Urbana–Champaign, July 1999.

9.        X. Chen an d X.D. Jia, Package Routing Algorithms in Mobile Ad Hoc Networks, Proc. of the Workshop on Wireless Networks and Mobile Computing held in conjunction with the 2001 International Conference on Parallel Processing, Sep. 2001, pp. 485–490.

10.     X. Chen, J. Wu, and X.D. Jia, Prefix Routing in Wireless Ad Hoc Networks of Mobile Stations, Technical Report, FAU-CSE-02–13, Florida Atlantic University, Boca Raton, FL, May 2002.

11.     C.-C. Chiang, M. Gerla, and L. Zhang, Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks, Cluster Computing, 1998, p. 187.

12.     T.H. Corm en, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1997.

13.     S.E. Deerin g and D.R. Cheriton, Multicast Routing in Datagram Internetworks and Extended LANs, ACM Transactions on Computer Systems, 1990, pp. 85–111.





Deval G. Patel

Paper Title:

Point Pattern Matching Algorithm for Recognition of 36 ASL Gestures

Abstract: Hand gesture recognition is a way to create a useful, highly adaptive interface between machines and their users. The recognition of gestures is difficult because gestures exhibit human variability. Sign languages are used for communication and interface . There are various types of systems and methods available for sign languages recognition. Our approach is robust and efficient for static hand gesture recognition. The main objective of this paper is to propose a system which is able to recognize 36  static hand gestures of  American Sign Language (ASL) for letter A- Z and digits 0-9 successfully and also it is able to perform the classification on static images correctly in real time. We proposed a novel method of pattern recognition to recognize symbols of the ASL based on the features extracted by SIFT algorithm and its performance is compared it with widely used methods such as PCA and Template Matching.

ASL, Hand Gesture Recognition System, PCA, Point Pattern Matching Algorithm.


1.        Daniel ThalmNN, Gesture Recognition Motion Capture, Motion Retargeting, and Action Recognition, EPFL – VRlab, pp. 1-22.
2.        Aditya Ramamoorthy et al. “Recognition of dynamic hand gestures “,Department of Electrical Engineering IIT New Delhi-110016 India. October 2002, pp. 1-13.

3.        Rafiqul Zaman Khan, Noor Adnan Ibraheem, Hand Gesture Recognition: a literature review,IJAIA 2012.

4.        Ravikiran.J, Kavi Mahesh, Suhas Manishi, Dheeraj.R, Sudheendar.S, Nithin.V.Pujari, “On finger detection for sign language recognition”,  Hong Kong, March 18, 2009.

5.        Sylvie Gibet and Pierre Francois Marteau, “On Approximation of curvature and velocity for gesture segmentation and synthesis”,Universite de Brertagne France, 2009.

6.        David Rybach, Prof Dr. J. Brochers, Prof Dr.H. Ney, Appearance based features for automatic continuous sign language recognition”.

7.        Yasushi Hamada, Nobutaka Shimada and Yoshiaki Shirai, “on Hand  shape estimation for complex background images”, Osaka University, Japan, 2004.

8.        Manglai Zhou, “3D model based hand gesture recognition and tracking”, Pami lab, university of Waterloo, December 3,2009.

9.        Lars Bretzner, Ivan Laptev, Toney Lindberg, On Hand gesture  recognition using multiscale colour features hierarchiel models and partial filtering, CVAP Laboratory, Department of numerical analysis  and Computer Science, Sweden,2002.

10.     Vaishali S Kulkarani, ME Digital Systems, S. D. Lokhande,  “Appearance based segmentation of sign language using gesture   segmentation”, Sinhgad College of Engineering, 2010.

11.     Wei-Lun Chao, “Introduction to Pattern Recognition”, National Taiwan University, Taiwan, October, 2009, pp. 1-31.





Kirubhakar Gurusamy, Venkatesh Chakrapani

Paper Title:

An assessment of Identity Security in Data Mining

Abstract: Privacy preserving becomes an important issue in the development progress of data mining techniques. Privacy preserving data mining has become increasingly popular because it allows sharing of privacy-sensitive data for analysis purposes. So people have become increasingly unwilling to share their data. This frequently results in individuals either refusing to share their data or providing incorrect data. In turn, such problems in data collection can affect the success of data mining, which relies on sufficient amounts of accurate data in order to produce meaningful results. In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed for privacy preserving data mining of multidimensional data records. This paper intends to reiterate several privacy preserving data mining technologies clearly and then proceeds to analyze the merits and shortcomings of these technologies.

Privacy preserving; data mining.


1.        P. Samarati, “Protecting respondent’s privacy in micro data release”, In IEEE Transaction on Knowledge and Data Engineering, 2001.
2.        V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis, “State-of-the-art in privacy preserving data mining”, In Proc of ACM SIGMOD, 2004.

3.        Ackerman, M. S., Cranor, L. F., and Reagle, J, “Privacy in ecommerce: examining user scenarios and privacy preferences”, In Proc. EC99, 1999.

4.        W. Du, Y. Han, and S. Chen, “Privacy-preserving multivariatestatistical analysis: Linear regression and classification”, In Proceedings of the Fourth SIAM International Conference on Data Mining, 2004.

5.        K. Chen and L. Liu, “Privacy preserving data classification with rotation perturbation”, In Proceedings of the Fifth International Conference of Data Mining (ICDM’05), 2005.

6.        K. Liu, H. Kargupta, and J. Ryan, “Random Projection-Based Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining”, IEEE Transactions on Knowledge and Data Engineering (TKDE), January 2006.

7.        P. Samarati and L. Sweeney, “Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression”, In Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory, 1998.

8.        L. Sweeney, “k-anonymity: a model for protecting privacy”,International Journal on Uncertainty, Fuzziness and Knowledgebased Systems, 2002.

9.        WONG R C, LI J, FU A W, eta1, “(α, k)-Anonymityan enhanced k-anonymity model for privacy-preserving data publishing , Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, New York, 2006.

10.     Agrawal, R. and Srikant, R, “Privacy-preserving data mining”, In Proc. SIGMOD00, 2000.

11.     Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J, “Privacy preserving mining of association rules”, In Proc. KDD02, 2002.

12.     Hong, J.I. and J.A. Landay, “An Architecture for Privacy Sensitive Ubiquitous Computing”, In Mobisys04.

13.     S. Laur, H. Lipmaa, and T. Mielik¨ainen, “Cryptographically private support vector machines”, In Twelfth ACM SIGKDD International Conference on Knowledge
Discovery and Data Mining, 2006.

14.     Ke Wang, Benjamin C. M. Fung, and Philip S. Yu, “Template-based privacy preservation in classification problems”, In ICDM, 2005.

15.     M. Kantarcioglu and C. Clifton, “Privacy-preserving distributed mining of association rules on horizontally partitioned data”, In Proc. of DKMD’02, June 2002.

16.     H. Polat and W. Du, “SVD-based collaborative filtering with privacy”, In The 20th ACM Symposium on Applied Computing, Track on Ecommerce Technologies, Santa Fe, New Mexico, 2005.

17.     S. Meregu and J. Ghosh, “Privacy-preserving distributed clustering using generative models”, In Proceedings of the third IEEE International Conference on Data Mining (ICDM’03), Melbourne, Florida, 2003.

18.     Charu C. Aggarwal and Philip S. Yu, “A condensation approach to privacy preserving data mining”, In EDBT, 2004.

19.     Ke Wang, Philip S. Yu, and Sourav Chakraborty, “Bottom-up generalization: A data mining solution to privacy protection”, In ICDM, 2004.

20.     H. Yu, X. Jiang, and J. Vaidya, “Privacy-preserving svm using nonlinear kernels on horizontally partitioned data”, In SAC ’06:Proceedings of the 2006 ACM symposium on Applied computing, New York, USA, 2006.





G. Mahalakshmi, A. Sivasankar

Paper Title:

Lossless Compression of Hyperspectral Images Using Hybrid Based Clustering DPCM

Abstract: This project explores the use of hybrid clustering technique for lossless compression method for Hyperspectral images. It is based on the joint use of fuzzy c means and nearest neighbor algorithms. In this method, linear prediction is performed using coefficients optimized for each spectral cluster separately. The difference between the prediction and original values is entropy coded using an adaptive range coder for each cluster. The result shows that this method has lower bit-per-pixel value. It is an extension to the existing lossless compression algorithm. Better partitioning of data is achieved. The technique starts with the fuzzy c means algorithm, performed as the first stage for an adequately high number of centroids and continues with the nearest neighbour algorithm executed for the clusters obtained in the first stage, as the set of initial objects to be merged for relatively complex shapes.

Hyperspectral images, image compression, lossless compression.


1.        J. Mielikainen, “Lossless compression of hyperspectral images using clustered linear prediction with adaptive prediction length,” IEEE Signal Process. Lett., vol. 9, no. 6, pp. 157–160, mar. 2012.
2.        J.Mielikainen and P. Toivanen, “Lossless Hyperspectral-image compression using context based conditional average,” IEEE Trans. Geosci. Remote Sens., vol. 41, no. 12, pp. 2943–2946, Dec. 2009.

3.        C.-C. Lin and Y.-T.Hwang, “Hyperspectral image compression using three dimensional wavelet coding,” IEEE Geosci.RemoteSens.Lett., vol. 7, no. 3, pp. 558 562, Nov. 2009.

4.        M. Slyz and L. Zhang, “A block-based inter-band lossless Hyperspectral image compressor,” in Proc. IEEE Data Comp. Conf., 2005, pp. 427–436,Sep.2009.

5.        A. Abrardo, M. Barni, E. Magli, and F. Nencini, “Error-resilient and low-complexity onboard lossless compression of hyperspectral images by means of distributed source coding,” IEEE Trans. Geosci. Remote Sens., vol. 48, no. 4, pp. 1892–1904, Mar. 2009.

6.        B. Huang and Y. Sriraja, “Lossless compression of hyperspectral imagery via lookup tables with predictor selection,” in Proc. SPIE, 2006, pp. 63 650L.1–63 650L.8.

7.        B. Aiazzi, L. Alparone, and S. Baronti, “Quality issues for compression of Hyperspectral imagery through spectrally adaptive DPCM,” in SatelliteData Compression. New York: Springer-Verlag.

8.        A. K. Jain, “Data clustering: 50 years beyond k-means,” Pattern Recognit. Lett., vol. 31, no. 8, pp. 651–666, Jun. 2010.

9.        A. B. Kiely and M. A. Klimesh, “Exploiting calibration-induced artifacts in lossless compression of hyperspectral imagery,” IEEE Trans. Geosci.Remote Sens., vol. 47, no. 8, pp. 2672–2678, Aug. 2009.





P. Keerthana, A. Sivasankar

Paper Title:

The Impact of Lossy Compression on Hyperspectral Data Adaptive Spectral Unmixing and PCA Classification

Abstract: In the past, scientific data have been almost exclusively compressed by means of lossless methods, in order to preserve their full quality. However, more recently, there has been an increasing interest in the lossy compression which has not yet globally accepted by the remote sensing community, mainly because it is sensed that the lossy compressed images may affect the results of posterior processing stages. Hence here, the influence of lossy compression on two standard approaches for hyperspectral data exploitation known as adaptive spectral unmixing, and supervised classification using PCA are considered. The experimental result states that the adaptive spectral unmixing provides a user defined spatial scale which improves the process of extraction of end members and PCA improves the classification accuracy. It is also observed that, for certain compression techniques, a higher compression ratio may lead to more accurate classification results. This work further provides recommendations on best practices when applying lossy compression prior to hyperspectral data classification and/or unmixing.

Hyperspectral data lossy compression, end member extraction, adaptive spectral unmixing, wavelet transform, support vector machine (SVM), Principal component analysis.


1.        G. Motta, F. Rizzo, and J. A. Storer, Eds., Hyperspectral Data     compression Berlin, Germany: Springer-Verlag, 2006.
2.        J. Serra-Sagristà and F. Aulí-Llinàs, “Remote Sensing Data Compression,” in Computational Intelligence for Remote Sensing. Berlin, Germany: Springer-Verlag, Jun. 2008, pp. 2761.

3.        B. Penna, T. Tillo, E. Magli, and G. Olmo, “Transform coding techniques for lossy hyperspectral data compression,” IEEE Trans. Geosci. Remote Sens., vol. 45, no. 5, pp. 1408–1421, May 2007.

4.        C.-I Chang and Q. Du, “Estimation of number of spectrally distinct signal sources in hyperspectral imagery,” IEEE Trans. Geosci. Remote Sens., vol. 42, no. 3, pp. 608–619, Mar. 2004.

5.        A. Plaza, P. Martínez, R. Pérez, and J. Plaza, “A quantitative and comparative analysis of endmember extraction algorithms from hyperspectral data,” IEEE Trans. Geosci. Remote Sens., vol. 42, no. 3, pp. 650–663, Mar. 2004.

6.        M. E. Winter, “N-FINDR: An algorithm for fast autonomous spectral end-member determination in hyperspectral data,” in Proc. SPIE ImageSpectrometry V, vol. 3753, pp. 266–277, 2003.

7.        J. M. P. Nascimento and J. M. Bioucas-Dias, “Vertex component analysis: A fast algorithm to unmix hyperspectral data,” IEEE Trans. Geosci.Remote Sens., vol. 43, no. 4, pp. 898–910, Apr. 2005.





V. Amirthavalli, S. Veluchamy

Paper Title:

Deployment of Mobile Sensor Node and Asynchronous Power Management

Abstract: The main motivation is to reduce power consumption in wireless transmission networks. In Wireless transmission networks power management and node deployment are the important factors in wireless transmission networks. In the previous methods, power can be reduced even though the nodes are remains in sleep mode. But the novel approach is proposed to reduce power in active condition. The main advantage is that the nodes are deployed in automatic manner which overcomes manual deployment. Nodes are used to cover maximum area with highly accurate localization mechanism can be done by ECDH protocol. Grid deployment is used for automatic node deployment in networks. The grid with minimum value technique is the important method to place the mobile node in the networks. Node uses power only in the active condition, whenever it needs to transmit data.

Dynamic Power Management, Grid Deployment., Mobile Sensor Node Deployment, Particle filter algorithm.

1.        Kejie Lu, Yi Qian, Jiankun Hu., “A Framework for Distributed Key Management Schemes in Heterogeneous Wireless Sensor Networks,” in 2006 IEEE.
2.        Makhamisa Senekane, Sehlabaka Qhobosheane, and B.M. Taele., “Elliptic Curve Diffie-Hellman Protocol Implementation Using Picoblaze,” IJCSNS International Journal of Computer Science and Network Security., VOL.11 No.6, June 2011.

3.        Christian Lederer, Roland Mader, Manuel Koschuch, Johann Großsch¨adl, Alexander Szekely, and Stefan Tillich.,“ Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor Networks” in IFIP International Federation for Information Processing 2009.

4.        S.Pradheepkumar, V.Vijayalakshmi and G. Zayaraz, “Implementation of Pseudo-Random Route-Driven ECDH Scheme for Heterogeneous Sensor Networks” International Journal of Communication Networks and Information Security (IJCNIS) Vol. 2, No. 1, April 2010

5.        Edoardo S. Biagioni, Galen Sasaki, “Wireless Sensor Placement For Reliable and Efficient Data Collection,"proceedings of the 36th Annual Hawaii international Conference System Sciences, 2003, 6-9 Jan 2003.

6.        Heo .N. and Varshney.P.K., “A distributed self-spreading algorithm for mobile wireless sensor networks,” in Proc. WCNC, Mar. (2003), vol. 3,pp. 1597–1602.

7.        Howard.A.,Matari’c.M.J., and Sukhatme.G.S., “Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem,” in Proc. 6th Int. Symp. DARS, Jun. 25–27, 2002, pp. 299–308.

8.        Poduri.S.and Sukhatme.G.S., “Constrained coverage for mobile sensor networks,” in Proc. IEEE ICRA, May (2004), vol. 1, pp. 165–171.

9.        Rahimi.M., Shah.H., Sukhatme.G., Heidemann.J., and Estrin.D., “Studying the feasibility of energy harvesting in a mobile sensor network,” in Proc. ICRA, Sep. (2003), vol. 1, pp. 19–24.

10.     Wang. G., Cao.G., and Porta.T.F.L., “Movement-assisted sensor deployment,” in Proc. 23rd Annu.Joint Conf. IEEE Comput.Commun. Soc.(INFOCOM), Mar. (2004), vol. 4, pp. 2469–2479.

11.     Gungor.V.C. and Hancke.G.P., “Industrial wireless sensor networks: Challenges, design principles, and technical approaches,” IEEE Trans.Ind. Electron., vol. 56, no. 10, pp. 4258–4265, Oct. (2009).

12.     R. C. Luo, L. C. Tu, and O. Chen, “Auto-deployment of mobile nodes in wireless sensor networks using grid method,” in Proc. IEEE ICIT, Hong Kong, 2005, pp. 359–364.

13.     Abraham O. Fapojuwo and Alejandra Cano-Tinoco, “Energy Consumption and Message Delay Analysis of QoS Enhanced Base Station Controlled Dynamic Clustering Protocol for Wireless Sensor Networks," IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 10, OCTOBER 2009

14.     Maisam-Mohammadian†1Nasser-Mozayani, “2 Way Authentications for IMS by ECDH," in  J. Basic. Appl. Sci. Res., 2(9)9378-9382, 2012.

15.     Patrick Traynor, Raju Kumar, Heesook Choi, Guohong CaoSencun Zhu, and Thomas La Porta., “Efficient Hybrid Security Mechanisms for Heterogeneous Sensor Networks," IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 6, NO. 6, JUNE 2007.





Yukthi B. R, Savitha A. P, M. B. Anandaraju, Nuthan A. C

Paper Title:

FPGA Based Implementation of Image Encryption Using Scan Patterns and Carrier Images

Abstract: This paper presents an FPGA implementation of image encryption method using carrier images and scan patterns generated by scan methodology. The scan is a language-based two-dimensional spatial-accessing methodology which can efficiently specify and generate a wide range of scanning paths. Then scanning paths sequence fill in original image. The carrier image is created with the help of alphanumeric keyword. Each alphanumeric key will be having a unique 8bit value generated by 4 out of 8-code.This newly generated carrier image is added with the original image to obtain encrypted image. The scan methodology is applied to either original image or carrier image, after the addition of original image and carrier image to obtain the highly distorted encrypted image. By applying the reverse we get the decrypted image.  Reversible logic is most popular concept in energy efficient computations and this will be demand for upcoming future computing technologies. The proposed paper will be simulated using Xilinx simulator and implemented in Xilinx FPGA platform.

Carrier image, Encryption, Scan patterns, 4 out of 8-code.

1.        S.R.M Prasanna, Y.V. Subba Rao and A. Mitra., “An Image Encryption method with Magnitude and Phase Manipulation using carrier images”, IJCS, vol. 1,No 2, pp.132-137,2006.
2.        Chao Shen Chen and Rong Jian Chen “Image encryption and decryption using SCAN methodology,” Proc. PDCAT, 2006.

3.        S.S. Maniccam and N.G.Bourbakis, “Image and video encryption using SCAN patterns,” Pattern Recognition, vol.37, pp.725-737, 2004.

4.        Panduranga H.T, Naveenkumar s.k, “A novel 3-step combinational approach for image encryption”, IJCEIT, vol 03, 2009.

5.        Panduranga H.T, Naveenkumar s.k, “A novel image encryption method using 4outof8 code”, Proc. CommV’09, pp 460-462, 2009.





Vandana, Yusuf Mulge

Paper Title:

A Review on QoS Multicast Routing Protocols for MANETs & Internet

Abstract: Multicasting is a technique used for distributing data packets from one or more   sources to a set of receivers on interconnected networks. Currently developing   network   applications   bring   specific   quality   of   service   (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. Multicasting can minimize the link bandwidth consumption and reduce the communication cost by sending the same data to multiple participants. Multicast service is critical for applications that need collaboration of team of users. Multicasting in MANETs and internet becomes a hot research area due to the increasing popularity of group communication applications such as video conferencing and interactive television. Recently, multimedia and group-oriented computing gains more popularity for users of ad hoc networks. In this paper we are presenting an overview of set of the most recent QoS multicast routing protocols that have been proposed in order to provide the researchers with a clear view of what has been done in this field and how modified protocols can be designed using these protocols.

MANETs, Multicasting, QoS, Routing.


1.        Aisha-Hassan A. Hashim , Mohammad M. Qabajeh, Othman Khalifa and Liana Qabajeh “Review of Multicast QoS Routing Protocols for Mobile Ad Hoc Networks”, International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008.
2.        Bill Fenner,Mark Handley,Hugh Holbrook,Isider Kouvehi,”Protocol Independent Mulicast-Sparse Mode”,Intenet Engg.Task Force(IEFT) RFC2362,20th March 2006.

3.        Carlberg, K., Crowcroft, J., “Building shared trees using a one-to-many joining mechanism”, ACM Computer Communication Review, pp. 5-11,1997

4.        Chen, S., Nahrstedt, K., Shavitt, Y., “A QoS-Aware Multicast Routing Protocol”, IEEE JSAC, vol. 18, no. 12, pp. 2580–2592, December 2000.

5.        C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector routing,” in Proc. 2nd IEEE Workshop on Mobile Computer Systems and Application, New Orleans, LA, vol. 1, Feb. 1999, pp. 90-100.

6.        Chen, S., Shavitt, Y., “A Scalable Distributed QoS Multicast Routing Protocol”, DIMACS TR 2000-18, Department of Computer Science, University of Illinois at Urbana-Champaign, 2000.

7.        Chen, S., Shavitt, Y., “A scalable distributed QoS multicast routing protocol”, IEEE International Conference on Communications, vol. 2, pp. 1161-1165, 2004.

8.        E. Royer and C. Perkins, (2000, Jul.). Multicast ad hoc on-demand distance vector(MAODV) routing. IETF Intemet Draft. Available:http://tools.ietf.org/id/draft-ietf-manet-maodv-00.txt.

9.        E.M. Royer, and C. E. Perkins, “Multicast operation of the ad hoc on-demand distance vector routing protocol,” in Proc. 5th Annu. ACM/IEEE Int. Conf. Mobile Computing and Networking, Seattle, WA,1999, pp. 207-217.

10.     Faloutsos, M., Banerjea, A., Pankaj, R., “QoSMIC: Quality of Service sensitive multicast Internet protocol”, Proceedings of the ACM SIGCOMM, pp. 144-153, 1998.

11.     Handley, M., Jacobson, V., “SDP: Session Directory Protocol (draft2.1)”, Internet Draft (February 1996), January 2004.

12.     Li, L., Li, C., “A QoS-guaranteed multicast routing protocol”, Computer Communications, vol. 27, no. 1, pp. 59-69, January 2004.

13.     Q. Xue and A. Ganz, “Ad hoc QoS on-demand routing (AQOR) in mobile ad-hoc networks,” J. Parallel and Distributed Computing, Vol. 63, Issue 2, 2003, pp 154-165.

14.     Vida Lashkari B. O., Mehdi Dehghan, “QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing” Proceedings of the World Congress on Engineering 2007 Vol II WCE 2007, July 2 - 4, 2007, London, U.K.

15.     Yan, S., Faloutsos, M., Banerjea, A., “QoS-Aware Multicast Routing for the Internet: The Design and Evaluation of QoSMIC”, IEEE/ACM Transactions on Networking, vol. 10, no. 1, pp. 54-66, February 2002.

16.     “PIM-SM Multicast Routing Protocol” on

17.     http://technet.microsoft.com/en-us/library/bb742462.aspx.





S. Ahmed, S. M. Nirkhi

Paper Title:

Fuzzy Forensic Analysis System for DDoS Attack in MANET Response Analysis

Abstract: Mobile Ad Hoc Networks (MANET) are wireless communication network; in which self capable mobile nodes can dynamically self organize into ad hoc topologies. Seamless interconnection with each other without pre-existing infrastructure makes MANET scalable. In turn scalability also increases the scope of security threats. Dynamic nature of MANET calls for self route management routing algorithm like DSR. Attacks at discovery phase of DSR to discover the route could be launched by attacker/malicious node by flooding (violating broadcasting rules) the route request message (RREQ) and prohibit the normal working of network for duration of time. Flooding is a kind of denial of service (DoS/DDoS) attack. When an attack on the target system is successful enough to hamper the normal working of network, this event triggers investigation. Network forensic analysis is done to analyze the attack scenario and to come up with digital proof against the attacker/attackers. To gather the proof there is the need to empirically analyze the evidential knowledge. Fuzzy logic is good choice for empirical analysis. So, we have implemented a fuzzy forensic analysis system. In this paper, we analyzed the response of fuzzy forensic analysis system that we have implemented.  

DDoS attack; Dynamic source routing; Fuzzy logic; MANET; Network forensics analysis.


1.        Yinghua Guo, Matthew Simon, “Network forensics in MANET: traffic analysis of source spoofed DoS attacks”, Nov 2010 IEEE Fourth International Conference on Network and  System Security.
2.        Yinghua Guo, Matthew Simon, “Forensic analysis of DoS attack traffic in MANET”, Nov 2010 IEEE Fourth International Conference on Network and System Security.

3.        Ying Zhu, “Attack pattern discovery in forensic investigation of network attacks”, IEEE journal on selected areas in communications, Vol 29,No. 7, August 2011..

4.        Slim Rekhis and Noureddine Boudriga, “A Formal Rule-based Scheme for Digital Investigation in Wireless Ad-hoc Networks” 2009 Fourth IEEE International Workshop on Systematic Approaches to Digital Forensic Engineering.

5.        Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei, “A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks “, Chapter 12, 2006.

6.        Taner Tuncer Yetkin Tatar, “Detection SYN Flooding Attacks Using Fuzzy Logic”, 2008 International Conference on Information Security and Assurance.

7.        Jung-Sun Kim, Dong-Geun Kim, Bong-Nam Noh, “A Fuzzy Logic Based Expert System as a Network Forensics”, July, 2004 IEEE.

8.        Sarah Ahmed, S. M. Nirkhi, “A Fuzzy Rule Based Forensic Analysis Of DDoS Attack in MAET”, IJACSA vol 4, issue 6.

9.        Yi Zhang, Qiang Liu, “A Real-Time DDoS Attack Detection and Prevention System Based on per-IP Traffic Behavioral Analysis”, 2010.

10.     R. Nichols and P. Lekkas, Wireless Security-Models, Threats, and Solutions, McGraw-Hill, Chapter 7, 2002.

11.     hanant Subhadrabandhu, Saswati Sarkar, Farooq Anjum, “A Framework for Misuse Detection in Ad Hoc Networks”, IEEE Journal on selected areas in communications, Vol. 24, No. 2, February  2006. 

12.     Q. Gu, P. Liu and C.H. Chu, Tactical bandwidth exhaustion in ad hoc networks, Proceedings of the Fifth Annual IEEE Information Assurance Workshop, PP. 257-264, 2004.

13.     Jill Slay, Benjamin Turnbull, “The Need for Technical Approach to Digital Forensic Evidence Collection for Wireless Technologies”, Proceedings of the 2006 IEEE workshop on Information Assurance United States Military Academy, NY.

14.     Kevin P. Mc Grath and John Nelson, “A wireless Network Forensic System”, ISSC June 2006, Dublin Institute of Technology.

15.     H. Wang, D. Zang, K.G. Shin, “ Change-Point Monitoring for the Detection of DoS Attacks”, IEEE Transaction on Dependable and Secure Computing, vol:1 No:4, pp:193-208, 2004.

16.     Y. Oshita, S. Ata, M. Murata, “Detecting Distrubuted Denial of Service Attacks by Analyzing TCP SYN Packets Statistically”, pp:2043-2049 Globecom2004.

17.     Jochen H. Schiller, “Mobile communication”, Pearson education, chapter 8, 2008.

18.     David B. Johnson, David A. Maltz, Josh Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”.

19.     Rashid Hafeez Khohar, Md Asri Ngadi , Satria Mandala,”A Review of  Current Routing Attacks in Mobile Adhoc Networks”, International journal of computer science and security, volume 2, No.- 3.

20.     David Irwin and Ray Hunt, “Forensic Information Acquisition in Mobile Networks”, IEEE 2009.

21.     Shishir K. Shandilya, Sunita Sahu,”A Trust Based Security Scheme for RREQ Flooding Attack in MANET”, International journal of computer applications, Vol. 5- No. 12, August 2010.





Naveen Kumar

Paper Title:

Comparative Study and Approach to Enhanced the Range and Power Requirement for Basic Memory Segment Analog Design

Abstract: Now a day, analogy designing with dynamic range in high in demand. The minimum dissipation for power factor can be achieved only with improved range of system. Current mirror component is being researched from mainly of the years to achieve it’s grated extend voltage level for power consumption. To comparative study of various current mirror with enhanced technology top design analogy circuit of most extend. This paper comes with achieve a logic for the communication system to achieve such a system which can be run over low power and low voltage supply. This paper also includes the theorem and result table by which it is easy to access the need of such a technology. CMOS S-RAM design is the basic element of memory design which can be achieved and comparative study is also given to minimize future works.

VMS, Low Voltage Low Power Current Mirror, Basic Current Mirror.


1.        S.S.Rajput, “Low Voltage Current Mode circuit structures and all their applications”, Ph.D. Thesis, Indian Institute of Technology, 2002.
2.        Behzad Razabi,, “Design of analog CMOS integrated circuits”, Tata McGraw Hills, fourth edition, 2001.

3.        S.S Rajput, “Advanced Current Mirror for Low Voltage Analog Designs”, IEEE, ICSE, Proc, vol. 148, pp. 258-263, 2004.

4.        S. Yan and E.Sanchez – Sinencio, “Low Voltage Analog Circuits Design Techniques : A Tutorial”, IEICE transaction on Analog Integrated Circuits Systems, vol E00A,no.2, pp. 1-17, Feb 2000.

5.        Ying-Chuan Liu, Hung-Yu Wang, Yuan-Long Jeang and Yu-Wei Huang, “A CMOS Current Mirror with Enhanced Input Dynamic Range”, 3rd International Conference on Innovative Computing Information and Control (ICICIC'08).

6.        M.Ismail and T.Fiez, “Analog VLSI Signal and Information Processing”, New York: McGraw-Hill 2004.

7.        N.Weste and K.Eshraghian, “Principles of CMOS VLSI Design”, Second Edition, Addition Wesley Longman (Singapore) Pvt Ltd.

8.        S.S. Rajput, Prateek Vajpayee, G.K. Sharma, “1V High Performance Current Mirror for Low Voltage Analog and Mixed Signal Applications in Submicron Regime”, IEEE TENCON Conference , pp no.1-4,2009.

9.        S.S. Rajput and S.S. Jammuar, “Low Voltage Analog Circuit Design Techniques”, IEEE Transactions on Circuits and System Magazine, Vol no.-2, pp. 24 -42, 2002.

10.     Donald A.Neaman, “Electronic circuit Analysis and Design”, Second Edition Tata Mc Graw-Hill, pp.-599-607,2002.

11.     Jasdeep Kaur, Nupur Prakash and S.S.Rajput, “High-Linearity Low-Voltage Self- Cascode Class AB CMOS Current Output Stage”, World Academy of Science , Engineering and Technology 41 journal, Electron, pp. 600-6003, 2008.

12.     Mohit kumar, “A low voltage Current mode analog cell”, Seminar Report Electronic Systems group, EE Dept, Nov. 2002.

13.     Garcia Rafael Ledesma Francisco and Ramirez-Angulo Jaime, “Comparison of new and conventional low voltage current mirrors”, Proc IEEE Journals, pp. 49-52, 2002.

14.     Timir Datta, Pamela Abshire “Mismatch Compensation of CMOS Current Mirrors Using Floating-Gate Transistors”, solid –state circuits, IEEE Journal ,vol. 25no 3,pp. 1823-1826,2009.

15.     Bruun E and Shah P, “Dynamic range of low-voltage cascode current mirrors”, Proc Circuit and system IEEE Journals, pp.1328-1331,1995.

16.     S.S.Rajput  and  S.S.Jamuar, “Low voltage, low power, high performance current mirror for portable analogue and mixed mode applications”, IEEE  Proc-Circuits Device system,Vol. 148,No 5, pp.273-278,2001.

17.     Z.Wang, “Analytical determination of output resistance and DC matching errors in MOS current mirrors”, Proceedings IEEE Transaction on Circuits, Devices and Systems, vol. 137, pp.397-304,1990.





B. Annapoorani, N. Kumaran

Paper Title:

Image Denoising Based On Fast Noise Estimation Methods and Median Algorithm

Abstract: Impulse noise detection is a critical issue when re- moving impulse noise and impulse/Gaussian mixed noise. In this paper, we propose a new detection mechanism for universal noise and a universal noise-filtering framework based on the nonlocal means (NL-means). The operation is carried out in two stages, i.e., detection followed by filtering. For detection, first, we propose the robust outlyingness ratio (ROR) for measuring how impulse like each pixel is, and then all the pixels are divided into four clusters according to the ROR values. Second, different decision rules are used to detect the impulse noise based on the absolute deviation to the median in each cluster. In order to make the detection results more accurate and more robust, the from-coarse-to-fine strategy and the iterative framework are used. In addition, the detection procedure consists of two stages, i.e., the coarse and fine detection stages. For filtering, the NL-means are extended to the impulse noise by introducing a reference image. Then, a universal denoising framework is proposed by combining the new detection mechanism with the NL-means (ROR-NLM). Finally, extensive simulation results show that the proposed noise detector is su- perior to most existing detectors, and the ROR-NLM produces excellent results and outperforms most existing filters for different noise models. Unlike most of the other impulse noise filters, the proposed ROR-NLM also achieves high peak signal-to-noise ratio and great image quality by efficiently removing impulse/Gaussian mixed noise.

Image denoising, impulse noise, mixed noise, noise detector, nonlocal means (NL-means).


1.        R. C. Gonzalez and R. E. Woods, Digital Image Processing. Engle- wood Cliffs, NJ: Prentice-Hall, 2002.
2.        V. Katkovnik, A. Foi, K. Egiazarian, and J. Astola, “From local Kernel to nonlocal multiple-model image denoising,” Int. J. Comput. Vis., vol. 86, no. 1, pp. 1–32, Jan. 2010.

3.        A. Buades, B. Coll, and J. M. Morel, “A review of image denoising algorithms, with a new one,” Multiscale Model. Simul., vol. 4, no. 2,pp. 490–530, 2005.

4.        A. Buades, B. Coll, and J. M. Morel, “A non-local algorithm for image denoising,” in Proc. Int. Conf. Comput. Vis. Pattern Recognit., 2005,pp. 60–65.

5.        M. Elad and M. Aharon, “Image denoising via sparse and redundant representations over learned dictionaries,” IEEE Trans. Image Process., vol. 15, no. 12, pp. 3736–3745, Dec. 2006.

6.        K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, “Image denoising by sparse 3-D transform-domain collaborative filtering,” IEEE Trans.Image Process., vol. 16, no. 8, pp. 2080–2095, Aug. 2007.

7.        I. Pitas and A. N. Venetsanopoulos, “Order statistics in digital image processing,” Proc. IEEE, vol. 8, no. 12, pp. 1893–1921, Dec. 1992.

8.        T. S. Huang, G. J. Yang, and G. Y. Tang, “A fast two-dimensional me-dian filtering algorithm,” IEEE Trans. Acoust. Speech Signal Process., vol. ASSP-27, no. 1, pp. 13–18, Feb. 1979.

9.        D. Brownrigg, “The weighted median filter,” Commun. ACM, vol. 27,no. 8, pp. 807–818, Aug. 1984.

10.     A. Nieminen, P. Heinonen, and Y. Neuvo, “A new class of detail-pre- serving filters for image processing,” IEEE Trans. Pattern Anal. Mach.Intell., vol. PAMI-9, no. 1, pp. 74–90, Jan. 1987.

11.     S. J. Ko and Y. H. Lee, “Center weighted median filters and their ap- plications to image enhancement,” IEEE Trans. Circuits Syst., vol. 38, no. 9, pp. 984–993, Sep. 1991.

12.     E. J. Coyle, J.-H. Lin, and M. Gabbouj, “Optimal stack filtering and the estimation and structural approaches to image processing,” IEEE Trans. Acoust., Speech Signal Process., vol. 37, no. 12, pp. 2037–2066, Dec. 1989.

13.     T. Sun and Y. Neuvo, “Detail-preserving median based filters in image processing,” Pattern Recognit. Lett., vol. 15, no. 4, pp. 341–347, Apr.1994.

14.     T. Chen and H. R. Wu, “Space variant median filters for the restora- tion of impulse noise corrupted images,” IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. vol. 48, no. 8, pp. 784–789, Aug. 2001.

15.     T. Chen, K. K. Ma, and L. H. Chen, “Tri-state median filter for image denoising,” IEEE Trans. Image Process., vol. 8, no. 12, pp. 1834–1838, Dec. 1999.

16.     T. Chen and H. R. Wu, “Adaptive impulse detection using center-weighted  median  filters,”  IEEE  Signal  Process.  Lett.,  vol.8, no. 1, pp. 1–3, Jun. 2001.

17.     V. Crnojevic, V. Senk, and Z. Trpovski, “Advanced impulse detection based on pixel-wise MAD,” IEEE Signal Process. Lett., vol. 11, no. 7,pp. 589–592, Jul. 2004.

18.     S. Akkoul, R. Ledee, R. Leconge, and R. Harba, “A new adaptive switching median filter,” IEEE Signal Process. Lett., vol. 17, no. 6, pp. 587–590, Jun. 2010.

19.     Y. Q. Dong and S. F. Xu, “A new directional weighted median filter for removal of random-valued impulse noise,” IEEE Signal Process. Lett., vol. 14, no. 3, pp. 193–196, Mar. 2007.

20.     W. Luo, “A new efficient impulse detection algorithm for the re- moval of impulse noise,” IEICE Trans. Fundam. Electron., Commun., Comput., vol. E88-A, no. 10, pp. 2579–2586, Oct. 2005.



0 replies

Leave a Reply

Want to join the discussion?
Feel free to contribute!

Leave a Reply

Your email address will not be published. Required fields are marked *

Calculate *