Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

M. R. Kaimal 0001

dblp:18/6407 · also M. Ramachandra Kaimal, Ramachandra Kaimal, Ramachandra Mathava Kaimal · DBLP profile ↗
← Back
16ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-1121-1888ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9Databases, data management, data science and information retrieval · 5Graphics, computer vision, multimedia, augmented reality and games · 4Applied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › business intelligence
prescriptive analytics
0.312018
Differentially Private Prescriptive Analytics · ICDM 2018
Data mining › statistical analysis
sensitivity analysis
0.312018
Differentially Private Prescriptive Analytics · ICDM 2018
Privacy and data protection
differential privacy
0.312018
Differentially Private Prescriptive Analytics · ICDM 2018

Methods — techniques the papers use, named apart from their topics

nested global optimization · 0.7constrained bayesian optimization · 0.7
YearPublicationVenuePosition
2019 SubspaceDB : In-database subspace clustering for analytical query processing
Sandhya Harikumar, M. R. Kaimal 0001
Data Knowl. Eng.2
2018 Differentially Private Prescriptive Analytics
abstract
Privacy preservation is important. Prescriptive analytics is a method to extract corrective actions to avoid undesirable outcomes. We propose a privacy preserving prescriptive analytics algorithm to protect the data used during the construction of the prescriptive analytics algorithm. We use differential privacy mechanism to achieve strong privacy guarantee. Differential privacy mechanism requires computation of sensitivity: maximum change in the output between two training datasets, which is differed by only one instance. The main challenge we addressed is the computation of sensitivity of the prescription vector. In absence of any analytical form, we construct a nested global optimization problem to compute the sensitivity. We solve the optimization problem using constrained Bayesian optimization, as the nested structure makes the objective function expensive. We demonstrate our algorithm on two real world datasets and observe that the prescription vectors remains useful even after making them private.
Haripriya Harikumar, Santu Rana, Sunil Gupta 0001, Thin Nguyen, M. R. Kaimal 0001, Svetha Venkatesh
ICDM5
2018 Prescriptive Analytics Through Constrained Bayesian Optimization
Haripriya Harikumar, Santu Rana, Sunil Gupta 0001, Thin Nguyen, M. R. Kaimal 0001, Svetha Venkatesh
PAKDD (1)5
2018 A 3D stroke based representation of sign language signs using key maximum curvature points and 3D chain codes
M. R. Kaimal 0001
Multim. Tools Appl.2
2016 Understanding Behavioral Differences Between Short and Long-Term Drinking Abstainers from Social Media
Haripriya Harikumar, Thin Nguyen, Sunil Gupta 0001, Santu Rana, M. R. Kaimal 0001, Svetha Venkatesh
ADMA5
2016 Extracting Key Challenges in Achieving Sobriety Through Shared Subspace Learning
Haripriya Harikumar, Thin Nguyen, Santu Rana, Sunil Gupta 0001, M. R. Kaimal 0001, Svetha Venkatesh
ADMA5
2016 Estimation of Driver Head Yaw Angle Using a Generic Geometric Model
abstract
Head yaw angle is an important indicator of a driver's distraction. Forward collision warning systems incorporate head yaw angle estimators for detecting driver's head-off-road glances. This paper presents a generic geometric model for head yaw estimation. The generic model is customized into 12 different models. The performance of the cylindrical and ellipsoidal models is improved by introducing nose projection and truncation. The yaw estimation problem is formulated using a single variable. This formulation provides better visualization of the cylindrical and ellipsoidal models. It is shown that the ellipsoidal model in literature is indeed a cylindrical model with nose projection. We have also proved that, under the ellipsoidal/cylindrical framework, the estimated yaw angle is independent of shifting the center of rotation along depth. Four previous works are shown as the customization of the proposed generic model. The performance of the proposed models are evaluated using four standard head pose datasets and an ADAS dataset. The proposed nose-projected truncated ellipsoidal model outperforms the state-of-the-art geometric models. Further, we have studied the impact of model parameters and inaccurate facial feature localization through simulation experiments.
S. Athinarayanan, M. R. Kaimal 0001, Kamal Bijlani
IEEE Trans. Intell. Transp. Syst.2
2014 Yaw Estimation Using Cylindrical and Ellipsoidal Face Models
abstract
Accurate head yaw estimation is necessary for detecting driver inattention in forward collision warning systems. In this paper, we propose three geometric models under the ellipsoidal framework for accurate head yaw estimation. We present theoretical analysis of the cylindrical and ellipsoidal face models used for yaw angle estimation of head rotation. The relationship between cylindrical, ellipsoidal, and proposed models is derived. We provide error functions for all models. Furthermore, for each model, over/under estimation of angle, zero crossings of error, bounds on yaw angle estimate, and bounds on error are presented. Experimental results of the proposed models on four standard head pose data sets yielded a mean absolute error between 4° and 8° demonstrating the efficacy of the proposed models over the state-of-the-art methods.
S. Athinarayanan, M. R. Kaimal 0001, Kamal Bijlani
IEEE Trans. Intell. Transp. Syst.2
2008 GAVLC: GA with Variable Length Chromosome for the simultaneous design and stability analysis of T-S fuzzy controllers
abstract
Most of the design techniques of T-S fuzzy controllers assumes that there exists an approximate T-S model of the system with fixed antecedent parts & rules and uses techniques like GA, LMI, etc for the optimal design of the gain values. This paper presents a novel integrated approach for the design and stability analysis of T-S fuzzy controllers using GA with variable length chromosomes (VLCs) and LMI. This approach helps to find out the optimal parameters of the antecedent parts of the rules along with rule optimization and also to optimize the consequent parts.
Reghunadhan Rajesh, M. R. Kaimal 0001
FUZZ-IEEE2
2007 Object Coding using a Shape Adaptive Wavelet Transform with Scalable WDR Method
abstract
In this paper, a shape adaptive wavelet transform coding scheme for arbitrarily shaped visual objects which is also scalable and progressive is proposed. The proposed scheme uses the shape adaptive wavelet transform (SA-DWT) of extracted objects for generating the wavelet coefficients and the wavelet difference method (SWDR) for progressive scalable coding and decoding. The method is developed for the limited bandwidth network where the image quality and data compression are most important. The experiments are performed on the MRI medical images, and video sequence images. The simulation results show that the proposed scheme is slightly better at all bit rates, in PSNR values compared to the other scalable coding schemes like SPIHT etc. Thus, the proposed coding scheme gives a convenient and better object coding scheme with applications in the multimedia image compression and transmission scenario.
T. S. Bindulal, M. R. Kaimal 0001
ICIP (2)2
2005 Comments on "A fuzzy approach to strategic games"
abstract
A fuzzy approach was proposed in the above paper for the solution of strategic games and some useful conclusions were presented on the selection of optimal strategies in the prisoner's dilemma game. In this paper, a general result is presented for the case in which a prisoner is noncooperative and selfish, which makes the evaluation suggested in the above paper redundant in this case.
Raj Mathew, M. R. Kaimal 0001
IEEE Trans. Fuzzy Syst.2
2004 Design of optimal fuzzy observer based on TS fuzzy model
abstract
In this paper, optimal fuzzy observer is developed for discrete time nonlinear stochastic system based on Takagi-Sugeno (TS) fuzzy model. We design a optimal fuzzy observer using the mathematical duality and by extending the nonlinear Bayesian estimation using Gaussian sum approach to the TS fuzzy model.
P. P. Mohanlal, M. R. Kaimal 0001
FUZZ-IEEE2
2004 Fuzzy modeling and optimal control of nonlinear second order systems
abstract
This paper presents the exact fuzzy modeling and optimal control of a class of second order nonlinear dynamic systems. Input saturation, output slew rate limit and nonlinear stiffness are considered. Conventionally, the TSK fuzzy modeling blends local linear models to represent a nonlinear system, which in general does not exactly represent the nonlinear system under consideration. Here, instead of local linear models, a set of 'boundary linear models' (BLM) and associated membership-functions are so chosen that the fuzzy blending of these models result in an exact representation of the overall nonlinear system. An optimal fuzzy controller is designed based on this exact fuzzy model and the results are compared with a conventional design.
P. P. Mohanlal, M. R. Kaimal 0001
FUZZ-IEEE2
2002 Exact Fuzzy Modeling and Optimal control of a Launch Vehicle in the atmospheric phase
abstract
This paper presents a novel method of Exact Fuzzy Modeling and Optimal control of a Launch Vehicle in the atmospheric phase. Time varying plant is considered with control power plant nonlinearity. Plant modeling, controller design and analysis are carried out for Rigid Body with Actuator dynamics. The results are compared with a classical design. Conventionally, the TSK fuzzy modeling blends local linear models to represent a nonlinear system, which in general does not exactly represent the nonlinear system under consideration. Here, instead of local linear models, a set of 'boundary linear models' and associated membership-functions are so chosen that the fuzzy blending of these models result in an exact representation of the overall nonlinear time varying system. Optimal control laws are designed for each of these fuzzy subsystems, and overall control is again the fuzzy blending of these individual control laws. This procedure results in an exact optimal control solution for the Launch Vehicle control in the atmospheric phase.
P. P. Mohanlal, M. R. Kaimal 0001
ICARCV2
1999 A fast second-generation encoding algorithm for vector quantization
abstract
This paper presents a fast encoding algorithm for vector quantization that uses edge information contained in an image in addition to the use of average values of the vectors forming the image. The algorithm makes use of these features to identify the visually significant areas of the image and to save computational time while producing good quality pictures at reasonable computing cost. The simulation results compare well with other existing algorithms of the conventional type.
Liza Jo, M. R. Kaimal 0001
IEEE Signal Process. Lett.2
1992 A Short Note on Perfectly Balanced Binary Search Trees
abstract
We present a perfect balancing method for a binary search tree. During the updates the algorithm allows the structure to grow gracefully and maintains the optimal shape without degeneration. The algorithm uses swapping as the basic operation. Since the tree produced by the algorithm is optimal it can favourably be compared with that produced by other balancing algorithms. In worst case situation, the algorithm takes O(n) time, n being the total number of nodes in the tree. This is an added significance when it is compared with the static optimal binary search trees.
A. P. Korah, M. R. Kaimal 0001
Comput. J.2