Pub Date : 2013-03-01DOI: 10.1109/ISSP.2013.6526906
H. Pandit, D. Shah
This paper is focused on the system of image recognition on the basis of color analysis. In healthcare domain, study of human nail color is very important. Many diseases could be identified by analyzing nails of hands. Human eye is having limitation in resolution as well as subjectivity in color analysis. The proposed system is based on the algorithm which automatically extracts only nails' area from scanned back side of palm. These selected pixels are processed for further analysis. The system is computer based, so small discontinuities in color values are also observed, and we can detect color changes in the initial stage of disease. In this way, system is quite useful in prediction of diseases in their initial stages.
{"title":"A system for nail color analysis in healthcare","authors":"H. Pandit, D. Shah","doi":"10.1109/ISSP.2013.6526906","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526906","url":null,"abstract":"This paper is focused on the system of image recognition on the basis of color analysis. In healthcare domain, study of human nail color is very important. Many diseases could be identified by analyzing nails of hands. Human eye is having limitation in resolution as well as subjectivity in color analysis. The proposed system is based on the algorithm which automatically extracts only nails' area from scanned back side of palm. These selected pixels are processed for further analysis. The system is computer based, so small discontinuities in color values are also observed, and we can detect color changes in the initial stage of disease. In this way, system is quite useful in prediction of diseases in their initial stages.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"03 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130666984","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526940
Dinesh Mandalapu, S. Madhvanath, B. R. Babu, H. Bellam
Simple “electronic clipboards” such as Pegasus NotesTaker and ACECAD DigiMemo offer a cost effective solution for capturing handwritten notes in electronic form, in many settings such as meetings, schools, and so on. However they do not have a way of knowing when the writer is done with the current physical page and has moved to a new page. They address this problem by providing a physical "new page" button on the device. However writers frequently forget to press this button, resulting in multiple physical pages of ink being captured in a single digital page. In this paper, we describe an algorithm to automatically separate (paginate) multiple pages of ink into the constituent pages, thereby doing away with the need to explicitly indicate the new page. We then perform layout analysis on each of the digital pages. Text strokes and graphic strokes in a page are separated, and the ink is grouped into logical segments such as figures and paragraphs. We also describe a tool that integrates the algorithms for automatic pagination and layout analysis, and provides a convenient user interface to move digital ink segments across pages, and reorganize handwritten notes.
{"title":"Automated pagination and layout analysis of handwritten notes","authors":"Dinesh Mandalapu, S. Madhvanath, B. R. Babu, H. Bellam","doi":"10.1109/ISSP.2013.6526940","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526940","url":null,"abstract":"Simple “electronic clipboards” such as Pegasus NotesTaker and ACECAD DigiMemo offer a cost effective solution for capturing handwritten notes in electronic form, in many settings such as meetings, schools, and so on. However they do not have a way of knowing when the writer is done with the current physical page and has moved to a new page. They address this problem by providing a physical \"new page\" button on the device. However writers frequently forget to press this button, resulting in multiple physical pages of ink being captured in a single digital page. In this paper, we describe an algorithm to automatically separate (paginate) multiple pages of ink into the constituent pages, thereby doing away with the need to explicitly indicate the new page. We then perform layout analysis on each of the digital pages. Text strokes and graphic strokes in a page are separated, and the ink is grouped into logical segments such as figures and paragraphs. We also describe a tool that integrates the algorithms for automatic pagination and layout analysis, and provides a convenient user interface to move digital ink segments across pages, and reorganize handwritten notes.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117281779","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526911
M. D. Amipara, H. Pathak
The batch product is very difficult to make economically viable production. In Aviation industries, faces such issues. The common and cheaper solution with identical product repeatability for the product is good solution. The solution proposed here is a design of a product which can be shared in different projects. This, in turn, also provides leverage for small batch production cost, as same item can be used at multiple places and hence provides quantity benefit to manufacturer. Also product can be produced easily and repeatedly with the same specifications and same quality including accepted tolerances. The solution provides reusability and sharability of a product for different purposes or projects. This work for broadband antenna in the specialized area of navigation aids and design a self complementary antenna from about 75 MHz to 400 MHz. It is developed based on strip line technology which covers the band of direction finder (VHF & UHF). Also can be used for the Instrument Landing System (equipments like Marker beacon, Localiser and glidepath).
{"title":"Wideband VHF self complementary antenna","authors":"M. D. Amipara, H. Pathak","doi":"10.1109/ISSP.2013.6526911","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526911","url":null,"abstract":"The batch product is very difficult to make economically viable production. In Aviation industries, faces such issues. The common and cheaper solution with identical product repeatability for the product is good solution. The solution proposed here is a design of a product which can be shared in different projects. This, in turn, also provides leverage for small batch production cost, as same item can be used at multiple places and hence provides quantity benefit to manufacturer. Also product can be produced easily and repeatedly with the same specifications and same quality including accepted tolerances. The solution provides reusability and sharability of a product for different purposes or projects. This work for broadband antenna in the specialized area of navigation aids and design a self complementary antenna from about 75 MHz to 400 MHz. It is developed based on strip line technology which covers the band of direction finder (VHF & UHF). Also can be used for the Instrument Landing System (equipments like Marker beacon, Localiser and glidepath).","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134331067","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526882
A. Soni, J. Jain, R. Roshan
The Fractional Fourier transform (FrFT), as a generalization of the classical Fourier transform, was introduced many years ago in mathematics literature. For the enhanced computation of fractional Fourier transform, discrete version of FrFT came into existence i.e. DFrFT. This paper illustrates the advantage of discrete fractional Fourier transform (DFrFT) as compared to other transforms for steganography in image processing. The simulation result shows same PSNR in both domain (time and frequency) but DFrFT gives an advantage of additional stego key i.e. order parameter of this transform.
{"title":"Image steganography using discrete fractional Fourier transform","authors":"A. Soni, J. Jain, R. Roshan","doi":"10.1109/ISSP.2013.6526882","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526882","url":null,"abstract":"The Fractional Fourier transform (FrFT), as a generalization of the classical Fourier transform, was introduced many years ago in mathematics literature. For the enhanced computation of fractional Fourier transform, discrete version of FrFT came into existence i.e. DFrFT. This paper illustrates the advantage of discrete fractional Fourier transform (DFrFT) as compared to other transforms for steganography in image processing. The simulation result shows same PSNR in both domain (time and frequency) but DFrFT gives an advantage of additional stego key i.e. order parameter of this transform.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"37 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090463","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526916
A. S. Verma, A. Jaiswal, M. Kumar, G. Nigam, S. K. Srivastava
The probability of correct operation of the system during a given lifetime is called the reliability. The reliability of a complete satellite communications system depends on the reliability of its two principal constituents - the satellite and the ground stations. The availability of a complete satellite communications system depends not only on the reliability of the constituents of the system but also on the probability of successful launching, the replacement time and the number of operational and back-up satellites (in orbit and on the ground). Availability of the ground stations depends not only on their reliability but also on their maintainability. For the satellite, availability depends only on reliability since maintenance is not envisaged with current techniques.
{"title":"Measurement of reliability and availability of satellite communication links: Progress and challenges","authors":"A. S. Verma, A. Jaiswal, M. Kumar, G. Nigam, S. K. Srivastava","doi":"10.1109/ISSP.2013.6526916","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526916","url":null,"abstract":"The probability of correct operation of the system during a given lifetime is called the reliability. The reliability of a complete satellite communications system depends on the reliability of its two principal constituents - the satellite and the ground stations. The availability of a complete satellite communications system depends not only on the reliability of the constituents of the system but also on the probability of successful launching, the replacement time and the number of operational and back-up satellites (in orbit and on the ground). Availability of the ground stations depends not only on their reliability but also on their maintainability. For the satellite, availability depends only on reliability since maintenance is not envisaged with current techniques.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132239443","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526909
R. Roshan, J. Jain, A. Soni
Peak-to-average power ratio (PAPR) is a major drawback in most multi-carrier communication techniques such as orthogonal frequency division multiplex system (OFDM). OFDM consists of lots of independent modulated subcarriers, as a result the amplitude of such a signal can have very large values. These large peaks increase the amount of inter-modulation distortion resulting in an increase in the error rate. In this paper we dealt with simple cyclic coding (CC) scheme having coding rates (R) of 4/7 and 11/15. The proposed coding scheme shows good PAPR reduction with any length of data sequence. The results are verified and shown for 16 point IFFT and 64 point IFFT. In this scheme add some extra parity bits to the data bits. These parity bits can correct up to one bit error.
{"title":"Reduction of peak to average power ratio in OFDM technique by using cyclic codes","authors":"R. Roshan, J. Jain, A. Soni","doi":"10.1109/ISSP.2013.6526909","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526909","url":null,"abstract":"Peak-to-average power ratio (PAPR) is a major drawback in most multi-carrier communication techniques such as orthogonal frequency division multiplex system (OFDM). OFDM consists of lots of independent modulated subcarriers, as a result the amplitude of such a signal can have very large values. These large peaks increase the amount of inter-modulation distortion resulting in an increase in the error rate. In this paper we dealt with simple cyclic coding (CC) scheme having coding rates (R) of 4/7 and 11/15. The proposed coding scheme shows good PAPR reduction with any length of data sequence. The results are verified and shown for 16 point IFFT and 64 point IFFT. In this scheme add some extra parity bits to the data bits. These parity bits can correct up to one bit error.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125983762","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526876
Dr. Nagaraj V. Dharwadkar, B. B. Amberker
In this paper, we propose an adaptive watermarking scheme for gray-scale images. The proposed scheme use the difference between the consecutive and non-overlapping pair of pixels to embed the watermark bits. The watermark is embedded into the pair of pixels using least-significant bit(LSB) substitution method. The difference between pair of pixels is used to determine the smooth and edge regions of the image. In smooth region less number of watermark bits are embedded and in edge region more number of watermark bits are embedded. The pixels of the cover image are categorized into different types using the embedding capacity which is determined by the difference between the pair of pixels. For any pair of consecutive pixels, both pixels are embedded with variable bits of watermark using LSB substitution method. Here, the number of bits to be embedded is decided based on the category to which the difference value belongs. After embedding, the difference value between embedded pair of pixels is retained by readjustment so that the quality of the image is maintained and embedding capacity is improved. The experimental results show that the proposed scheme has high embedding capacity and less distortion in embedded images.
{"title":"An adaptive gray-scale image watermarking scheme using smooth and edge areas of an image","authors":"Dr. Nagaraj V. Dharwadkar, B. B. Amberker","doi":"10.1109/ISSP.2013.6526876","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526876","url":null,"abstract":"In this paper, we propose an adaptive watermarking scheme for gray-scale images. The proposed scheme use the difference between the consecutive and non-overlapping pair of pixels to embed the watermark bits. The watermark is embedded into the pair of pixels using least-significant bit(LSB) substitution method. The difference between pair of pixels is used to determine the smooth and edge regions of the image. In smooth region less number of watermark bits are embedded and in edge region more number of watermark bits are embedded. The pixels of the cover image are categorized into different types using the embedding capacity which is determined by the difference between the pair of pixels. For any pair of consecutive pixels, both pixels are embedded with variable bits of watermark using LSB substitution method. Here, the number of bits to be embedded is decided based on the category to which the difference value belongs. After embedding, the difference value between embedded pair of pixels is retained by readjustment so that the quality of the image is maintained and embedding capacity is improved. The experimental results show that the proposed scheme has high embedding capacity and less distortion in embedded images.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133642762","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526925
C. Pawar, R. B. Wagh
Today Cloud computing is on demand as it offers dynamic flexible resource allocation, for reliable and guaranteed services in pay-as-you-use manner, to Cloud service users. So there must be a provision that all resources are made available to requesting users in efficient manner to satisfy their needs. This resource provision is done by considering the Service Level Agreements (SLA) and with the help of parallel processing. Recent work considers various strategies with single SLA parameter. Hence by considering multiple SLA parameter and resource allocation by preemption mechanism for high priority task execution can improve the resource utilization in Cloud. In this paper we propose an algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time. An obtained experimental results show that in a situation where resource contention is fierce our algorithm provides better utilization of resources.
{"title":"Priority based dynamic resource allocation in Cloud computing with modified waiting queue","authors":"C. Pawar, R. B. Wagh","doi":"10.1109/ISSP.2013.6526925","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526925","url":null,"abstract":"Today Cloud computing is on demand as it offers dynamic flexible resource allocation, for reliable and guaranteed services in pay-as-you-use manner, to Cloud service users. So there must be a provision that all resources are made available to requesting users in efficient manner to satisfy their needs. This resource provision is done by considering the Service Level Agreements (SLA) and with the help of parallel processing. Recent work considers various strategies with single SLA parameter. Hence by considering multiple SLA parameter and resource allocation by preemption mechanism for high priority task execution can improve the resource utilization in Cloud. In this paper we propose an algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time. An obtained experimental results show that in a situation where resource contention is fierce our algorithm provides better utilization of resources.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129260840","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526879
S. Lakra, J. Singh, A. Singh
Results on classifying a speaker on the basis of gender by processing speech and analyzing the voice samples are presented. Firstly, the speech samples are classified into voiced/unvoiced/silence by using a speech classification algorithm implemented in MATLab. The pitch of the subject's voice is extracted from the classified speech sample. Following this, automated clustering is done by an Adaptive Neuro-Fuzzy Inference System (ANFIS) to separate male and female pitch values. An automated gender classification is successfully performed by ANFIS, although, the ANFIS has to be trained before the actual classification.
{"title":"Automated pitch-based gender recognition using an adaptive neuro-fuzzy inference system","authors":"S. Lakra, J. Singh, A. Singh","doi":"10.1109/ISSP.2013.6526879","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526879","url":null,"abstract":"Results on classifying a speaker on the basis of gender by processing speech and analyzing the voice samples are presented. Firstly, the speech samples are classified into voiced/unvoiced/silence by using a speech classification algorithm implemented in MATLab. The pitch of the subject's voice is extracted from the classified speech sample. Following this, automated clustering is done by an Adaptive Neuro-Fuzzy Inference System (ANFIS) to separate male and female pitch values. An automated gender classification is successfully performed by ANFIS, although, the ANFIS has to be trained before the actual classification.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129274419","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 : 2013-03-01DOI: 10.1109/ISSP.2013.6526869
D. Rathod, S. Parikh, B. Buddhadev
World Wide Web can be viewed as a REST-based architecture and which uses a stateless, client-server, cacheable HTTP protocol for communication and resources is its basic element. RESTful web services use HTTP request to create and/or update, read and delete resources. Along with CRUD (Create, Read, Update and Delete) operations, there are many REST modeling issues addressed during our research related to describing the behavior of the Resources and how to show relation between resources including their attributes. In this paper we proposed the model using Unified Modeling Language to design structural and behavioral RESTful web services. We also developed hotel booking benchmark application based on these model.
{"title":"Structural and behavioral modeling of RESTful web service interface using UML","authors":"D. Rathod, S. Parikh, B. Buddhadev","doi":"10.1109/ISSP.2013.6526869","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526869","url":null,"abstract":"World Wide Web can be viewed as a REST-based architecture and which uses a stateless, client-server, cacheable HTTP protocol for communication and resources is its basic element. RESTful web services use HTTP request to create and/or update, read and delete resources. Along with CRUD (Create, Read, Update and Delete) operations, there are many REST modeling issues addressed during our research related to describing the behavior of the Resources and how to show relation between resources including their attributes. In this paper we proposed the model using Unified Modeling Language to design structural and behavioral RESTful web services. We also developed hotel booking benchmark application based on these model.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123265084","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
扫码关注我们
求助内容：
应助结果提醒方式：