Pub Date : 2009-12-28DOI: 10.1109/ICIINFS.2009.5429854
A. Ramanan, M. Niranjan
In this paper we propose a novel approach to constructing a discriminant visual codebook in a simple and extremely fast way as a one-pass, that we call Resource-Allocating Codebook (RAC), inspired by the Resource Allocating Network (RAN) algorithms developed in the artificial neural networks literature. Unlike density preserving clustering, this approach retains data spread out more widely in the input space, thereby including rare low level features in the codebook. We show that the codebook constructed by the RAC technique outperforms the codebook constructed by K-means clustering in recognition performance and computation on two standard face databases, namely the AT&T and Yale faces, performed with SIFT features.
{"title":"Resource-Allocating Codebook for patch-based face recognition","authors":"A. Ramanan, M. Niranjan","doi":"10.1109/ICIINFS.2009.5429854","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429854","url":null,"abstract":"In this paper we propose a novel approach to constructing a discriminant visual codebook in a simple and extremely fast way as a one-pass, that we call Resource-Allocating Codebook (RAC), inspired by the Resource Allocating Network (RAN) algorithms developed in the artificial neural networks literature. Unlike density preserving clustering, this approach retains data spread out more widely in the input space, thereby including rare low level features in the codebook. We show that the codebook constructed by the RAC technique outperforms the codebook constructed by K-means clustering in recognition performance and computation on two standard face databases, namely the AT&T and Yale faces, performed with SIFT features.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126939552","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429839
Mahendra Samarawickrama, A. Pasqual, R. Rodrigo
A single-chip FPGA implementation of a vision core is an efficient way to design fast and compact embedded vision systems from the PCB design level. The scope of the research is to design a novel FPGA-based parallel architecture for embedded vision entirely with on-chip FPGA resources. We designed it by utilizing block-RAMs and IO interfaces on the FPGA. As a result, the system is compact, fast and flexible. We evaluated this architecture for several mid-level neighborhood algorithms using Xilinx Virtex-2 Pro (XC2VP30) FPGA. Our algorithm uses a vision core with a 100 MHz system clock which supports image processing on a low-resolution image of 128×128 pixels up to 200 images per second. The results are accurate. We have compared our results with existing FPGA implementations. The performance of the algorithms could be substantially improved by applying sufficient parallelism.
单片FPGA实现视觉核心是从PCB设计层面设计快速、紧凑的嵌入式视觉系统的有效途径。研究的范围是完全利用片上FPGA资源设计一种基于FPGA的嵌入式视觉并行架构。我们利用FPGA上的块ram和IO接口来设计它。因此，该系统具有紧凑、快速、灵活的特点。我们使用Xilinx Virtex-2 Pro (XC2VP30) FPGA对该架构进行了几种中级邻域算法的评估。我们的算法使用具有100 MHz系统时钟的视觉核心，支持在128×128像素的低分辨率图像上进行图像处理，每秒高达200张图像。结果是准确的。我们将我们的结果与现有的FPGA实现进行了比较。通过应用足够的并行性，可以大大提高算法的性能。
{"title":"FPGA-based compact and flexible architecture for real-time embedded vision systems","authors":"Mahendra Samarawickrama, A. Pasqual, R. Rodrigo","doi":"10.1109/ICIINFS.2009.5429839","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429839","url":null,"abstract":"A single-chip FPGA implementation of a vision core is an efficient way to design fast and compact embedded vision systems from the PCB design level. The scope of the research is to design a novel FPGA-based parallel architecture for embedded vision entirely with on-chip FPGA resources. We designed it by utilizing block-RAMs and IO interfaces on the FPGA. As a result, the system is compact, fast and flexible. We evaluated this architecture for several mid-level neighborhood algorithms using Xilinx Virtex-2 Pro (XC2VP30) FPGA. Our algorithm uses a vision core with a 100 MHz system clock which supports image processing on a low-resolution image of 128×128 pixels up to 200 images per second. The results are accurate. We have compared our results with existing FPGA implementations. The performance of the algorithms could be substantially improved by applying sufficient parallelism.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123128067","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429846
V. R. Herath, O. Adamczyk, R. Peveling, C. Wodehoff, R. Noé
This paper presents the design of an input interface to a CMOS DSPU of an optical coherent QPSK with polarization multiplex receiver. The interface consists of a 20 channel 1:8 DEMUX. Source Coupled FET logic (SCFL) and CMOS logic were used in the design. The interface converts 10 Gbit/s input data rate to 1.25 Gbit/s at the output. The interface gives an open eye diagram at the output up to 9.5 Gbit/s input data rate. The system consumes 7.9 mW/channel.Gb/s. 130 nm bulk CMOS technology was used in the design.
{"title":"9.5 Gbit/s 20 channel 1∶8 DEMUX for a coherent optical receiver DSPU ASIC input interface","authors":"V. R. Herath, O. Adamczyk, R. Peveling, C. Wodehoff, R. Noé","doi":"10.1109/ICIINFS.2009.5429846","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429846","url":null,"abstract":"This paper presents the design of an input interface to a CMOS DSPU of an optical coherent QPSK with polarization multiplex receiver. The interface consists of a 20 channel 1:8 DEMUX. Source Coupled FET logic (SCFL) and CMOS logic were used in the design. The interface converts 10 Gbit/s input data rate to 1.25 Gbit/s at the output. The interface gives an open eye diagram at the output up to 9.5 Gbit/s input data rate. The system consumes 7.9 mW/channel.Gb/s. 130 nm bulk CMOS technology was used in the design.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116460835","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429861
U. Dharmapriya, S. Siyambalapitiya, A. Kulatunga
With the rapid development of Information Technology (IT) in recent past, number of unsolved real-world complex problems benefited immensely since solutions could be found within considerable time period. This is mainly due to the computational intelligence techniques which can deliver a reasonably good result within a shorter time period by performing complex calculations with numbers of iterations. Distribution operation is a common problem in the area of supply chain management which got the attention for many years. However, up to now only simplified versions of distribution operations such as Vehicle Routing Problem (VRP), Travelling Salesman Problem (TSP) have being considered by many researches. Some of the researchers adopted with heuristic approaches such as Simulated Annealing (SA), Genetic Algorithm (GA), Tabu Search (TS) and etc. with number of assumptions. However, the standard problems are far away from the real world problem. Furthermore, when the problem size (or scale) increases, the computational time to finds the optimal results increase exponentially, hence these problems are categorized as +P-hard problems in mathematical terms. To bridge the gap between standard problems in distribution and the real world problems, in this research, the standard VRP problem is extended to multi depot environment with split delivery option and tries to investigate the applicability of Simulated Annealing (SA) and Tabu Search (TS) to find solutions to this complex problem within considerable time frame. +umbers of simulation studies are carried out with both of these techniques and results revealed that both these techniques can be adapted to complex Multi Depot Vehicle Routing Problem with Time Windows and Split Delivery (MDVRPTWSD) problem and TS out performances in solution quality.
{"title":"Computational intelligence techniques to optimize a constrained distribution operations","authors":"U. Dharmapriya, S. Siyambalapitiya, A. Kulatunga","doi":"10.1109/ICIINFS.2009.5429861","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429861","url":null,"abstract":"With the rapid development of Information Technology (IT) in recent past, number of unsolved real-world complex problems benefited immensely since solutions could be found within considerable time period. This is mainly due to the computational intelligence techniques which can deliver a reasonably good result within a shorter time period by performing complex calculations with numbers of iterations. Distribution operation is a common problem in the area of supply chain management which got the attention for many years. However, up to now only simplified versions of distribution operations such as Vehicle Routing Problem (VRP), Travelling Salesman Problem (TSP) have being considered by many researches. Some of the researchers adopted with heuristic approaches such as Simulated Annealing (SA), Genetic Algorithm (GA), Tabu Search (TS) and etc. with number of assumptions. However, the standard problems are far away from the real world problem. Furthermore, when the problem size (or scale) increases, the computational time to finds the optimal results increase exponentially, hence these problems are categorized as +P-hard problems in mathematical terms. To bridge the gap between standard problems in distribution and the real world problems, in this research, the standard VRP problem is extended to multi depot environment with split delivery option and tries to investigate the applicability of Simulated Annealing (SA) and Tabu Search (TS) to find solutions to this complex problem within considerable time frame. +umbers of simulation studies are carried out with both of these techniques and results revealed that both these techniques can be adapted to complex Multi Depot Vehicle Routing Problem with Time Windows and Split Delivery (MDVRPTWSD) problem and TS out performances in solution quality.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611854","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429836
P. K. Sa, Ratnakar Dash, B. Majhi
The proposed approach of removal of random valued impulsive noise from images works in two phases. The first phase detects contaminated pixels and the second phase filters only those pixels keeping others intact. The detection scheme utilizes second order difference of pixels in a test window and the filtering scheme is a variation median filter based on the edge information. The proposed scheme is simulated extensively on standard images and comparison with existing schemes reveal that our scheme outperforms them in terms of Peak Signal to Noise Ratio (PSNR), number of false detection and miss detection. The proposed scheme is also good at preserving finer details. Further, the computational complexity and number of iterations needed by the proposed scheme is less than the existing counterparts.
{"title":"Second order difference based detection and directional weighted median filter for removal of random valued impulsive noise","authors":"P. K. Sa, Ratnakar Dash, B. Majhi","doi":"10.1109/ICIINFS.2009.5429836","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429836","url":null,"abstract":"The proposed approach of removal of random valued impulsive noise from images works in two phases. The first phase detects contaminated pixels and the second phase filters only those pixels keeping others intact. The detection scheme utilizes second order difference of pixels in a test window and the filtering scheme is a variation median filter based on the edge information. The proposed scheme is simulated extensively on standard images and comparison with existing schemes reveal that our scheme outperforms them in terms of Peak Signal to Noise Ratio (PSNR), number of false detection and miss detection. The proposed scheme is also good at preserving finer details. Further, the computational complexity and number of iterations needed by the proposed scheme is less than the existing counterparts.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128442653","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429840
N. Ghoshal, J. K. Mandal, A. Khamrui
This study deals with devising and implementing a novel technique for image authentication and secured message transmission based on hiding large volume of data into gray scale images. Image authentication is done by embedding message / image in spatial domain by choosing image blocks of size 3 × 3 from the source image in row major order. Three bits of authenticating message /image/message-digest are fabricated within each source image byte of each image block where the position is chosen randomly using a hash function b7b6b5 ⨁k where b7, b6, b5 are higher order three bits of each source image byte and k is an integer number varies from 0 to 7, and the process is repeated for the whole image. The dimension of authenticating image followed by message digest (MD) and the content of authenticating message/image are also embedded. To enhance the security a layer has also been fabricated by XOR operation of the embedded image with a self generated MD obtained from the source image. Reverse process is applied for decoding. The results have been tested through histogram analysis, noise analysis and standard deviation computation of the source image with the embedded image and compared with popular existing steganographic algorithms like S-Tools. It is seen that the proposed FBIA is capable to embed more information than S-Tools with better fidelity.
{"title":"A framework for block based image authentication (FBIA)","authors":"N. Ghoshal, J. K. Mandal, A. Khamrui","doi":"10.1109/ICIINFS.2009.5429840","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429840","url":null,"abstract":"This study deals with devising and implementing a novel technique for image authentication and secured message transmission based on hiding large volume of data into gray scale images. Image authentication is done by embedding message / image in spatial domain by choosing image blocks of size 3 × 3 from the source image in row major order. Three bits of authenticating message /image/message-digest are fabricated within each source image byte of each image block where the position is chosen randomly using a hash function b7b6b5 ⨁k where b7, b6, b5 are higher order three bits of each source image byte and k is an integer number varies from 0 to 7, and the process is repeated for the whole image. The dimension of authenticating image followed by message digest (MD) and the content of authenticating message/image are also embedded. To enhance the security a layer has also been fabricated by XOR operation of the embedded image with a self generated MD obtained from the source image. Reverse process is applied for decoding. The results have been tested through histogram analysis, noise analysis and standard deviation computation of the source image with the embedded image and compared with popular existing steganographic algorithms like S-Tools. It is seen that the proposed FBIA is capable to embed more information than S-Tools with better fidelity.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128693215","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429795
W. Tennakoon, S. R. Munasinghe
This paper presents a real time non linear automatic UAV simulation test-bed and autonomous control implementation with way point navigation. This UAV simulator is an integrated product that combines a vehicle operator station with a synthetic environment to support UAV research, training and operations while providing the operators (Internal Pilot) with a consistent interface. the simulated air vehicle operates against simulated terrain, weather, and computer generated forces In the synthetic mission space. External pilot also interact into synthetic simulation test-bed. The autonomous control system is based on the Aerosonde UAV and major considerations of controller performance and minimum instability within manual and autonomous switching have been evaluated with full software simulation. Major requirements for the good control system are minimum overshoot, minimum setting time without undesirable oscillation and low cross coupling between high level commands. A MATLAB simulink standard configuration environment and the Aerosim Aeronautical Simulation Block Set are utilized for simulation studies, presented through a flightgear interface and Custom GUI. The AeroSim® simulation environment features a complete detailed 6 degrees-of-freedom nonlinear generic UAV model which consist earth, atmospheric, aerodynamics, inertia and equation of motion sub models.
{"title":"Design of a fully fledged uav test-bed with internal and external pilot","authors":"W. Tennakoon, S. R. Munasinghe","doi":"10.1109/ICIINFS.2009.5429795","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429795","url":null,"abstract":"This paper presents a real time non linear automatic UAV simulation test-bed and autonomous control implementation with way point navigation. This UAV simulator is an integrated product that combines a vehicle operator station with a synthetic environment to support UAV research, training and operations while providing the operators (Internal Pilot) with a consistent interface. the simulated air vehicle operates against simulated terrain, weather, and computer generated forces In the synthetic mission space. External pilot also interact into synthetic simulation test-bed. The autonomous control system is based on the Aerosonde UAV and major considerations of controller performance and minimum instability within manual and autonomous switching have been evaluated with full software simulation. Major requirements for the good control system are minimum overshoot, minimum setting time without undesirable oscillation and low cross coupling between high level commands. A MATLAB simulink standard configuration environment and the Aerosim Aeronautical Simulation Block Set are utilized for simulation studies, presented through a flightgear interface and Custom GUI. The AeroSim® simulation environment features a complete detailed 6 degrees-of-freedom nonlinear generic UAV model which consist earth, atmospheric, aerodynamics, inertia and equation of motion sub models.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793580","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429889
Michael Medagama, D. Dias, S. Fernando
Bandwidth scarcity is a common problem faced in multimedia transmission over broadband wireless networks. From a consumer's perspective, the effectiveness of multimedia delivery suffers significantly in such networks. Further, in a mobile environment, when the number of users increases, they experience interruptions in the received multimedia streams. Adaptive streaming is one solution that can be adopted in any network environment regardless of the nature of the network. Adaptive streaming can be achieved using transcoding techniques. Transcoding is a mechanism that converts a video to a form that has less information so that the resulting data volume is appropriate for streaming over a low bandwidth network. However, the quality of the video stream drops due to transcoding. The advantage is that when there is a large number of users sharing the network, users could watch a video at a lower quality with no interruption if the transcoding is applied before the video is streamed to the end user. i.e., a compromise can be made between the video quality and network delay. The main focus of this research is to analyze the variation of transcoding parameters with respect to bandwidth, in order to achieve an adaptive streaming solution of optimum achievable quality in a low bandwidth broadband network.
{"title":"Transcoding based optimum quality video streaming under limited bandwidth","authors":"Michael Medagama, D. Dias, S. Fernando","doi":"10.1109/ICIINFS.2009.5429889","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429889","url":null,"abstract":"Bandwidth scarcity is a common problem faced in multimedia transmission over broadband wireless networks. From a consumer's perspective, the effectiveness of multimedia delivery suffers significantly in such networks. Further, in a mobile environment, when the number of users increases, they experience interruptions in the received multimedia streams. Adaptive streaming is one solution that can be adopted in any network environment regardless of the nature of the network. Adaptive streaming can be achieved using transcoding techniques. Transcoding is a mechanism that converts a video to a form that has less information so that the resulting data volume is appropriate for streaming over a low bandwidth network. However, the quality of the video stream drops due to transcoding. The advantage is that when there is a large number of users sharing the network, users could watch a video at a lower quality with no interruption if the transcoding is applied before the video is streamed to the end user. i.e., a compromise can be made between the video quality and network delay. The main focus of this research is to analyze the variation of transcoding parameters with respect to bandwidth, in order to achieve an adaptive streaming solution of optimum achievable quality in a low bandwidth broadband network.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128657821","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429895
Jayanta Pal, J. K. Mandal
In this paper a four stage character/bit level encoding technique (RBCMCPCC) has been proposed, where the first three steps take input block of length 128 bit, 192bit and 256 bit, respectively, and generate intermediate blocks of the same lengths using identical lengths of keys in each step. The fourth stage generates final cipher blocks based on random session-keys. Before execution of the fourth sage, all 256 bit blocks are passed through the chaining process to ensure the generation of non-identical intermediate stream. A two dimensional matrix based substitution and folding operation is performed in the first stage of encryption, whereas a three dimensional matrix based permutation and substitution operation is done in the next sage. Again, a four dimensional matrix oriented substitution and transposition operation is applied in the third stage. Finally, wrapping operation is done to produce the cipher text. To expound the effectiveness of the algorithm, the obtained results are compared with BAM, TDES, CTSCCT and RSA algorithms.
{"title":"A random block length based cryptosystem through multiple cascaded permutation-combinations and chaining of blocks","authors":"Jayanta Pal, J. K. Mandal","doi":"10.1109/ICIINFS.2009.5429895","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429895","url":null,"abstract":"In this paper a four stage character/bit level encoding technique (RBCMCPCC) has been proposed, where the first three steps take input block of length 128 bit, 192bit and 256 bit, respectively, and generate intermediate blocks of the same lengths using identical lengths of keys in each step. The fourth stage generates final cipher blocks based on random session-keys. Before execution of the fourth sage, all 256 bit blocks are passed through the chaining process to ensure the generation of non-identical intermediate stream. A two dimensional matrix based substitution and folding operation is performed in the first stage of encryption, whereas a three dimensional matrix based permutation and substitution operation is done in the next sage. Again, a four dimensional matrix oriented substitution and transposition operation is applied in the third stage. Finally, wrapping operation is done to produce the cipher text. To expound the effectiveness of the algorithm, the obtained results are compared with BAM, TDES, CTSCCT and RSA algorithms.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591763","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429864
A. K. B. Karunathilake, B. Balasuriya, R. Ragel
CAPTCHAs or reverse Turing tests are real-time assessments used by programs (or computers) to tell humans and machines apart. This is achieved by assigning and assessing hard AI problems that could only be solved easily by human but not by machines. Applications of such assessments range from stopping spammers from automatically filling online forms to preventing hackers from performing dictionary attack. Today, the race between makers and breakers of CAPTCHAs is at a juncture, where the CAPTCHAs proposed are not even answerable by humans. We consider such CAPTCHAs as non user friendly. In this paper, we propose a novel technique for reverse Turing test - we call it the Line CAPTCHAs - that mainly focuses on user friendliness while not compromising the security aspect that is expected to be provided by such a system.
{"title":"User friendly line CAPTCHAs","authors":"A. K. B. Karunathilake, B. Balasuriya, R. Ragel","doi":"10.1109/ICIINFS.2009.5429864","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429864","url":null,"abstract":"CAPTCHAs or reverse Turing tests are real-time assessments used by programs (or computers) to tell humans and machines apart. This is achieved by assigning and assessing hard AI problems that could only be solved easily by human but not by machines. Applications of such assessments range from stopping spammers from automatically filling online forms to preventing hackers from performing dictionary attack. Today, the race between makers and breakers of CAPTCHAs is at a juncture, where the CAPTCHAs proposed are not even answerable by humans. We consider such CAPTCHAs as non user friendly. In this paper, we propose a novel technique for reverse Turing test - we call it the Line CAPTCHAs - that mainly focuses on user friendliness while not compromising the security aspect that is expected to be provided by such a system.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513708","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
扫码关注我们
求助内容：
应助结果提醒方式：