• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.103-113
• /
• 2019

Motivation: Polymerized actin-based cytoskeletal structures are crucial in shape, dynamics, and resilience of a cell. For example, dynamical actin-containing ruffles are located at leading edges of cells and have a significant impact on cell motility. Other filamentous actin (F-actin) bundles, called stress fibers, are essential in cell attachment and detachment. For this reason, their mechanistic understanding provides crucial information to solve practical problems related to cell interactions with materials in tissue engineering. Detecting and counting actin-based structures in a cellular ensemble is a fundamental first step. In this research, we suggest a new method to characterize F-actin wrapping fibers from confocal fluorescence image stacks. As fluorescently labeled F-actin often envelope the fibers, we first propose to segment these fibers by diminishing an energy based on maximum flow and minimum cut algorithm. The actual actin is detected through the use of bilateral filtering followed by a thresholding step. Later, concave actin bundles are detected through a graph-based procedure that actually determines if the considered actin filament is enclosing the fiber.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.145-154
• /
• 2006

This paper improves algorithms of Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. Improving SPRE algorithm performs the execution speed optimization based on the information of the execution frequency from profiling and the memory space optimization. The first purpose of presented algorithm is to reduce in space requirements and the second purpose is to de crease the execution time. Since too much weight on execution speed optimization may cause the explosion of the memory space, it is important to consider the size of memory. This fact can be a big advantage in the embedded system which concerns the required memory size more than the execution speed In this paper we implemented the min-cut algorithm, and this algorithm used the control flow graph is constructed with network and partitioned.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.1-9
• /
• 2022

In this paper, we propose the Deep Learning-Based Companion Animal Abnormal Behavior Detection Service, which using video and sensor data. Due to the recent increase in households with companion animals, the pet tech industry with artificial intelligence is growing in the existing food and medical-oriented companion animal market. In this study, companion animal behavior was classified and abnormal behavior was detected based on a deep learning model using various data for health management of companion animals through artificial intelligence. Video data and sensor data of companion animals are collected using CCTV and the manufactured pet wearable device, and used as input data for the model. Image data was processed by combining the YOLO(You Only Look Once) model and DeepLabCut for extracting joint coordinates to detect companion animal objects for behavior classification. Also, in order to process sensor data, GAT(Graph Attention Network), which can identify the correlation and characteristics of each sensor, was used.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.2
• /
• pp.67-70
• /
• 2015

We propose an automatic vessel segmentation method of vertebral arteries in CT angiography using combined circular and cylindrical model fitting. First, to generate multi-segmented volumes, whole volume is automatically divided into four segments by anatomical properties of bone structures along z-axis of head and neck. To define an optimal volume circumscribing vertebral arteries, anterior-posterior bounding and side boundaries are defined as initial extracted vessel region. Second, the initial vessel candidates are tracked using circular model fitting. Since boundaries of the vertebral arteries are ambiguous in case the arteries pass through the transverse foramen in the cervical vertebra, the circle model is extended along z-axis to cylinder model for considering additional vessel information of neighboring slices. Finally, the boundaries of the vertebral arteries are detected using graph-cut optimization. From the experiments, the proposed method provides accurate results without bone artifacts and eroded vessels in the cervical vertebra.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.89-102
• /
• 2019

Collagen can be used in building artificial skin replacements for treatment of burns and towards the reconstruction of bone as well as researching cell behavior and cellular interaction. The strength of collagen in connective tissue rests on the characteristics of collagen fibers. 3D confocal imaging of collagen fibers enables the characterization of their spatial distribution as related to their function. However, the image stacks acquired with confocal laser-scanning microscope does not clearly show the collagen architecture in 3D. Therefore, we developed a new method to reconstruct, visualize and characterize collagen fibers from fluorescence confocal images. First, we exploit the tensor voting framework to extract sparse reliable information about collagen structure in a 3D image and therefore denoise and filter the acquired image stack. We then propose to segment the collagen fibers by defining an energy term based on the Hessian matrix. This energy term is minimized by a min cut-max flow algorithm that allows adaptive regularization. We demonstrate the efficacy of our methods by visualizing reconstructed collagen from specific 3D image stack.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.516-516
• /
• 2002

With the wide usage of LiDAR data and high-resolution satellite image, 3D modeling of buildings in urban areas has become an important research topic in the photogrammetry and computer vision field for many years. However the previous modeling has its limitations of merely texturing the image to the DSM surface of the study area and does not represent the relief of building surfaces. This study is focused on presenting a system of realistic 3D building modeling from consecutive stereo image sequences using digital camera. Generally when acquiring images through camera, various parameters such as zooming, focus, and attitude are necessary to extract accurate results, which in certain cases, some parameters have to be rectified. It is, however, not always possible or practical to precisely estimate or rectify the information of camera positions or attitudes. In this research, we constructed the collinearity condition of stereo images through extracting the distinctive points from stereo image sequence. In addition, we executed image matching with Graph Cut method, which has a very high accuracy. This system successfully performed the realistic modeling of building with a good visual quality. From the study, we concluded that 3D building modeling of city area could be acquired more realistically.