scholarly journals A Revisit Histogram of Oriented Descriptor for Facial Color Image Classification Based on Fusion of Color Information

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huy Nguyen-Quoc ◽  
Vinh Truong Hoang

Histogram of Oriented Gradient (HOG) is a robust descriptor which is widely used in many real-life applications, including human detection, face recognition, object counting, and video surveillance. In order to extract HOG descriptor from color images whose information is three times more than the grayscale images, researchers currently apply the maximum magnitude selection method. This method makes the information of the resulted image is reduced by selecting the maximum magnitudes. However, after we extract HOG using the unselected magnitudes of the maximum magnitude selection method, we observe that the performance is better than using the maximum magnitudes in several cases. Therefore, in this paper, we propose a novel approach for extracting HOG from color images such as Color Component Selection and Color Component Fusion. We also propose the extended kernels in order to improve the performance of HOG. With our new approaches in the color component analysis, the experimental results of several facial benchmark datasets are enhanced with the increment from 3 to 10% of accuracy. Specifically, a 95.92% of precision is achieved on the Face AR database and 75% on the Georgia Face database. The results are better more than 10 times compared with the original HOG approach.

Author(s):  
Jae Young Choi

Recently, considerable research efforts have been devoted to effective utilization of facial color information for improved recognition performance. Of all color-based face recognition (FR) methods, the most widely used approach is a color FR method using input-level fusion. In this method, augmented input vectors of the color images are first generated by concatenating different color components (including both luminance and chrominance information) by column order at the input level and feature subspace is then trained with a set of augmented input vectors. However, in practical applications, a testing image could be captured as a grayscale image, rather than as a color image, mainly caused by different, heterogeneous image acquisition environment. A grayscale testing image causes so-called dimensionality mismatch between the trained feature subspace and testing input vector. Disparity in dimensionality negatively impacts the reliable FR performance and even imposes a significant restriction on carrying out FR operations in practical color FR systems. To resolve the dimensionality mismatch, we propose a novel approach to estimate new feature subspace, suitable for recognizing a grayscale testing image. In particular, new feature subspace is estimated from a given feature subspace created using color training images. The effectiveness of proposed solution has been successfully tested on four public face databases (DBs) such as CMU, FERET, XM2VTSDB, and ORL DBs. Extensive and comparative experiments showed that the proposed solution works well for resolving dimensionality mismatch of importance in real-life color FR systems.


Author(s):  
A. Kasthuri ◽  
A. Suruliandi ◽  
S. P. Raja

Face annotation, a modern research topic in the area of image processing, has useful real-life applications. It is a really difficult task to annotate the correct names of people to the corresponding faces because of the variations in facial appearance. Hence, there still is a need for a robust feature to improve the performance of the face annotation process. In this work, a novel approach called the Deep Gabor-Oriented Local Order Features (DGOLOF) for feature representation has been proposed, which extracts deep texture features from face images. Seven recently proposed face annotation methods are considered to evaluate the proposed deep texture feature under uncontrolled situations like occlusion, expression changes, illumination and pose variations. Experimental results on the LFW, IMFDB, Yahoo and PubFig databases show that the proposed deep texture feature provides efficient results with the Name Semantic Network (NSN)-based face annotation. Moreover, it is observed that the proposed deep texture feature improves the performance of face annotation, regardless of all the challenges involved.


Author(s):  
Zhiwu Huang ◽  
Jiqing Wu ◽  
Luc Van Gool

Generative modeling over natural images is one of the most fundamental machine learning problems. However, few modern generative models, including Wasserstein Generative Adversarial Nets (WGANs), are studied on manifold-valued images that are frequently encountered in real-world applications. To fill the gap, this paper first formulates the problem of generating manifold-valued images and exploits three typical instances: hue-saturation-value (HSV) color image generation, chromaticity-brightness (CB) color image generation, and diffusion-tensor (DT) image generation. For the proposed generative modeling problem, we then introduce a theorem of optimal transport to derive a new Wasserstein distance of data distributions on complete manifolds, enabling us to achieve a tractable objective under the WGAN framework. In addition, we recommend three benchmark datasets that are CIFAR-10 HSV/CB color images, ImageNet HSV/CB color images, UCL DT image datasets. On the three datasets, we experimentally demonstrate the proposed manifold-aware WGAN model can generate more plausible manifold-valued images than its competitors.


2014 ◽  
Vol 511-512 ◽  
pp. 545-549
Author(s):  
Qiang Chen

Edge detection of color image is a difficult problem in image processing. Although a lot of corresponding to methods have been proposed, however, none of them can effectively detect image edges while suppressing noises. In this paper, a novel edge detection algorithm of color images based on mathematical morphology is proposed. Through designing a new anti-noise morphological gradient operators, we can obtain better edge detection results. The proposed gradient operators are applied to detect edge for three components of a color image. An then, the final edge can be obtained by fusing the three edge results. Experimental results show that the feasibility and effectiveness of the proposed algorithm. Moreover, the proposed algorithm has better effect of preserving the edge details and better robustness to noises than traditional methods.


2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Ying Li ◽  
Shuliang Wang ◽  
Caoyuan Li ◽  
Zhenkuan Pan ◽  
Weizhong Zhang

