Browsing by Author "HSUEH, YC"

Now showing 1 - 13 of 13

A GENERALIZATION OF THE STABLE MATCHING PROBLEM
(1995-04-21)
TAN, JJM
;
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
It is known that there may not exist any stable matching for a given instance of the stable roommates problem. A stable partition is a structure that generalizes the notion of a stable matching; Tan (1991) proved that every instance of the stable roommates problem contains at least one such structure. In this paper we propose a new algorithm for finding a stable partition, and hence a new algorithm for finding a stable matching if one exists. Our algorithm processes the problem dynamically as long as certain relative preference orders are maintained. Some theoretical results about stable partitions are also presented.
A UNIFYING APPROACH TO THE STRUCTURES OF THE STABLE MATCHING PROBLEMS
(1991)
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
It is well-known that the structure of the set of stable marriages of a stable marriage instance can be represented as a finite distributive lattice and, conversely, every finite distributive lattice is a set of stable marriages for some stable marriage instance. Recently, Irving[12] and Gusfield [9] propose some representations of the set of all stable assignments for a given solvable instance of the stable roommates problem. In this paper, we will give a unifying approach to the structures of the stable marriage problem and the stable roommates problem. To achieve this purpose, we first study the duality in the structure of a stable marriage instance, then transform every stable roommates instance into a corresponding stable marriage instance and obtain the structure of the stable roommates instance directly from that of the corresponding stable marriage instance. The main results of this paper are: (1) There is a one-one correspondence between the set of stable marriages for a stable marriage instance and the set of feasible words of some Faigle geometry; (2) There is a one-one correspondence between the set of stable assignments for a stable roommates instance and the set of basic words of some Faigle geometry.
AN ADAPTIVE ENHANCEMENT ALGORITHM FOR QUANTIZED IMAGES
(1994-05-01)
CHU, CH
;
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
When high-quality images are displayed by low-level graphics devices, they must be re-quantized. Many quantization algorithms have been proposed to solve this problem. However, the fine details cannot manifest themselves in the quantized images by the general quantization-algorithms. In this paper, an adaptive technique is proposed to enhance the quantized images such that the fine features such as edges, thin lines, and curves are more visible. By tuning a threshold value, the desired patterns used to produce the visual impression of grayscale information at constant and small varying areas can be preserved and the high frequency information can made more visible.
EXTENDED LATTICE-ORDERED STRUCTURES FOR L-FUZZY SETS AND L-FUZZY NUMBERS
(1993-02-25)
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
An L-fuzzy set A is a mapping of a set X into another set L. The set L is called the true set of A and X is called the universe of A. It has been discussed that a better structure for the truth set L is a complete lattice-ordered monoid. Then operations on L can be directly extended to operate on L(X) and a complete lattice-ordered monoid can be obtained. In this paper, we consider operations on L(X) which are extended from operations on X by the extension principle. We will obtain a similar complete lattice-ordered monoid constituted by extended operations. Moreover, a notion of L-fuzzy numbers is proposed. Then, extended operations on L-fuzzy numbers are discussed and a distributively lattice-ordered structure is developed for L-fuzzy numbers.
FUZZY UNCERTAINTY TEXTURE SPECTRUM FOR TEXTURE ANALYSIS
(1995-06-08)
LEE, YG
;
LEE, JH
;
HSUEH, YC
;
交大名義發表
;
資訊工程學系
A new method using fuzzy uncertainty, which measures the uncertainty of the uniform surface in an image, is proposed for texture analysis. A grey-scale image can be transformed into a fuzzy image by the uncertainty definition. The distribution of the membership in a measured fuzzy image, denoted the fuzzy uncertainty texture spectrum (FUTS), is used as the texture feature for texture analysis.
GENETIC-BASED FUZZY HIT-OR-MISS TEXTURE SPECTRUM FOR TEXTURE ANALYSIS
(1995-11-09)
LEE, YG
;
LEE, JH
;
HSUEH, YC
;
交大名義發表
;
資訊工程學系
A new method using a fuzzy hit-or-miss transform recognition procedure, which measures degrees of fit of specified patterns within an image, is proposed for texture analysis. For a given texture, three optimal texture patterns (structuring elements) dynamically generated by genetic algorithms are used to inspect the degrees of fit by using the fuzzy hit-or-miss transform, respectively. The distribution of these degrees of fit, converted into a texture spectrum, is used as the texture feature for texture analysis.
IMAGE COMPRESSION BY CARDINALITY DISTRIBUTION
(1994-09-01)
CHU, CH
;
CHERN, MG
;
HSUEH, YC
;
資訊工程學系
;
Department of Computer Science
Cardinality distribution is an efficient technique to display images with different gray level systems. In this paper, we extend the application of cardinality distribution to image compression. Image is first quantized to an image with fewer gray levels. Because the cardinality-distributed images possess the desired dithering patterns, the quantized images have the more compact forms. In the decompression, gray level expansion by cardinality distribution is proposed to reconstruct the images. Therefore, cardinality distribution not only has the ability to quantize images with different gray levels but also has the potential to compress images.
IMAGE REQUANTIZATION BY CARDINALITY DISTRIBUTION
(1991)
HSUEH, YC
;
CHERN, MG
;
CHU, CH
;
交大名義發表
;
資訊工程學系
This article presents a new approach to image requantization, called cardinality distribution. The new method introduces dithering patterns as ordered dither does; however, it provides a smoothing parameter p between 0 and 1. When p is chosen to be near 0.5, the new method can capture very sharp details of images. Therefore, the major deficiency of ordered dither can be avoided. Moreover, the reordering technique and its modified version are used to code bilevel and higher gray-level requantized images, respectively.
MATHEMATICAL MORPHOLOGY ON L-IMAGES
(1992-02-01)
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
In most applications, morphological operations are considered as unary operations, each associated with a structuring element. Due to the problem of grey-level overflow, the associated structuring elements of morphological operations on grey-level images (functions from R(n) or Z(n) to [0, m], where m is a fixed positive number) are limited to 'flat' or 'non-flat' structuring elements. However, neither flat or non-flat structuring elements are grey-level images. In this paper, we propose the notion of l-images, based on a clc-monoid (complete lattice-ordered commutative monoid), as a unified representation of binary images (functions from R(n) or Z(n) to {0, 1}), signals (functions from R(n) or Z(n) to the set of extended real numbers R*) and grey-level images. Then we generalize morphological operations to l-images such that the associated structuring elements can be arbitrary l-images. As consequences, we obtain several concrete expressions for dilations and erosions on grey-level images such that the associated structuring elements are also grey-level images. Therefore, the grey-level overflow problem is solved with no limitations on structuring elements. Furthermore, we show that the duality property of dilations and erosions on l-images holds if the underlying clc-monoid is self-dual.
ON FUZZIFICATION OF MATROIDS
(1993-02-10)
HSUEH, YC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
;
Department of Computer Science
In this paper, we propose one possible fuzzification of matroids which entends the independence axioms of matroids from set systems to fuzzy set systems and preserves most basic properties of matroids. By representing a fuzzy subset of a finite set E as a subset of E x (0, 1], we obtain fuzzy matroids by fuzzifying independence spaces on E x (0, 1]. Alternatively, by representing fuzzy subsets of E as functions from E into [0, 1], we can obtain fuzzy matroids from polymatroids associated with 'real' rank functions. We also investigate the duality for fuzzy matroids.
QUANTIZATION-ERROR CURVE - A MEASURE OF SIMILARITY BETWEEN REQUANTISED IMAGES
(1994-03-31)
CHU, CH
;
HSUEH, YC
;
資訊工程學系
;
Department of Computer Science
A new similarity measure between a digital image and its quantised version is presented. By calculating the quantisation error on each of a sequence of subdomains, we can obtain a quantisation error curve as a similarity measure. This measure outperforms the commonly used measure for estimating the similarity between requantised images.
TEXTURE CLASSIFICATION METHOD USING MULTIPLE SPACE-FILLING CURVES
(1994-12-01)
LEE, JH
;
HSUEH, YC
;
資訊工程學系
;
Department of Computer Science
Texture analysis by using the Peano curve does not provide sufficient discriminatory power to classify natural textures. An improved method by simultaneously using several space filling curves to the texture analysis and classification is proposed.
TEXTURE CLASSIFICATION USING MORPHOLOGICAL GRADIENT TEXTURE SPECTRUM
(1994)
LEE, JH
;
HSUEH, YC
;
資訊工程學系
;
Department of Computer Science