• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.495-503
• /
• 2007

Symmetric interpolating refinable function vectors with compact support are of interest in several applications such as signal processing, image processing and computer graphics. It is known in [13] that orthogonal interpolating refinable function vectors can not be symmetric for multiplicity r = 2 and dilation d = 2. In this paper, we shall investigate symmetric interpolating refinable function vectors with compact support for multiplicity r = 2 and dilation d = 2 by omitting orthogonality. To illustrate our theorems and results in this paper, we shall also present some examples of symmetric interpolating refinable function vectors with compact support and high order of sum rules.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.163-166
• /
• 2004

In this paper, we consider the embedding problem of postorder Fibonacci circulants. We show that Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulants. And the postorder Fibonacci circulants of order n can be embedded into the Fibonacci cubes of order n with expansion 1, dilation n-2 and congestion O (n-1), the Hypercube of order n-2 with expansion $\frac{f_n}{2^{n-2}}$, dilation n-2 and congestion O(n-2).

• Proceedings of the Korean Society of Veterinary Clinics Conference
• /
• 2009.10a
• /
• pp.205-205
• /
• 2009

• The Journal of Korean Association of Computer Education
• /
• v.17 no.2
• /
• pp.115-124
• /
• 2014

Hypercube and star graph are widely known as interconnection network. The embedding of an interconnection network is a mapping of a network G into other network H. The possibility of embedding interconnection network G into H with a low cost, has an advantage of efficient algorithms usage in network H, which was developed in network G. In this paper, we provide an embedding algorithm between HCN and HON. HCN(n,n) can be embedded into HON($C_{n+1},C_{n+1}$) with dilation 3 and HON($C_d,C_d$) can be embedded into HCN(2d-1,2d-1) with dilation O(d). Also, star graph can be embedded to half pancake's value of dilation 11, expansion 1, and average dilation 8. Thus, the result means that various algorithms designed for HCN and Star graph can be efficiently executed on HON and half pancake, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1095-1106
• /
• 1994

This paper presents a method for determining optimal grayscale function processing(FP) morphological filters under the least square (LMS) error criterion. The optimal erosion and dilation filters with a grayscale structuring element(GSE) are determined by minimizing the mean square error (MSE) between the desired signal and the filter output. It is shown that convergence of the erosion and dilation filters can be achieved by a proper choice of the step size parameter of the LMS algorithm. In an attempt to determine optimal closing and opening filters, a matrix representation of both opening and closing with a basis matrix is proposed. With this representation, opening and closing are accomplished by a local matrix operation rather than cascade operations. The LMS and back-propagation algorithm are utilzed for obtaining the optimal basis matrix for closing and opening. Some results of optimal morphological filters applied to 2-D images are presented.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.91-102
• /
• 2010

Star graph is a well-known interconnection network to further improve the network cost of Hypercube and has good properties such as node symmetry, maximal fault tolerance and strongly hierarchical property. In this study, we will suggest embedding scheme among star graph and pancake graph, bubblesort graph, which are variations of star graph. We will show that bubblesort graph can be embedded into pancake and star graph with dilation 3, expansion 1, respectively and pancake graph can be embedded into bubblesort graph with dilation cost O($n^2$). Additionally, we will show that star graph can be embedded into pancake graph with dilation 4, expansion 1. Also, with dilation cost O(n) we will prove that star graph can be embedded into bubblesort graph and pancake graph can be embedded into star graph.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.1
• /
• pp.37-48
• /
• 2000

In this paper, we propose a new connected operator Using morphological grayscale reconstruction for region-based coding First, an effective method of reference-image creation lis proposed, which is based on the Size as well as the contrast. This improves the performance of simplification, because It preserves perceptually important components and removes unnecessary components The conventional connected operators are good for removing small regions, but have a serious drawback for low-contrast regions that are larger than the structuring element. That is, when the conventional connected operators are applied to tills region, the simplification becomes less effective or several meaningful regions are merged to one region to avoid this, the conventional geodesic dilation is modified to propose an adaptive operator to reduce the effect of inappropriate propagation, pixels reconstructed to the original values are excluded m the dilation operation Experimental results have shown that the proposed algorithm achieves better performance In terms of the reconstruction of flat zones. The Picture quality has also been improved by about 7dB, compared to the conventional methods.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.333-340
• /
• 2002

Embedding is a mapping an interconnection network G to another interconnection network H. If a network G can be embedded to another network H, algorithms developed on G can be simulated on H. In this paper, we first propose a method to embed between Hierarchical Cubic Network HCN(n, n) and Hierarchical Folded-hypercube Network HFN(n, n). HCN(n, n) and HFN(n, n) are graph topologies having desirable properties of hypercube while improving the network cost, defined as degree${\times}$diameter, of Hypercube. We prove that HCN(n, n) can be embedded into HFN(n, n) with dilation 3 and congestion 2, and the average dilation is less than 2. HFN(n, n) can be embedded into HCN(n, n) with dilation 0 (n), but the average dilation is less than 2. Finally, we analyze the fault tolerance of HCN(n, n) and prove that HCN(n, n) is maximally fault tolerant.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.633-638
• /
• 2005

The extraction of a face is a very important part for human interface, biometrics and security. In this paper, we applies DCM(Dilation of Color and Motion) filter and Active Contour Models to extract facial outline. First, DCM filter is made by applying morphology dilation to the combination of facial color image and differential image applied by dilation previously. This filter is used to remove complex background and to detect facial outline. Because Active Contour Models receive a large effect according to initial curves, we calculate rotational degree using geometric ratio of face, eyes and mouth. We use edgeness and intensity as an image energy, in order to extract outline in the area of weak edge. We acquire various head-pose images with both eyes from five persons in inner space with complex background. As an experimental result with total 125 images gathered by 25 per person, it shows that average extraction rate of facial outline is 98.1% and average processing time is 0.2sec.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1173-1183
• /
• 2006

Matrix-star, Pancake, and RFM graphs have such a good property of Star graph and a lower network cost than Hypercube. Matrix-star graph has Star graph as a basic module and the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. Also it is an interconnection network that improves the network cost against Star graph. In this paper, we propose a method to embed among Matrix-star Pancake, and RFM graphs using the edge definition of graphs. We prove that Matrix-star $MS_{2,n}$ can be embedded into Pancake $P_{2n}$ with dilation 4, expansion 1, and $RFM_{n}$ graphs can be embedded into Pancake $P_{n}$ with dilation 2. Also, we show that Matrix-star $MS_{2,n}$ can be embedded into the $RFM_{2n}$ with average dilation 3.