全文获取类型
收费全文 | 10216篇 |
免费 | 20篇 |
国内免费 | 139篇 |
专业分类
电工技术 | 129篇 |
综合类 | 1篇 |
化学工业 | 219篇 |
金属工艺 | 427篇 |
机械仪表 | 47篇 |
建筑科学 | 65篇 |
能源动力 | 43篇 |
轻工业 | 18篇 |
水利工程 | 19篇 |
石油天然气 | 11篇 |
无线电 | 319篇 |
一般工业技术 | 111篇 |
冶金工业 | 103篇 |
原子能技术 | 89篇 |
自动化技术 | 8774篇 |
出版年
2022年 | 2篇 |
2020年 | 3篇 |
2019年 | 16篇 |
2018年 | 6篇 |
2017年 | 2篇 |
2016年 | 2篇 |
2015年 | 5篇 |
2014年 | 209篇 |
2013年 | 181篇 |
2012年 | 761篇 |
2011年 | 3063篇 |
2010年 | 1130篇 |
2009年 | 1002篇 |
2008年 | 672篇 |
2007年 | 586篇 |
2006年 | 443篇 |
2005年 | 573篇 |
2004年 | 521篇 |
2003年 | 582篇 |
2002年 | 269篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 22篇 |
1998年 | 95篇 |
1997年 | 28篇 |
1996年 | 19篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 11篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 26篇 |
1983年 | 15篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 1篇 |
1972年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
Gönül Turhan-SayanAuthor Vitae 《Pattern recognition》2003,36(7):1449-1466
This paper presents a model-based electromagnetic feature extraction technique that makes use of time-frequency analysis to extract natural resonance-related target features from scattered signals. In this technique, the discrete auto-Wigner distribution of a given signal is processed to obtain a partitioned energy density vector with a significantly reduced sensitivity to aspect angle. Each partition of this vector contains, in the approximate sense, spectral distribution of the signal energy confined to a particular subinterval of time. Selection of sufficiently late-time partitions provides target features with a markedly increased target discrimination capacity. The potential of the suggested technique and the practical issues in its implementation are demonstrated by applying it to realistic target classification problems with very encouraging results. 相似文献
992.
Peng-Yeng YinAuthor Vitae 《Pattern recognition》2003,36(8):1783-1797
This paper presents a new polygonal approximation method using ant colony search algorithm. The problem is represented by a directed graph such that the objective of the original problem becomes to find the shortest closed circuit on the graph under the problem-specific constraints. A number of artificial ants are distributed on the graph and communicate with one another through the pheromone trails which are a form of the long-term memory guiding the future exploration of the graph. The important properties of the proposed method are thoroughly investigated. The performance of the proposed method as compared to those of the genetic-based and the tabu search-based approaches is very promising. 相似文献
993.
I. EpifanioAuthor Vitae J. GutiérrezAuthor VitaeJ. MaloAuthor Vitae 《Pattern recognition》2003,36(8):1799-1811
Two types of redundancies are contained in images: statistical redundancy and psychovisual redundancy. Image representation techniques for image coding should remove both redundancies in order to obtain good results. In order to establish an appropriate representation, the standard approach to transform coding only considers the statistical redundancy, whereas the psychovisual factors are introduced after the selection of the representation as a simple scalar weighting in the transform domain.In this work, we take into account the psychovisual factors in the definition of the representation together with the statistical factors, by means of the perceptual metric and the covariance matrix, respectively. In general the ellipsoids described by these matrices are not aligned. Therefore, the optimal basis for image representation should simultaneously diagonalize both matrices. This approach to the basis selection problem has several advantages in the particular application of image coding. As the transform domain is Euclidean (by definition), the quantizer design is highly simplified and at the same time, the use of scalar quantizers is truly justified. The proposed representation is compared to covariance-based representations such as the DCT and the KLT or PCA using standard JPEG-like and Max-Lloyd quantizers. 相似文献
994.
Thomas Bernier Author VitaeJacques-André LandryAuthor Vitae 《Pattern recognition》2003,36(8):1711-1723
A new method for the representation and comparison of irregular two-dimensional shapes is presented. This method uses a polar transformation of the contour points about the geometric centre of the object. The distinctive vertices of the shape are extracted and used as comparative parameters to minimize the difference of contour distance from the centre. Experiments are performed, more than 39 000 comparisons of database shapes, provided by Sebastian et al. (ICCV (2001) 755), are made and the results are compared to those obtained therein. In addition, 450 comparisons of leaf shape are made and leaves of very similar shape are accurately distinguished. The method is shown to be invariant to translation, rotation and scaling and highly accurate in shape distinction. The method shows more tolerance to scale variation than that of Sebastian et al. (ICCV (2001) 755) and is less computationally intense. 相似文献
995.
Kwan-Ho LinAuthor VitaeKin-Man LamAuthor Vitae Wan-Chi SiuAuthor Vitae 《Pattern recognition》2003,36(8):1827-1834
Hausdorff distance is an efficient measure of the similarity of two point sets. In this paper, we propose a new spatially weighted Hausdorff distance measure for human face recognition. The weighting function used in the Hausdorff distance measure is based on an eigenface, which has a large value at locations of importance facial features and can reflect the face structure more effectively. Two modified Hausdorff distances, namely, “spatially eigen-weighted Hausdorff distance” (SEWHD) and “spatially eigen-weighted ‘doubly’ Hausdorff distance” (SEW2HD) are proposed, which incorporate the information about the location of important facial features such as eyes, mouth, and face contour so that distances at those regions will be emphasized. Experimental results based on a combination of the ORL, MIT, and Yale face databases show that SEW2HD can achieve recognition rates of 83%, 90% and 92% for the first one, the first three and the first five likely matched faces, respectively, while the corresponding recognition rates of SEWHD are 80%, 83% and 88%, respectively. 相似文献
996.
This paper presents a homotopy-based algorithm for the recovery of depth cues in the spatial domain. The algorithm specifically deals with defocus blur and spatial shifts, that is 2D motion, stereo disparities and/or zooming disparities. These cues are estimated from two images of the same scene acquired by a camera evolving in time and/or space. We show that they can be simultaneously computed by resolving a system of equations using a homotopy method. The proposed algorithm is tested using synthetic and real images. The results confirm that the use of a homotopy method leads to a dense and accurate estimation of depth cues. This approach has been integrated into an application for relief estimation from remotely sensed images. 相似文献
997.
Aditya RamamoorthyAuthor Vitae Subhashis BanerjeeAuthor Vitae 《Pattern recognition》2003,36(9):2069-2081
This paper is concerned with the problem of recognition of dynamic hand gestures. We have considered gestures which are sequences of distinct hand poses. In these gestures hand poses can undergo motion and discrete changes. However, continuous deformations of the hand shapes are not permitted. We have developed a recognition engine which can reliably recognize these gestures despite individual variations. The engine also has the ability to detect start and end of gesture sequences in an automated fashion. The recognition strategy uses a combination of static shape recognition (performed using contour discriminant analysis), Kalman filter based hand tracking and a HMM based temporal characterization scheme. The system is fairly robust to background clutter and uses skin color for static shape recognition and tracking. A real time implementation on standard hardware is developed. Experimental results establish the effectiveness of the approach. 相似文献
998.
Feature extraction is an important component of a pattern recognition system. It performs two tasks: transforming input parameter vector into a feature vector and/or reducing its dimensionality. A well-defined feature extraction algorithm makes the classification process more effective and efficient. Two popular methods for feature extraction are linear discriminant analysis (LDA) and principal component analysis (PCA). In this paper, the minimum classification error (MCE) training algorithm (which was originally proposed for optimizing classifiers) is investigated for feature extraction. A generalized MCE (GMCE) training algorithm is proposed to mend the shortcomings of the MCE training algorithm. LDA, PCA, and MCE and GMCE algorithms extract features through linear transformation. Support vector machine (SVM) is a recently developed pattern classification algorithm, which uses non-linear kernel functions to achieve non-linear decision boundaries in the parametric space. In this paper, SVM is also investigated and compared to linear feature extraction algorithms. 相似文献
999.
To protect the copyright of an arbitrarily shaped object, an oblivious and robust watermarking scheme is proposed. Different from other methods, an inertia ellipse is constructed to estimate the state of attack channel, and barycenter matching is employed to achieve fast self-synchronizing watermark detection. Watermark verification can be performed without the original image. Experimental results prove the robustness of our scheme against object manipulations, such as rotation, translation, scaling, etc. 相似文献
1000.
A. DipandaAuthor Vitae S. WooAuthor VitaeF. MarzaniAuthor Vitae J.M. BilbaultAuthor Vitae 《Pattern recognition》2003,36(9):2143-2159
The recovery of 3-D shape information (depth) using stereo vision analysis is one of the major areas in computer vision and has given rise to a great deal of literature in the recent past. The widely known stereo vision methods are the passive stereo vision approaches that use two cameras. Obtaining 3-D information involves the identification of the corresponding 2-D points between left and right images. Most existing methods tackle this matching task from singular points, i.e. finding points in both image planes with more or less the same neighborhood characteristics. One key problem we have to solve is that we are on the first instance unable to know a priori whether a point in the first image has a correspondence or not due to surface occlusion or simply because it has been projected out of the scope of the second camera. This makes the matching process very difficult and imposes a need of an a posteriori stage to remove false matching.In this paper we are concerned with the active stereo vision systems which offer an alternative to the passive stereo vision systems. In our system, a light projector that illuminates objects to be analyzed by a pyramid-shaped laser beam replaces one of the two cameras. The projections of laser rays on the objects are detected as spots in the image. In this particular case, only one image needs to be treated, and the stereo matching problem boils down to associating the laser rays and their corresponding real spots in the 2-D image. We have expressed this problem as a minimization of a global function that we propose to perform using Genetic Algorithms (GAs). We have implemented two different algorithms: in the first, GAs are performed after a deterministic search. In the second, data is partitioned into clusters and GAs are independently applied in each cluster. In our second contribution in this paper, we have described an efficient system calibration method. Experimental results are presented to illustrate the feasibility of our approach. The proposed method yields high accuracy 3-D reconstruction even for complex objects. We conclude that GAs can effectively be applied to this matching problem. 相似文献