平均因子分解法，適用于正定矩陣First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangular (that is, it has all zeros below the diagonal).
It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition.
MODE_Switch1Processing multi-interrupt request needs to set the priority of these interrupt requests.
The IRQ flags of the 7 interrupt are controlled by the interrupt event occurring. But the
IRQ flag set doesn t mean the system to execute the interrupt vector. The IRQ flags can be
triggered by the events without interrupt enable. Just only any the event occurs and the
IRQ will be logic "1".
Chessboard Cover,On a chessboard，only one square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.
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
SOUNDSC(Y,...) is the same as SOUND(Y,...) except the data is
scaled so that the sound is played as loud as possible without
clipping. The mean of the data is removed.
Spikes can be taken as absolute quantities of measuring values which are large than approximately four (expressed as variable [Times_SD] in the program)times of the standard deviation of the time series, and can be removed by repeating 3 times with each time series. When a measuring value with the deviation from the mean larger than four times of the standard deviation, the variable can be taken as NO_VALUE, and the number of spikes is saved into the variable [SpikeNum].
If the variable [Times_SD] is taken as four, many records will be removed, so the variable [Times_SD] can be taken as larger, for example eight.
Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a square.
圖像處理的關于Snakes : Active Contour Models算法和水平集以及GVF的幾篇文章，文章列表為：
[1]Snakes Active Contour Models.pdf
[2]Multiscale Active Contours.pdf
[3]Snakes, shapes, and gradient vector flow.pdf
[4]Motion of level sets by mean curvature I.pdf
[5]Spectral Stability of Local Deformations Spectral Stability of Local Deformations.pdf
[6]An active contour model for object tracking using the previous contour.pdf
[7]Volumetric Segmentation of Brain Images Using Parallel Genetic AlgorithmsI.pdf
[8]Segmentation in echocardiographic sequences using shape-based snake model.pdf
[9]Active Contours Without Edges.pdf
學習圖像處理的人必看的幾篇文章
本程序實做MLP(Multi-layer perceptron)算法，使用者可以自行設定訓練數據集與測試數據集，將訓練數據集加載，在2、3維下可以顯示其分布狀態，并分別設定鍵節值、學習率、迭代次數來訓練其類神經網絡，最后可觀看辨識率與RMSE（Root Mean squared error）來判別訓練是否可以停止。
