Abstract

Video data is increasing rapidly along with the capacity of storage devices owned by a lay user. Users have mod­erate to large personal collections of videos and would like to keep them in an organized manner based on its content. Video organizing tools for personal users are way behind even the primitive image organizing tools. We present a mechanism in this paper to help ordinary users organize their personal collection of videos based on categories they choose. We cluster the PHOG features extracted from se­lected key frames to form a representation for each user­selected category during the learning phase. During the organization phase, labels from a K -NN classifier on these cluster centres for each key frame are aggregated to give a label to the video while categorizing. Video processing is computationally intensive. To peiform the computationally intensive steps involved, we exploit the CPU as well as the GPU that is common even on personal systems. Effective use of the parallel hardware on the system is the only way to make the tool scale reasonably to large collections that will be available soon. Our tool is able to organize a set of 100 sport videos of total duration of 1375 minutes in about 9.5 minutes. The process of learning the categories from 12 annotated videos of duration 165 minutes took 75 seconds on a GTX 580 card. These were on a standard desktop with an off-the-shelfGPU. The labeling accuracy is about 96% on all video

Abstract

s the complexity of 3D models used in computergraphics applications grows, there arises a need to visualize theoverall distribution of detail on them. Detail is a function ofthe amount of information present on a surface. In this paper,we present a method to quantify detail using a combination oflocal measures of curvature and density. We show that detailcan be used for applications like ordering for mesh decimation,visualizing abnormalities in a mesh and so on

Abstract

Visual surveillance is increasingly prevalent todaybut the privacy issues of individuals involved in surveillancevideos have not been dealt with adequately so far. In mostcases, if not all, the chief purpose of placing a camera can beserved without knowing the identity of the individuals involvedunless the activity is of some predetermined kind. One needsto transform these videos to protect identity of individualsinvolved possibly at the source camera itself. In this paperwe present the De-Identification Camera, which is a scalable,low cost and real-time solution to the privacy protection issues.Our main contribution lies in proposing a privacy protectionarchitecture which transforms the video at the camera level itself,We also present and implement a de-identification pipeline whichis suitable for real-time implementation. We implemented thesystem on a Texas Instrument OMAP4 based embedded platformand was able to de-identify videos in real time, transformingthe video on the camera itself ensures protection from variousattacks. We also address issues like data utility of surveillancevideos by making this solution customizable. We propose thatsuch systems can replace the traditional surveillance cameras inthe future by providing all the surveillance and privacy protectionsolutions on hardware, probably with few performance upgrades.

Abstract

Many image filtering operations provide ample par-allelism, but progressive non-linear processing of im-ages is among the hardest to parallelize due to long,sequential, and non-linear data dependency. A typicalexample of such an operation is error diffusion dither-ing, exemplified by the Floyd-Steinberg algorithm. Inthis paper, we present its parallelization on multicoreCPUs using a block-based approach and on the GPUusing a pixel based approach. We also present a hybridapproach in which the CPU and the GPU operatein parallel during the computation. High PerformanceComputing has traditionally been associated with highend CPUs and GPUs. Our focus is on everyday com-puters such as laptops and desktops, where significantcompute power is available on the GPU as on theCPU. Our implementation can dither an8K8Kimage on an off-the-shelf laptop with an Nvidia 8600MGPU in about 400 milliseconds when the sequentialimplementation on its CPU took about 4 seconds.

Abstract

K-Means is a popular clustering algorithm with wideapplications in Computer Vision, Data mining, Data Visu-alization, etc. Clustering is an important step for indexingand searching of documents, images, video, etc. Clusteringlarge numbers of high-dimensional vectors is very compu-tation intensive. In this paper, we present the design andimplementation of theK-Means clustering algorithm on themodern GPU. All steps are performed entirely on the GPUefficiently in our approach. We also present a load balancedmulti-node, multi-GPU implementation which can handleup to 6 million, 128-dimensional vectors. We use efficientmemory layout for all steps to get high performance. TheGPU accelerators are now present on high-end workstationsand low-end laptops. Scalability in the number and dimen-sionality of the vectors, the number of clusters, as well as inthe number of cores available for processing are importantfor usability to different users. Our implementation scaleslinearly or near-linearly with different problem parameters.We achieve up to 2 times increase in speed compared to thebest GPU implementation forK-Means on a single GPU.We obtain a speed up of over 170 on a single Nvidia FermiGPU compared to a standard sequential implementation.We are able to execute one iteration ofK-Means in 136seconds on off-the-shelf GPUs to cluster 6 million vectorsof 128 dimensions into 4K clusters and in 2.5 seconds tocluster 125K vectors of 128 dimensions into 2K clusters.

Abstract

Interaction of proline with gold cluster was studied using density functional theory (DFT). Two types of mixed basis sets UB3LYP/6-311++G LANL2MB and UB3LYP/6-311++G LANL2DZ were used for optimization of complex structures. Proline interacts with gold cluster either through one anchor bond, N-Au or an anchor bond O-Au associated with a non-conventional O-H…Au hydrogen bond. Among these interactions, higher tendency for interaction is seen with Au cluster through amide terminal. Natural bond orbital analysis (NBO) is used to substantiate the results.

Abstract

We have applied genetic algorithm optimization for the design of laser pulses to control dissociation process in the ground electronic state of HF molecule, within the mathematical framework of optimal control theory. In order to design the experimentally feasible laser fields, we coded the small set of selected field parameters in the GA parameter space. Two types of pulses, one with fixed frequency components and the other having non-deterministic components have been designed. Optimized laser field obtained using this approach, possesses simple time and frequency structures. We show that the fields having non-deterministic frequency components lead to greater dissociation probability compared to the ones having deterministic frequency components.

Abstract

Video Scene Segmentation is an important problem in computer vision as it helps in efficient storage, indexing and retrieval of videos. Significant amount of work has been done in this area in the form of shot segmentation techniques and they often give reasonably good results. However, shots are not of much importance for the semantic analysis of the videos. For semantic and meaningful analysis of the videos (e.g. movies), scene is more important since it captures one complete unit of action. People have tried different approaches in scene segmentation but almost all of them use color, texture etc. to compute scene boundaries. In this paper, we propose a new algorithm based on a Bag of Words(BoW) representation which computes semantic similarity between shots using a Bipartite Graph Model (BGM). Based on semantic similarity, we detect the scene boundaries in the movie. We have tested our algorithm on a multiple Hollywood movies, and the proposed method is found to give good results.

Abstract

A major requirement in the design of robust OCRs is the invariance of feature extraction scheme with the popular fonts used in the print. Many statistical and structural features have been tried for character classification in the past. In this paper, we get motivated by the recent successes in object category recognition literature and use a spatial extension of the histogram of oriented gradients (HOG) for character classification. Our experiments are conducted on 1453950 Telugu character samples in 359 classes and 15 fonts. On this data set, we obtain an accuracy of 96-98% with an SVM classifier.

Abstract

This paper presents integration and testing scheme for managing a large Multilingual OCR Project. The project is an attempt to implement an integrated platform for OCR of different Indian languages. Software engineering, workflow management and testing processes have been discussed in this paper. The OCR has now been experimentally deployed for some specific applications and currently is being enhanced for handling the space and time constraints, achieving higher recognition accuracies and adding new functionalities.