Rangarajan Aravind

Rangarajan Aravind

Auto-generated profile, based on publicly available information

Rangarajan Aravind

Indian Institute of Technology Madras

Research Focus & Metrics

Academic Career Length

40Years (1987-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 1987 in Optical Engineering
Verified
Journal Article
Closed access
PDF file
RAR. Aravind
R. Aravind
AGAllen Gersho
Allen Gersho
Image compression using memoryless vector quantization (VQ), in which small blocks (vectors) of pixels are independently encoded, has been demonstrated to be an effective technique for achieving bit rates above 0.6 bits per pixel (bpp). To maintain the same quality at lower rates, it is necessary to exploit spatial redundancy over a larger region of pixels than is possible with memoryless VQ. This can be achieved by incorporating memory of previously encoded blocks into the encoding of each successive input block. Finite-state vector quantization (FSVQ) employs a finite number of states, which summarize key information about previously encoded vectors, to select one of a family of codebooks to encode each input vector. In this paper, we review the basic ideas of VQ and extend the finite-state concept to image compression. We introduce a novel for-mulation of the state and state-transition rule that uses a perceptually based edge classifier. We also examine the use of interpolation in conjunction with VQ with finite memory. Coding results are presented for monochrome images in the bit-rate range of 0.24 to 0.32 bpp. The results achieved with finite memory are comparable to those of memoryless VQ at 0.6 bpp and show that there are significant gains to be obtained by enhancing the basic VQ approach with interblock memory.

2 January 1993 in AT&T Technical Journal
Verified
Journal Article
Closed access
PDF file
RARangarajan Aravind
Rangarajan Aravind
GCGlenn L. Cash
Glenn L. Cash
DDDonald L. Duttweiler
Donald L. Duttweiler
HHHsueh-Ming Hang
Hsueh-Ming Hang
BHBarry G. Haskell
Barry G. Haskell
APAtul Puri
Atul Puri
Most image or video applications involving transmission or storage require some form of data compression to reduce the otherwise inordinate demand on bandwidth and storage. Compatibility among different applications and manufacturers is very desirabl...

1 June 2016
Verified
Conference Paper
Closed access
VRVijay Rengarajan
Vijay Rengarajan
ARA. N. Rajagopalan
A. N. Rajagopalan
RAR. Aravind
R. Aravind
The rule of perspectivity that 'straight-lines-mustremain-straight' is easily inflected in CMOS cameras by distortions introduced by motion. Lines can be rendered as curves due to the row-wise exposure mechanism known as rolling shutter (RS). We solve the problem of correcting distortions arising from handheld cameras due to RS effect from a single image free from motion blur with special relevance to urban scenes. We develop a procedure to extract prominent curves from the RS image since this is essential for deciphering the varying row-wise motion. We pose an optimization problem with line desirability costs based on straightness, angle, and length, to resolve the geometric ambiguities while estimating the camera motion based on a rotation-only model assuming known camera intrinsic matrix. Finally, we rectify the RS image based on the estimated camera trajectory using inverse mapping. We show rectification results for RS images captured using mobile phone cameras. We also compare our single image method against existing video and nonblind RS rectification methods that typically require multiple images.

18 January 2006
Verified
Conference Paper
Closed access
PPParimal Parag
Parimal Parag
SBSrikrishna Bhashyam
Srikrishna Bhashyam
RAR. Aravind
R. Aravind
— We propose a new subcarrier allocation algo- rithm for Orthogonal Frequency Division Multiple Access (OFDMA) that gives fair allocation of capacity to multiple users with different channel and traffic characteristics. This is achieved by utilizing buffer state information and mea- sured traffic statistics in addition to channel state feedback. Multiuser diversity gains are achieved in the proposed al- gorithm by scheduling across both time (buffering) and fre- quency (subcarriers). Simulation results are shown to illus- trate (a) improved capacity allocation and throughput, and (b) larger admissible traffic when compared to the existing algorithms. Keywords - OFDMA; Scheduling; Subcarriers; Buffering;

19 June 2008 in Electronics Letters
Verified
Journal Article
Closed access
JOJ. Oliver
J. Oliver
RAR. Aravind
R. Aravind
KPK.M.M. Prabhu
K.M.M. Prabhu
A threshold-based procedure to estimate sparse channels in an orthogonal frequency division multiplexing (OFDM) system is proposed. An optimal threshold is derived by maximising the probability of correct detection between significant and zero-valued taps estimated by the least squares (LS) estimator. Improved LS estimates are obtained by pruning the LS estimates with the statistically derived threshold.

9 September 2008 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
GSG. R. K. S. Subrahmanyam
G. R. K. S. Subrahmanyam
ARA. N. Rajagopalan
A. N. Rajagopalan
RAR. Aravind
R. Aravind
This correspondence proposes a recursive algorithm for noise reduction in synthetic aperture radar imagery. Excellent despeckling in conjunction with feature preservation is achieved by incorporating a discontinuity-adaptive Markov random field prior within the unscented Kalman filter framework through importance sampling. The performance of this method is demonstrated on both synthetic and real examples.