Silicon-based microelectrode arrays for stimulation and signal recording of in vitro cultured neurons

Microelectrode arrays (MEAs) for stimulation and signal recording of in vitro cultured neurons are presented.Each MEA is composed of 60 independent electrodes with 59 working ones and one reference one.These electrodes are divided into 30 pairs.Through each pair of electrodes,four independent states can be realized to define the accessing modes of neurons cultured on the surface of the electrodes.A total MEA covers an area of 10 mm×10 mm.MEAs are fabricated in a silicon-based semiconductor process.An implemented MEA is bonded on a specially designed printed-circuit-board (PCB) and surrounded by a culture chamber.An impedance measurement has been made to verify the electrical characteristics of MEAs.The surface was modified to enhance the biocompatibility.A series of PC12 cells culture experiments validates the effectiveness of the modification.An extracellular signal recording experiment with acetylcholine (Ach) as a stimulant has been carried out,and the results show the feasibility of MEAs for extracellular action potential recording.Extracellular electrical stimulation and recording experiments have been carried out too.They indicate that MEAs can be used for extracellular stimulation,recording,simultaneous stimulation and recording,and isolation of PC12 cells network cultured in vitro.     

分布式视频编码虚拟依赖信道模型研究

视频信息固有的非平稳特性,如冲突区域等,使时域预测技术变得非常复杂.在分布式视频编码(DVC)中,由于解码端不能获取当前编码帧的信息,精确地对时域相关噪声进行建模变得更为困难.文中以虚拟依赖信道模型为切入点对如何降低时域相关噪声进行了研究.首先对DVC虚拟依赖信道进行了建模,并对影响边信息的主要因素进行了分析,分析结果表明在变换域中不同的频率子带对时域相关噪声的敏感度不同.在此基础上提出了一种新的基于小波变换域的虚拟依赖信道模型VCMDWT,基于分类编码的思想对较为平稳的LL子带进行Wyner-Ziv编码,对非平稳的高频子带进行SPIHT帧内编码.实验结果表明,与基于像素域的方法相比,所提出的VCMDWT模型能够得到更稳定的虚拟信道,提高DVC系统的率失真性能达到2.6dBs以上.     

基于动态权重裁剪的快速Adaboost训练算法

提出了基于动态权重裁剪的快速Adaboost训练算法,当训练数据集较大时,可以大大提高训练速度.基于动态权重裁剪的Adaboost训练算法在每次迭代过程中舍去权重较小的大多数样本,保留权重较大的少数样本进行训练,迭代完成后检查这个利用少量样本训练得到的弱分类器在所有样本上的分类性能,如果错误率大于0.5,则扩大样本的数量重新训练本次迭代的弱分类器.由于在大多数迭代过程中,只利用了少量样本进行弱分类器的训练,从而提高了整个算法的训练速度.     

A genetic algorithm with gene rearrangement for K-means clustering

In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility.     

Stable local dimensionality reduction approaches

Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.