We investigate the effects of adding procurement information (component offer prices) to a sales-based economic regime model, which is used for strategic, tactical, and operational decision making in dynamic supply chains. The performance of the regime model is evaluated through experiments with the MinneTAC trading agent, which competes in the TAC SCM game. We find that the new regime model has a similar overall predictive performance as the existing model. Regime switches are predicted more accurately, whereas the prediction accuracy of dominant regimes is slightly worse. However, by adding procurement information, we have enriched the model and we have further opportunities for applications in the procurement market, such as procurement reserve pricing.

In today's complex supply chains, product pricing is a vital, yet non-trivial task. We propose a product pricing approach using adaptive real-time probability of acceptance estimations based on economic regimes. Radial Basis Function Networks are trained to estimate parameters for double-bounded log-logistic distributions assumed to be underlying daily offer prices, using information available real-time. The relation between data and parameters is dynamically modeled using economic regimes (characterizing market conditions) and error terms (accounting for customer feedback). Given the parametric approximations of price distributions, acceptance probabilities are estimated using a closed-form mathematical expression, which is used to determine the price yielding a desired quota. The approach is implemented in the MinneTAC agent and tested against a price-following product pricing method in the TAC SCM game. Performance significantly improves; more customer orders are obtained against higher prices and profits more than double.

We develop a real-time estimation approach to predict bidders' maximum willingness to pay in a multiunit ascending uniform-price and discriminatory-price (Yankee) online auction. Our two-stage approach begins with a bidder classification step, which is followed by an analytical prediction model. The classification model identifies bidders as either adopting a myopic best-response (MBR) bidding strategy or a non-MBR strategy. We then use a generalized bid-inversion function to estimate the willingness to pay for MBR bidders. We empirically validate our two-stage approach using data from two popular online auction sites. Our joint classification-and-prediction approach outperforms two other naïve prediction strategies that draw random valuations between a bidder's current bid and the known market upper bound. Our prediction results indicate that, on average, our estimates are within 2% of bidders' revealed willingness to pay for Yankee and uniform-price multiunit auctions. We discuss how our results can facilitate mechanism-design changes such as dynamic-bid increments and dynamic buy-it-now prices.

We present a semi-parametric model that describes pricing behaviors in a market environment, and we show how that model can be used to guide resource allocation and pricing decisions in an autonomous trading agent. We validate our model by presenting experimental results obtained in the Trading Agent Competition for Supply Chain Management.

The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such strategies require the a priori knowledge to be explicitly defined in the optimization criterion, e.g., "high-gradient border", "smoothness"', or "similar intensity or texture". This approach is limited by the validity of underlying assumptions and cannot capture complex structure appearance. This paper introduces database-guided segmentation as a new data-driven paradigm that directly exploits expert annotation of interest structures in large medical databases. Segmentation is formulated as a two-step learning problem. The first step is structure detection where we learn how to discriminate between the object of interest and background. The resulting classifier based on a boosted cascade of simple features also provides a global rigid transformation of the structure. The second step is shape inference where we use a sample-based representation of the joint distribution of appearance and shape annotations. To learn the association between the complex appearance and shape we propose a feature selection mechanism and the corresponding metric. We show that the selected features are better than using directly the appearance and illustrate the performance of the proposed method on a large set of ultrasound heart images.

Abstract-Existing methods for incorporating subspace model constraints in shape tracking use only partial information from the measurements and model distribution. We propose a unified framework for robust shape tracking, optimally fusing heteroscedastic uncertainties or noise from measurement, system dynamics, and a subspace model. The resulting nonorthogonal subspace projection and fusion are natural extensions of the traditional model constraint using orthogonal projection. We present two motion measurement algorithms and introduce alternative solutions for measurement uncertainty estimation. We build shape models offline from training data and exploit information from the ground truth initialization online through a strong model adaptation. Our framework is applied for tracking in echocardiograms where the motion estimation errors are heteroscedastic in nature, each heart has a distinct shape, and the relative motions of epicardial and endocardial borders reveal crucial diagnostic features. The proposed method significantly outperforms the existing shape-space-constrained tracking algorithm. Due to the complete treatment of heteroscedastic uncertainties, the strong model adaptation, and the coupled tracking of double-contours, robust performance is observed even on the most challenging cases.

