• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.1
• /
• pp.1-8
• /
• 2015

In many image processing tasks, connected component labeling (CCL) is performed to extract regions of interest. CCL was usually done in a sequential fashion when image resolution was relatively low and there are small number of input channels. As image resolution gets higher up to HD or Full HD and as the number of input channels increases, sequential CCL is too time-consuming to be used in real time applications. To cope with this situation, parallel CCL framework was introduced where multiple cores are utilized simultaneously. Several parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZ-LE) method[1], modified 8 directional label selection (M8DLS) method[2], and HYBRID1 method[3]. Soh [3] showed that HYBRID1 outperforms NSZ-LE and M8DLS, and argued that HYBRID1 is by far the best. In this paper we propose an improved hybrid parallel CCL algorithm termed as HYBRID2 that hybridizes M8DLS with label backtracking (LB) and show that it runs around 20% faster than HYBRID1 for various kinds of images.

• Honam Mathematical Journal
• /
• v.43 no.1
• /
• pp.123-129
• /
• 2021

Two new concepts, namely, ��∗-connectedness and ��∗-component are introduced by using ideal in proximity spaces. A relation of ��∗-connectedness with different types of connectedness that are considered in literature before is studied. It is shown that ��∗-connectedness is a contractive property.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1891-1908
• /
• 2018

In this paper, we investigate the existence of an S-shaped connected component in the set of positive solutions of the Dirichlet problem of the one-dimension Minkowski-curvature equation $$\{\(\frac{u^{\prime}}{\sqrt{1-u^{{\prime}2}}}\)^{\prime}+{\lambda}a(x)f(u)=0,\;x{\in}(0,1),\\u(0)=u(1)=0$$, where ${\lambda}$ is a positive parameter, $f{\in}C[0,{\infty})$, $a{\in}C[0,1]$. The proofs of main results are based upon the bifurcation techniques.

• International Journal of Contents
• /
• v.8 no.1
• /
• pp.30-38
• /
• 2012

Text extraction and binarization are the important pre-processing steps for text recognition. The performance of text binarization strongly related to the accuracy of recognition stage. In our proposed method, the first stage based on line detection and shape feature analysis applied to locate the position of a business card and detect the shape from the complex environment. In the second stage, several local regions contained the possible text components are separated based on the projection histogram. In each local region, the pixels grouped into several connected components based on the connected component labeling and projection histogram. Then, classify each connect component into text region and reject the non-text region based on the feature information analysis such as size of connected component and stroke width estimation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.861-864
• /
• 2014

본 논문은 혀 미각 영역별 분석을 통해 신체의 이상 여부에 대한 정보를 제공하는 설진 진단 시스템의 첫 단계로 얼굴 영상에서 혀 영역을 검출하는 실험을 통하여 미각 영역별 분석의 기반을 다진다. 제안하는 알고리즘은 혀 영상을 획득한 후, Haar-like Feature를 이용하여 혀를 검출한다. 검출된 혀 영역은 HSV컬러모델의 특징을 이용하여 이진화 한 후, Connected Component Labeling을 이용하여 혀 영역 분리한다. 한방병원의 환자들의 혀 사진 100장을 이용하여 90%의 검출률을 확인하였다.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.241-254
• /
• 2008

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.826-832
• /
• 2016

In this paper, we propose a tongue diagnosis system for determining the presence of specific taste crack area as a first step in the digital tongue diagnosis system that anyone can use easily without special equipment and expensive digital tongue diagnosis equipment. Training DB was developed by the Haar-like feature, Adaboost learning on the basis of 261 pictures which was collected in Oriental medicine. Tongue candidate regions were detected from the input image by the learning results and calculated the average value of the HUE component to separate only the tongue area in the detected candidate regions. A tongue area is separated through the Connected Component Labeling from the contour of tongue detected. The palate regions were divided by the relative width and height of the tongue regions separated. Image on the taste area is converted to gray image and binarized with each of the average brightness values. A crack in the presence or absence was determined via Connected Component Labeling with binary images.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.85-98
• /
• 2005

Recently, a lot of researches about mobile vision using Personal Digital Assistant(PDA) has been attempted. Many CPUs for PDA are integer CPUs, which have no floating-computation component. It results in slow computation of the algorithms peformed by vision system or image processing, which have much floating-computation. In this paper, in order to resolve this weakness, we propose the Client(PDA)/server(PC) architecture which is connected to each other with a wireless LAN, and we construct the system with pipelining processing using two CPUs of the Client(PDA) and the Server(PC) in image sequence. The Client(PDA) extracts tentative text regions using Edge Density(ED). The Server(PC) uses both the Multi-1.aver Perceptron(MLP)-based texture classifier and Connected Component(CC)-based filtering for a definite text extraction based on the Client(PDA)'s tentativel99-y extracted results. The proposed method leads to not only efficient text extraction by using both the MLP and the CC, but also fast running time using Client(PDA)/server(PC) architecture with the pipelining processing.

• Communications of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.117-134
• /
• 2005

We introduce the notion of (r,s)-connected sets in intuitionistic fuzzy topological spaces and investigate some properties of them. In particular, we show that every (r,s)-component in an intuitionistic fuzzy topological space is (r,s)-component in the stratification of it.