首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   719篇
  免费   31篇
  国内免费   3篇
化学   16篇
力学   31篇
综合类   2篇
数学   76篇
物理学   159篇
无线电   469篇
  2024年   2篇
  2023年   19篇
  2022年   12篇
  2021年   20篇
  2020年   12篇
  2019年   6篇
  2018年   6篇
  2017年   15篇
  2016年   23篇
  2015年   30篇
  2014年   60篇
  2013年   63篇
  2012年   36篇
  2011年   44篇
  2010年   31篇
  2009年   38篇
  2008年   49篇
  2007年   42篇
  2006年   26篇
  2005年   22篇
  2004年   27篇
  2003年   17篇
  2002年   25篇
  2001年   14篇
  2000年   8篇
  1999年   21篇
  1998年   25篇
  1997年   12篇
  1996年   11篇
  1995年   12篇
  1994年   6篇
  1993年   6篇
  1992年   7篇
  1990年   2篇
  1989年   1篇
  1988年   1篇
  1982年   1篇
  1981年   1篇
排序方式: 共有753条查询结果,搜索用时 0 毫秒
71.
文章提出一种高效的VLSI结构,实现MPEG-4视频编码标准中二值形状的运动估值算法。我们称这种结构为DDBME。其主要由一个基于一维脉动阵列的数据分配器和16*32bit的搜索区域缓冲器组成。在DDBME中,采用数据位并行处理技术进行块匹配算法中绝对误差和(SAD)的计算。  相似文献   
72.
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space (Van der Stappen et al., 1997). In this paper we address the dynamic version of the motion planning problem in which a robot moves among polygonal obstacles which move along polylines. The obstacles are assumed to move along constant complexity polylines, and to respect the low density property at any given time. We will show that in this situation a cell decomposition of the free space of size O(n2(n) log2 n) can be computed in O(n2(n) log2 n) time. The dynamic motion planning problem is then solved in O(n2(n) log3 n) time. We also show that these results are close to optimal.  相似文献   
73.
陈弘毅  舒清明 《电子学报》1998,26(11):55-60
在视频图像压缩编码中,运动估值计算量巨大、其硬件实现极富挑战性,本文提出一种采用压缩阵列的新型低频滞块匹配运动估值器结构,该结构既能够有效地实现全搜索,又能够实现如三步搜索等快速分层搜索算法,与传统的累加树型结构相比,其运行效率显著提高,而芯片面积进一步减少,在此基础上,本文还提出一种自适应夫匹配和硬件实现方法,使块匹配运算量再降低约1/2-1/4,并以很小的硬件开销进一步降低了延滞。  相似文献   
74.
MPEG-4 issued two calls for proposals requesting submission of algorithms and tools relevant to standardization of MPEG-4. This paper reports on the evaluation of tools submitted for evaluation in November 1995 and January 1996. Complete video coding schemes submitted in January 1996 are also covered. The goal of the evaluation was to cluster the tools according to the technical areas they address, to evaluate them according to the issues relevant to the standardization process, and finally to suggest areas of core experiments to improve a video verification model (VM) as soon as the VM becomes available. Altogether, MPEG evaluated 87 tools and 19 complete coding algorithms, most of them highlighted in this paper. During the evaluation, 19 areas for core experiments were identified. Each core experiment is targeted at different functionalities like compression efficiency, content-based coding, error resilience, scalability. This definition of core experiments caused close collaboration and supported mutual fertilization between organizations working on similar tools, which allowed the VM to progress much faster than expected.  相似文献   
75.
基于IEKF视觉运动分析递归算法的研究   总被引:1,自引:1,他引:0  
杨敬安 《电子学报》1996,24(4):60-65
本文提出基于图象序列上特征点的图象平面轨迹进行运动参数估计,以提取运动物体的姿态、速度以及外部环境内所感兴趣点的位置参数,由于图象特征点轨迹与待估计的参数有关,因此能够组合长序列图象内的信息并利用IEKF递归地估计未知的运动及结构参数。  相似文献   
76.
The local visual motion detection mechanism used in the visual systems of primatescan only sense the motion component oriented perpendicularly to the contrast gradient of thebrightness pattern.But the visual system of higher animals can adaptively determine the actualdirection of motion through a learning process.In this paper a multilayered feedforward neuralnetwork model for perception of visual motion is presented.This model employs W.Reichardt'selementary motion detectors array and T.Kohonen's self-organizing feature map.We explored theself-organizing principles for perception of visual motion.The computer simulations show thatthis neural network is able to recognize the true direction of motion through an unsupervisedlearning process.In addition,the neurons with the same or similar motion direction selectivitytend to appear in“functional columns”which seem to be qualitatively similar to the corticalmotion columns observed by electrophysiological and cytohistochemical studies in certain higherareas such as MT.It proves that motion-detection by spatio-temporal coherences,mapping,co-operation,competition,and Hebb rule may be the basic principles for the self-organization ofvisual motion perception networks.  相似文献   
77.
本文基于局部均匀操作及相关运动检测器提出一种能够有效地检测光流力象运动及运动间断的强而可靠的算法,从而为进一步研究动态运动视觉开辟了新的途径。  相似文献   
78.
To shorten scanning time and increase the feasibility of experimental results, we performed right coronary artery magnetic resonance angiography (CMRA) at 3.0 T using dual acceptance window weighting function in 25 normal subjects. We examined these subjects using conventional navigator with fixed gating window and 6 dual acceptance window weighted gating (DAWG) sequences with different central weighted ratio (CWR). Compared with the conventional navigator sequence, DAWG sequences with CWRs of 20% and 25% increased the scanning efficiency by 30% and 26% respectively (P<.05), while maintaining good image quality; further the corresponding scanning time decreased from 2.12–1.64 and 1.69 min, respectively (P<.05). However, CWRs less than 15% caused image degradation to some extent. The coronary artery lengths and diameters did not show statistically significant differences between the two techniques (P>.05). Briefly, to avoid the problems caused by low navigator efficiency and to maintain comparable image quality, the weighted gating parameters of 3 mm width central acceptance window and 15 mm width outer acceptance window with CWR between 20% and 25% are recommended for right CMRA at 3 T.  相似文献   
79.
Several specific features have been incorporated into Motion estimation (ME) in H.264 coding standard to improve its coding efficiency. However, they result in very high computational load. In this paper, a fast ME algorithm is proposed to reduce the computational complexity. First, a mode discriminant method is used to free the encoder from checking the small block size modes in homogeneous regions. Second, a condensed hierarchical block matching method and a spatial neighbor searching scheme are employed to find the best full-pixel motion vector. Finally, direction-based selection rule is utilized to reduce the searching range in sub-pixel ME process. Experimental results on commonly used QCIF and CIF format test sequences have shown that the proposed algorithm achieves a reduction of 88% ME process time on average, while incurring only 0.033 dB loss in PSNR and 0.50% increment on the total bit rate compared with that of exhaustive ME process, which is a default approach adopted in the JM reference software.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号