其中ImageUrls返回分析得到的圖片連結。LinkUrls返回分析得到的網頁連結。BodyText返回去掉標記的網頁本文部分。TitleText返回網頁的標題。{A Class for Page AnalysisAuthor: Liu LIUMail: Geo(DOT)Cra(AT)Gmail(DOT)comWeb: http://www.aivisoft.net/}unit Crawl;interfaceuses Math, Windows, SysUtils, Variants,
checkout the new opencv.in real world data, in lower dimension, spill tree outperform bbf by an order of computing time.spill tree approximation result in 4 msbest-bin-first approximation result in 20 msnaive search result in 61 mstest data can be
SMO_SVM.pas:{Author: Liu LiuWebsite: www.aivisoft.netE-Mail: geo.cra@gmail.comThis code is translated from a p-code by J. Platt.This code shows a SMO(Sequential Minimal Optimization) SVM.Enjoy fast and efficient SVM!This code now provide 4 different
{作者:劉留參考文獻為:Jean-Yves Bouguet "Pyramidal Implementation of the Lucas Kanade Feature Tracker Description of the algorithm"http://www.aivisoft.net/Geo.Cra[at]gmail[dot]com}unit OpticalFlowLK;interfaceuses Math, Windows, SysUtils, Variants, Classes,
昨天打算重寫記憶體 Clerk,以前系統上用的記憶體 Clerk很不方便,為了加入引用計數功能而犧牲了簡單性,而且為了安全執行緒用了一些鎖。這次做到了所有記憶體配置和釋放都是Lock Free的。因為記憶體塊之間是單鏈表,所以實現Lock Free比較簡單。難的地方是管理空閑資源是用的一個數組,這時要使用DCAS及類似的方法(k word compare and k-th
http://snipplr.com/view/35730/// create a toolbar to have two buttons in the rightUIToolbar* tools = [[UIToolbar alloc] initWithFrame:CGRectMake(0, 0, 90.0, 44.01)]; // create the array to hold the buttons, which then gets added to the
cvSURF implementation have been admitted by opencv library. Now you can download the optimized version at opencv cvs respository:http://opencvlibrary.cvs.sourceforge.net/opencvlibrary/opencv/cv/src/cvsurf.cpp?view=logSome modifications by Vadim: 46
procedure CornerDetect(sWidth, sHeight: longint; Quality: extended);var i, j, fi, fj: longint; a, b, c, sum, MinAccept, MaxEigenvalue: extended;begin FeatureCount := 0; { 下面採用Good Feature To Track介紹的方法 J. Shi and C. Tomasi "Good Features to
N是未知數個數,A是係數矩陣,X是右端項矩陣,同時存放解,右端項矩陣允許有M列。function GAUE(var A: TDoubleExtendedArray; var X: TDoubleExtendedArray; N, M: longint): boolean;var i, j, k, jk: longint; B, Max, Eps: Extended;begin Eps := 1E-8; for k := 0 to N - 1 do begin Max := 0;
特徵值和特徵向量是指對於矩陣A有,Av=lv,v為特徵向量,l為特徵值。就是求解一個高次方程:det(A-lI)=0代碼如下:unit Matrix;interfaceuses Math, Windows, SysUtils, Variants, Classes;TypeTSingleExtendedArray =array of extended;TDoubleExtendedArray=array of array of