Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Vikram V. Appia is active.

Publication


Featured researches published by Vikram V. Appia.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 2013

Numerical Conditioning Problems and Solutions for Nonparametric i.i.d. Statistical Active Contours

Hao Wu; Vikram V. Appia; Anthony J. Yezzi

In this paper, we propose an active contour model based on nonparametric independent and identically distributed (i.i.d.) statistics of the image that can segment an image without any a priori information about the intensity distributions of the region of interest or the background. This is not, however, the first active contour model proposed to solve the segmentation problem under these same assumptions. In contrast to prior active contour models based on nonparametric i.i.d. statistics, we do not formulate our optimization criterion according to any distance measure between estimated probability densities inside and outside the active contour. Instead, treating the segmentation problem as a pixel-wise classification problem, we formulate an active contour to minimize the unbiased pixel-wise average misclassification probability (AMP). This not only simplifies the problem by avoiding the need to arbitrarily select among many sensible distance measures to measure the difference between the probability densities estimated inside and outside the active contour, but it also solves a numerical conditioning problem that arises with such prior active contour models. As a result, the AMP model exhibits faster convergence with higher accuracy and robustness when compared to active contour models previously formulated to solve the same nonparametric i.i.d. statistical segmentation problem via probability distances. To discuss this improved numerical behavior more precisely, we introduce the notion of “conditioning ratio” and demonstrate that the proposed AMP active contour is numerically better conditioned (i.e., exhibits a much smaller conditioning ratio) than prior probability distance-based active contours.


international conference on computer vision | 2011

Active geodesics: Region-based active contour segmentation with a global edge-based constraint

Vikram V. Appia; Anthony J. Yezzi

We present an active geodesic contour model in which we constrain the evolving active contour to be a geodesic with respect to a weighted edge-based energy through its entire evolution rather than just at its final state (as in the traditional geodesic active contour models). Since the contour is always a geodesic throughout the evolution, we automatically get local optimality with respect to an edge fitting criterion. This enables us to construct a purely region-based energy minimization model without having to devise arbitrary weights in the combination of our energy function to balance edge-based terms with the region-based terms. We show that this novel approach of combining edge information as the geodesic constraint in optimizing a purely region-based energy yields a new class of active contours which exhibit both local and global behaviors that are naturally responsive to intuitive types of user interaction. We also show the relationship of this new class of globally constrained active contours with traditional minimal path methods, which seek global minimizers of purely edge-based energies without incorporating region-based criteria. Finally, we present some numerical examples to illustrate the benefits of this approach over traditional active contour models.


computer vision and pattern recognition | 2014

A Surround View Camera Solution for Embedded Systems

Buyue Zhang; Vikram V. Appia; Ibrahim Ethem Pekkucuksen; Yucheng Liu; Aziz Umit Batur; Pavan Shastry; Stanley Liu; Shiju Sivasankaran; Kedar Chitnis

Automotive surround view camera system is an emerging automotive ADAS (Advanced Driver Assistance System) technology that assists the driver in parking the vehicle safely by allowing him/her to see a top-down view of the 360 degree surroundings of the vehicle. Such a system normally consists of four to six wide-angle (fish-eye lens) cameras mounted around the vehicle, each facing a different direction. From these camera inputs, a composite bird-eye view of the vehicle is synthesized and shown to the driver in real-time during parking. In this paper, we present a surround view camera solution that consists of three key algorithm components: geometric alignment, photometric alignment, and composite view synthesis. Our solution produces a seamlessly stitched bird-eye view of the vehicle from four cameras. It runs real-time on DSP C66x producing an 880x1080 output video at 30 fps.


IEEE Transactions on Biomedical Engineering | 2013

Automatic Delineation of the Myocardial Wall From CT Images Via Shape Segmentation and Variational Region Growing

Liangjia Zhu; Yi Gao; Vikram V. Appia; Anthony J. Yezzi; Chesnal D. Arepalli; Tracy L. Faber; Arthur E. Stillman; Allen R. Tannenbaum

