41461201
Edge Detection Models
In this paper, the Mumford-Shah (MS) model and its variations are studied for image segmentation. It is found that using the piecewise constant approximation, we cannot detect edges with low contrast. Therefore other terms, such as gradient and Laplacian, are included in the models. To simplify the problem, the gradient of the original image is used in the Rudin-Osher-Fatemi (ROF) like model. It is found that this approximation is better than the piecewise constant approximation for some images since it can detect the low contrast edges of objects. Linear approximation is also used for both MS and ROF like models. It is found that the linear approximation results are comparable with the results of the models using gradient and Laplacian terms.
36931032
A Roof Edge Detection Model
We have generalized the Mumford-Shah model to obtain a new model capable of detecting roof edges. In this new model, we have assumed a piecewise planar surface for each bounded region. We have also shown that this new model is less dependent on the scale parameter ν than the original Mumford-Shah model. We have proved that the gradient projection method can produce the minimal energy. The validity of the new model is demonstrated by experimental results.
5432165
Newimage segmentation models
21818900
Trunk Reservation in Multi-service Networks with BPP Traffic
In this paper we develop approximate models for trunk reservation in multi-service systems with BPP (Binomial-Poisson-Pascal) multi-rate traffic streams. The approximation is a generalization of previous work by Tran-Gia & Hubner who assumed Poisson arrival processes. It is based on a generalized algorithm which allows for calculation of individual performance measures for each service, in particular the traffic congestion. The algorithm is numerically robust and requires a minimum of computer memory and computing time. The approximation is good when the services have equal mean service times.
18316669
On Linear-Spline Based Histograms
Approximation is a very effective paradigm to speed up query processing in large databases. One popular approximation mechanism is data size reduction. There are three reduction techniques: sampling, histograms, and wavelets. Histogram techniques are supported by many commercial database systems, and have been shown very effective for approximately processing aggregation queries. In this paper, we will investigate the optimal models for building histograms based on linear spline techniques. We will firstly propose several novel models. Secondly, we will present efficient algorithms to achieve these proposed optimal models. Our experiment results showed that our new techniques can greatly improve the approximation accuracy comparing to the existing techniques.
5129992
Content-Based Image Retrieval Using Multiple-Instance Learning
We explore the application of machine learning techniques to the problem of content-based image retrieval (CBIR). Unlike most existing CBIR systems in which only global information is used or in which a user must explicitly indicate what part of the image is of interest, we apply the multiple-instance (MI) learning model to use a small number of training images to learn what images from the database are of interest to the user.
27590229
Spectral histogram representations for visual modeling
We present spectral histogram representations for visual modeling. Based on a generative process, the representation is derived by partitioning the frequency domain into small disjoint regions and assuming independence among the regions. This gives rise to a set of filters and a representation consisting of marginal distributions of those filter responses. A distinct advantage of our representation is that it can be effectively used for different classification and recognition tasks, which is demonstrated by experiments and comparisons in texture classification, face recognition, and appearance-based 3D object recognition. The marked improvement over existing methods justifies our principle that effective priori knowledge should be derived from physical generative processes.
25468199
Edge vulnerability parameters of split graphs
Abstract A graph is called a split graph if its vertex set can be partitioned into a clique and an independent set. In this work, we investigate three vulnerability parameters of split graphs when edges are removed, i.e., edge-connectivity, edge-toughness and edge-integrity. It is proved that, for a noncomplete connected split graph G , its edge-connectivity is δ ( G ) , and its edge-toughness is min { δ ( G ) , | E ( G ) | | V ( G ) | − 1 } , where δ ( G ) , V ( G ) and E ( G ) , are the minimum degree, the vertex set and the edge set of G , respectively. Furthermore, we show that the edge-integrity of a noncomplete connected split graph equals its order when its minimum degree is greater than half of the size of its largest clique.