Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208346
S. Janakiraman, N. Suriya, V. Nithiya, B. Radhakrishnan, J. Ramanathan, Rengarajan Amirtharajan
The advent of rapid growth of the Internet has ascertained the hidden communication with its focus on security that has gained increasing importance. Of the various methods for establishing hidden communication, one important method is Steganography where the very existence of the data is concealed. Here, the embedding of secret data is varied by employing block based segmentation and thus, Steganography is performed. Categorization of the cover image is done with the help of a reference point and thereby, based on the variation in the MSB bit plane, the secret data is hidden. The proposed method will increase the complexity and the embedding capacity of the image and thus proving to be more efficient by the usage of utmost two or three bits for embedding the secret information in a cover pixel.
{"title":"Reflective code for gray block embedding","authors":"S. Janakiraman, N. Suriya, V. Nithiya, B. Radhakrishnan, J. Ramanathan, Rengarajan Amirtharajan","doi":"10.1109/ICPRIME.2012.6208346","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208346","url":null,"abstract":"The advent of rapid growth of the Internet has ascertained the hidden communication with its focus on security that has gained increasing importance. Of the various methods for establishing hidden communication, one important method is Steganography where the very existence of the data is concealed. Here, the embedding of secret data is varied by employing block based segmentation and thus, Steganography is performed. Categorization of the cover image is done with the help of a reference point and thereby, based on the variation in the MSB bit plane, the secret data is hidden. The proposed method will increase the complexity and the embedding capacity of the image and thus proving to be more efficient by the usage of utmost two or three bits for embedding the secret information in a cover pixel.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129651961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208354
M. S. Kumar, Y. S. Kumaraswamy
Digital medical images take up most of the storage space in the medical database. Digital images are in the form of X-Rays, MRI, CT. These medical images are extensively used in diagnosis and planning treatment schedule. Retrieving required medical images from the database in an efficient manner for diagnosis, research and educational purposes is essential. Image retrieval systems are used to retrieve similar images from database by inputting a query image. Image retrieval systems extract features in the image to a feature vector and use similarity measures for retrieval of images from the database. So the efficiency of the image retrieval system depends upon the feature selection and its classification. In this paper, it is proposed to implement a novel feature selection mechanism using Discrete Sine Transforms (DST) with Information Gain for feature reduction. Classification results obtained from existing Support Vector Machine (SVM) is compared with the proposed Support Vector Machine model. Results obtained show that the proposed SVM classifier outperforms conventional SVM classifier and multi layer perceptron neural network.
{"title":"An improved support vector machine kernel for medical image retrieval system","authors":"M. S. Kumar, Y. S. Kumaraswamy","doi":"10.1109/ICPRIME.2012.6208354","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208354","url":null,"abstract":"Digital medical images take up most of the storage space in the medical database. Digital images are in the form of X-Rays, MRI, CT. These medical images are extensively used in diagnosis and planning treatment schedule. Retrieving required medical images from the database in an efficient manner for diagnosis, research and educational purposes is essential. Image retrieval systems are used to retrieve similar images from database by inputting a query image. Image retrieval systems extract features in the image to a feature vector and use similarity measures for retrieval of images from the database. So the efficiency of the image retrieval system depends upon the feature selection and its classification. In this paper, it is proposed to implement a novel feature selection mechanism using Discrete Sine Transforms (DST) with Information Gain for feature reduction. Classification results obtained from existing Support Vector Machine (SVM) is compared with the proposed Support Vector Machine model. Results obtained show that the proposed SVM classifier outperforms conventional SVM classifier and multi layer perceptron neural network.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208368
B. M. Vaganan, D. Pandiaraja, S. Sundar, E. E. Priya
Chronic obstructive pulmonary disease (COPD) is associated with the respiratory system. COPD is often treated with inhalers whose two major ingredients are the bronchodilators and the steroids. In this paper we mathematically model the deposition of the inhaled drug on the infected airway into Cauchy-Euler differential equation and use Visual Basic to simulate the evolution of the recovery of the inflamed airway.
{"title":"Cauchy-Euler model, cellular automata simulation of the rate of recovery of the infected airway from COPD","authors":"B. M. Vaganan, D. Pandiaraja, S. Sundar, E. E. Priya","doi":"10.1109/ICPRIME.2012.6208368","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208368","url":null,"abstract":"Chronic obstructive pulmonary disease (COPD) is associated with the respiratory system. COPD is often treated with inhalers whose two major ingredients are the bronchodilators and the steroids. In this paper we mathematically model the deposition of the inhaled drug on the infected airway into Cauchy-Euler differential equation and use Visual Basic to simulate the evolution of the recovery of the inflamed airway.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130554564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208288
T. Kathirvalavakumar, S. J. Subavathi
In this paper, a new adaptive learning rate algorithm to train a single hidden layer neural network is proposed. The adaptive learning rate is derived by differentiating linear and nonlinear errors and functional constraints weight decay term at hidden layer and penalty term at output layer. Since the adaptive learning rate calculation involves first order derivative of linear and nonlinear errors and second order derivatives of functional constraints, the proposed algorithm converges quickly. Simulation results show the advantages of proposed algorithm.
{"title":"Modified backpropagation algorithm with adaptive learning rate based on differential errors and differential functional constraints","authors":"T. Kathirvalavakumar, S. J. Subavathi","doi":"10.1109/ICPRIME.2012.6208288","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208288","url":null,"abstract":"In this paper, a new adaptive learning rate algorithm to train a single hidden layer neural network is proposed. The adaptive learning rate is derived by differentiating linear and nonlinear errors and functional constraints weight decay term at hidden layer and penalty term at output layer. Since the adaptive learning rate calculation involves first order derivative of linear and nonlinear errors and second order derivatives of functional constraints, the proposed algorithm converges quickly. Simulation results show the advantages of proposed algorithm.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131018048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208365
R. Roselin, K. Thangavel
The mammography is the most effective procedure for to diagnosis the breast cancer at an early stage. A granule is a mass of objects, in the universe of discourse, put together by indistinguishability, similarity, proximity, or functionality. In mammograms, it is quite difficult to identify the suspicious region which is a mass of calcification on the breast tissue. This paper proposes rough entropy based granular computing to segment mammogram images. The proposed method is evaluated by classification algorithms which are available in WEKA.
{"title":"Mammogram image segmentation using granular computing based on rough entropy","authors":"R. Roselin, K. Thangavel","doi":"10.1109/ICPRIME.2012.6208365","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208365","url":null,"abstract":"The mammography is the most effective procedure for to diagnosis the breast cancer at an early stage. A granule is a mass of objects, in the universe of discourse, put together by indistinguishability, similarity, proximity, or functionality. In mammograms, it is quite difficult to identify the suspicious region which is a mass of calcification on the breast tissue. This paper proposes rough entropy based granular computing to segment mammogram images. The proposed method is evaluated by classification algorithms which are available in WEKA.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121662694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208355
R. Harini, C. Chandrasekar
Image Segmentation is one of the significant elements in the part of image processing. It becomes most essential demanding factor while typically dealing with medical image segmentation. In this paper, proposal of our work comprises of formation of kernel for the medical images by performing the deviation of mapped image data within the scope of each region from the piecewise constant model and based on the regularization term based on the function of indices value of the region. The functional objective minimization is carried out by two steps minimization in image segmentation using graph cut methods, and minimization with respect to region parameters using constant point computation. Nearest neighbor classifiers are introduced to the benchmarked image data segmented portions. Among the different methods in supervised statistical pattern recognition, the nearest neighbor rule results in achieving high performance without requirement of the prior assumptions about the distributions from which the training sets are taken.
{"title":"Image segmentation using nearest neighbor classifiers based on kernel formation for medical images","authors":"R. Harini, C. Chandrasekar","doi":"10.1109/ICPRIME.2012.6208355","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208355","url":null,"abstract":"Image Segmentation is one of the significant elements in the part of image processing. It becomes most essential demanding factor while typically dealing with medical image segmentation. In this paper, proposal of our work comprises of formation of kernel for the medical images by performing the deviation of mapped image data within the scope of each region from the piecewise constant model and based on the regularization term based on the function of indices value of the region. The functional objective minimization is carried out by two steps minimization in image segmentation using graph cut methods, and minimization with respect to region parameters using constant point computation. Nearest neighbor classifiers are introduced to the benchmarked image data segmented portions. Among the different methods in supervised statistical pattern recognition, the nearest neighbor rule results in achieving high performance without requirement of the prior assumptions about the distributions from which the training sets are taken.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127004654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208366
M. Joshi, A. Bhale
The importance of mammograms in early breast cancer detection is an accepted fact. Mammograms (either an analog x-ray film or a digital softcopy) are computationally empowered to extract significant information. Several computational techniques/algorithms process mammograms to highlight and reveal otherwise unseen features. Thus mammographic images are computationally unfolded to obtain appropriate information that can be used for further analysis. Computational analysis of mammograms is an essential tool, which is used by numerous specialists for various purposes. In this paper we review such research work reported in the literature in recent years. Our focus is in particular on computational preprocessing of mammograms. Preprocessing involves enhancement of mammographic images as well as extraction of relevant features from images. We grouped various image enhancement research approaches systematically. We also categorized various research techniques based on the types of features that are extracted and used to obtain intended results. Although mammograms are used mostly for breast cancer detection, the research is not confined to this aspect only. Several other areas that deal with mammograms are also explored by researchers including image compression, Content based Image Retrieval (CBIR) etc. Variety in these research applications is also discussed and presented in this paper.
{"title":"Computational unfoldment of mammograms","authors":"M. Joshi, A. Bhale","doi":"10.1109/ICPRIME.2012.6208366","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208366","url":null,"abstract":"The importance of mammograms in early breast cancer detection is an accepted fact. Mammograms (either an analog x-ray film or a digital softcopy) are computationally empowered to extract significant information. Several computational techniques/algorithms process mammograms to highlight and reveal otherwise unseen features. Thus mammographic images are computationally unfolded to obtain appropriate information that can be used for further analysis. Computational analysis of mammograms is an essential tool, which is used by numerous specialists for various purposes. In this paper we review such research work reported in the literature in recent years. Our focus is in particular on computational preprocessing of mammograms. Preprocessing involves enhancement of mammographic images as well as extraction of relevant features from images. We grouped various image enhancement research approaches systematically. We also categorized various research techniques based on the types of features that are extracted and used to obtain intended results. Although mammograms are used mostly for breast cancer detection, the research is not confined to this aspect only. Several other areas that deal with mammograms are also explored by researchers including image compression, Content based Image Retrieval (CBIR) etc. Variety in these research applications is also discussed and presented in this paper.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208341
S. Nithya, Rekha C Chandrasekar, R. Kaniezhil
Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile nodes. Ad hoc wireless networks have massive commercial and military potential because of their mobility support. Quality of Service (QoS) routing in mobile Ad-Hoc networks is challenging due to rapid change in network topology. In this paper, we focused to reduce flooding performance of the Fisheye State Routing (FSR) protocol in Grid using ns-2 network simulator under different performance metrics scenario in respect to number of Nodes and Pause-Time. The connection establishment is costly in terms of time and resource where the network is mostly affected by connection request flooding. The proposed approach presents a way to reduce flooding in MANETs. Flooding is dictated by the propagation of connection-request packets from the source to its neighborhood nodes. The proposed architecture promotes on the concept of sharing neighborhood information. The proposed approach focuses on exposing its neighborhood peer to another node that is referred to as its friend-node, which had requested/forwarded connection request. If there is a high probability for the friend node to communicate through the exposed routes, this could improve the efficacy of bandwidth utilization by reducing flooding, as the routes have been acquired, without any broadcasts. Friendship between nodes is quantized based on empirical computations and heuristic algorithms. The nodes store the neighborhood information in their cache that is periodically verified for consistency. Simulation results show the performance of this proposed method.
{"title":"A new approach to reduce flooding in Grid Fisheye state routing (GFSR) protocol by propagation neighborhood","authors":"S. Nithya, Rekha C Chandrasekar, R. Kaniezhil","doi":"10.1109/ICPRIME.2012.6208341","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208341","url":null,"abstract":"Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile nodes. Ad hoc wireless networks have massive commercial and military potential because of their mobility support. Quality of Service (QoS) routing in mobile Ad-Hoc networks is challenging due to rapid change in network topology. In this paper, we focused to reduce flooding performance of the Fisheye State Routing (FSR) protocol in Grid using ns-2 network simulator under different performance metrics scenario in respect to number of Nodes and Pause-Time. The connection establishment is costly in terms of time and resource where the network is mostly affected by connection request flooding. The proposed approach presents a way to reduce flooding in MANETs. Flooding is dictated by the propagation of connection-request packets from the source to its neighborhood nodes. The proposed architecture promotes on the concept of sharing neighborhood information. The proposed approach focuses on exposing its neighborhood peer to another node that is referred to as its friend-node, which had requested/forwarded connection request. If there is a high probability for the friend node to communicate through the exposed routes, this could improve the efficacy of bandwidth utilization by reducing flooding, as the routes have been acquired, without any broadcasts. Friendship between nodes is quantized based on empirical computations and heuristic algorithms. The nodes store the neighborhood information in their cache that is periodically verified for consistency. Simulation results show the performance of this proposed method.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116960098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208381
S. Pramanik, D. Bhattacharjee
This paper presents a novel facial sketch image or face-sketch recognition approach based on facial feature extraction. To recognize a face-sketch, we have concentrated on a set of geometric face features like eyes, nose, eyebrows, lips, etc and their length and width ratio because it is difficult to match photos and sketches because they belong to two different modalities. In this system, first the facial features/components from training images are extracted, then ratios of length, width, and area etc. are calculated and those are stored as feature vectors for individual images. After that the mean feature vectors are computed and subtracted from each feature vector for centering of the feature vectors. In the next phase, feature vector for the incoming probe face-sketch is also computed in similar fashion. Here, K-NN classifier is used to recognize probe face-sketch. It is experimentally verified that the proposed method is robust against faces are in a frontal pose, with normal lighting and neutral expression and have no occlusions. The experiment has been conducted with 80 male and female face images from different face databases. It has useful applications for both law enforcement and digital entertainment.
{"title":"Geometric feature based face-sketch recognition","authors":"S. Pramanik, D. Bhattacharjee","doi":"10.1109/ICPRIME.2012.6208381","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208381","url":null,"abstract":"This paper presents a novel facial sketch image or face-sketch recognition approach based on facial feature extraction. To recognize a face-sketch, we have concentrated on a set of geometric face features like eyes, nose, eyebrows, lips, etc and their length and width ratio because it is difficult to match photos and sketches because they belong to two different modalities. In this system, first the facial features/components from training images are extracted, then ratios of length, width, and area etc. are calculated and those are stored as feature vectors for individual images. After that the mean feature vectors are computed and subtracted from each feature vector for centering of the feature vectors. In the next phase, feature vector for the incoming probe face-sketch is also computed in similar fashion. Here, K-NN classifier is used to recognize probe face-sketch. It is experimentally verified that the proposed method is robust against faces are in a frontal pose, with normal lighting and neutral expression and have no occlusions. The experiment has been conducted with 80 male and female face images from different face databases. It has useful applications for both law enforcement and digital entertainment.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117029467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-03-21DOI: 10.1109/ICPRIME.2012.6208283
S. Jayanthi, S. Prema
Web services describe a standardized way of integrating Web-based applications using the XML (Extensible Markup Language), SOAP (Simple Object Access Protocol), WSDL and UDDI (Universal Description Discovery and Integration) open standards over an Internet protocol backbone. WSDL (Web Service Definition Language) is used for describing the available services. The dynamic approach starts with crawling on the Web for Web Services, simultaneously gathering the WSDL service descriptions and related documents. The Web APIs provide the methodology for building unique service objects from multiple web resources. In this semantic search engine, if the web user gets satisfied with the description they can crawl into the webpage, otherwise they can shift to another link. This query enhancement process is exploited to learn useful information that helps to generate related queries. In this research work the add-on is automatically generated when compared with the existing system. Add-on is programs that are integrated into the browser application, usually providing additional functionality. Finally this work gives an overview of how to segregate the unique service object (USO) using Bookshelf Data Structure from web resources and use it to semantically annotate the resulting services in visual mode.
{"title":"Segregating unique service object from multi-web sources for effective visualization","authors":"S. Jayanthi, S. Prema","doi":"10.1109/ICPRIME.2012.6208283","DOIUrl":"https://doi.org/10.1109/ICPRIME.2012.6208283","url":null,"abstract":"Web services describe a standardized way of integrating Web-based applications using the XML (Extensible Markup Language), SOAP (Simple Object Access Protocol), WSDL and UDDI (Universal Description Discovery and Integration) open standards over an Internet protocol backbone. WSDL (Web Service Definition Language) is used for describing the available services. The dynamic approach starts with crawling on the Web for Web Services, simultaneously gathering the WSDL service descriptions and related documents. The Web APIs provide the methodology for building unique service objects from multiple web resources. In this semantic search engine, if the web user gets satisfied with the description they can crawl into the webpage, otherwise they can shift to another link. This query enhancement process is exploited to learn useful information that helps to generate related queries. In this research work the add-on is automatically generated when compared with the existing system. Add-on is programs that are integrated into the browser application, usually providing additional functionality. Finally this work gives an overview of how to segregate the unique service object (USO) using Bookshelf Data Structure from web resources and use it to semantically annotate the resulting services in visual mode.","PeriodicalId":148511,"journal":{"name":"International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131119007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：