Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sujitha, S.
- Normalised Otsu's Segmentation Algorithm for Melanoma Diagnosis
Abstract Views :131 |
PDF Views:0
Authors
Affiliations
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 Department of ICT, School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
1 School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
2 Department of ICT, School of Computing, SASTRA University, Thanjavur - 613401, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 22 (2015), Pagination:Abstract
Melanoma is a deadly skin cancer which increases the death rate at a faster rate. In order to bring the death rate under control, melanoma should be detected at its earlier stage. To achieve this, researchers have introduced Computer aided diagnosis and adopted the same. In this technique, Segmentation is found to be one of the important steps. Many algorithms exist in practise for segmentation,where one of the important algorithms is Traditional Otsu Segmentation Algorithm. In this algorithm the major drawback is that the segmentation is improper in the presence of variable illumination. This paper proposes an algorithm "Normalised Otsu Segmentation" which overcomes the above mentioned drawback and results in an accurate segmentation. This algorithm first normalises the image to overcome variable illumination and then segments the image using Otsu algorithm. The accurate result given by this algorithm can be used in further steps to detect the lesion accurately which will provide a hand a for reducing the death rate.Keywords
Illumination, Melanoma, Normalisation, Otsu’s Algorithm, Segmentation.- A Survey on Color Image Segmentation Techniques for Melanoma Diagnosis
Abstract Views :135 |
PDF Views:0
Authors
Affiliations
1 School of Computing, Sastra University, Thanjavur - 613401, Tamil Nadu, IN
2 Department of ICT, School of Computing, Sastra University, Thanjavur – 613401, Tamil Nadu, IN
1 School of Computing, Sastra University, Thanjavur - 613401, Tamil Nadu, IN
2 Department of ICT, School of Computing, Sastra University, Thanjavur – 613401, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 22 (2015), Pagination:Abstract
Image segmentation is an important process in Melanoma diagnosis. It divides the image into segments which provides a better path for extracting features and classifying them accordingly and so far many literatures have explained how the segmentation has been carried out for gray scale images. Though most algorithms have been written for gray scale images it is not necessary that we must stick on only to that instead we can also use color images directly for segmentation process. On doing so, variation in color can be used as an important feature for melanoma diagnosis. Color is a unique feature which can be used to provide a distinct differentiation between Melanoma and Benign. Hence on applying this color image segmentation, earlier detection can be done easily. This literature presents a survey on existing techniques for color image segmentation. Color images when segmented directly, yields better differentiation between the lesions.Keywords
Benign, Color Image Segmentation, Gray Scale Images, Melanoma, Segmentation.- Impact of Massive Open Online Courses and Best Practices: A Case Study on Social Network Analysis Course
Abstract Views :156 |
PDF Views:3
Authors
Affiliations
1 Department of Information Technology, Thiagarajar College of Engineering, Madurai, IN
1 Department of Information Technology, Thiagarajar College of Engineering, Madurai, IN
Source
Journal of Engineering Education Transformations, Vol 31, No 3 (2018), Pagination: 136-140Abstract
Transformations in Engineering Education is to improve the quality of engineering education in learning and research as well as in student development, faculty development, curriculum development and teaching technology methods which involve active learning strategies.Nowadays teaching method takes a new transformation from the conventional method of learning to digital learning like e-learning and m-learning. To improve the students learning ability, a teacher will play a role as mentor/facilitator rather than a teacher. In this paper, we have considered the Impact of Massive Open Online Courses and its Best Practices as a case study on Social Network Analysis Course for the students of third-year Information Technology (IT) department.Keywords
Engineering Education, Massive Open Online Courses, Social Network Analysis, Active Learning Strategies, Course Outcomes.- Perspective of Teaching Methodologies in Dentistry:Active vs Passive Learning
Abstract Views :282 |
PDF Views:136
Authors
Affiliations
1 Department of Oral Pathology, Vinayaka Mission’s Sankarachariyar Dental College, NH-47, Sankari Main road, Ariyanoor, Salem - 636308, Tamil Nadu, IN
1 Department of Oral Pathology, Vinayaka Mission’s Sankarachariyar Dental College, NH-47, Sankari Main road, Ariyanoor, Salem - 636308, Tamil Nadu, IN
Source
Journal of Academy of Dental Education, Vol 3, No 2 (2017), Pagination: 11-18Abstract
Education in its general sense is a form of learning, in which knowledge, skills and habits are transferred across generations through teaching. The syllabus and curriculum followed by the dental colleges in training undergraduate and postgraduate students have been set by the Dental Council of India in assuring a minimum standard of quality. The current design of curriculum emphasizes on didactic lectures with inclusion of minimum quota completion as a prerequisite for the student to appear for university examinations. This article comprises of a questionnaire study on obtaining the perspective of teaching methodology in dentistry among staffs and students.Keywords
Active Learning, Group Discussions, Lectures, Teaching Methodology.References
- Hackathorn J, Solomon ED, Blankmeyer KL, Tennial RE, Garczynski AM. Learning by doing: An empirical study of active teaching techniques. The Journal of Effective Teaching. 2011; 11(2):40–54.
- Gerzina TM, McLean T, Fairley J. Dental clinical teaching: perceptions of students and teachers. Journal of Dental Education. 2005 Dec; 69(12):1377–84. PMid:16352774
- Alrahlah A. How effective the Problem Based Learning (PBL) in dental education. A critical review. The Saudi Dental Journal. 2016 Aug; 28:155–61. crossref PMid:27872545 PMCid:PMC5110467
- Alkhuwaiter SS, Aljuailan RI, Banabilh SM. Problembased learning: Dental student’s perception of their education environments at Qassim University. Journal of International Society of Preventive and Community Dentistry. 2016; 6(6):575–83. crossref PMid:28032051 PMCid:PMC5184393
- Gopinath V, Nallaswamy D. A systematic review on the most effective method teaching dentistry to dental students compared to video based learning. American Journal of Educational Research. 2017; 5(1):63–8.
- A Review of Data Classification Using various Classifiers Algorithm
Abstract Views :157 |
PDF Views:1
Authors
Affiliations
1 Department of IT, PSG College of Technology Coimbatore, IN
1 Department of IT, PSG College of Technology Coimbatore, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 12, No 5 (2020), Pagination: 81-85Abstract
Machine-Learning (ML) methods have great importance in interdisciplinary domains. Besides many areas, healthcare domain is the most thriving area where the involvement of Machine Learning algorithms is relatively essential. The purpose of this research is to put together the various supervised learning algorithms such as Logistic Regression, Random Forest, XG boost and Support Vector Machine for the prediction of heart disease by considering relevant medical parameters in the dataset. It uses the training dataset to get better boundary conditions which could be used to determine each target class. Once the boundary conditions are determined, the validation will be done to predict the target class.The system also analyses the performance metrics of the algorithms in order to compare their effectiveness in real-time.Keywords
Healthcare Domain, Heart Disease, Supervised Learning Algorithms, Performance Analysis.- FPGA Implementation of CALIB_IO, Wave and Clock Generation Modules for Grain Sorting Machine
Abstract Views :144 |
PDF Views:0
Authors
S. Sujitha
1,
N. Augustia
1
Affiliations
1 Department of Electronics and Communication Engineering, VSB Engineering College, IN
1 Department of Electronics and Communication Engineering, VSB Engineering College, IN
Source
ICTACT Journal on Microelectronics, Vol 5, No 4 (2020), Pagination: 854-860Abstract
The color sorting machines inspect grains by means of sensors and remove contaminants by a short burst of compressed air by using the color difference. Grain Sorting machines are successfully being used in the rice milling industry for long time. The color sorters are used in the grain cleaning to remove unwanted materials like dust particles, black tip, burnt, other discolored grains and other inner contaminants. Today’s advanced color sensors are robust, compact, requires less maintenance and consumes very little energy. Hence, these color sensors can be considered for inclusion in any modern grain cleaning plant. This paper aims to develop Calib_IO, Wave Generation and Clock Generation modules for grain sorting machine to remove unwanted materials like dust particles, black tip, burnt, other discolored grains and other inner contaminants and to increase its processing speed. Clock generation module is designed using Quartus II software and is implemented in Cyclone IV E (FPGA KIT) that incorporates compact color sensors for sorting grains.Keywords
Sorting Grains, Color Sorting Machines, Calib_IO, Wave Generation, Clock Generation.- The Connected Edge-To-Vertex Geodetic Number of a Graph
Abstract Views :146 |
PDF Views:0
Authors
J. John
1,
S. sujitha
2
Affiliations
1 Department of Mathematics, Government College of Engineering, Tirunelveli- 627007, IN
2 Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, IN
1 Department of Mathematics, Government College of Engineering, Tirunelveli- 627007, IN
2 Department of Mathematics, Holy Cross College (Autonomous), Nagercoil, IN
Source
The Journal of the Indian Mathematical Society, Vol 90, No 1-2 (2023), Pagination: 1-12Abstract
Let G = (V, E) be a graph. A subset S ⊆ E is called an edge-to-vertex geodetic set of G if every vertex of G is either incident with an edge of S or lies on a geodesic joining a pair of edges of S. The minimum cardinality of an edge-to-vertex geodetic set of G is gev(G). Any edge-to-vertex geodetic set of cardinality gev(G) is called an edge-to-vertex geodetic basis of G. A connected edge-to-vertex geodetic set of a graph G is an edge-to-vertex geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected edge-to-vertex geodetic set of G is the connected edge-to-vertex geodetic number of G and is denoted by gcev(G). Some general properties satisfied by this concept are studied. The connected graphs G of size q with connected edge-to-vertex geodetic number 2 or q or q − 1 are characterized. It is shown that for any three positive integers q, a and b with 2 ≤ a ≤ b ≤ q, there exists a connected graph G of size q, gev(G) = a and gcev(G) = b.Keywords
Geodesic, Edge-To-Vertex Godetic Number, Connected Edge-To-Vertex Geodetic Number.References
- F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, 1990.
- F. Buckley, F. Harary and L. V. Quintas, Extremal results on the Geodetic number of a graph, Scientia A 2, (1988) 17–22.
- G. Chartrand, F. Harary and P. Zhang, Geodetic sets in Graphs , Discuss. Math. Graph Theory, 20 (2000), 129–138.
- G. Chartrand, F. Harary, P.Zhang, On the geodetic number of a graph, Networks, 39(1) (2002), 1–6.
- F. Harary, Graph Theory, Addison-Wesley, 1969.
- D. A. Mojdeh and N. J. Rad, Connected geodomination in graphs, J. Discrete Math. Sci. Cryptogr., 9(1) (2006), 177–186.
- A. P. Santhakumaran P. Titus and J. John, On the connected geodetic number of a Graph, J. Comb. Maths. Comb. Comput, 69 (2009), 219–229.
- A. P. Santhakumaran P. Titus and J. John, The upper connected geodetic number and the forcing connected geodetic number of a Graph, Discrete Appl. Math., 157(7) (2009), 1571–1580.
- A. P. Santhakumaran and J. John, On the edge-to-vertex geodetic number of a graph, Miskolc Math. Notes, 13(1) (2012), 131-141.