The GIFT (the GNU Image-Finding Tool) is a Content Based Image Retrieval System (CBIRS: http://en.wikipedia.org/wiki/CBIR). It enables you to do Query By Example (QBE: http://en.wikipedia.org/wiki/QBE) on images, giving you the opportunity to improve query results by relevance feedback. For processing your queries the program relies entirely on the content of the images, freeing you from the need to annotate all images before querying the collection.
標簽： Image-Finding Retrieval Content System
上傳時間： 2014-01-11
上傳用戶：咔樂塢
Interactive smoothing for time-series signals, with sliders that allow you to adjust the smoothing parameters continuously while observing the effect on your signal dynamically. Run SmoothSliderTest to see how it works.
標簽： smoothing Interactive time-series signals
上傳時間： 2014-12-07
上傳用戶：xinyuzhiqiwuwu
The philosophy of the book is to present various pattern recognition tasks in a unified way, including image analysis, speech processing, and communication applications. Despite their differences, these areas do share common features and their study can only benefit from a unified approach.
標簽： recognition philosophy pattern present
上傳時間： 2017-05-05
上傳用戶：plsee
This is a mutlicore and cluster(of single-core,multi-core systems) matrix inversion code. Which uses the MPI(Message Passing Interface) for communication across the compute nodes of cluster and using thread-API based OpenMP(Open Multi Processing) between cores of intra-compute or head node.
標簽： single-core multi-core inversion mutlicore
上傳時間： 2013-12-21
上傳用戶：ryb
L. Dong and A. P. Petropulu, 揗ultichannel ALLIANCES: A Cross-layer Cooperative Scheme for Wireless Networks,擨EEE Trans. on Signal ProcessingJanuary 2008. (MATLAB Code)
標簽： L. A. P. Cross-layer
上傳時間： 2014-01-18
上傳用戶：kr770906
L. Dong and A. P. Petropulu, 揗ultichannel ALLIANCES: A Cross-layer Cooperative Scheme for Wireless Networks,擨EEE Trans. on Signal ProcessingJanuary 2008.
標簽： L. A. P. Cross-layer
上傳時間： 2013-11-28
上傳用戶：zhanditian
SPREAD SPECTRUM MODULATION TECHNIQUES -spread spectrum - those modulation methods that are producing a signal whose spectrum is more wider than of the data signal, the occupied frequency band being independent by the signal of data band. -The signals with spread spectrum of direct sequence type BPSK (BPSK-DS-SS) -The signals with spread spectrum of direct sequence type QPSK – DS–SS - Frequency hopping spread spectrum signals (FH-SS)
標簽： MODULATION TECHNIQUES modulation SPECTRUM
上傳時間： 2017-06-05
上傳用戶：lht618
Spread-spectrum techniques are methods by which electromagnetic energy generated in a particular bandwidth is deliberately spread in the frequency domain, resulting in a signal with a wider bandwidth. These techniques are used for a variety of reasons, including the establishment of secure communications, increasing resistance to natural interference and jamming, and to prevent detec
標簽： Spread-spectrum electromagnetic techniques particular
上傳時間： 2017-06-06
上傳用戶：royzhangsz
Sensing and planning are at the core of robot motion. Traditionally, mobile robots have been used for performing various tasks with a general-purpose processor on-board. This book grew out of our research enquiry into alternate architectures for sensor-based robot motion. It describes our research starting early 2002 with the objectives of obtaining a time, space and energy-efficient solution for processing sensor data for various robotic tasks. New algorithms and architectures have been developed for exploration and other aspects of robot motion. The research has also resulted in design and fabrication of an FPGA-based mobile robot equipped with ultrasonic sensors. Numerous experiments with the FPGA-based mobile robot have also been performed and they confirm the efficacy of the alternate architecture.
標簽： Traditionally planning Sensing motion
上傳時間： 2013-12-20
上傳用戶：古谷仁美
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
標簽： iterations performs Bailey number
上傳時間： 2014-01-05
上傳用戶：libenshu01