Color image segmentation is fundamental in image processing and computer vision. A novel approach, GDF-Ncut, is proposed to segment color images by integrating generalized data field (GDF) and improved normalized cuts (Ncut). To start with, the hierarchy-grid structure is constructed in the color feature space of an image in an attempt to reduce the time complexity but preserve the quality of image segmentation. Then a fast hierarchy-grid clustering is performed under GDF potential estimation and therefore image pixels are merged into disjoint oversegmented but meaningful initial regions. Finally, these regions are presented as a weighted undirected graph, upon which Ncut algorithm merges homogenous initial regions to achieve final image segmentation. The use of the fast clustering improves the effectiveness of Ncut because regions-based graph is constructed instead of pixel-based graph. Meanwhile, during the processes of Ncut matrix computation, oversegmented regions are grouped into homogeneous parts for greatly ameliorating the intermediate problems from GDF and accordingly decreasing the sensitivity to noise. Experimental results on a variety of color images demonstrate that the proposed method significantly reduces the time complexity while partitioning image into meaningful and physically connected regions. The method is potentially beneficial to serve object extraction and pattern recognition.


Author(s):  
Deepak Gambhir ◽  
Meenu Manchanda

Multiple images of a scene, captured using different imaging devices and containing complementary information, are required to be combined into a single fused image. The fused image, so obtained, should ideally contain all important features of individual input images. Further, color image processing is also gaining importance in most of the real-life applications. Color images provide better visual information and are highly suitable for human visual perception. Motivated by the gaining importance of color image processing, fusion of color images is proposed. The fusion algorithm is proposed in HSV color space where the luminance components of multiple input images, based on fuzzy transform and spatial frequency, are fused. The chrominance information of input images provides color to the fused image. The fused image contains all important information and possesses natural color appearance. Experiments performed on various pairs of visible–infrared and multifocus images demonstrate the superiority of the proposed algorithm over recent state-of-the-art image fusion algorithms.


2021 ◽  
Vol 13 (6) ◽  
pp. 3465
Author(s):  
Jordi Colomer ◽  
Dolors Cañabate ◽  
Brigita Stanikūnienė ◽  
Remigijus Bubnys

In the face of today’s global challenges, the practice and theory of contemporary education inevitably focuses on developing the competences that help individuals to find meaningfulness in their societal and professional life, to understand the impact of local actions on global processes and to enable them to solve real-life problems [...]


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Shu-Bo Chen ◽  
Saima Rashid ◽  
Muhammad Aslam Noor ◽  
Zakia Hammouch ◽  
Yu-Ming Chu

Abstract Inequality theory provides a significant mechanism for managing symmetrical aspects in real-life circumstances. The renowned distinguishing feature of integral inequalities and fractional calculus has a solid possibility to regulate continuous issues with high proficiency. This manuscript contributes to a captivating association of fractional calculus, special functions and convex functions. The authors develop a novel approach for investigating a new class of convex functions which is known as an n-polynomial $\mathcal{P}$ P -convex function. Meanwhile, considering two identities via generalized fractional integrals, provide several generalizations of the Hermite–Hadamard and Ostrowski type inequalities by employing the better approaches of Hölder and power-mean inequalities. By this new strategy, using the concept of n-polynomial $\mathcal{P}$ P -convexity we can evaluate several other classes of n-polynomial harmonically convex, n-polynomial convex, classical harmonically convex and classical convex functions as particular cases. In order to investigate the efficiency and supremacy of the suggested scheme regarding the fractional calculus, special functions and n-polynomial $\mathcal{P}$ P -convexity, we present two applications for the modified Bessel function and $\mathfrak{q}$ q -digamma function. Finally, these outcomes can evaluate the possible symmetric roles of the criterion that express the real phenomena of the problem.


2021 ◽  
Vol 16 (1) ◽  
pp. 1-23
Author(s):  
Bo Liu ◽  
Haowen Zhong ◽  
Yanshan Xiao

Multi-view classification aims at designing a multi-view learning strategy to train a classifier from multi-view data, which are easily collected in practice. Most of the existing works focus on multi-view classification by assuming the multi-view data are collected with precise information. However, we always collect the uncertain multi-view data due to the collection process is corrupted with noise in real-life application. In this case, this article proposes a novel approach, called uncertain multi-view learning with support vector machine (UMV-SVM) to cope with the problem of multi-view learning with uncertain data. The method first enforces the agreement among all the views to seek complementary information of multi-view data and takes the uncertainty of the multi-view data into consideration by modeling reachability area of the noise. Then it proposes an iterative framework to solve the proposed UMV-SVM model such that we can obtain the multi-view classifier for prediction. Extensive experiments on real-life datasets have shown that the proposed UMV-SVM can achieve a better performance for uncertain multi-view classification in comparison to the state-of-the-art multi-view classification methods.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Adam Catching ◽  
Sara Capponi ◽  
Ming Te Yeh ◽  
Simone Bianco ◽  
Raul Andino

AbstractCOVID-19’s high virus transmission rates have caused a pandemic that is exacerbated by the high rates of asymptomatic and presymptomatic infections. These factors suggest that face masks and social distance could be paramount in containing the pandemic. We examined the efficacy of each measure and the combination of both measures using an agent-based model within a closed space that approximated real-life interactions. By explicitly considering different fractions of asymptomatic individuals, as well as a realistic hypothesis of face masks protection during inhaling and exhaling, our simulations demonstrate that a synergistic use of face masks and social distancing is the most effective intervention to curb the infection spread. To control the pandemic, our models suggest that high adherence to social distance is necessary to curb the spread of the disease, and that wearing face masks provides optimal protection even if only a small portion of the population comply with social distance. Finally, the face mask effectiveness in curbing the viral spread is not reduced if a large fraction of population is asymptomatic. Our findings have important implications for policies that dictate the reopening of social gatherings.


Sign in / Sign up

Export Citation Format

Share Document