Prof Barun Biswas - Academia.edu (original) (raw)

Uploads

Papers by Prof Barun Biswas

Computer of the day deals with binary digits. When the project started we were initially with com... more Computer of the day deals with binary digits. When the project started we were initially with complexity of arithmetic algorithm. Classical Booth‟s algorithm is universally accepted as it is not prone to sign changing. However we must remember that computer can do whatever we ask to do. We basically observed that Strassen matrix multiplication algorithm where there is any place to play with it. We started thinking. We know that no finite state machine can multiply arbitrarily large pair of binary numbers. We compromise and consider binary number n to be adjustable according to machine consideration both in time and space. We started our experiment with checking shift operation in multiplication by considering multiple shift at the same time. The result was encouraging. Our effort is supported by detailed performance profile analysis. The work is an initial effort. The extension of the work is possible and we are sure we will preside to new revolution in near future

Considering the vast collection of handwritten documents in various archives, research studies fo... more Considering the vast collection of handwritten documents in various archives, research studies for their automatic processing have major impact in the society. Line segmentation from images of such documents is a crucial step. The problem is more difficult for documents of major Indian scripts such as Bangla because a large number of its characters have either ascender or descender or both and the majority of its writers are accustomed in extremely cursive handwriting. In this article, we describe a novel strip based text line segmentation method for handwritten documents of Bangla. Moreover, the proposed method has been found to perform efficiently on English and Devanagari handwritten documents. We conducted extensive experimentations and its results show the robustness of the proposed approach on multiple scripts.