Recent advances in CT technology have made possible the acquisition of high resolution images of the heart in which important anatomical features such as the coronary vessels are visible. The state of the art in MR Imaging techniques, on the other hand, typically provides lower resolution but can facilitate the differentiation of viable (healthy) cardiac tissue from infarcted (injured) tissue. The registration of CT and MR images of the same heart permit the association of anatomy with function. As an example, given an infarcted region, the coronary vessels responsible for irrigating that region may be isolated and targeted for treatment (e.g., coronary bypass). We demonstrate a software package, PROTEUS, which is capable of registering CT and MR images. Since the manifestation of cardiac tissue in the two modalities differs so greatly we rely on features to perform the matching. Specifically, we employ a model-based approach that relies on segmented contours delineating the inner and outer borders of the left ventricle (LV). Given these contours, our technique is completely automatic.

We propose a novel solution to the problem of motion compensation of coronary angiographs. As the heart is beating, it is difficult for the physician to observe closely a particular point (e.g. stenosis) on the artery tree. We propose, to rigidly compensate the sequence so that the area around the point of interest appears stable. This is a difficult problem because the arteries deform in a non-rigid manner and only their 2D X-ray projection is observed. Also, the lack of features around the selected point makes the matching subject to the aperture problem. The algorithm automatically extracts a section of the artery of interest, models it as a polyline, and tracks it. The problem is formulated as an energy minimization problem which is solved using a shortest path in a graph algorithm. The motion compensated sequence can be obtained by translating every pixel so that the point of interest remains stable. We have applied this algorithm to many examples in two sets of angiography data and have obtained excellent results.

Hybrid models are powerful tools for recovery in that they simultaneously provide a gross parametric as well as a detailed description of an object. However, it is difficult to directly employ hybrid models in the segmentation process since they are not guaranteed to locate the optimal boundaries in cross-sectional slices. Propagating 2D active contours from slice to slice, on the other hand, to delineate an object's boundaries is often effective, but may run into problems when the object's topology changes, such as at bifurcations or even in areas of high curvature. Here, we present a cooperative framework to exploit the positive aspects of both 3D hybrid model and 2D active contour approaches for segmentation and recovery. In this framework the user-defined parametric component of a 3D hybrid model provides constraints for a set of 2D segmentations performed by active contours. The same hybrid model is then fit both parametrically and locally to this segmentation. For the hybrid model fit we employ several new variations on the physically-motivated paradigm which seek to speed recovery while guaranteeing stability. A by-product of these variations is an increased generality of the method via the elimination, of some of its ad hoc parameters. We apply our cooperative framework to the recovery of branching cylindrical structures from 3D image volumes. The hybrid model we employ has a novel parametric component which is a fusion of individual cylinders. These cylinders have spines that are arbitrary space curves and cross-sections which may be any star shaped planar curve.

We present a method for motion estimation using ordinal measures. Ordinal measures are based on relative ordering of intensity values in an image region called rank permutation. While popular measures like the sum-of-squared-difference (SSD) and normalized correlation (NCC) rely on linearity between corresponding intensity values, ordinal measures only require them to be monotonically related so that rank permutations between corresponding regions are presented. This property turns out to be useful for motion estimation in tagged magnetic resonance images. We study the imaging equation involved in two methods of tagging and observe temporal monotonicity in intensity under certain conditions though the tags themselves fade. We compare our method to SSD and NCC in a rotating ring phantom image sequence. We present an experiment on a real heart image sequence which suggests the suitability of our method.

We present a new algorithm for the automatic recovery of tag grid-line intersections in Tagged MR images of the left ventricle of the heart. Our method uses an active spring mesh to capture local properties of the motion and a global motion model to capture the global coherence of the motion. We recover the global component of the motion using robust estimation. Different motion models have been developed for short and long axis views of the heart. The algorithm has been tested on healthy and pathological data.

We introduce a new solid shape model formulation that includes built-in offsets from a base global component (e.g. an ellipsoid) which are functions of the global component's parameters. The offsets provide two features. First, they help to form an expected model shape which facilitates appropriate model data correspondences. Second, they scale with the base global model to maintain the expected shape even in the presence of large global deformations. We apply this model formulation to the recovery of 3-D cardiac motion from a volunteer dataset of tagged-MR images. The model instance is a variation of the hybrid volumetric ventriculoid (HVV), a deformable thick-walled ellipsoid model resembling the left ventricle (LV) of the heart. A unique aspect of of implementation is the employment of constant volume constraints when recovering the cardiac motion. In addition, we present a novel geodesic-like prismoidal tessellation of the model which provides for more stable fits.

The paper describes an algorithm for combining color and texture information for the segmentation of color images. The algorithm uses maximum likelihood classification combined with a certainty based fusion criterion. The algorithm was validated using mosaics of real color textures. It was also tested on real outdoor color scenes and aerial images. This algorithm is part of a more complex system which is currently being designed to assist an operator in updating an old map of an area using aerial images.

