A decision function method for boundary detection

Interactive Segmentation with Intelligent Scissors

“…Among the global boundary based techniques, graph searching and dynamic programming are popular techniques used to find the globally "optimal" boundaries based on some local cost criteria [2,7,8,[20][21][22][23]. They formulate the boundary finding problem as a directed graph or cost functional to which an optimal solution is sought.…”

“…Chien and Fu [8] argue that Ballard and Sklansky's decision function is "too specifically designed for one type of application" and develop a more general "criterion" function which has both local (e.g., gradient) and global (e.g., curvature) components. They minimize the criterion function using a modified decision tree search and apply their technique to determine cardiac boundaries in chest X-rays.…”

Computer aided diagnosis in chest radiography

“…Most algorithms for the segmentation of lung fields fall in this category [198,269,270,65,4,6,7,32,82,84]. Techniques employed are (local) thresholding, region growing, edge detection, ridge detection, morphologi-RB PC PA / lateral evaluation remarks Toriwaki [233,232] × PA none describes a complete analysis system Harlow [102] × PA none Chien [37,38] × PA none only right lung, result used to detect abnormalities Hasegawa [103] × PA none Pietka [198] × PA none McNitt-Gray [179,178] × PA 16 Q uses 5 anatomical classes Duryea [65] × PA 802 Q Xu [269] × PA 1000 R outer rib cage only Xu [270] × PA 300 R diaphragm edges only Armato [7] × PA 600 R costophrenic angles only Armato [4] × lateral 200 Q Armato [6] × PA 600 R Carrascal [32] × both 65 RQ Vittitoe [250] × PA 99 Q Tsujii [235] × PA 71 Q Wilson, Brown [265,28] × PA none describes a complete analysis system Vittitoe [251] × PA 115 Q uses 6 anatomical classes Van Ginneken [82,84] (Chapter 3)…”

Intelligent scissors for image composition

“…The gradient direction is the unit vector defined by I x and I y . Letting D(p) be the unit vector perpendicular (rotated 90 degrees clockwise) to the gradient direction at point p (i.e., for D(p) = (I y (p), -I x (p))), the formulation of the gradient direction feature cost is (4) where are vector dot products and (5) is the bidirectional link or edge vector between pixels p and q. Links are either horizontal, vertical, or diagonal (relative to the position of q in p's neighborhood) and point such that the dot product of D(p) and L(p, q) is positive, as noted in (5).…”

“…Another class of image segmentation techniques use a graph searching formulation of DP (or similar concepts) to find globally optimal boundaries [2,4,10,11,14]. These techniques differ from snakes in that boundary points are generated in a stage-wise optimal cost fashion whereas snakes iteratively minimize an energy functional for all points on a contour in parallel (giving the appearance of wiggling).…”