A general technique for the recovery of signi cant image features is presented. The technique is based on the mean shift algorithm, a simple nonparametric pro- cedure for estimating density gradients. Drawbacks of the current methods (including robust clustering) are avoided. Feature space of any nature can be processed, and as an example, color image segmentation is dis- cussed. The segmentation is completely autonomous, Only its class is chosen by the user. Thus, the same program can produce a high quality edge image, or pro- vide, by extracting all the signi cant colors, a prepro- cessor for content-based query systems. A 512 512 color image is analyzed in less than 10 seconds on a standard workstation. Gray level images are handled as color images having Only the lightness coordinate
標(biāo)簽： technique presented features recovery
上傳時(shí)間： 2015-10-14
上傳用戶：410805624
HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer is great, remarked Chip. ``I Only wish Timothy were here to see these results. (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)
標(biāo)簽： supercomputer extended Diller explor
上傳時(shí)間： 2013-12-22
上傳用戶：黑漆漆
Learning Kernel Classifiers: Theory and Algorithms, Introduction This chapter introduces the general problem of machine learning and how it relates to statistical inference. 1.1 The Learning Problem and (Statistical) Inference It was Only a few years after the introduction of the first computer that one of man’s greatest dreams seemed to be realizable—artificial intelligence. Bearing in mind that in the early days the most powerful computers had much less computational power than a cell phone today, it comes as no surprise that much theoretical research on the potential of machines’ capabilities to learn took place at this time. This becomes a computational problem as soon as the dataset gets larger than a few hundred examples.
標(biāo)簽： Introduction Classifiers Algorithms introduces
上傳時(shí)間： 2015-10-20
上傳用戶：aeiouetla
藍(lán)牙跳頻系統(tǒng)的simulink仿真程序（This is a MATLAB simulation (SIMULINK) for the hop selection scheme in Bluetooth. Since nearly the same scheme is used for 79 and 23-hop system. Only the 79-hop system in simulated in the CONNECTION state.）
標(biāo)簽： simulation Bluetooth selection simulink
上傳時(shí)間： 2013-12-19
上傳用戶：wanqunsheng
The CUBA library provides new implementation of four general-purpose multidimensional integration algorithms: Vegas, Suave, Divonne, and Cuhre. Suave is a new algorithm, Divonne is a known algorithm to which important details have been added, and Vegas and Cuhre are new implementations of existing algorithms with Only few improvements over the original versions. All four algorithms can integrate vector integrands and have very similar Fortran, C/C++, and Mathematica interfaces.
標(biāo)簽： multidimensional general-purpose implementation integration
上傳時(shí)間： 2014-09-09
上傳用戶：gxf2016
RAM Disk Driver with custom BoundsChecker events This sample illustrates how to add custom BoundsChecker events to a DDK driver. It links to the kchecker library and has several BOUNDSCHECKER() calls in it. This sample is a software Only Windows NT Device Driver. This driver is provided for educational purposes Only. Generally the Windows NT cache manager does a much better job of optimizing memory usage than using a RAM disk.
標(biāo)簽： custom BoundsChecker illustrates Bounds
上傳時(shí)間： 2014-01-04
上傳用戶：onewq
Pico-IrDA is a minimalistic IrDA stack for microcontrollers. It supports IrOBEX in primary and secondary IrDA mode and IrCOMM in secondary mode Only. Pico-IrDA works with a fixed baudrate of 9600 bps and is restricted to two communication peers
標(biāo)簽： microcontrollers minimalistic Pico-IrDA supports
上傳時(shí)間： 2015-11-02
上傳用戶：洛木卓
Developers use algorithms and data structures every day of their working lives. Having a good under-standing of these algorithms and knowledge of when to apply them is essential to producing softwarethat not Only works correctly, but also performs efficiently. This book aims to explain those algorithms and data structures most commOnly encountered in day-to-day software development, while remaining at all times practical, concise, and to the point, with little orno verbiage to distract from the core concepts and examples.
標(biāo)簽： Developers algorithms structures working
上傳時(shí)間： 2015-11-03
上傳用戶：wyc199288
design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user Only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.
標(biāo)簽： Butterworth internally Chebyshev specified
上傳時(shí)間： 2015-11-08
上傳用戶：253189838
CORDIC (Coordinate Rotation Digital Computer) is a method for computing elementary functions using minimal hardware such as shifts, adds/subs and compares. CORDIC works by rotating the coordinate system through constant angles until the angle is reduces to zero. The angle offsets are selected such that the operations on X and Y are Only shifts and adds.
標(biāo)簽： Coordinate elementary computing functions
上傳時(shí)間： 2015-11-08
上傳用戶：saharawalker
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