The problem of segmenting an image into separate regions and tracking them over time is one of the most significant problems in vision. Terzopoulos et al. (1987) proposed an approach to detect the contour regions of complex shapes, assuming a user selected initial contour not very far from the desired solution. We propose to further explore the information provided by the user's selected points and apply an optimal method to detect contours which allows a segmentation of the image. The method is based on dynamic programming (DP), and applies to a wide variety of shapes. It is exact and not iterative. We also consider a multiscale approach capable of speeding up the algorithm by a factor of 20, although at the expense of losing the guaranteed optimality characteristic. The problem of tracking and matching these contours is addressed. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. For matching, a novel strategy is proposed where the solution is a smooth displacement field in which unmatched regions are allowed while cross vectors are not. The algorithm is again based on DP and the optimal solution is guaranteed. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation and automatic tracking of the regions of interest in medical images.>

There is increasing interest in the recovery of generalized cylinders (GCs) with curved spines. However, existing formulations of such GCs, for example those based an the Frenet-Serret frame or the tube model, suffer serious drawbacks: discontinuities, a lack of expressive power, "narrowing" in the plane normal to the spine, non-intuitive twisting behavior, and/or off-axis nonorthogonality of their local coordinate systems. We discuss some of the problems associated with the non-orthogonality of the coordinate system based on the Frenet-Serret frame. This non-orthogonality is induced by torsion effects and we show how to correct for it. We then introduce a new model, the extruded GC (EGC) model, which overcomes all the problems mentioned above. For complex axes, the EGC model is also simpler to understand and use than existing models. The EGC model is further extended by including local surface deformations. Recovery of the deformable EGC via a physically-motivated paradigm is demonstrated on pre-segmented data from a human carotid artery.>

Periodic data is often most appropriately described with a periodic model. This allows for the subsumption of tracking into model fitting and a natural method for the interpolation of data over time. We present a deformable periodic generalized cylinder (DPGC) for simultaneously modeling and tracking closed contours which exhibit a repeating motion. Results of the recovery of the projection of a beating left ventricle (BLV) from segmented ultrasound data as well as the segmentation of a BLV cross section from series of MR image slices are presented.

Modeling nonrigid moving 3-D objects entails recovery of global motion, global shape, and local shape. The already difficult problem of tracking nonrigid local shape is made worse by the need for a model-data correspondence scheme to make tracking possible. Both problems are addressed. Various methods for establishing 3-D model-data correspondence are discussed, and a correspondence scheme for tessellated data is presented. A force-based method for nonrigid motion tracking is presented. The authors' method does not use complex finite element techniques but follows a residual force-based dynamic model for local deformation. Another novel feature is that the net forces are obtained by an adaptive force distribution scheme which ensures smooth and stable deformation. Results are presented of tracking simulated as well as real 3-D data of the inner wall of the heart ventricle from segmented magnetic resonance images.>

Presents an integrated framework for segmenting dense range data of complex 3-D scenes into surface (bi-quadrics) and volumetric (superquadrics) primitives, without a priori domain knowledge or stored models. Surface segmentation is performed by a novel local-to-global iterative regression approach of searching for the best piecewise description of the data in terms of biquadric models. Region adjacency information, surface discontinuities, and global shape properties are extracted and used to guide the volumetric segmentation. Superquadric models are recovered by a global-to-local residual-driven procedure, which recursively segments the scene to derive the part-structure. A set of acceptance criteria provide the objective evaluation of intermediate descriptions, and decide whether to terminate the procedure, or selectively refine the segmentation. The control module generates hypotheses about superquadric models at clusters of underestimated data and performs controlled extrapolation of part-models by shrinking the global model. The authors present results on real range images of scenes of varying complexity, including objects with occluding parts, and scenes where surface segmentation is not sufficient to guide the volumetric segmentation.>

A paradigm is presented for the segmentation of images into piecewise continuous patches. Data aggregation is performed via model recovery in terms of variable-order bivariate polynomials using iterative regression. All the recovered models are candidates for the final description of the data. Selection of the models is achieved through a maximization of the quadratic Boolean problem. The procedure can be adapted to prefer certain kinds of descriptions (one which describes more data points, or has smaller error, or has a lower order model). A fast optimization procedure for model selection is discussed. The approach combines model extraction and model selection in a dynamic way. Partial recovery of the models is followed by the optimization (selection) procedure where only the best models are allowed to develop further. The results are comparable with the results obtained when using the selection module only after all the models are fully recovered, while the computational complexity is significantly reduced. The procedure was tested on real range and intensity images. >