• ETRI Journal
• /
• v.38 no.3
• /
• pp.518-528
• /
• 2016

The searching of an extensive document database for documents that are locally similar to a given query document, and the subsequent detection of similar regions between such documents, is considered as an essential task in the fields of information retrieval and data management. In this paper, we present a framework for such a task. The proposed framework employs the method of short-read mapping, which is used in bioinformatics to reveal similarities between genomic sequences. In this paper, documents are considered biological objects; consequently, edit operations between locally similar documents are viewed as an evolutionary process. Accordingly, we are able to apply the method of evolution tracing in the detection of similar regions between documents. In addition, we propose heuristic methods to address issues associated with the different stages of the proposed framework, for example, a frequency-based fragment ordering method and a locality-aware interval aggregation method. Extensive experiments covering various scenarios related to the search of an extensive document database for documents that are locally similar to a given query document are considered, and the results indicate that the proposed framework outperforms existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.180-187
• /
• 2014

In this paper, a extension of a fixed-complexity sphere decoder (FSD) to perform interference signal detection and cancelling is proposed for downlink multiuser multiple input-multiple output (MIMO) communication system. It is based on the application of channel matrix expansion on generalized sphere decoder (GSD), and modification of the channel matrix ordering scheme to a FSD algorithm for interference detection. A Monte Carlo simulation shows that the proposed algorithm improves the receiver performance by 3 dB as compared to maximum likelihood detection without interference cancelling at 10% packet error rate in configuration of 702 Mbit/s datarate for four users respectively on IEEE802.11ac.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2326-2339
• /
• 2011

To reduce the implementation complexity of the Vertical Bell Labs layered space-time (V-BLAST) systems with respect to the zero-forcing (ZF) criterion, a computationally efficient recursive algorithm is proposed. A fast implementation of the proposed algorithm is developed and its complexity is analyzed in detail. The proposed algorithm matches the ZF-OSIC detection well, and its three significant advantages can be demonstrated by analyses and simulations. Firstly, its speedups over the conventional ZF-OSIC with norm-based ordering, the original fast recursive algorithm (FRA) and the fastest known algorithm (FKA) in the number of flops are 1.58, 2.33 and 1.22, respectively. Secondly, a much simpler implementation than FRA and FKA can be expected. Finally, the storage requirements are lower than those of FRA and FKA. These advantages make the proposed algorithm more efficient and practical.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.715-718
• /
• 2000

Although shared memory parallel programs are designed to be deterministic both in their final results and intermediate states, the races that occur when different processes access a common memory location in an order not guaranteed by synchronization could result in unintended non-deterministic executions of the program. So, Detecting races, particularly first data races, is important for debugging explicit shared memory parallel programs. It is possible that all data races reported by other on-the-fly algorithms would disappear once the first races were removed. To detect races parallel programs with nested loops and inter-thread coordination, it must guarantee the order of synchronization operations in an execution instance. In this paper, we propose an improved restructuring method that guarantee ordering execution instance and preserve the semantics of original program. This method requires O(np) time and (s + up) space, where n is the number of total operations, s is the number of synchronization operations and p is the number of parallelism in the execution. Also, this method makes on-the-fly detection of parallel program with nested loops and inter-thread coordination more easily in space and time complexity.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.231-234
• /
• 2001

In this paper, we present a robust watermarking technique based on a DCT-domain watermarking approach and an order statistic(OS) filter. The proposed technique inserts one watermark into each of four coefficients within a 2 ${\times}$ 2 block which is scanned on DCT coefficients in the zig-zag ordering from the medium frequency range. The detection algorithm uses an adaptive trimmed mean operator as a local estimator of the embedded watermark to obtain the desired robustness in the presence of additive Gaussian noise and JPEG compression attacks. The performance is analyzed through statistical analysis and numerical experiments. It is shown that the robustness properties against additive noise and JPEG compression attacks are more enhanced than the previous techniques.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.848-851
• /
• 2002

