ΒC

Β.N. Chatterji

Indian Institute of Technology Kharagpur

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Prabir Kumar Biswas

Indian Institute of Technology Kharagpur

Partha Pratim Das

Indian Institute of Technology Kharagpur

Jayanta Mukherjee

Indian Institute of Technology Kharagpur

Manesh Kokare

Institute of Engineering

Manas Saha

University of Saskatchewan

Avijit Kar

Jadavpur University

Mrinal Kanti Naskar

Jadavpur University

Rutuparna Panda

Veer Surendra Sai University of Technology

Ambar Dutta

Birla Institute of Technology, Mesra

M. Aswatha Kumar

Christ University

Cooperative Institutions

Indian Institute of Technology Kharagpur

Indian Institute of Technology Indore

Jadavpur University

Birla Institute of Technology, Mesra

National Institute of Technology Rourkela

University of Kalyani

Indian Statistical Institute

Jawaharlal Nehru Technological University, Kakinada

Indian Institute of Technology Bombay

Indian Institute of Engineering Science and Technology, Shibpur

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

A new approach to corner matching from image sequence using fuzzy similarity index

Pattern Recognition Letters (2010)

Ambar Dutta Avijit Kar Β.N. Chatterji

Similarity (geometry)

Similarity measure

Cross-correlation

10.1016/j.patrec.2010.12.006

Cite

Citations (17)

Segmentation Of Range Images Using Morphological Operators

Prabir Kumar Biswas Shreya biswas Amarjit Roy Β.N. Chatterji

In this paper we present an algorithm for segmentation of range images using the digitisable operations of morphology. The range image is segmented into planar primitives based on their orientations. The concept of Neighborhood Plane Sets (NPS) introduced by Mukherjee et al [10] has been used. The NPS proposed in [ 10] has been augmented by considering four more orientations. A straightforward technique for the extraction of NPS has been proposed. NPS extraction is followed by a smoothing step. The final segments are extracted using a particle marking scheme.

Smoothing

10.1109/tencon.1991.753897

Cite

Citations (3)

Mammogram denoising by curvelet transform based on the information of neighbouring coefficients

Manas Saha Mrinal Kanti Naskar Β.N. Chatterji

We present here an experimental work on mammogram denoising by the mathematical tool called the curvelet transform. The infiltration of noise in mammogram during the X-ray screening is a common and inevitable phenomenon. And such noise is normally reduced by the curvelet transform based on conventional thresholding strategy called the hard thresholding (HT). Therefore, the motive of this experimentation is to suggest an alternate but efficient mechanism of mammogram denoising by the same transform but with different algorithms purely based on the information of the neighbouring coefficients. It is found that the curvelet transform applied with the precept of surrounding curvelet coefficients is visually and statistically better than the conventional approach based on HT.

Curvelet

10.1109/c3it.2015.7060180

Cite

Citations (6)

An SIMD algorithm for range image segmentation

Pattern Recognition (1995)

Prabir Kumar Biswas Satarupa Biswas Β.N. Chatterji

SIMD

10.1016/0031-3203(94)00093-2

Cite

Citations (3)

Recognition of Distorted Kannada Characters

IETE Journal of Research (1984)

T.R. Rammohan Β.N. Chatterji

This paper deals with the recognition of distorted Kannada characters. Hamming distance concept and Viterbi algorithm were used for recognition. Modified trellis was used for accurate decision and high speed processing.

Kannada

Viterbi algorithm

Trellis (graph)

10.1080/03772063.1984.11453272

Cite

Citations (3)

Image Segmentation Using Suprathreshold Stochastic Resonance

International Journal of Electrical and Computer Engineering (IJECE) (2010)

Rajib Kumar Jha Prabir Kumar Biswas Β.N. Chatterji

Stochastic Resonance

Source

Cite

Citations (4)

Theoretical study of use of optical orthogonal codes for compressed video transmission in optical code division multiple access (OCDMA) system

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE (2007)

Shila Ghosh Β.N. Chatterji

A theoretical investigation to evaluate the performance of optical code division multiple access (OCDMA) for compressed video transmission is shown. OCDMA has many advantages than a typical synchronous protocol time division multiple access (TDMA). A pulsed laser transmission of multi channel digital video can be done using various techniques depending on whether the multi channel data are to be synchronous or asynchronous. A typical form of asynchronous digital operation is wavelength division multiplexing (WDM) in which the digital data of each video source are assigned a specific and separate wavelength. A sophisticated hardware such as accurate wavelength control of all lasers and tunable narrow band optical filters at the receivers is required in this case. A major disadvantage with CDMA is the reduction in per channel data rate (relative to the speeds available in the laser itself) that occurs in the insertion of code addressing. Hence optical CDMA for the video transmission application is meaningful when individual channel video bit rates can be significantly reduced and that can be done by compression of video data. In our work for compression of video image standard JPEG is implemented where a compression ratio of about 60 % is obtained without noticeable image degradation. Compared to the other existing techniques JPEG standard achieves higher compression ration with high S/N ratio. Here we demonstrated the auto and cross correlation properties of the codes. We have shown the implementation of bipolar Walsh coding in OCDMA system and their use in transmission of image/video.

10.1117/12.732290

Cite

Citations (4)

Fourier-Mellin Transform based Image Matching Algorithm

IETE Journal of Research (1996)

Biswarup Dasgupta Β.N. Chatterji

Image matching methods should be invariant to translation, rotation and scale. This paper presents such an image matching algorithm based on Fourier-Mellin transform. An algorithm for calculation of Fourier-Mellin descriptors is first discussed. The invariance of Fourier-Mellin transform to rotation, translation and scaling is stated along with necessary proof. A segmentation and feature based matching algorithm based on the Fourier- Mellin transform is then presented. The use of the algorithm on two natural images is presented. The time complexity of the algorithm is also discussed.

Mellin transform

Hartley transform

Mellin inversion theorem

10.1080/03772063.1996.11415890

Cite

Citations (15)

Hyperspheres in digital geometry

Information Sciences (1990)

Partha Pratim Das Β.N. Chatterji

Digital geometry

Degree (music)

10.1016/0020-0255(90)90005-u

Cite

Citations (9)

TheL₂Polynomial Spline Wavelet Transforms: A Signal and Image Processing Perspective

IETE Technical Review (1998)

Rutuparna Panda Β.N. Chatterji

This paper presents an overview of the suitability of the polynomial spline wavelet transform to qualify as an elegant tool for multiresolution signal decomposition. The paper also reviews the effectiveness of the polynomial spline function that has maintained its leadership among its clan having wide applications in different areas ranging from the field of function approximation to computer vision. Construction of different scaling functions and their properties are shown. Polynomial spline wavelets and their characteristics are also shown. We have introduced the special cases of generalised spline wavelets. The distinctive features of these various representations are discussed with respect to the multiresolution signal decomposition. The main thrust is to emphasize a signal and image processing point of view which should make these techniques more attractive for mathematicians and signal processors.

Spline (mechanical)

10.1080/02564602.1998.11416744

Cite

Citations (3)