全文获取类型

收费全文 |
750篇 |

完全免费 |
7篇 |

专业分类

自动化技术 |
757篇 |

出版年

2018年 |
6篇 |

2017年 |
9篇 |

2016年 |
11篇 |

2015年 |
9篇 |

2014年 |
17篇 |

2013年 |
12篇 |

2012年 |
16篇 |

2011年 |
31篇 |

2010年 |
13篇 |

2009年 |
27篇 |

2008年 |
35篇 |

2007年 |
27篇 |

2006年 |
26篇 |

2005年 |
22篇 |

2004年 |
23篇 |

2003年 |
25篇 |

2002年 |
20篇 |

2001年 |
24篇 |

2000年 |
32篇 |

1999年 |
33篇 |

1998年 |
30篇 |

1997年 |
22篇 |

1996年 |
23篇 |

1995年 |
27篇 |

1994年 |
21篇 |

1993年 |
17篇 |

1992年 |
17篇 |

1991年 |
18篇 |

1990年 |
14篇 |

1989年 |
15篇 |

1988年 |
9篇 |

1987年 |
15篇 |

1986年 |
19篇 |

1985年 |
15篇 |

1984年 |
14篇 |

1983年 |
10篇 |

1982年 |
6篇 |

1981年 |
3篇 |

1980年 |
8篇 |

1979年 |
9篇 |

1978年 |
3篇 |

1977年 |
3篇 |

1976年 |
3篇 |

1975年 |
3篇 |

1974年 |
3篇 |

1973年 |
3篇 |

1972年 |
2篇 |

1971年 |
1篇 |

1970年 |
1篇 |

1969年 |
2篇 |

1968年 |
1篇 |

1967年 |
1篇 |

1961年 |
1篇 |

**排序方式：**共有757条查询结果，搜索用时 218 毫秒

1.

Performance of optical flow techniques

**总被引：151，自引：7，他引：144** J. L. Barron D. J. Fleet S. S. Beauchemin 《International Journal of Computer Vision》1994,12(1):43-77

While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential, matching, energy-based, and phase-based methods. Our comparisons are primarily empirical, and concentrate on the accuracy, reliability, and density of the velocity measurements; they show that performance can differ significantly among the techniques we implemented. 相似文献

2.

PCNN models and applications

**总被引：74，自引：0，他引：74**Pulse coupled neural network (PCNN) models are described. The linking field modulation term is shown to be a universal feature of any biologically grounded dendritic model. Applications and implementations of PCNNs are reviewed. Application based variations and simplifications are summarized. The PCNN image decomposition (factoring) model is described in detail. 相似文献

3.

Visualizing vector field topology in fluid flows

**总被引：17，自引：0，他引：17**Methods for automating the analysis and display of vector field topology in general, and flow topology in particular, are described. By using techniques to extract and visualize topological information, it is possible to combine the simplicity of schematic depictions with the quantitative accuracy of curves and surfaces computed directly from the data. Two-dimensional vector field topology is discussed, covering critical points and time-dependent flows, to provide a basis for the examination of topology in three-dimensional separated flows. Surface topology and separation structures in three-dimensional flows are then addressed. The construction of representations of tangent surfaces that are accurate, as well as efficient to compute and display, is examined, covering tessellation, clipping, and refinement. Locating, characterizing, and displaying three-dimensional critical points are considered 相似文献

4.

Morphological associative memories

**总被引：16，自引：0，他引：16**The theory of artificial neural networks has been successfully applied to a wide variety of pattern recognition problems. In this theory, the first step in computing the next state of a neuron or in performing the next layer neural network computation involves the linear operation of multiplying neural values by their synaptic strengths and adding the results. A nonlinear activation function usually follows the linear operation in order to provide for nonlinearity of the network and set the next state of the neuron. In this paper we introduce a novel class of artificial neural networks, called morphological neural networks, in which the operations of multiplication and addition are replaced by addition and maximum (or minimum), respectively. By taking the maximum (or minimum) of sums instead of the sum of products, morphological network computation is nonlinear before possible application of a nonlinear activation function. As a consequence, the properties of morphological neural networks are drastically different than those of traditional neural network models. The main emphasis of the research presented here is on morphological associative memories. We examine the computing and storage capabilities of morphological associative memories and discuss differences between morphological models and traditional semilinear models such as the Hopfield net. 相似文献

5.

A topology preserving level set method for geometric deformable models

