The variational level set model for piecewise constant/smooth image segmentation on surfaces and the related dual methods are investigated in this paper.The implicit surface on which the image is defined is represented by zero level set of a static signed distance function,the spatial contour used to divide regions of image on the implicit surface is expressed by the intersection of another dynamic zero level set and implicit surface.The variational level set model for planar image segmentation has been extended to the one on implicit surface by means of intrinsic gradient and intrinsic divergence,which is transformed to a global convex minimization problem in this paper using a new binary label function and the concept of convex relaxation to void the effect of initialization of active contour on the result of segmentation.Finally,the dual methods for solving the global convex minimization problem is designed in this paper and some numerical experiments demonstrate the proposed method is superior to traditional method in computation efficiency.