Advancement in Color Image Processing using Geometric Algebra

This paper describes an advancement in color image processing, using geometric algebra. This is achieved using a compact representation of vectors within $n$ dimensional space. Geometric Algebra (GA) is a preferred framework for signal representation and image representation. In this context the R, G, B color channels are not defined separately but as a single entity. As GA provides a rich set of operations, the signal and image processing operations becomes straightforward and the algorithms intuitive. From the experiments described in this paper, it is also possible to conclude that the convolution operation with the rotor masks within GA belong to a class of linear vector filters and can be applied to image or speech signals. The usefulness of the introduced approach has been demonstrated by analyzing and implementing two different types of edge detection schemes

RECOGNITION OF REALTIME BASED PRIMITIVE GEOMETRY OBJECTS USING PERCEPTRON NETWORK

The purpose of this study is to analyze the perceptron model on pattern recognition of primitive geometric objects in real time based on video images. The samples used in this study were cubes, prisms, tubes and balls. The system was built using the Delphi 7 programming language with pre-processing stages system training includes the process of calculating matrix values from the original image, then proceed with the grayscale and edge detection processes using convolution with a kernel, namely the sobel operator and then the matrix results from the edge detection process are transformed using a perceptron network to obtain energy from the image of the object, then the resulting energy The transformation is stored in the database as a system test reference pattern recognition energy. Measurement of system performance evaluation in this study uses two parameters, namely detection rate and false positive rate. The recognition rate of primitive geometric objects using the perceptron network model in this study reaches 60.00% to 80.00%. The detection rate percentage shows that this model can be used as a supporting approach for the recognition of geometric objects in video

Non-Rigid Registration with Deep Learning and Conformal Harmonic Maps

We present a novel fully-automated approach to non-rigid registration for high-resolution facial scans using conformal harmonic maps. The novelty of this paper is its use of applied deep learning models to prepare data for geometric algorithms to compute non-rigid registration. We use facial detection to both constrain the boundary of the face and provide a mechanism to manipulate the input mesh. We use conformal harmonic maps[7] to map a dense 3D point cloud to the closed unit disc D1(0) and optimize the weights of each edge. Our experiments show the effectiveness of this approach

Pedestrian Detection Using Basic Polyline: A Geometric Framework for Pedestrian Detection

Pedestrian detection has been an active research area for computer vision in recently years. It has many applications that could improve our lives, such as video surveillance security, auto-driving assistance systems, etc. The approaches of pedestrian detection could be roughly categorized into two categories, shape-based approaches and appearance-based approaches. In the literature, most of approaches are appearance-based. Shape-based approaches are usually integrated with an appearance-based approach to speed up a detection process. In this thesis, I propose a shape-based pedestrian detection framework using the geometric features of human to detect pedestrians. This framework includes three main steps. Give a static image, i) generating the edge image of the given image, ii) according to the edge image, extracting the basic polylines, and iii) using the geometric relationships among the polylines to detect pedestrians. The detection result obtained by the proposed framework is promising. There was a comparison made of this proposed framework with the algorithm which introduced by Dalal and Triggs [7]. This proposed algorithm increased the true-positive detection result by 47.67%, and reduced the false-positive detection number by 41.42%

Finding Temporally Consistent Occlusion Boundaries in Videos using Geometric Context

We present an algorithm for finding temporally consistent occlusion boundaries in videos to support segmentation of dynamic scenes. We learn occlusion boundaries in a pairwise Markov random field (MRF) framework. We first estimate the probability of an spatio-temporal edge being an occlusion boundary by using appearance, flow, and geometric features. Next, we enforce occlusion boundary continuity in a MRF model by learning pairwise occlusion probabilities using a random forest. Then, we temporally smooth boundaries to remove temporal inconsistencies in occlusion boundary estimation. Our proposed framework provides an efficient approach for finding temporally consistent occlusion boundaries in video by utilizing causality, redundancy in videos, and semantic layout of the scene. We have developed a dataset with fully annotated ground-truth occlusion boundaries of over 30 videos ($5000 frames). This dataset is used to evaluate temporal occlusion boundaries and provides a much needed baseline for future studies. We perform experiments to demonstrate the role of scene layout, and temporal information for occlusion reasoning in dynamic scenes.Comment: Applications of Computer Vision (WACV), 2015 IEEE Winter Conference o