xinyuangeshujiance

Contourlet变换中的隐马尔科夫树模型程序 Hidden Markov Tree model of Contourlet Transform 2008年11月14日 MATLAB2 (R2006a) 这是一个Matlab实现的隐马尔科夫树模型，用于计算图像的Contourlet系数。程序同时还包括图像去噪、纹理恢复的应用模型。(Contourlet transform the hidden Markov model procedures for Hidden Markov Tree model of Contourlet Transform 2008 年 11 月 14 日 MATLAB2 (R2006a) is a Matlab implementation of the Hidden Markov Tree Model, used to calculate the image Contourlet factor. Program also includes denoising, texture recovery application model.)

re-inforcement learning doc

This file is the programs of (chapter 4) of book (Modeling the Wireless Propagation Channel a Simulation Approach with MATLAB) which is related to introduction to multipath. It helps you to simulate multipath wireless channel.

Matlab implementation of the ES (extensive search algorithm ) used in motion estimation of macro blocks.

经典的MUSIC,前后向空间平滑和改进的空间平滑算法(three kinds algorithms for MUSIC、SS and Modified SS)

说明：  经典的fast ICA程序，用于盲信号的分离,希望能够对大家有帮助！(classic fast ICA procedures for the Blind Signal Separation, we hope to be able to help!)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)

此文件为 在matlab中rgb2gray的方式(way of rgb2gray in matlab)

该文档包含了深度学习中的矢量化编程方式和程序示例(this document contain vectorization exercise of deep learning network)

matlab codes for EEG signal processing