We introduce an image segmentation algorithm, called normalGCsummax, which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that normalGCsummax preserves robustness of RFC with respect to the seed choice (thus, avoiding “shrinking problem” of GC), while keeping GC’s stronger control over the problem of “leaking though poorly defined boundary segments.” The analysis of normalGCsummax is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of normalGCsummax we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in normalGCsummax running in a time close to linear. Experimental comparison of normalGCsummax to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of normalGCsummax over these other methods, resulting in a rank ordering of normalGCsummax>normalPnormalW~normalInormalRnormalFnormalC>normalGnormalC.