917 resultados para Bilateral balanced occlusion
Resumo:
The bilateral filter is known to be quite effective in denoising images corrupted with small dosages of additive Gaussian noise. The denoising performance of the filter, however, is known to degrade quickly with the increase in noise level. Several adaptations of the filter have been proposed in the literature to address this shortcoming, but often at a substantial computational overhead. In this paper, we report a simple pre-processing step that can substantially improve the denoising performance of the bilateral filter, at almost no additional cost. The modified filter is designed to be robust at large noise levels, and often tends to perform poorly below a certain noise threshold. To get the best of the original and the modified filter, we propose to combine them in a weighted fashion, where the weights are chosen to minimize (a surrogate of) the oracle mean-squared-error (MSE). The optimally-weighted filter is thus guaranteed to perform better than either of the component filters in terms of the MSE, at all noise levels. We also provide a fast algorithm for the weighted filtering. Visual and quantitative denoising results on standard test images are reported which demonstrate that the improvement over the original filter is significant both visually and in terms of PSNR. Moreover, the denoising performance of the optimally-weighted bilateral filter is competitive with the computation-intensive non-local means filter.
Resumo:
The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.
Resumo:
We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.
Resumo:
Consultoria Legislativa - Área XVIII - Direito Internacional Público e Relações Internacionais.
Resumo:
Analisa o planejamento estratégico em processo de implantação na Câmara dos Deputados, avaliando a abordagem denominada BSC - Balanced Scorecard. Procura responder se a sistemática adotada para a implantação do BSC na Câmara Federal foi adequada e quais os benefícios ao Poder Legislativo. Interpreta como ocorreu a implantação, comunicação, controle e monitoramento do planejamento estratégico por parte do corpo diretivo, ponderando o processo de adaptação às características da instituição e as possíveis contribuições para a promoção de um legislativo moderno e transparente para a sociedade brasileira.
Resumo:
Implementing resource discovery techniques at the Museum of Domestic Design and Architecture, Middlesex University Social Media and the Balanced Value Impact Model
Resumo:
This report presents meristic data for nearly all of the known species of Sebasles. Rudimentary caudal ray counts tend to be higher in more active species. The number of caudal rays supported by the hypurals is consistently 14, whereas the number of branched caudal rays varies between 11 and 13. Vertebral counts and most fin-ray counts tend to be lower in species or populations in warmer latitudes, except for pectoral ray counts which tend to have an opposite geographic pattern. On the basis of the small magnitude of meristic and morphometric differences and the lack of other differences between northern and southern samples of "Sebasles caurinus," Sebaslichlhys vexillaris Jordan and Gilbert is regarded as a junior synonym of Sebasles caurinus Richardson. The patterns of bilateral variation in paired meristics are analyzed and their mechanism discussed. The frequency distribution of pectoral ray counts in their right-left combination is shown to be useful in species separation. No association was found between any combination of two meristic features in any species. The author proposes that intrasample associations between meristic features are evidence of sampling heterogeneity. (PDF file contains 21 pages.)
Resumo:
We provide a model that bridges the gap between two benchmark models of strategic network formation: Jackson and Wolinsky' s model based on bilateral formation of links, and Bala and Goyal's two-way fl ow model, where links can be unilaterally formed. In the model introduced and studied here a link can be created unilaterally. When it is only supported by one of the two players the fl ow through the link suffers a certain decay, but when it is supported by both the fl ow runs without friction. When the decay in links supported by only one player is maximal (i.e. there is no flow) we have Jackson and Wolinsky 's connections model without decay, while when flow in such links is perfect we have Bala and Goyal' s two-way flow model. We study Nash, strict Nash and pairwise stability for the intermediate models. Efficiency and dynamics are also examined.
Resumo:
Documento de trabajo