Recently, there are lots of concerning on the integration of robot and virtual reality with the trends of the research of intelligent robot and mined reality. In this paper, a 3D GUI system is proposed based on Internet for remote controlling and monitoring of agent robot working for itself. The proposed system is consists of a manager ordering a new position and displaying the motion of robot, an agent robot moving to the destination according to the indication, a positioning module detecting the current position of robot, and a geographical information module. A user can order the robot agent move to a new position in a virtual space and watch the real images captured from the real sites of the robot. Then, the agent robot moves to the position automatically with avoiding collision by using range finding and a path detection algorithm. We demonstrate the proposed 3D GUI system is supporting a more convenient remote control means far the robots.

• Investigative Magnetic Resonance Imaging
• /
• v.23 no.1
• /
• pp.1-16
• /
• 2019

Dynamic contrast enhanced (DCE) magnetic resonance (MR) imaging plays an important role in non-invasive detection and characterization of primary and metastatic lesions in the liver. Recently, efforts have been made to improve spatial and temporal resolution of DCE liver MRI for arterial phase imaging. Review of recent publications related to arterial phase imaging of the liver indicates that there exist primarily two approaches: breath-hold and free-breathing. For breath-hold imaging, acquiring multiple arterial phase images in a breath-hold is the preferred approach over conventional single-phase imaging. For free-breathing imaging, a combination of three-dimensional (3D) stack-of-stars golden-angle sampling and compressed sensing parallel imaging reconstruction is one of emerging techniques. Self-gating can be used to decrease respiratory motion artifact. This article introduces recent MRI technologies relevant to hepatic arterial phase imaging, including differential subsampling with Cartesian ordering (DISCO), golden-angle radial sparse parallel (GRASP), and X-D GRASP. This article also describes techniques related to dynamic 3D image reconstruction of the liver from golden-angle stack-of-stars data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.323-335
• /
• 2012

In this paper, we propose an AR(augmented reality) system using user's bare hand based on computer vision. It is important for registering a virtual object on the real input image to detect and track correct feature points. The AR systems with markers are stable but they can not register the virtual object on an acquired image when the marker goes out of a range of the camera. There is a tendency to give users inconvenient environment which is limited to control a virtual object. On the other hand, our system detects fingertips as fiducial features using adaptive ellipse fitting method considering the geometric characteristics of hand. It registers the virtual object stably by getting movement of fingertips with determining the shortest distance from a palm center. We verified that the accuracy of fingertip detection over 82.0% and fingertip ordering and tracking have just 1.8% and 2.0% errors for each step. We proved that this system can replace the marker system by tacking a camera projection matrix effectively in the view of stable augmentation of virtual object.

• Bulletin of the Korean Chemical Society
• /
• v.31 no.5
• /
• pp.1262-1266
• /
• 2010

In this study, we investigated the use of liquid crystals to selectively detect the activity of enzymes at interfaces decorated with oligopeptide-based membranes. We prepared a mixed monolayer of tetra(ethylene glycol)-terminated lipids and carboxylic acid-terminated lipids at the aqueous-liquid crystal (LC) interface. The 17 amino-acid oligopeptide SNFKTIYDEANQFATYK was then immobilized onto this mixed monolayer through N-hydroxysuccinimide-activation of the carboxylic acid groups. We examined the orientational behavior of nematic 4-cyano-4'-pentylbiphenyl (5CB) after conjugation of the 17 amino-acid oligopeptide with the mixed monolayer assembled at the interface. Immobilization of the oligopeptide caused orientational transitions in 5CB, with a change from homeotropic (perpendicular) to tilted alignment, which was primarily due to the reorganization of the monolayer. The orientation of the 5CB molecules returned to its homeotropic state after contacting the interface containing ${\alpha}$-chymotrypsin, which can cleave the immobilized oligopeptide. Control experiments confirmed that the enzymatic activity of ${\alpha}$-chymotrypsin triggered the ordering transitions in the LC. These results suggest that the LC can provide a facile method for selective detection of enzymatic activity.