9910171
Semantics and CBIR: a medical imaging perspective
Medical CBIR (content-based image retrieval) applications pose unique challenges but at the same time offer many new opportunities. On one hand, while one can easily understand news or sports videos, a medical image is often completely incomprehensible to untrained eyes. On the other hand, semantics in the medical domain is much better defined and there is a vast accumulation of formal knowledge representations that could be exploited to support semantic search for any specialty areas in medicine.
 In this paper, however, we will not dwell on any one particular specialty area, but rather address the question of how to support scalable semantic search across the whole of medical CBIR field: what are the advantages to take and gaps to fill, what are the key enabling technologies, and the critical success factor from an industrial point of view.
 In terms of enabling technologies, we discuss three aspects: 1. anatomical, disease, and contextual semantics, and their representations using ontologies; 2. scalable image analysis and tagging algorithms; and 3. ontological reasoning and its role in guiding and improving image analysis and retrieval.
 More specifically, for ontological representation of medical imaging semantics, we discuss the potential use of FMA, RadLex, ICD, and AIM. For scalable image analysis we present a learning-based anatomy detection and segmentation framework using distribution-free priors. It is easily adaptable to different anatomies and different imaging modalities.
5988621
Motion estimation using ordinal measures
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.
8269092
Color and texture fusion: application to aerial image segmentation and GIS updating
Abstract This paper describes a new 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.
5097328
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours
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. >
11252982
Segmentation of range images as the search for geometric parametric models
Segmentation of range images has long been considered in computer vision as an important but extremely difficult problem. In this paper we present a new paradigm for the segmentation of range images into piecewise continuous surfaces. Data aggregation is performed via model recovery in terms of variable-order bi-variate polynomials using iterative regression. Model recovery is initiated independently in regularly placed seed regions in the image. All the recovered models are potential candidates for the final description of the data. Selection of the models is defined as a quadratic Boolean problem, and the solution is sought by the WTA (winner-takes-all) technique, which turns out to be a good compromise between the speed of computation and the accuracy of the solution. The overall efficiency of the method is achieved by combining model recovery and model selection in an iterative way. Partial recovery of the models is followed by the selection (optimization) procedure and only the “best” models are allowed to develop further.The major novelty of the approach lies in an effective combination of simple component algorithms, which stands in contrast to methods which attempt to solve the problem in a single processing step using sophisticated means. We present the results on several real range images.
5230577
A cooperative framework for segmentation using 2D active contours and 3D hybrid models as applied to branching cylindrical structures
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.
5555268
User Heterogeneity and its Impact on Electronic Auction Market Design: An Empirical Exploration1Research Essays
While traditional information systems research emphasizes understanding of end users from perspectives such as cognitive fit and technology acceptance, it fails to consider the economic dimensions of their interactions with a system. When viewed as economic agents who participate in electronic markets, it is easy to see that users' preferences, behaviors, personalities, and ultimately their economic welfare are intricately linked to the design of information systems. We use a data-driven, inductive approach to develop a taxonomy of bidding behavior in online auctions. Our analysis indicates significant heterogeneity exists in the user base of these representative electronic markets. Using online auction data from 1999 and 2000, we find a stable taxonomy of bidder behavior containing five types of bidding strategies. Bidders pursue different bidding strategies that, in aggregate, realize different winning likelihoods and consumer surplus. We find that technological evolution has an impact on bidders' strategies. We demonstrate how the taxonomy of bidder behavior can be used to enhance the design of some types of information systems. These enhancements include developing user-centric bidding agents, inferring bidders' underlying valuations to facilitate real-time auction calibration, and creating low-risk computational platforms for decision making.
2140816
Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
Many auctions involve selling several distinct items simultaneously, where bidders can bid on the whole or any part of the lot. Such auctions are referred to as combinatorial auctions. Examples of such auctions include truck delivery routes, industrial procurement, and FCC spectrum. Determining winners in such auctions is an NP-hard problem, and significant research is being conducted in this area. However, multiple-round (iterative) combinatorial auctions present significant challenges in bid formulations as well. Because the combinatorial dynamics in iterative auctions can make a given bid part of a winning and nonwinning set of bids without any changes in the bid, bidders are usually not able to evaluate whether they should revise their bid at a given point in time or not. Therefore, in this paper we address various computational problems that are relevant from the bidder's perspective. In particular, we introduce two bid evaluation metrics that can be used by bidders to determine whether any given bid can be a part of the winning allocation and explore their theoretical properties. Based on these metrics, we also develop efficient data structures and algorithms that provide comprehensive information about the current state of the auction atany time, which can help bidders in evaluating their bids and bidding strategies. Our approach uses exponential memory storage but provides fast incremental update for new bids, thereby facilitating bidder support for real-time iterative combinatorial auctions.
1351731
Research issues in real-time DBMS in the context of electronic commerce
In future, information products in electronic commerce setting will be subjected to the sazae quality/service standards found in traditional industries. Furthermore, each user views quality such as on-time delivery, correctness, and completeness differently and values information differently. In order to recognize customized requirements, real-time databases are required in electronic commerce. Since an economic paradigm is implicit in electronic commerce, we need to integrate economic issues into managing real-time databases. An appropriate priority pricing mechanism can potentially increase collective benefits and simplify database functions such as deadline assignment, admission control, scheduling, buffer management, and data management. We discuss these emerging issues and provide an information services
6504247
Hardware Diagnosis as Program Debugging
Horn clauses provide a useful framework for writing executable structural representations for digital circuits. This paper discusses how these representations can be used to diagnose faulty circuits using algorithmic program debugging techniques developed by Shapiro. The sound theoretical basis of these techniques is one of the major advantages of this approach. This framework also provides a new perspective on some of the hardware diagnosis techniques suggested in the literature.
18542805
IT infrastructure in emerging markets: arguing for an end-to-end perspective
To help sustain large-scale pervasive computing in emerging markets, researchers must address unique challenges in the delivery fabric and enterprise backbone. Such challenges present opportunities for high impact innovation. Although most research organizations have focused on developing consumer-facing solutions, we posit that future research must take an end-to-end perspective. That is, researchers must not only consider the front end (such as consumer devices) but also the medium to reach the consumer (for example, the delivery fabric) and the back end (for example, the enterprise backbone) to create an economically sustainable, scalable solution. Although our end-to-end perspective generalizes to all emerging markets, in this article, we mainly discuss the Indian market from which we based our observations.