Prognosis and diagnosis of cardiac diseases frequently require quantitative evaluation of the ventricle volume, mass, and ejection fraction. The delineation of the myocardial wall is involved in all of these evaluations, which is a challenging task due to large variations in myocardial shapes and image quality. In this paper, we present an automatic method for extracting the myocardial wall of the left and right ventricles from cardiac CT images. In the method, the left and right ventricles are located sequentially, in which each ventricle is detected by first identifying the endocardium and then segmenting the epicardium. To this end, the endocardium is localized by utilizing its geometric features obtained on-line from a CT image. After that, a variational region-growing model is employed to extract the epicardium of the ventricles. In particular, the location of the endocardium of the left ventricle is determined via using an active contour model on the blood-pool surface. To localize the right ventricle, the active contour model is applied on a heart surface extracted based on the left ventricle segmentation result. The robustness and accuracy of the proposed approach is demonstrated by experimental results from 33 human and 12 pig CT images.


midwest symposium on circuits and systems | 2014

Trends in camera based Automotive Driver Assistance Systems (ADAS)

Shashank Dabral; Sanmati Kamath; Vikram V. Appia; Mihir Mody; Buyue Zhang; Umit Batur

Advance Driver Assistance Systems (ADAS), once limited to high end luxury automobiles are fast becoming popular with Mid and entry level segments driven in part by legislation coming in to effect in the latter part of this decade. These systems require support for a wide variety of applications, from surround-view visual systems to safety critical vision applications (eg Pedestrian Detect, automatic braking etc). In this white paper we describe some of the existing and emerging trends and applications in each of these segments along with the requirements and motivations for each of these features. We also highlight TIs automotive class TDA2x device, a state of the art automotive grade device capable of handling complex ADAS applications within a low power and cost budget.


Proceedings of SPIE | 2010

A regions of confidence based approach to enhance segmentation with shape priors

Vikram V. Appia; Balaji Ganapathy; Amer Abufadel; Anthony J. Yezzi; Tracy L. Faber

We propose an improved region based segmentation model with shape priors that uses labels of confidence/interest to exclude the influence of certain regions in the image that may not provide useful information for segmentation. These could be regions in the image which are expected to have weak, missing or corrupt edges or they could be regions in the image which the user is not interested in segmenting, but are part of the object being segmented. In the training datasets, along with the manual segmentations we also generate an auxiliary map indicating these regions of low confidence/interest. Since, all the training images are acquired under similar conditions, we can train our algorithm to estimate these regions as well. Based on this training we will generate a map which indicates the regions in the image that are likely to contain no useful information for segmentation. We then use a parametric model to represent the segmenting curve as a combination of shape priors obtained by representing the training data as a collection of signed distance functions. We evolve an objective energy functional to evolve the global parameters that are used to represent the curve. We vary the influence each pixel has on the evolution of these parameters based on the confidence/interest label. When we use these labels to indicate the regions with low confidence; the regions containing accurate edges will have a dominant role in the evolution of the curve and the segmentation in the low confidence regions will be approximated based on the training data. Since our model evolves global parameters, it improves the segmentation even in the regions with accurate edges. This is because we eliminate the influence of the low confidence regions which may mislead the final segmentation. Similarly when we use the labels to indicate the regions which are not of importance, we will get a better segmentation of the object in the regions we are interested in.


international conference on computer vision | 2011

Localized principal component analysis based curve evolution: A divide and conquer approach

Vikram V. Appia; Balaji Ganapathy; Anthony J. Yezzi; Tracy L. Faber

We propose a novel localized principal component analysis (PCA) based curve evolution approach which evolves the segmenting curve semi-locally within various target regions (divisions) in an image and then combines these locally accurate segmentation curves to obtain a global segmentation. The training data for our approach consists of training shapes and associated auxiliary (target) masks. The masks indicate the various regions of the shape exhibiting highly correlated variations locally which may be rather independent of the variations in the distant parts of the global shape. Thus, in a sense, we are clustering the variations exhibited in the training data set. We then use a parametric model to implicitly represent each localized segmentation curve as a combination of the local shape priors obtained by representing the training shapes and the masks as a collection of signed distance functions. We also propose a parametric model to combine the locally evolved segmentation curves into a single hybrid (global) segmentation. Finally, we combine the evolution of these semi-local and global parameters to minimize an objective energy function. The resulting algorithm thus provides a globally accurate solution, which retains the local variations in shape. We present some results to illustrate how our approach performs better than the traditional approach with fully global PCA.