Multi plication process is not only bounded only in mathematics. It is also applied in many other... more Multi plication process is not only bounded only in mathematics. It is also applied in many other fields where a sequence of summing or additi on is to be applied. Multi plication is nothing but a sequence of addi tion performed repeatedl y. Our basic approach is to consider as many bits of multi plier as possible so that the total number of partial product. In this paper we tried to i mplement such a techni que where we can consider more than one two bi ts(compared to Booth's process of multi plication) of the multi plier to decrease the total number of parti al product with the other operation like addi tion, shift and complement.

For the security porpoise in the internet cryptography is one of the most important subjects nowa... more For the security porpoise in the internet cryptography is one of the most important subjects nowadays. Designing a cypher for data exchange between two nodes or receiver and sender deals with one of the troubleshoot jobs. In our proposed algorithm we try to introduce a new technique in the field of cryptography. We are hopeful that this new technique will sure reduces the overhead of data or key exchange between nodes. Here we will discuss the symmetric key exchange between nodes.

Journal of Global Research in Computer Science, Jun 10, 2012

The aroma of multiplication algorithm is ever lasting. It is due to time, space and cost effectiv... more The aroma of multiplication algorithm is ever lasting. It is due to time, space and cost effective as well as number representation. We study here that given a multiplier whether we will take one bit, two bit, three bit or in general n bit for multiplicative realization. Since initial inspiration is Booth's algorithm[1] we consider an interesting aberration of Booth's multiplication algorithm in this paper called BKS(named after the author Barun Biswas, Krishnendu Basuli & Samar Sen Sarma). The BKS algorithm surpasses Booth's algorithm with minimum cost.

Cryptography is a technique in which a data is transmitted through the medium without being hampe... more Cryptography is a technique in which a data is transmitted through the medium without being hampered. It is not new subject. It was used far ago. This technique deals with many steps, such as: key generation, key transmission, key storage and key deletion. The most difficult part of the cryptography is the design of cipher; i.e. designing of the algorithm used to encrypt and decrypt plain text and cipher text respectively. A problem generally noticed is man-in-the-middle attack. We will try to eliminate or reduce the chance to occur this problem.

Procedia Technology, 2013

In this paper we summarize the existing work on classical Booth's algorithm of multiplication and... more In this paper we summarize the existing work on classical Booth's algorithm of multiplication and propose an improved version of its general form. In Booth's or modified Booth's algorithm two bits or three bits are considered at a time in the multiplier. Here we have shown an approach of using any number of bits of the multiplier. Then we find an optimal value of such bits for which the complexity of the operation will be minimal.

2014 22nd International Conference on Pattern Recognition, 2014

This article deals with binarization of degraded document images. In the proposed approach, Canny... more This article deals with binarization of degraded document images. In the proposed approach, Canny edge image of the input degraded document image is obtained after blurring it with a Gaussian filter. Next, the gray values of the two pixels of the input image at the left and right of each edge pixel are noted to form a histogram of these gray values which possesses two distinct peaks and the lowest valley between them provides the global threshold value. Each pixel with gray value greater than the above threshold is turned as background pixel. A small square window is considered around each non-background pixel and certain simple statistics are computed on the gray values of the pixels of this small window based on which the said pixel is turned either background or foreground. Such a local thresholding method at the latter stage can efficiently handle various degradations in the document. The binarized image so obtained is finally subjected to certain common post-processing operations. The proposed method has been compared with a few existing binarization techniques.

IOSR Journal of Engineering, 2012

This paper is remodeling of Modified Booth's algorithm, where shift three at a time. The result s... more This paper is remodeling of Modified Booth's algorithm, where shift three at a time. The result shows that classical concept of single shift multiplication algorithms are to be revised with a multiple number of shifts. The observation is that in general the complexity is N/3, which is astonishingly harmonic to the number of bit shift operation. Clearly three shift reduces complexity to reciprocal of three. The matter is that behavior needs a generalized revision of the Booth's multiplicative algorithm.

arXiv (Cornell University), Sep 19, 2012

The most popular algorithms for generation of minimal spanning tree are Kruskal's[2] and Prim's[2... more The most popular algorithms for generation of minimal spanning tree are Kruskal's[2] and Prim's[2] algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix (DWCM); it is little bit modification of FCM.

Computer of the day deals with binary digits. When the project started we were initially with com... more Computer of the day deals with binary digits. When the project started we were initially with complexity of arithmetic algorithm. Classical Booth‟s algorithm is universally accepted as it is not prone to sign changing. However we must remember that computer can do whatever we ask to do. We basically observed that Strassen matrix multiplication algorithm where there is any place to play with it. We started thinking. We know that no finite state machine can multiply arbitrarily large pair of binary numbers. We compromise and consider binary number n to be adjustable according to machine consideration both in time and space. We started our experiment with checking shift operation in multiplication by considering multiple shift at the same time. The result was encouraging. Our effort is supported by detailed performance profile analysis. The work is an initial effort. The extension of the work is possible and we are sure we will preside to new revolution in near future

Considering the vast collection of handwritten documents in various archives, research studies fo... more Considering the vast collection of handwritten documents in various archives, research studies for their automatic processing have major impact in the society. Line segmentation from images of such documents is a crucial step. The problem is more difficult for documents of major Indian scripts such as Bangla because a large number of its characters have either ascender or descender or both and the majority of its writers are accustomed in extremely cursive handwriting. In this article, we describe a novel strip based text line segmentation method for handwritten documents of Bangla. Moreover, the proposed method has been found to perform efficiently on English and Devanagari handwritten documents. We conducted extensive experimentations and its results show the robustness of the proposed approach on multiple scripts.

Multi plication process is not only bounded only in mathematics. It is also applied in many other... more Multi plication process is not only bounded only in mathematics. It is also applied in many other fields where a sequence of summing or additi on is to be applied. Multi plication is nothing but a sequence of addi tion performed repeatedl y. Our basic approach is to consider as many bits of multi plier as possible so that the total number of partial product. In this paper we tried to i mplement such a techni que where we can consider more than one two bi ts(compared to Booth's process of multi plication) of the multi plier to decrease the total number of parti al product with the other operation like addi tion, shift and complement.

For the security porpoise in the internet cryptography is one of the most important subjects nowa... more For the security porpoise in the internet cryptography is one of the most important subjects nowadays. Designing a cypher for data exchange between two nodes or receiver and sender deals with one of the troubleshoot jobs. In our proposed algorithm we try to introduce a new technique in the field of cryptography. We are hopeful that this new technique will sure reduces the overhead of data or key exchange between nodes. Here we will discuss the symmetric key exchange between nodes.

Journal of Global Research in Computer Science, Jun 10, 2012

The aroma of multiplication algorithm is ever lasting. It is due to time, space and cost effectiv... more The aroma of multiplication algorithm is ever lasting. It is due to time, space and cost effective as well as number representation. We study here that given a multiplier whether we will take one bit, two bit, three bit or in general n bit for multiplicative realization. Since initial inspiration is Booth's algorithm[1] we consider an interesting aberration of Booth's multiplication algorithm in this paper called BKS(named after the author Barun Biswas, Krishnendu Basuli & Samar Sen Sarma). The BKS algorithm surpasses Booth's algorithm with minimum cost.

Cryptography is a technique in which a data is transmitted through the medium without being hampe... more Cryptography is a technique in which a data is transmitted through the medium without being hampered. It is not new subject. It was used far ago. This technique deals with many steps, such as: key generation, key transmission, key storage and key deletion. The most difficult part of the cryptography is the design of cipher; i.e. designing of the algorithm used to encrypt and decrypt plain text and cipher text respectively. A problem generally noticed is man-in-the-middle attack. We will try to eliminate or reduce the chance to occur this problem.

Procedia Technology, 2013

In this paper we summarize the existing work on classical Booth's algorithm of multiplication and... more In this paper we summarize the existing work on classical Booth's algorithm of multiplication and propose an improved version of its general form. In Booth's or modified Booth's algorithm two bits or three bits are considered at a time in the multiplier. Here we have shown an approach of using any number of bits of the multiplier. Then we find an optimal value of such bits for which the complexity of the operation will be minimal.

2014 22nd International Conference on Pattern Recognition, 2014

This article deals with binarization of degraded document images. In the proposed approach, Canny... more This article deals with binarization of degraded document images. In the proposed approach, Canny edge image of the input degraded document image is obtained after blurring it with a Gaussian filter. Next, the gray values of the two pixels of the input image at the left and right of each edge pixel are noted to form a histogram of these gray values which possesses two distinct peaks and the lowest valley between them provides the global threshold value. Each pixel with gray value greater than the above threshold is turned as background pixel. A small square window is considered around each non-background pixel and certain simple statistics are computed on the gray values of the pixels of this small window based on which the said pixel is turned either background or foreground. Such a local thresholding method at the latter stage can efficiently handle various degradations in the document. The binarized image so obtained is finally subjected to certain common post-processing operations. The proposed method has been compared with a few existing binarization techniques.

IOSR Journal of Engineering, 2012

This paper is remodeling of Modified Booth's algorithm, where shift three at a time. The result s... more This paper is remodeling of Modified Booth's algorithm, where shift three at a time. The result shows that classical concept of single shift multiplication algorithms are to be revised with a multiple number of shifts. The observation is that in general the complexity is N/3, which is astonishingly harmonic to the number of bit shift operation. Clearly three shift reduces complexity to reciprocal of three. The matter is that behavior needs a generalized revision of the Booth's multiplicative algorithm.

arXiv (Cornell University), Sep 19, 2012

The most popular algorithms for generation of minimal spanning tree are Kruskal's[2] and Prim's[2... more The most popular algorithms for generation of minimal spanning tree are Kruskal's[2] and Prim's[2] algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix (DWCM); it is little bit modification of FCM.