• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3729-3749
• /
• 2021

At present, deep convolution network-based salient object detection (SOD) has achieved impressive performance. However, it is still a challenging problem to make full use of the multi-scale information of the extracted features and which appropriate feature fusion method is adopted to process feature mapping. In this paper, we propose a new adjacency auxiliary network (AANet) based on multi-scale feature fusion for SOD. Firstly, we design the parallel connection feature enhancement module (PFEM) for each layer of feature extraction, which improves the feature density by connecting different dilated convolution branches in parallel, and add channel attention flow to fully extract the context information of features. Then the adjacent layer features with close degree of abstraction but different characteristic properties are fused through the adjacent auxiliary module (AAM) to eliminate the ambiguity and noise of the features. Besides, in order to refine the features effectively to get more accurate object boundaries, we design adjacency decoder (AAM_D) based on adjacency auxiliary module (AAM), which concatenates the features of adjacent layers, extracts their spatial attention, and then combines them with the output of AAM. The outputs of AAM_D features with semantic information and spatial detail obtained from each feature are used as salient prediction maps for multi-level feature joint supervising. Experiment results on six benchmark SOD datasets demonstrate that the proposed method outperforms similar previous methods.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.89-99
• /
• 2004

This paper proposes a morphological analysis method that enables morphological analysis by checking conditions between two adjacent morphemes. These conditions are fed from a dictionary. This method eliminates a code conversion module and the application of transformational rules for candidate generation. The method claims that very high speed morphological analysis is attainable through simple bit operations for adjacency condition check. MACH, an implementation of the proposed method, is a supersonic Korean morphological analyzer which is able to analyze a document of 1 GB in 5 minutes on a PC with 1.13 GHz Pentium III CPU. The analysis accuracy of MACH is 99.2 %.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.661-670
• /
• 2008

In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.724-729
• /
• 2011

Information retrieval is a method to search the needed data by users. Generally, when a user searches some data in the large scale data set like the internet, ranking-based search is widely used because it is not easy to find the exactly needed data at once. In this paper, we propose a novel ranking-based search method based on sequence and adjacency relationship of user query by the help of TF-IDF and n-gram. As a result, it was possible to find the needed data more accurately with 73% accuracy in more than 19,000 data set.

• Korean Journal of Remote Sensing
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2002

A hybrid image segmentation algorithm is proposed which integrates edge-based and region-based techniques through the watershed algorithm. First, by using mean curvature diffusion coupled to min/max flow, noise is eliminated and thin edges are preserved. After images are segmented by watershed algorithm, the segmented regions are combined with neighbor regions. Region adjacency graph (RAG) is employed to analyze the relationship among the segmented regions. The graph nodes and edge costs in RAG correspond to segmented regions and dissimilarities between two adjacent regions respectively. After the most similar pair of regions is determined by searching minimum cost RAG edge, regions are merged and the RAG is updated. The proposed method efficiently reduces noise and provides one-pixel wide, closed contours.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2002.09a
• /
• pp.26-26
• /
• 2002

• Proceedings of the KSPS conference
• /
• 2002.11a
• /
• pp.64-69
• /
• 2002

This study concerns the constraints of English Poetic Meter. In English poems, the metrical pattern doesn't always match the linguistic stress on the lines. These mismatches are found differently among the poets. For the lexical stress mismatched with the weak metrical position, $*W{\Rightarrow}{\;}Strength$ is established by the concept of the strong syllable. The peaks of monosyllabic words mismatched with the weak metrical position are divided according to which side of the boundary of a phonological domain they are adjacent to. Adjacency Constraint I is suggested for the mismatched peak which is adjacent to the left boundary of a phonological domain; *Peak] and Adjacency ConstraintII for the mismatched peak which are adjacent to the right boundary of a phonological domain. These constraints are various according to the poets(Pope, Milton and Shakespeare) : *[Peak [-stress], $W{\Rightarrow}{\;}*Strength$ and *Peak] in Pope; *[+stress][Peak [-stress] and *Peak] in Milton ; *[+stress][Peak [-stress], $W{\;}{\Rightarrow}{\;}*Strength$ and ACII in Shakespeare.

• Computational Structural Engineering
• /
• v.9 no.4
• /
• pp.141-154
• /
• 1996

Delaunay triangulation is a very powerful method of mesh generation for its versatility such as handling complex geometries, element density control, and local/global remeshing capability, The limit of generating simplex elements(3-node elements in 2-D) only is resolved by adding generation module of 6-node quadratic elements. Since proposed adjacency does not change from 3-node element mesh to 6-node mesh, generation module can utilize the original simplex element generator. Therefore, versatility of the Delaunay triangulation is preserved. A simple upsetting problem is employed to show the possibility of the algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.53-60
• /
• 2000

The purpose of this paper is to propose new recovery algorithm for case of a system element raises communication obstacle due to faults in networks, Also we are simulate the algorithm using adjacency matrix. We recover one faulty node per each excution of proposed algorithm so that we can be reconstruct the faulty system gradually to communicatable network. For that, this paper propose a new recovery algorithm named MATRECO which connect the recovery process is simulated by use of adjacency matrix.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.707-716
• /
• 2013

The present paper consists of two parts. Since the recent paper [4] proved that an Alexandroff $T_0$-space is a semi-$T_{\frac{1}{2}}$-space, the first part studies semi-open and semi-closed structures of the Khalimsky nD space. The second one focuses on the study of a relation between the LS-property of ($SC^{n_1,l_1}_{k_1}{\times}SC^{n_2,l_2}_{k_2}$, k) relative to the simple closed $k_i$-curves $SC^{n_i,l_i}_{k_i}$, $i{\in}\{1,2\}$ and its normal k-adjacency. In addition, the present paper points out that the main theorems of Boxer and Karaca's paper [3] such as Theorems 4.4 and 4.7 of [3] cannot be new assertions. Indeed, instead they should be attributed to Theorems 4.3 and 4.5, and Example 4.6 of [10].