IEEE Transactions on Image Processing | 2014

A Complete System for Automatic Extraction of Left Ventricular Myocardium From CT Images Using Shape Segmentation and Contour Evolution

Liangjia Zhu; Yi Gao; Vikram V. Appia; Anthony J. Yezzi; Chesnal D. Arepalli; Tracy L. Faber; Arthur E. Stillman; Allen R. Tannenbaum

The left ventricular myocardium plays a key role in the entire circulation system and an automatic delineation of the myocardium is a prerequisite for most of the subsequent functional analysis. In this paper, we present a complete system for an automatic segmentation of the left ventricular myocardium from cardiac computed tomography (CT) images using the shape information from images to be segmented. The system follows a coarse-to-fine strategy by first localizing the left ventricle and then deforming the myocardial surfaces of the left ventricle to refine the segmentation. In particular, the blood pool of a CT image is extracted and represented as a triangulated surface. Then, the left ventricle is localized as a salient component on this surface using geometric and anatomical characteristics. After that, the myocardial surfaces are initialized from the localization result and evolved by applying forces from the image intensities with a constraint based on the initial myocardial surface locations. The proposed framework has been validated on 34-human and 12-pig CT images, and the robustness and accuracy are demonstrated.


Proceedings of SPIE | 2010

Lung fissure detection in CT images using global minimal paths

Vikram V. Appia; Uday Patil; Bipul Das

Pulmonary fissures separate human lungs into five distinct regions called lobes. Detection of fissure is essential for localization of the lobar distribution of lung diseases, surgical planning and follow-up. Treatment planning also requires calculation of the lobe volume. This volume estimation mandates accurate segmentation of the fissures. Presence of other structures (like vessels) near the fissure, along with its high variational probability in terms of position, shape etc. makes the lobe segmentation a challenging task. Also, false incomplete fissures and occurrence of diseases add to the complications of fissure detection. In this paper, we propose a semi-automated fissure segmentation algorithm using a minimal path approach on CT images. An energy function is defined such that the path integral over the fissure is the global minimum. Based on a few user defined points on a single slice of the CT image, the proposed algorithm minimizes a 2D energy function on the sagital slice computed using (a) intensity (b) distance of the vasculature, (c) curvature in 2D, (d) continuity in 3D. The fissure is the infimum energy path between a representative point on the fissure and nearest lung boundary point in this energy domain. The algorithm has been tested on 10 CT volume datasets acquired from GE scanners at multiple clinical sites. The datasets span through different pathological conditions and varying imaging artifacts.


computer vision and pattern recognition | 2016

A Diverse Low Cost High Performance Platform for Advanced Driver Assistance System (ADAS) Applications

Prashanth Viswanath; Kedar Chitnis; Pramod Swami; Mihir Mody; Sujith Shivalingappa; Soyeb Nagori; Manu Mathew; Kumar Desappan; Shyam Jagannathan; Deepak Kumar Poddar; Anshu Jain; Hrushikesh Garud; Vikram V. Appia; Mayank Mangla; Shashank Dabral

Advanced driver assistance systems (ADAS) are becoming more and more popular. Lot of the ADAS applications such as Lane departure warning (LDW), Forward Collision Warning (FCW), Automatic Cruise Control (ACC), Auto Emergency Braking (AEB), Surround View (SV) that were present only in high-end cars in the past have trickled down to the low and mid end vehicles. Lot of these applications are also mandated by safety authorities such as EUNCAP and NHTSA. In order to make these applications affordable in the low and mid end vehicles, it is important to have a cost effective, yet high performance and low power solution. Texas Instruments (TIs) TDA3x is an ideal platform which addresses these needs. This paper illustrates mapping of different algorithms such as SV, LDW, Object detection (OD), Structure From Motion (SFM) and Camera-Monitor Systems (CMS) to the TDA3x device, thereby demonstrating its compute capabilities. We also share the performance for these embedded vision applications, showing that TDA3x is an excellent high performance device for ADAS applications.

Collaboration


Dive into the Vikram V. Appia's collaboration.

Top Co-Authors

Avatar

Anthony J. Yezzi

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge