2 resultados para Industrial management -- Quality control
em Universidad de Alicante
Resumo:
This paper illustrates how to design a visual experiment to measure color differences in gonioapparent materials and how to assess the merits of different advanced color-difference formulas trying to predict the results of such experiment. Successful color-difference formulas are necessary for industrial quality control and artificial color-vision applications. A color- difference formula must be accurate under a wide variety of experimental conditions including the use of challenging materials like, for example, gonioapparent samples. Improving the experimental design in a previous paper [Melgosaet al., Optics Express 22, 3458-3467 (2014)], we have tested 11 advanced color-difference formulas from visual assessments performed by a panel of 11 observers with normal colorvision using a set of 56 nearly achromatic colorpairs of automotive gonioapparent samples. Best predictions of our experimental results were found for the AUDI2000 color-difference formula, followed by color-difference formulas based on the color appearance model CIECAM02. Parameters in the original weighting function for lightness in the AUDI2000 formula were optimized obtaining small improvements. However, a power function from results provided by the AUDI2000 formula considerably improved results, producing values close to the inter-observer variability in our visual experiment. Additional research is required to obtain a modified AUDI2000 color-difference formula significantly better than the current one.
Resumo:
The Iterative Closest Point algorithm (ICP) is commonly used in engineering applications to solve the rigid registration problem of partially overlapped point sets which are pre-aligned with a coarse estimate of their relative positions. This iterative algorithm is applied in many areas such as the medicine for volumetric reconstruction of tomography data, in robotics to reconstruct surfaces or scenes using range sensor information, in industrial systems for quality control of manufactured objects or even in biology to study the structure and folding of proteins. One of the algorithm’s main problems is its high computational complexity (quadratic in the number of points with the non-optimized original variant) in a context where high density point sets, acquired by high resolution scanners, are processed. Many variants have been proposed in the literature whose goal is the performance improvement either by reducing the number of points or the required iterations or even enhancing the complexity of the most expensive phase: the closest neighbor search. In spite of decreasing its complexity, some of the variants tend to have a negative impact on the final registration precision or the convergence domain thus limiting the possible application scenarios. The goal of this work is the improvement of the algorithm’s computational cost so that a wider range of computationally demanding problems from among the ones described before can be addressed. For that purpose, an experimental and mathematical convergence analysis and validation of point-to-point distance metrics has been performed taking into account those distances with lower computational cost than the Euclidean one, which is used as the de facto standard for the algorithm’s implementations in the literature. In that analysis, the functioning of the algorithm in diverse topological spaces, characterized by different metrics, has been studied to check the convergence, efficacy and cost of the method in order to determine the one which offers the best results. Given that the distance calculation represents a significant part of the whole set of computations performed by the algorithm, it is expected that any reduction of that operation affects significantly and positively the overall performance of the method. As a result, a performance improvement has been achieved by the application of those reduced cost metrics whose quality in terms of convergence and error has been analyzed and validated experimentally as comparable with respect to the Euclidean distance using a heterogeneous set of objects, scenarios and initial situations.