41478916
New Uniform Colour Spaces
13451366
Comparing Different Colour Discrimination Data Sets
42138946
An Evaluation of Colour Models' Performance Using Image Compression Algorithms
2266681
Thermal Medical Image Retrieval by Moment Invariants
Thermal medical imaging provides a valuable method for detecting various diseases such as breast cancer or Raynaud’s syndrome. While previous efforts on the automated processing on thermal infrared images were designed for and hence constrained to a certain type of disease we apply the concept of content-based image retrieval (CBIR) as a more generic approach to the problem. CBIR allows the retrieval of similar images based on features extracted directly from image data. Image retrieval for a thermal image that shows symptoms of a certain disease will provide visually similar cases which usually also represent similarities in medical terms. The image features we investigate in this study are a set of combinations of geometric image moments which are invariant to translation, scale, rotation and contrast.
36453049
Parallel Models and Job Characterization for System Scheduling
In this work, we study job characterization in multi-programmed multiprocessor system by taking into consideration the parallel job models. We first introduce an example to illustrate the issues involved. Then we focus on two popular system scheduling policies: round-robin for single processor systems, and equi-partition for multiprocessor systems. We analytically study effect of job parallelization on the overall performance of the system, and also present simulation results. Through these studies, we discuss scheduling policies of parallel jobs in relation to the ratio of number of jobs and the number of processors in the multiprocessor system, and propose new paradigm for parallel algorithm designs.
1511154
Association-based similarity testing and its applications
This paper proposes a new similarity measure between basket datasets based on associations. The new measure is calculated from support counts using a formula inspired by information entropy. Experiments on both real and synthetic datasets show the effectiveness of the measure. This paper then investigates the applications of the similarity measure. It first studies the problem of finding a mapping between categorical database attribute sets using similarity measures. A generic approach for identifying such a mapping is proposed. The approach is implemented based on the similarity measure proposed in the paper and its performance has been evaluated and validated. Moreover, this paper also explores the applications of using the similarity measure to mine distributed datasets.
253853
Bayesian reconstruction of 3D shapes and scenes from a single image
It is common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts "filled-in" by prior visual knowledge. We represent prior knowledge of 3D shapes and scenes by probabilistic models at two levels - both are defined on graphs. The first level model is built on a graph representation for single objects, and it is a mixture model for both man-made block objects such as trees and grasses. It assumes surface and boundary smoothness, 3D angle symmetry etc. The second level model is built on the relation graph of all objects in a scene. It assumes that objects should be supported for maximum stability with global bounding surfaces, such as ground, sky and walls. Given an input image, we extract the geometry and photometric structures through image segmentation and sketching, and represent them in a big graph. Then we partition the graph into subgraphs each being an object, infer the 3D shape and recover occluded surfaces, edges and vertices in each subgraph, and infer the scene structures between the recovered 3D sub-graphs. The inference algorithm samples from the prior model under the constraint that it reproduces the observed image/sketch under projective geometry.
239739
A new distributed data mining model based on similarity
Distributed Data Mining (DDM) has been very active and enjoying a growing amount attention since its inception. Current DDM techniques regard the distributed data sets as a single virtual table and assume there exists a global model which could be generated if the data were combined/centralized. This paper proposes a similarity-based distributed data mining(SBDDM) framework which explicitly take the differences among distributed sources into consideration. A new similarity measure is introduced and its effectiveness is then evaluated and validated. This paper also illustrates the limitations of current DDM techniques through three concrete case studies. Finally distributed clustering within the SBDDM framework is also discussed.
654543
A survey on wavelet applications in data mining
Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.