全文获取类型
收费全文 | 479篇 |
免费 | 30篇 |
国内免费 | 32篇 |
专业分类
电工技术 | 1篇 |
综合类 | 7篇 |
化学工业 | 14篇 |
金属工艺 | 2篇 |
机械仪表 | 26篇 |
建筑科学 | 5篇 |
能源动力 | 6篇 |
轻工业 | 4篇 |
水利工程 | 2篇 |
石油天然气 | 4篇 |
武器工业 | 1篇 |
无线电 | 118篇 |
一般工业技术 | 18篇 |
原子能技术 | 1篇 |
自动化技术 | 332篇 |
出版年
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 9篇 |
2018年 | 15篇 |
2017年 | 23篇 |
2016年 | 27篇 |
2015年 | 25篇 |
2014年 | 31篇 |
2013年 | 35篇 |
2012年 | 28篇 |
2011年 | 34篇 |
2010年 | 28篇 |
2009年 | 30篇 |
2008年 | 39篇 |
2007年 | 35篇 |
2006年 | 36篇 |
2005年 | 32篇 |
2004年 | 15篇 |
2003年 | 12篇 |
2002年 | 27篇 |
2001年 | 10篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1987年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有541条查询结果,搜索用时 46 毫秒
1.
The problem of detecting a subspace signal embedded in subspace Gaussian interference and thermal noise is studied in this paper. In this problem, both the signal-independent and signal-dependent interferences are assumed to be present, therefore the overall interference subspace covers the signal subspace. The approach of this paper extends previous works involving either of those two kinds of interferences. A set of secondary data containing only interference plus noise is employed to estimate the interference covariance matrix and the noise power. Three new detectors are designed via the generalized likelihood ratio (GLR), Rao and Wald tests, respectively. Their probabilities of false alarms (PFAs) and detections are analytically derived. The PFAs show that the new detectors have the constant false alarm rate (CFAR) property against the interference and noise. Numerical results show that the new detectors outperform their counterparts for the studied problem. Furthermore, the new detectors are less sensitive to the secondary data size and to the mismatched subspace signal than some other detectors, such as the GLR detector (GLRD), the adaptive matched filter (AMF), the adaptive subspace detector (ASD), etc. 相似文献
2.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks. 相似文献
3.
子空间方法盲多用户检测技术分析与探索 总被引:1,自引:0,他引:1
着重分析了基于子空间跟踪的盲线性多用户检测算法 ,并对其内部算法模块进行了仿真比较 ,最后对算法性能改善方法提出了自己的新思路 相似文献
4.
A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification. 相似文献
5.
We propose subspace distance measures to analyze the similarity between intrapersonal face subspaces, which characterize the variations between face images of the same individual. We call the conventional intrapersonal subspace average intrapersonal subspace (AIS) because the image differences often come from a large number of persons. An intrapersonal subspace is referred to as specific intrapersonal subspace (SIS) if the image differences are from just one person. We demonstrate that SIS varies significantly from person to person, and most SISs are not similar to AIS. Based on these observations, we introduce the maximum a posteriori (MAP) adaptation to the problem of SIS estimation, and apply it to the Bayesian face recognition algorithm. Experimental results show that the adaptive Bayesian algorithm outperforms the non-adaptive Bayesian algorithm as well as Eigenface and Fisherface methods if a small number of adaptation images are available. 相似文献
6.
Federico Felici Author Vitae Jan-Willem van Wingerden Author Vitae Author Vitae 《Automatica》2007,43(10):1684-1697
A novel subspace identification method is presented which is able to reconstruct the deterministic part of a multivariable state-space LPV system with affine parameter dependence, in the presence of process and output noise. It is assumed that the identification data is generated with the scheduling variable varying periodically during the course of the identification experiment. This allows to use methods from LTI subspace identification to determine the column space of the time-varying observability matrices. It is shown that the crucial step in determining the original LPV system is to ensure the obtained observability matrices are defined with respect to the same state basis. Once the LPV model has been identified, it is valid for other nonperiodic scheduling sequences as well. 相似文献
7.
8.
Ioannis Marras Georgios Tzimiropoulos Stefanos Zafeiriou Maja Pantic 《Image and vision computing》2014
We introduce a robust framework for learning and fusing of orientation appearance models based on both texture and depth information for rigid object tracking. Our framework fuses data obtained from a standard visual camera and dense depth maps obtained by low-cost consumer depth cameras such as the Kinect. To combine these two completely different modalities, we propose to use features that do not depend on the data representation: angles. More specifically, our framework combines image gradient orientations as extracted from intensity images with the directions of surface normals computed from dense depth fields. We propose to capture the correlations between the obtained orientation appearance models using a fusion approach motivated by the original Active Appearance Models (AAMs). To incorporate these features in a learning framework, we use a robust kernel based on the Euler representation of angles which does not require off-line training, and can be efficiently implemented online. The robustness of learning from orientation appearance models is presented both theoretically and experimentally in this work. This kernel enables us to cope with gross measurement errors, missing data as well as other typical problems such as illumination changes and occlusions. By combining the proposed models with a particle filter, the proposed framework was used for performing 2D plus 3D rigid object tracking, achieving robust performance in very difficult tracking scenarios including extreme pose variations. 相似文献
9.
很多经典的人脸识别方法难以适应姿势变化及人脸错位的情形。为了解决这一问题,提出一种基于纹理豪斯多夫距离(THD)的人脸识别算法。将人脸图像的空间量及纹理特征相结合,使其在深入的头部转动和人脸错位中都有很高的容错度。在FERET及Yale两大人脸数据库的实验表明,与其他经典的方法相比较,所提出的方法取得了更好的识别效果。 相似文献
10.
For hyperspectral target detection, it is usually the case that only part of the targets pixels can be used as target signatures, so can we use them to construct the most proper background subspace for detecting all the probable targets? In this paper, a dynamic subspace detection (DSD) method which establishes a multiple detection framework is proposed. In each detection procedure, blocks of pixels are calculated by the random selection and the succeeding detection performance distribution analysis. Manifold analysis is further used to eliminate the probable anomalous pixels and purify the subspace datasets, and the remaining pixels construct the subspace for each detection procedure. The final detection results are then enhanced by the fusion of target occurrence frequencies in all the detection procedures. Experiments with both synthetic and real hyperspectral images (HSI) evaluate the validation of our proposed DSD method by using several different state-of-the-art methods as the basic detectors. With several other single detectors and multiple detection methods as comparable methods, improved receiver operating characteristic curves and better separability between targets and backgrounds by the DSD methods are illustrated. The DSD methods also perform well with the covariance-based detectors, showing their efficiency in selecting covariance information for detection. 相似文献