222 resultados para Weighted Lebesgue Space


Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

High-power (more than 500 mW) and high-speed (more than 1 Gbps) tapered lasers at 1060 nm are required in free-space optical communications and (at lower frequencies of around 100 MHz) display applications for frequency doubling to the green. On a 3 mm long tapered laser, we have obtained an open eye diagram at 1 Gbps, together with a high extinction ratio of 11 dB, an optical modulation amplitude of 530 mW, and a high modulation efficiency of 13 W/A. On a 4 mm-long tapered laser, we have obtained an open eye diagram at 700 Mbps, together with a high extinction ratio of 19 dB, a high optical modulation amplitude of 1.6 W, and a very high modulation efficiency of 19 W/A. On a 6 mm-long tapered laser, we have obtained a very high power of 5W CW and a very high static modulation efficiency of 59.8 W/A. © 2011 SPIE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

RoFSO links are found to be susceptible to high-order laser distortion making conventional SFDR ineffective as a performance indicator. For the first time, peak input power is demonstrated as a service-independent bound on dynamic range. © 2011 OSA.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a volumetric formulation for the multi-view stereo problem which is amenable to a computationally tractable global optimisation using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labelled as "object" and "empty" under a cost functional consisting of the following two terms: (1) A term that forces the boundary between the two regions to pass through photo-consistent locations and (2) a ballooning term that inflates the "object" region. To take account of the effect of occlusion on the first term we use an occlusion robust photo-consistency metric based on Normalised Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.