zhang xu

 

Comments and Ratings by zhang		1 - 1 of 1
Updated	File	Comments	Rating
16 Sep 2009	B-spline Grid, Image and Point based Registration B-spline registration of two 2D / 3D images or corrsp. points, affine and with smooth b-spline grid. Author: Dirk-Jan Kroon	I'm currently working on this subject, can you point some related resource or important papers to me. Thank you!

Files Matching zhang's Watch List					View all 1 - 5 of 26
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
14 Sep 2011		Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices. Author: Matt J	vert2con, polyhedron, polytope, vertices, convex hull, convhull	28	15	5.0 5.0 | 7 ratings
01 Jul 2011		Solvers for Joint Sparse MMV Reconstruction Analysis and Synthesis Prior Algorithms for MMV Author: Angshul Majumdar	communications, demo, image processing, mathematics, optimization, signal processing	16	0
03 Jan 2011		Toolbox Sparse Optmization Optimization codes for sparsity related signal processing Author: Gabriel Peyre	compressed sensing, deconvolution, total variation, l1 minimization, time frequency, sparsity	115	9	4.25 4.2 | 9 ratings
23 Nov 2010		Toolbox Alpert Transform The Alpert transform is a multiwavelets transform based on orthogonal polynomials. Author: Gabriel Peyre	alpert, wavelets, multiwavelets, sphere	21	1	5.0 5.0 | 1 rating
15 Nov 2010		Non-circular Gears Generation A toolbox to generate a pair of non-circular gears. Author: Gabriel Peyre	gears, noncircular gears, numerical integration, dichotomy	9	0

Comments and Ratings Matching zhang's Watch List			1-5 of 28
Date	File	Comment by	Comments	Rating
14 Jan 2012	Toolbox Sparse Optmization Optimization codes for sparsity related signal processing	hunan	very good	Comment only
31 Oct 2011	Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices.	Matt J	@david: You need to tell me how I can reproduce the error.	Comment only
31 Oct 2011	Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices.	david	Hi Matt, I'll be very thankful if you helps me with this problem: When I applied your function i get the following error : "??? Maximum recursion limit of 500 reached. Use set(0,'RecursionLimit',N) to change the limit. Be aware that exceeding your available stack space can crash MATLAB and/or your computer." What i have to do in this case ?	Comment only
23 Sep 2011	Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices.	Matt J	Hi Sandro, I'm not having any such difficult in R2011a, so perhaps you need to upgrade. Here is the test that I ran, and no errors resulted >> [a,b,ae,be]=vert2lcon(eye(20)); >> V=lcon2vert(a,b,ae,be); >> norm(V'*V-eye(20)) ans = 5.7516e-015	Comment only
22 Sep 2011	Representing Polyhedral Convex Hulls by Vertices or (In)Equalities Express bounded polyhedron via equalities/inequalities or vertices.	Sandro	hi Matt, Do you have any exposure of how high the dim could be? I am testing something like x1+x2+...+xn=1, xi>=0, i=1,2,...n. I randomly generate some points within this region and also give the vertices like (0,0,0..,0), (1,0,0,..0), (0,1,0,...0)...to help checking. It looks like n=10 works, but n=20 is stuck due to qullmx function called by convexhulln. Is there any possible we can have function like qullmx but more powerful in the sense of dim and speed? Sandro	5