28794181
JSEG Based Color Separation of Tongue Image in Traditional Chinese Medicine
The process of color separation of tongue image in traditional Chinese medicine (TCM) is decomposed into two steps: region partition and color classification. In the first step, a partition method based on JSEG is proposed to obtain homogenous regions in the tongue. In the second step, a priori template and some standard color patches are designed to assist the classification according to a priori knowledge from the TCM experts, where the nearest neighbour classifier is applied for color classification. The experimental results show that the proposed approach is greatly promising to computerized tongue diagnosis.
32026454
Color-texture image segmentation by integrating directional operators into JSEG method
We presented a new color-texture image segmentation method that combined directional operators and the JSEG (J measure based SEGmentation) algorithm. In particular, two major contributions were set forth in this paper. (1) The two measures defined in JSEG and HSEG (H measure based SEGmentation) were discussed respectively and then we found the over-segmentation problem of JSEG could be attributed partly to the absence of color discontinuity in the J measure. Moreover, we have also proven in essence the H measure is isotropic operators for edge detection in images. (2) A new measure was proposed by integrating directional operators into the J measure, on which our segmentation method was based. The new segmentation method took account of both textural homogeneity and color discontinuity in local regions. Performance improvement due to the proposed modification was demonstrated on a variety of real color images.
34251654
Near-Linear Time Approximation Algorithms for Curve Simplification
We consider the problem of approximating a polygonal curve P under a given error criterion by another polygonal curve P? whose vertices are a subset of the vertices of P. The goal is to minimize the number of vertices of P? while ensuring that the error between P? and P is below a certain threshold. We consider two fundamentally different error measures -- Hausdorff and Frechet error measures. For both error criteria, we present near-linear time approximation algorithms that, given a parameter ? > 0, compute a simplified polygonal curve P? whose error is less than ? and size at most the size of an optimal simplified polygonal curve with error ?/2. We consider monotone curves in the case of Hausdorff error measure and arbitrary curves for the Frechet error measure. We present experimental results demonstrating that our algorithms are simple and fast, and produce close to optimal simplifications in practice.
43216837
Bootstrapping Word Sense Disambiguation Using Dynamic Web Knowledge
18268847
Interactive model identification for nonholonomic cart pushed by a mobile manipulator
A model identification method for unknown environments has been developed. By the interactions between a mobile manipulator and the unknown object, a nonholonomic cart, sensory information has been collected to estimate the model parameters of the cart, which are used to control the cart. Since the raw data are contaminated by noise they can not be modeled statistically, a wavelet based least square method is proposed to estimate these parameters for the cart. The raw signal has been decomposed into a certain bandwidth to generate a series of new signals, which are used to estimate the parameters. The new signal, which has the minimal estimation residual in least square sense is adopted as the best estimation. The error convergence of the estimation approach is given. The experimental results indicate that the estimation accuracy can be significantly improved by the use of the proposed method.
17258193
Spatiotemporal video segmentation based on graphical models
This paper proposes a probabilistic framework for spatiotemporal segmentation of video sequences. Motion information, boundary information from intensity segmentation, and spatial connectivity of segmentation are unified in the video segmentation process by means of graphical models. A Bayesian network is presented to model interactions among the motion vector field, the intensity segmentation field, and the video segmentation field. The notion of the Markov random field is used to encourage the formation of continuous regions. Given consecutive frames, the conditional joint probability density of the three fields is maximized in an iterative way. To effectively utilize boundary information from the intensity segmentation, distance transformation is employed in local objective functions. Experimental results show that the method is robust and generates spatiotemporally coherent segmentation results. Moreover, the proposed video segmentation approach can be viewed as the compromise of previous motion based approaches and region merging approaches.
6612123
Automatic Misconfiguration Troubleshooting with PeerPressure
Technical support contributes 17% of the total cost of ownership of today's desktop PCs [25]. An important element of technical support is troubleshooting miscon-figured applications. Misconfiguration troubleshooting is particularly challenging, because configuration information is shared and altered by multiple applications. 
 
In this paper, we present a novel troubleshooting system: PeerPressure, which uses statistics from a set of sample machines to diagnose the root-cause misconfigurations on a sick machine. This is in contrast with methods that require manual identification on a healthy machine for diagnosing misconfigurations [30]. The elimination of this manual operation makes a significant step towards automated misconfiguration troubleshooting. 
 
In PeerPressure, we introduce a ranking metric for misconfiguration candidates. This metric is based on empirical Bayesian estimation. We have prototyped a PeerPressure troubleshooting system and used a database of 87 machine configuration snapshots to evaluate its performance. With 20 real-world troubleshooting cases, PeerPressure can effectively pinpoint the root-cause misconfigurations for 12 of these cases. For the remaining cases, PeerPressure significantly narrows down the number of root-cause candidates by three orders of magnitude.