نتایج جستجو برای: light processing

تعداد نتایج: 878407  

1995
Juan Carlos Santamaría Ronald C. Arkin

This paper describes the results from a feasibility analysis performed on two diierent structured light system designs and the image processing algorithms they require for dent detection and localization. The impact of each structured light system is analyzed in terms of their mechanical realization and the complexity of the image processing algorithms required for robust dent detection. The tw...

2002
Ian McDowall Mark Bolas Dan Corr Terry Schmidt

DLP (Digital Light Processing) is about to invade stereo applications, one of the last bastions of CRT projection technology. This paper presents various methods for achieving stereo and their application to DLP projectors. The newly developed sequential stereo capable projectors are also introduced and their performance characteris tics discussed along with artifacts. Also presented are ways t...

2005
Robert Granger Frederik Vercauteren

Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm problem that works directly in these groups. Using a prototype implementation, we obtain practical upper bounds for the difficulty of solving the DLP in the tori T2(Fpm) and T6(Fpm) for various p and m. Our results do not affect ...

2005
Pascal Hitzler Peter Haase Markus Krötzsch York Sure-Vetter Rudi Studer

We discuss some of the recent controversies concerning the DLP fragment of OWL. We argue that it is a meaningful fragment and can serve as a basic interoperability layer between OWL and logic programming-based ontology languages.

2008
Sebastian Rudolph Markus Krötzsch Pascal Hitzler

We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today’s most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The ...

Journal: :Microscopy research and technique 2004
Yinlong Sun Bartek Rajwa J Paul Robinson

A common observation about confocal microscopy images is that lower image stacks have lower voxel intensities and are usually blurred in comparison with the upper ones. The key reasons are light absorption and scattering by the objects and particles in the volume through which light passes. This report proposes a new technique to reduce such noise impacts in terms of an adaptive intensity compe...

Journal: :Minimally invasive therapy & allied technologies : MITAT : official journal of the Society for Minimally Invasive Therapy 2009
Hongen Liao Masayoshi Tsuzuki Takashi Mochizuki Etsuko Kobayashi Toshio Chiba Ichiro Sakuma

This paper describes a fast image mapping system that integrates endoscopic image mosaics with three-dimensional (3-D) ultrasound images for assisting intrauterine laser photocoagulation treatment. Endoscopic laser photocoagulation treatment has a good survival rate and a low complication rate for twins. However, the small field of view and lack of surrounding information makes the identificati...

1997
Robert W. Cohn Anatoly A. Vasiliev Wenyao Liu David L. Hill

Arbitrary complex-valued functions can be implemented as arrays of individually specified diffusers. For any diffuser, only average step height and vertical roughness are needed to control phase and amplitude. This modulation concept suggests potentially low-cost fabrication methods in which desired topographies are patterned by exposing photoresist with partially developed speckle patterns. An...

2010
Wilhelm Kempf

1. The communication model Communication is not simply just information processing from a sender to a recipient. It is an interactive process that has its own specific dynamics by which the communicators themselves become entangled in the topic of the communication. The meaning of any message results from the context in which it is placed and can be understood on three different levels. Take a ...

Journal: :IACR Cryptology ePrint Archive 2006
Ilya Mironov Anton Mityagin Kobbi Nissim

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید