QQ客服 官方微博 反馈留言

浏览/检索结果: 共8条，第1-8条 帮助 已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择作者升序作者降序题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序 Finite sample breakdown point of Tukey's halfspace median 期刊论文 SCIENCE CHINA-MATHEMATICS, 2017, 卷号: 60, 期号: 5, 页码: 861-874 作者:  Liu, XiaoHui;  Zuo, YiJun;  Wang, QiHua 收藏  |  浏览/下载：24/0  |  提交时间：2018/07/30 Tukey depth  Tukey median  breakdown point  in general position   Application of adaptive enhancement means in head and neck CR image (EI CONFERENCE) 会议论文 2012 3rd International Conference on Information Technology for Manufacturing Systems, ITMS 2012, September 8, 2012 - September 9, 2012, Qingdao, China Zhang M.-H.; Zhang Y.-Y. 收藏  |  浏览/下载：24/0  |  提交时间：2013/03/25 Digital CR of head and neck overcomes the disadvantage of regular X-ray radiography  which can not reveal bone and soft tissue position deficiency in one exposing  and reduces the Xray radiation dose. Meanwhile  various factors cause the decline of image quality  and images must be enhanced in order to meet demands of doctor's clinical diagnosis. The general enhancement algorithms don't consider body's structure differences and density characteristics. A new adaptive CR enhancement algorithm was proposed in this article  and head and neck CR images were processed with this method and compared with linear unsharp masking method. The experiment proves that the details of CR image enhanced were abundant and enhanced CR image had good visual effect  SNR was high  as well as detail variance /background variance (DV/BV) indicating that this algorithm is suitable for head and neck CR medical images. (2012) Trans Tech Publications  Switzerland.   Design and experimental research of a new type focus mechanism used in space-based telescope (EI CONFERENCE) 会议论文 2012 9th IEEE International Conference on Mechatronics and Automation, ICMA 2012, August 5, 2012 - August 8, 2012, Chengdu, China Wang D.; Jia X. 收藏  |  浏览/下载：27/0  |  提交时间：2013/03/25 The position of focal plane will be changed because of temperature fluctuation and vacuum environment. In order to make the telescope work well  positioning accuracy of the mechanism is 0.008mm. The performance satisfies the need of precision  a focusing mechanism is needed. To majority of large space-based telescopes  and the scheme design is reasonable and practicable. 2012 IEEE.  the general way to do this would be to use a reflector  which was located in the backfocal distance. One of typical schemes of this mechanism was introduced  however  because of the big axial size  the mechanism can't be used when the size of the enclosure was limited. A new type of focusing mechanism was introduced  which has such advantages of small size  high accuracy and low mass. The design and test methods had been discussed. According to the results  the repeatability positioning accuracy is 0.0025mm   Analysis of cooling system of active magnetic bearing of HTGR power conversion unit 期刊论文 2010, 2010 Wang Yan; Xie Heng; Zhao Lei 收藏  |  浏览/下载：1/0 Most-unstable wave method for inlet conditions of large eddy simulations of spatially developing channel flows 期刊论文 2010, 2010 Ren Kaifeng; Zhang Huiqiang; Wang Xilin 收藏  |  浏览/下载：4/0 Sonic point position and critical pressure ratio in non-uniform microchannels 期刊论文 2010, 2010 Ding Ying-Tao; He Feng; Yao Zhao-Hui; Shen Meng-Yu; Wang Xue-Fang 收藏  |  浏览/下载：2/0 An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China Yang Q.; Zhang C.; Wang C. 收藏  |  浏览/下载：12/0  |  提交时间：2013/03/25 Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.   High-accuracy real-time automatic thresholding for centroid tracker (EI CONFERENCE) 会议论文 ICO20: Optical Information Processing, August 21, 2005 - August 26, 2005, Changchun, China Zhang Y.; Wang Y. 收藏  |  浏览/下载：25/0  |  提交时间：2013/03/25 Many of the video image trackers today use the centroid as the tracking point. In engineering  we can get several key pairs of peaks which can include the target and the background around it and use the method of Otsu to get intensity thresholds from them. According to the thresholds  it give a great help for us to get a glancing size  a target's centroid is computed from a binary image to reduce the processing time. Hence thresholding of gray level image to binary image is a decisive step in centroid tracking. How to choose the feat thresholds in clutter is still an intractability problem unsolved today. This paper introduces a high-accuracy real-time automatic thresholding method for centroid tracker. It works well for variety types of target tracking in clutter. The core of this method is to get the entire information contained in the histogram  we can gain the binary image and get the centroid from it. To track the target  so that we can compare the size of the object in the current frame with the former. If the change is little  such as the number of the peaks  the paper also suggests subjoining an eyeshot-window  we consider the object has been tracked well. Otherwise  their height  just like our eyes focus on a target  if the change is bigger than usual  position and other properties in the histogram. Combine with this histogram analysis  we will not miss it unless it is out of our eyeshot  we should analyze the inflection in the histogram to find out what happened to the object. In general  the impression will help us to extract the target in clutter and track it and we will wait its emergence since it has been covered. To obtain the impression  what we have to do is turning the analysis into codes for the tracker to determine a feat threshold. The paper will show the steps in detail. The paper also discusses the hardware architecture which can meet the speed requirement.  the paper offers a idea comes from the method of Snakes