17940272
Segmentation versus object representation—are they separable?
When vision is used for moving through the environment, for manipulating or for recognizing objects, it has to simplify the visual input to the level that is required for the specific task. To simplify means to partition images into entities that correspond to individual regions, objects and parts in the real world and to describe those entities only in detail sufficient for performing a required task. For visual discrimination, shape is probably the most important property. After all, line drawings of scenes and objects are usually sufficient for description and subsequent recognition. In computer vision literature this partitioning of images and description of individual parts is called segmentation and shape representation. Segmentation and shape representation appear to be distinct problems and are treated as such in most computer vision systems. In this paper we try to disperse this notion and show that there is no clear division between segmentation and shape representation. Solving any one of those two problems separately is very difficult. On the other hand, if any one of the two problems is solved first, the other one becomes much easier. For example, if the image is correctly divided into parts, the subsequent shape description of those parts gets easier. The opposite is also true when the shapes of parts are known, the partitioning of the image gets simpler.
38069956
Introduction to the Special Issue on Innovative Applications of Computer Vision
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.
14869645
Multi-modality model-based registration in the cardiac domain
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.
14750394
Global models with parametric offsets as applied to cardiac motion recovery
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.
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. >
321445
Detection of Masquerade Attacks on Wireless Sensor Networks
We propose two lightweight techniques to detect masquerade attacks on wireless sensor networks (WSN). Our solutions take into consideration, important WSN properties like coverage, connectivity, data aggregation and specific communication patterns. The two proposed techniques complement each other when used concurrently. The mutual guarding (MG) technique does not work when nodes are not completely covered by their neighbors or when adversary has shorter transmission range than the sensor nodes. It also does not protect nodes near the boundary. The SRP technique does not have these drawbacks. In this paper, we present our proposed techniques and analyze their performance in terms of successful masquerade detection rate and traffic and computational overhead.
13648929
Database design in the modern organization - identifying robust structures under changing query patterns and arrival rate conditions
We summarize the problem tackled here in the following way: Given a modern database application environment, how can we identify and select the database structure that provides robust performance across changing query patterns and arrival rate conditions? We demonstrate the importance of investigating the underlying relationships and then utilize this information in formulating robust structures. Our work is pre-theory in the philosophy of science sense. That is, the careful identification and observation of relationships will subsequently be utilized in formulating a testable theory of the development of robust database structures under dynamic query patterns and arrival rates. Our first step in providing a database design or "structure selection" method is to determine potential good performers among different database structures. These potential good performers are selected and analyzed across arrays of query patterns. The next step is to identify database structures that are robust structures, that is good performers across the different types of query patterns and arrival rate levels. The presentation includes illustrations of the determination of actual query pattern processing times and the use of these times within a queuing analysis. In fact, for the database layout analyzed, application of our methods demonstrates the existence of such robust database structures.
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.
2100365
Simulating online Yankee auctions to optimize sellers revenue
The online Yankee auction sells multiple units of the same good to multiple buyers using an ascending and open auction mechanism. One of the important controllable factors of the Yankee auction is the minimum bid increment specified at the beginning of an auction. Bidders can bid only in the multiples of this bid increment even if they are willing to bid higher than the minimum required bid. This paper presents a simulation approach to optimize sellers' revenue, which is based on theoretical properties of Yankee auctions and utilizes data from real auctions to replicate a given auction. The simulation model can be configured to change the value of bid increment and explore whether a given auction used the optimal bid increment. Our analysis indicates that the auctioneers are, most of the time, far away from optimal choice of bid increment, resulting in substantial losses in a market with already tight margins.
6426062
Understanding Patterns of Technology Evolution: An Ecosystem Perspective
Understanding the dynamics of technology evolution — whether for the purposes of forecasting new product or technology infrastructure developments, or identifying the basis for future digital convergence in the global market— is a key challenge for innovators, senior managers, and policymakers. This research provides an overview of a new ecosystem model of technology evolution, the purpose of which is to structure these kinds of assessments and suggest reusable analysis structures to ensure that total environment of technological innovation is considered. We use examples from the end-user computing context and the electronics industry to identify five patterns of technology evolution that commonly occur. We also develop a state diagram-based approach to demonstrate the cyclical nature of technology evolution. Finally, we illustrate our findings using a case study on digital music technologies.