• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.242-254
• /
• 2000

This paper describes an efficient solid modeling method for thin-walled plastic or sheet metal parts, based on the non-manifold offsetting operations. Since the previous methods for modeling and converting a sheet into a solid have adopted the boundary representations for solid object as their topological framework, it is difficult to represent the exact adjacency relationship between topological entities of a sheet model and a mixture of wireframe and sheet models that can appear in the meantime of modeling procedure, and it is hard to implement topological operations for sheet modeling and transformation of a sheet into a solid. To solve these problems, we introduce a non-manifold B-rep and propose a sheet conversion method based on a non-manifold offset algorithm. Because the non-manifold offset aigorithm based on mathematical definitions results in an offset solid with tubular and spherical thickness-faces we modify it to generate the ruled or planar thickness-faces that are mostly shown in actual plastic or sheet metal parts. In addition, in order to accelerate the Boolean operations used the offset algorithm, we also develope an efficient face-face intersection algorithm using topological adjacency information.

• Journal of the Korean Mathematical Society
• /
• v.47 no.5
• /
• pp.1031-1054
• /
• 2010

Let $\mathbb{Z}^n$ be the Cartesian product of the set of integers $\mathbb{Z}$ and let ($\mathbb{Z}$, T) and ($\mathbb{Z}^n$, $T^n$) be the Khalimsky line topology on $\mathbb{Z}$ and the Khalimsky product topology on $\mathbb{Z}^n$, respectively. Then for a set $X\;{\subset}\;\mathbb{Z}^n$, consider the subspace (X, $T^n_X$) induced from ($\mathbb{Z}^n$, $T^n$). Considering a k-adjacency on (X, $T^n_X$), we call it a (computer topological) space with k-adjacency and use the notation (X, k, $T^n_X$) := $X_{n,k}$. In this paper we introduce the notions of KD-($k_0$, $k_1$)-homotopy equivalence and KD-k-deformation retract and investigate a classification of (computer topological) spaces $X_{n,k}$ in terms of a KD-($k_0$, $k_1$)-homotopy equivalence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.360-373
• /
• 2017

This paper presents a novel digital video steganalysis scheme against the spatial domain video steganography technology based on a spatial temporal detector (ST_D) that considers both spatial and temporal redundancies of the video sequences simultaneously. Three descriptors are constructed on XY, XT and YT planes respectively to depict the spatial and temporal relationship between the current pixel and its adjacent pixels. Considering the impact of local motion intensity and texture complexity on the histogram distribution of three descriptors, each frame is segmented into non-overlapped blocks that are $8{\times}8$ in size for motion and texture analysis. Subsequently, texture and motion factors are introduced to provide reasonable weights for histograms of the three descriptors of each block. After further weighted modulation, the statistics of the histograms of the three descriptors are concatenated into a single value to build the global description of ST_D. The experimental results demonstrate the great advantage of our features relative to those of the rich model (RM), the subtractive pixel adjacency model (SPAM) and subtractive prediction error adjacency matrix (SPEAM), especially for compressed videos, which constitute most Internet videos.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.736-743
• /
• 2013

In IRST(infrared search and track) system, the small target detection is very difficult because the IR(infrared) image have various clutter and sensor noise. The noise and clutter similar to the target intensity value produce many false alarms. In this paper. We propose the adaptive detection method which obtains optimal target detection using the image intensity information and the prior information of target. In order to enhance the target, we apply the human visual system. we determine the adaptive threshold value using image intensity and distance measure in target enhancement image. The experimental results indicate that the proposed method can efficiently extract target region in various IR images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1363-1369
• /
• 2004

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

• Cross-Cultural Studies
• /
• v.37
• /
• pp.361-382
• /
• 2014

This study aims to investigate the change of functions of duibuqi and analysis other fuctions of duibuqi apart from apology from pragmatics and conversation analysis perspectives. Duibuqi consists of dui(face) and buqi(be not capable of performing), and means 'be not capable of facing'. After that, it is assumed to have changed to 'ashamed' and finally 'sorry'. In terms of functions, duibuqi is generally regarded as meaning 'sorry' typically, so mei guanxi is considered to consist adjacency pair with it, but in this investigation, mei guanxi is very little adjacent to duibuqi contrary to expectation(n=2/28, per.=7.1/100). About half of duibuqi(n=15/28, per.=53.6/100) functions in apology action sequence, and in the sequence, duibuqi functions much more for take the lead in apology(n=11/15) but not for a reaction against scolding(n=4/15). And the other half of duibuqi(n=13/28, per.=46.4/100) functions for softening the impact of reject or direct action, or for switching situations, e.g. from favorable situation to unfavorable situation, or for expressing speaker's emotion to the other's repair etc. Consequently, duibuqi has being changed its meanings and its functions is being changed accordingly.

• Journal of Navigation and Port Research
• /
• v.32 no.1
• /
• pp.47-56
• /
• 2008

With rapid growing of the Northeastern Asia, the interest for the connection of Infrastructure that was behind of interesting until now is getting larger. In a line of same connection, UN-ESCAP are forwarding transcontinental railway project, asian highway project et al.. And this study aimed at analysis on the effect that extended to a space by Korea-Japan undersea tunnel project. In aspect of a national land balanced-development to solve various problems such as overcrowding in capital region, unbalanced state by regions, weak exchange between South and North Korea, and weakness of national land basis to prepare for unification et al., this study consulted the economic potentiality model as a analysis method to examine an effect. In this analysis, I used 24 scenarios including all cases by combination of 3 scenarios for Korea-Japan undersea tunnel, 4 scenarios for transportation modes in the section of undersea tunnel, and 2 scenarios for adjacency infrastructure. Transportation modes in the section of undersea tunnel are railway, car-train, mixing way of railway and car-train, and mixing way of road and railway. Adjacency infrastructure applied railway and road. In all scenarios, Korea showed higher growth potentiality than Japan. Also, proposal plan C route relatively showed better in national land balanced-development than other proposal plans. The growth potentiality relatively appeared higher by buildup of a connection together with non-capital regions from the construction of Korea-Japan undersea tunnel. In aspect of Northeastern Asia, it resulted in a increasing of trade and chance of network formation in the region of Asia through infrastructure connection. But, in considering passenger and various factors that extended to the economic growth, this analysis have some limitation. Therefore, I hope that deep studies will continuously perform with various factors.

• Spatial Information Research
• /
• v.18 no.5
• /
• pp.93-105
• /
• 2010

Spatial neighborhoods are spaces which are relate to target space. A 3D spatial query which is a function for searching spatial neighborhoods is a significant function in spatial analysis. Various methodologies have been proposed in related these studies, this study suggests an adjacent based methodology. The methodology of this paper implements topological data for represent a adjacency via using network based topological data model, then apply modifiable Dijkstra's algorithm to each topological data. Results of ordering analysis about an adjacent space from a target space were visualized and considered ways to take advantage of. Object of this paper is to implement a 3D spatial query for searching a target space with a adjacent relationship in 3D space. And purposes of this study are to 1)generate adjacency based 3D network data via network based topological data model and to 2)implement a 3D spatial query for searching spatial neighborhoods by applying Dijkstra's algorithms to these data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.