Face recognition under varying background and pose is challenging, and extracting background and pose invariant features is an effective approach to solve this problem. This paper proposes a skin detection-based appro...
详细信息
ISBN:
(纸本)9781479915880
Face recognition under varying background and pose is challenging, and extracting background and pose invariant features is an effective approach to solve this problem. This paper proposes a skin detection-based approach for enhancing the performance of a Face Recognition (FR) system, employing a unique combination of Skin based background removal, Discrete Wavelet Transform (DWT), Adaptive Multi-Level Threshold Binary Particle Swarm Optimization (ABPSO) and an Error Control Feedback (ECF) loop. Skin based background removal is used for efficient background removal and ABPSO-based feature selection algorithm is used to search the feature space for the optimal feature subset. The ECF loop is used to neutralize pose variations. Experimental results, obtained by applying the proposed algorithm on Color FERET and CMUPIE face databases, show that the proposed system outperforms other FR systems. A significant increase in the recognition rate and substantial reduction in the number of features are observed.
In most of the imageprocessing applications there is a maximum limit up to which an image can be compressed without adversely affecting the quality of the image to a great deal. In this paper, we propose a new waterm...
详细信息
ISBN:
(纸本)9781424442195
In most of the imageprocessing applications there is a maximum limit up to which an image can be compressed without adversely affecting the quality of the image to a great deal. In this paper, we propose a new watermarking scheme to embed text in images using an algorithm for finding the optimum bit plane that can be substituted from the image by the character bit plane. The maximum embedding capacity is kept as a function of minimum expected quality. This watermarking method is experimentally found to be highly robust against many imageprocessing attacks including JPEG 2000 as it takes in to consideration both the lossy stages of JPEG 2000 during its implementation.
Development of computer-aided diagnosis (CAD) systems for early detection of the pathological brain is essential to save medical resources. In recent years, a variety of techniques have been proposed to upgrade the sy...
详细信息
ISBN:
(纸本)9781467385640
Development of computer-aided diagnosis (CAD) systems for early detection of the pathological brain is essential to save medical resources. In recent years, a variety of techniques have been proposed to upgrade the system's performance. In this paper, a new automatic CAD system for brain magnetic resonance (MR) image classification is proposed. The method utilizes two-dimensional discrete wavelet transform to extract features from the MR images. The dimension of the features have been reduced using principal component analysis (PCA) and linear discriminant analysis (LDA), to obtain the more significant features. Finally, the reduced set of features are applied to the random forests classifier to determine the normal or pathological brain. A standard dataset, Dataset-255 of 255 images (35 normal and 220 pathological) is used for the validation of the proposed scheme. To improve the generalization capability of the scheme, 5-fold stratified cross-validation procedure is utilized. The results of the experiments reveal that the proposed scheme is superior to other state-of-the-art techniques in terms of classification accuracy with substantially reduced number of features.
In this paper, a complete database of handwritten atomic Odia characters is suggested. The first version of the database has been modeled and named OHCSv1.0 (Odia handwritten character set). The database comprises of ...
详细信息
ISBN:
(纸本)9781467385640
In this paper, a complete database of handwritten atomic Odia characters is suggested. The first version of the database has been modeled and named OHCSv1.0 (Odia handwritten character set). The database comprises of 17,100 transcribed characters, each collected twice from 150 unique people at different point of time. Each character has 300 number of occurrences. The character images are standardized to a size of 6 4 x 6 4 pixels. A novel framework for perceiving transcribed Odia characters from this database has also been proposed. The character images are gathered into various groups in view of their shape components utilizing an incremental spectral clustering algorithm. During testing, affinity of probe character to a cluster is first decided. Subsequently, the trained classifier recognizes the character inside the cluster. Suitable simulation has been carried out to validate the scheme.
Tracking dense features has become one of the most popular methods for human action recognition. Proper descriptors should be used to capture the motion information contained in these trajectories and motion boundary ...
详细信息
ISBN:
(纸本)9781467385640
Tracking dense features has become one of the most popular methods for human action recognition. Proper descriptors should be used to capture the motion information contained in these trajectories and motion boundary histogram (MBH), which encodes velocity information, gives best performance among state of art action recognition descriptors. In this paper, we propose to use a new descriptor, histogram of spatial gradient of acceleration (HSGA) in combination with MBH to describe actions. Our new descriptor combination is based on studies which reveal that acceleration is as important as velocity in motion description. HSGA is computed by taking histogram of orientation of spatial gradient of optical acceleration in a 3D space-time block divided into cells around dense trajectories. Optical acceleration is obtained by taking time derivative of optical flow. This combination of descriptors gave good performance on a variety of data sets. Combining these motion descriptors with a scene descriptor like HOG further improved the recognition accuracy for realistic action datasets.
Existing approaches on newborn identification focuses on recognizing them using face, inked footprints, and palm prints. While palm and inked footprints are intrusive modalities, face modality suffers from non-coopera...
详细信息
ISBN:
(纸本)9781467385640
Existing approaches on newborn identification focuses on recognizing them using face, inked footprints, and palm prints. While palm and inked footprints are intrusive modalities, face modality suffers from non-cooperative nature of newborns. In this research, we investigate utilization of binocular region for recognizing newborns, as this region is considered to be relatively stable in face biometrics literature. We collect a database consisting of 402 face images pertaining to 50 babies of less than 6 months of age. A set of experiments pertaining to various descriptors, including local binary patterns, dense scale invariant feature transform, and Gabor features, along with subspace learning using principal component analysis, linear discriminant analysis, and independent component analysis. Recognition performance of various approaches are compared with respect to face and binocular modalities. Verification results are reported in terms of Receiver operating characteristics curves respectively. The results show that binocular can outperform face as a modality for newborn recognition.
In this paper, a shape recognition method is proposed for a few common geometrical shapes including straight line, circle, ellipse, triangle, quadrilateral, pentagon and hexagon. In the present work, two indices namel...
详细信息
ISBN:
(纸本)9781479915880
In this paper, a shape recognition method is proposed for a few common geometrical shapes including straight line, circle, ellipse, triangle, quadrilateral, pentagon and hexagon. In the present work, two indices namely Unique Shape Signature (USS) and Condensibility (C) are employed for shape recognition of an object. Using the USS index, all the above mentioned non-circular shapes are neatly recognized, whereas, the C index recognized the circular objects. An added advantage of the proposed method is that it can further differentiate triangles, quadrilaterals and both symmetric and non-symmetric shapes of pentagon and hexagon using distance variance (Var(d(si))) parameter calculated from USS. Applying the proposed method on above mentioned shapes, an overall recognition rate of 98.80% is achieved on several simulated and real objects of different shapes. Proposed method has also been compared with two existing methods, presents better result. Performance of the proposed method is illustrated by applying it on underwater images and it is observed to perform satisfactory on all the images under test.
In this paper, a real time multi-view human activity recognition model using a RGB-D (Red Green BlueDepth) sensor is proposed. The method receives as input RGBD data streams in real time from a Kinect for Windows V2 s...
详细信息
ISBN:
(纸本)9781467385640
In this paper, a real time multi-view human activity recognition model using a RGB-D (Red Green BlueDepth) sensor is proposed. The method receives as input RGBD data streams in real time from a Kinect for Windows V2 sensor. Initially, a skeleton-tracking algorithm is applied which gives 3D joint information of 25 unique joints. The presented approach uses a weighted version of the Fast Dynamic Time Warping that weighs the importance of each skeleton joint towards the Dynamic Time Warping (DTW) similarity cost. To recognize multi-view human activities, the weighted Dynamic TimeWarping warps a time sequence of joint positions to reference time sequences and produces a similarity value. Experimental results demonstrate that the proposed method is robust, flexible and efficient with respect to multiple views activity recognition, scale and phase variations activities at different realistic scenes.
We present a simple and powerful scheme to allow CSG of implicit surfaces on the GPU. We decompose the boolean expression of surfaces into sum-of-products form. Our algorithm presented in this paper then renders each ...
详细信息
ISBN:
(纸本)9781479915880
We present a simple and powerful scheme to allow CSG of implicit surfaces on the GPU. We decompose the boolean expression of surfaces into sum-of-products form. Our algorithm presented in this paper then renders each product term, sum of products can be automatically by enabling depth test. Our Approximate CSG uses adaptive marching points algorithm for finding ray-surface intersection. Once we find an interval where root exists after root-isolation, this is used for presence of intersection. We perform root-refinement only for the uncomplemented terms in the product. Exact CSG is done by using the discriminant of the ray-surface intersection for the presence of the root. Now we can simply evaluate the product expression by checking all uncomplemented terms should be true and all complemented terms should be false. If our condition is met, we find the maximum of all the roots among uncomplemented terms to be the solution. Our algorithm is linear in the number of terms O(n). We achieve real-time rates for 4-5 terms in the product for approximate CSG. We achieve more than real-time rates for Exact CSG. Our primitives are implicit surfaces so we can achieve fairly complex results with less terms.
With rapid improvements in the performance and programmability, graphicsprocessing Units (GPUs) have fostered considerable interest in substantially reducing the running time of compute intensive problems. The soluti...
详细信息
ISBN:
(纸本)9781424442195
With rapid improvements in the performance and programmability, graphicsprocessing Units (GPUs) have fostered considerable interest in substantially reducing the running time of compute intensive problems. The solution to the view-independent mutual point-pair visibility problem (required for inter-reflections in global illumination) can, it would seem, require the capabilities of the GPUs. In this paper, various ways of parallelizing the construction of the Visibility Map (V-map, a description of mutual visibility) are presented to lead the way for an implementation that achieves a speed up of 11 or more. We evaluate our scheme qualitatively and quantitatively, and conclude that parallelizing the V-map construction algorithm is eminently useful.
暂无评论