全文获取类型
收费全文 | 62篇 |
免费 | 0篇 |
专业分类
能源动力 | 1篇 |
无线电 | 8篇 |
一般工业技术 | 1篇 |
原子能技术 | 1篇 |
自动化技术 | 51篇 |
出版年
2012年 | 1篇 |
2011年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1971年 | 1篇 |
1956年 | 2篇 |
排序方式: 共有62条查询结果,搜索用时 0 毫秒
31.
Straight lines have to be straight 总被引:18,自引:0,他引:18
Most algorithms in 3D computer vision rely on the pinhole camera model because of its simplicity, whereas video optics, especially
low-cost wide-angle or fish-eye lenses, generate a lot of non-linear distortion which can be critical. To find the distortion
parameters of a camera, we use the following fundamental property: a camera follows the pinhole model if and only if the projection
of every line in space onto the camera is a line. Consequently, if we find the transformation on the video image so that every
line in space is viewed in the transformed image as a line, then we know how to remove the distortion from the image. The
algorithm consists of first doing edge extraction on a possibly distorted video sequence, then doing polygonal approximation
with a large tolerance on these edges to extract possible lines from the sequence, and then finding the parameters of our
distortion model that best transform these edges to segments. Results are presented on real video images, compared with distortion
calibration obtained by a full camera calibration method which uses a calibration grid.
Received: 27 December 1999 / Accepted: 8 November 2000 相似文献
32.
Generalized Gradients: Priors on Minimization Flows 总被引:3,自引:2,他引:3
G. Charpiat P. Maurel J.-P. Pons R. Keriven O. Faugeras 《International Journal of Computer Vision》2007,73(3):325-344
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows.
Classically, the definition of a gradient depends directly on the choice of an inner product structure. This consideration
is largely absent from the active contours literature. Most authors, explicitely or implicitely, assume that the space of
admissible deformations is ruled by the canonical L
2 inner product. The classical gradient flows reported in the literature are relative to this particular choice. Here, we investigate
the relevance of using (i) other inner products, yielding other gradient descents, and (ii) other minimizing flows not deriving
from any inner product. In particular, we show how to induce different degrees of spatial consistency into the minimizing
flow, in order to decrease the probability of getting trapped into irrelevant local minima. We report numerical experiments
indicating that the sensitivity of the active contours method to initial conditions, which seriously limits its applicability
and efficiency, is alleviated by our application-specific spatially coherent minimizing flows. We show that the choice of
the inner product can be seen as a prior on the deformation fields and we present an extension of the definition of the gradient
toward more general priors.
Electronic supplementary material Electronic supplementary material is available for this article at 相似文献
33.
Dominique Pagnoux Jean-Marc Blondy Philippe Di Bin Pierre Faugeras Nicolas Katcharov Paul Facq 《电信纪事》1994,49(11-12):619-628
Simple expressions of modal self and cross transfer coefficients have been established in the case of an optical fibre connection with small defects. A complete theoretical study leads to exhibit special azimuthal properties for the LP1,n modes family which had not been noticed up to date. Experimental applications of these properties in techniques of modal metrology are used in order to evaluate the quality of multimode or monomode connectors by the precise determination of the transverse offset between two fibres. 相似文献
34.
The Vector Distance Functions 总被引:1,自引:0,他引:1
We present a novel method for representing and evolving objects of arbitrary dimension. The method, called the Vector Distance Function (VDF) method, uses the vector that connects any point in space to its closest point on the object. It can deal with smooth manifolds with and without boundaries and with shapes of different dimensions. It can be used to evolve such objects according to a variety of motions, including mean curvature. If discontinuous velocity fields are allowed the dimension of the objects can change. The evolution method that we propose guarantees that we stay in the class of VDF's and therefore that the intrinsic properties of the underlying shapes such as their dimension, curvatures can be read off easily from the VDF and its spatial derivatives at each time instant. The main disadvantage of the method is its redundancy: the size of the representation is always that of the ambient space even though the object we are representing may be of a much lower dimension. This disadvantage is also one of its strengths since it buys us flexibility. 相似文献
35.
36.
Daniel Faugeras 《电信纪事》1956,11(10):209-222
37.
38.
Zhang Z. Faugeras O.D. 《IEEE transactions on pattern analysis and machine intelligence》1992,14(12):1141-1156
A method for estimating 3D displacements from two stereo frames is presented. It is based on the hypothesize-and-verify paradigm used to match 3D line segments between the two frames. In order to reduce the complexity of the method, an assumption is made that objects are rigid. The formulate a set of complete rigidity constraints for 3D line segments and integrate the uncertainty of measurements in this formation. The hypothesize-and-verify stages of the method use an extended Kalman filter to produce estimates of the displacements and of their uncertainty. The algorithm is shown to work on indoor and natural scenes. It is also shown to be easily extended to the case in which several mobile objects are present. The method is quite robust, fast, and has been thoroughly tested on hundreds of real stereo frames 相似文献
39.
Building Three-Dimensional Object Models from Image Sequences 总被引:3,自引:0,他引:3
We present the results from a working system designed to reconstruct a complete CAD/CAM surface model for objects that have both smooth and sharp surface boundaries. The input is a sequence of images of the object; the output is a 3-D surface mesh that can be manipulated and rendered with standard CAD/CAM tools. It is now well known that complete surface information (second-order differential surface properties) can be recovered at edges generated by the extremal boundary of a 3-D surface, In this paper we present new results in applying this theoretical framework to many views of a real object to build a complete 3-D model. Our experiments place these multiple frames in a common coordinate system using known motion, if available, or by otherwise automatically computing object motion based on our classification of edges in the reconstruction process. Experimental results are shown for bath real and synthetic data. 相似文献
40.