**总被引：14，自引：0，他引：14** Xiao Han Chenyang Xu Prince J.L. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》2003,25(6):755-768

Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models-the ability to automatically handle topology changes-turns out to be a liability in applications where the object to be segmented has a known topology that must be preserved. We present a new class of geometric deformable models designed using a novel topology-preserving level set method, which achieves topology preservation by applying the simple point concept from digital topology. These new models maintain the other advantages of standard geometric deformable models including subpixel accuracy and production of nonintersecting curves or surfaces. Moreover, since the topology-preserving constraint is enforced efficiently through local computations, the resulting algorithm incurs only nominal computational overhead over standard geometric deformable models. Several experiments on simulated and real data are provided to demonstrate the performance of this new deformable model algorithm. 相似文献

6.

FVC2000: fingerprint verification competition

**总被引：14，自引：0，他引：14** Maio D. Maltoni D. Cappelli R. Wayman J.L. Jain A.K. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》2002,24(3):402-412

Reliable and accurate fingerprint recognition is a challenging pattern recognition problem, requiring algorithms robust in many contexts. FVC2000 competition attempted to establish the first common benchmark, allowing companies and academic institutions to unambiguously compare performance and track improvements in their fingerprint recognition algorithms. Three databases were created using different state-of-the-art sensors and a fourth database was artificially generated; 11 algorithms were extensively tested on the four data sets. We believe that FVC2000 protocol, databases, and results will be useful to all practitioners in the field not only as a benchmark for improving methods, but also for enabling an unbiased evaluation of algorithms 相似文献

7.

Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis

**总被引：13，自引：0，他引：13**Genetic algorithms play a significant role, as search techniques forhandling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the naturalevolution principles of populations. These algorithms process apopulation of chromosomes, which represent search space solutions,with three operations: selection, crossover and mutation.Under its initial formulation, the search space solutions are coded using the binary alphabet. However, the good properties related with these algorithms do not stem from the use of this alphabet; other coding types have been considered for the representation issue, such as real coding, which would seem particularly natural when tackling optimization problems of parameters with variables in continuous domains. In this paper we review the features of real-coded genetic algorithms. Different models of genetic operators and some mechanisms available for studying the behaviour of this type of genetic algorithms are revised and compared. 相似文献

8.

Quad trees a data structure for retrieval on composite keys

**总被引：13，自引：0，他引：13**Summary The quad tree is a data structure appropriate for storing information to be retrieved on composite keys. We discuss the specific case of two-dimensional retrieval, although the structure is easily generalised to arbitrary dimensions. Algorithms are given both for staightforward insertion and for a type of balanced insertion into quad trees. Empirical analyses show that the average time for insertion is logarithmic with the tree size. An algorithm for retrieval within regions is presented along with data from empirical studies which imply that searching is reasonably efficient. We define an optimized tree and present an algorithm to accomplish optimization in

*n*log*n*time. Searching is guaranteed to be fast in optimized trees. Remaining problems include those of deletion from quad trees and merging of quad trees, which seem to be inherently difficult operations. 相似文献9.

Fuzzy systems with defuzzification are universal approximators

**总被引：8，自引：0，他引：8** Castro J.L. Delgado M. 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society》1996,26(1):149-152

In this paper, we consider a fundamental theoretical question: Is it always possible to design a fuzzy system capable of approximating any real continuous function on a compact set with arbitrary accuracy? Moreover, we research whether the answer to the above question is positive when we restrict to a fixed (but arbitrary) type of fuzzy reasoning and to a subclass of fuzzy relations. This result can be viewed as an existence theorem of an optimal fuzzy system for a wide variety of problems. 相似文献

10.

Hidden Markov measure field models for image segmentation

**总被引：7，自引：0，他引：7** Marroquin J.L. Santana E.A. Botello S. 《Pattern Analysis and Machine Intelligence, IEEE Transactions on》2003,25(11):1380-1387

Parametric image segmentation consists of finding a label field that defines a partition of an image into a set of nonoverlapping regions and the parameters of the models that describe the variation of some property within each region. A new Bayesian formulation for the solution of this problem is presented, based on the key idea of using a doubly stochastic prior model for the label field, which allows one to find exact optimal estimators for both this field and the model parameters by the minimization of a differentiable function. An efficient minimization algorithm and comparisons with existing methods on synthetic images are presented, as well as examples of realistic applications to the segmentation of Magnetic Resonance volumes and to motion segmentation. 相似文献