Search results for "InGaN"
showing 10 items of 1214 documents
Color and Flow Based Superpixels for 3D Geometry Respecting Meshing
2014
We present an adaptive weight based superpixel segmentation method for the goal of creating mesh representation that respects the 3D scene structure. We propose a new fusion framework which employs both dense optical flow and color images to compute the probability of boundaries. The main contribution of this work is that we introduce a new color and optical flow pixel-wise weighting model that takes into account the non-linear error distribution of the depth estimation from optical flow. Experiments show that our method is better than the other state-of-art methods in terms of smaller error in the final produced mesh.
Perceptual similarity between color images using fuzzy metrics
2016
A method to measure the similarity between color images is proposed.Correlation among the color image channels is taken into account.Proposed similarity measure is based on fuzzy metrics because of their advantages.The proposal matches well with the perceptual visual similarity between color images. In many applications of the computer vision field measuring the similarity between (color) images is of paramount importance. However, the commonly used pixelwise similarity measures such as Mean Absolute Error, Peak Signal to Noise Ratio, Mean Squared Error or Normalized Color Difference do not match well with perceptual similarity. Recently, it has been proposed a method for gray-scale image s…
A neural network based automatic road signs recognizer
2003
Automatic road sign recognition systems are aimed at detection and recognition of one or more road signs from real-world color images. In this research, road signs are detected and extracted from real world scenes on the basis of their color and shape features. A dynamic region growing technique is adopted to enhance color segmentation results obtained in the HSV color space. The technique is based on a dynamic threshold that reduces the effect of hue instability in real scenes due to external brightness variation. Classification is then performed on extracted candidate regions using multilayer perceptron neural networks. The obtained results show good detection and recognition rates of the…
On the uniform sampling of CIELAB color space and the number of discernible colors
2013
This paper presents a useful algorithmic strategy to sample uniformly the CIELAB color space based on close packed hexagonal grid. This sampling scheme has been used successfully in different research works from computational color science to color image processing. The main objective of this paper is to demonstrate the relevance and the accuracy of the hexagonal grid sampling method applied to the CIELAB color space. The second objective of this paper is to show that the number of color samples computed depends on the application and on the color gamut boundary considered. As demonstration, we use this sampling to support a discussion on the number of discernible colors related to a JND.
Software for simulating dichromatic perception of video streams
2013
We have designed a configurable stand-alone Matlab-based software to simulate dichromatic perception of video streams. The algorithm used is an extension for video streams of the “corresponding pair algorithm” by Capilla and coworkers for simulation of dichromatic perception of images. The software allows the user to upload a video sequence and to process it using different dichromatic color vision models and viewing conditions. The output video may be generated in different spatial and temporal resolutions and file formats. The functions for Matlab environment and a stand-alone application may be downloaded from the Repository of the University of Alicante. © 2013 Wiley Periodicals, Inc. C…
The effect of texture on face identification and configural information processing
2014
Shape and texture are an integral part of face identity. In the present study, the importance of face texture for face identification and detection of configural manipulation (i.e., spatial relation among facial features) was examined by comparing grayscale face photographs (i.e., real faces) and line drawings of the same faces. Whereas real faces provide information about texture and shape of faces, line drawings are lacking texture cues. A change-detection task and a forced-choice identification task were used with both stimuli categories. Within the change detection task, participants had to decide whether the size of the eyes of two sequentially presented faces had changed or not. After…
An eye tracking comparison of external pointing cues and internal continuous cues in learning with complex animations
2010
Abstract Two experiments used eye tracking to investigate a novel cueing approach for directing learner attention to low salience, high relevance aspects of a complex animation. In the first experiment, comprehension of a piano mechanism animation containing spreading-colour cues was compared with comprehension obtained with arrow cues or no cues. Eye tracking data revealed differences in learner attention patterns between the different experimental conditions. The second experiment used eye tracking with synchronized and non-synchronized cues to investigate the role of dynamic direction of attention in cueing effectiveness. Results of Experiment 1 showed that spreading-colour cues resulted…
Approximated overlap error for the evaluation of feature descriptors on 3D scenes
2013
This paper presents a new framework to evaluate feature descriptors on 3D datasets. The proposed method employs the approximated overlap error in order to conform with the reference planar evaluation case of the Oxford dataset based on the overlap error. The method takes into account not only the keypoint centre but also the feature shape and it does not require complex data setups, depth maps or an accurate camera calibration. Only a ground-truth fundamental matrix should be computed, so that the dataset can be freely extended by adding further images. The proposed approach is robust to false positives occurring in the evaluation process, which do not introduce any relevant changes in the …
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Approximation of piecewise smooth functions and images by edge-adapted (ENO-EA) nonlinear multiresolution techniques
2008
Abstract This paper introduces and analyzes new approximation procedures for bivariate functions. These procedures are based on an edge-adapted nonlinear reconstruction technique which is an intrinsically two-dimensional extension of the essentially non-oscillatory and subcell resolution techniques introduced in the one-dimensional setting by Harten and Osher. Edge-adapted reconstructions are tailored to piecewise smooth functions with geometrically smooth edge discontinuities, and are therefore attractive for applications such as image compression and shock computations. The local approximation order is investigated both in L p and in the Hausdorff distance between graphs. In particular, i…