• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• Genomics & Informatics
• /
• v.16 no.4
• /
• pp.23.1-23.5
• /
• 2018

Virus taxonomy was initially determined by clinical experiments based on phenotype. However, with the development of sequence analysis methods, genotype-based classification was also applied. With the development of genome sequence analysis technology, there is an increasing demand for virus taxonomy to be extended from in vivo and in vitro to in silico. In this study, we verified the consistency of the current International Committee on Taxonomy of Viruses taxonomy using an in silico approach, aiming to identify the specific sequence for each virus. We applied this approach to norovirus in Caliciviridae, which causes 90% of gastroenteritis cases worldwide. First, based on the dogma "protein structure determines its function," we hypothesized that the specific sequence can be identified by the specific structure. Firstly, we extracted the coding region (CDS). Secondly, the CDS protein sequences of each genus were annotated by the conserved domain database (CDD) search. Finally, the conserved domains of each genus in Caliciviridae are classified by RPS-BLAST with CDD. The analysis result is that Caliciviridae has sequences including RNA helicase in common. In case of Norovirus, Calicivirus coat protein C terminal and viral polyprotein N-terminal appears as a specific domain in Caliciviridae. It does not include in the other genera in Caliciviridae. If this method is utilized to detect specific conserved domains, it can be used as classification keywords based on protein functional structure. After determining the specific protein domains, the specific protein domain sequences would be converted to gene sequences. This sequences would be re-used one of viral bio-marks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• Spatial Information Research
• /
• v.18 no.4
• /
• pp.109-120
• /
• 2010

Recently, due to rapid increasement of spatial data collected from various geosensors in u-GIS environments, the importance of spatial index for efficient search of large spatial data is rising gradually. Especially, researches based R-Tree to improve search performance of spatial data have been actively performed. These previous researches focus on reducing overlaps between nodes or the height of the R -Tree. However, these can not solve an unnecessary node access problem efficiently occurred in tree traversal. In this paper, we propose a MR-Tree(Mapping-based R-Tree) to solve this problem and to support efficient search of large spatial data. The MR-Tree can improve search performance by using a mapping tree for direct access to leaf nodes of the R-Tree without tree traversal. The mapping tree is composed with MBRs and pointers of R-Tree leaf nodes associating each partition which is made by splitting data area repeatedly along dimensions. Especially, the MR-Tree can be adopted in various variations of the R-Tree easily without a modification of the R-Tree structure. In addition, because the mapping tree is constructed in main memory, search time can be greatly reduced. Finally, we proved superiority of MR-Tree performance through experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.701-708
• /
• 2005

Structuring mechanism, important to serve messages in post-office box structure, is to construct the hierarchy of classes according to the contents of message objects. This Paper Proposes $\alpha$-cut based genealogy grouping method to cluster a lot of structured objects in application domain. The proposed method decides the relationship first by semantic similarity relation and fuzzy relation, and then performs the grouping by operations of search( ), insert() and hierarchy(). This hierarchy structure makes it easy to process group-related processing tasks such as answering queries, discriminating objects, finding similarities among objects, etc. The proposed post-office box structure may be efficiently used to serve and manage message objects by the creation of groups. The Proposed method is tested for 5500 message objects and compared with other methods such as non-grouping, BGM, RGM, OGM.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.173-183
• /
• 1996

In this paper, a new structure that can do fault detection and location of digial logic circuits more efficiently using current testing techniques is proposed. In the conventional method, observation point for steady state power supply current was only one, but in the proposed method more fault classes are divided for fault detection and location through the ovservation of steady state power supply current at two points. Also, it is shown that this structure can be easily applied in detection of stuck-open fault which is not easy to do testing with conventional current testing techniques. In the presented mehtod, an extra trasnistor is used, and current path is made compulsorily in the CMOS circuits in which no current path can be established in steady state, then it can be known that stuck-open tault is in the MOS transistor on the considering current path, if this path disappears due to stuck-open fault. The validity and the effectiveness is shwon, thorugh the SPICE simulation of circuits with fault and the current path search experiment using current path search program based on transistor short model wirtten in C language on SUN sparc workstation.

• Steel and Composite Structures
• /
• v.25 no.4
• /
• pp.485-496
• /
• 2017

In this paper, damage detection has been introduced as an optimization problem and a two-step method has been proposed that can detect the location and severity of damage in truss structures precisely and reduce the volume of computations considerably. In the first step, using the residual force vector concept, the suspected damaged members are detected which will result in a reduction in the number of variables and hence a decrease in the search space dimensions. In the second step, the precise location and severity of damage in the members are identified using the genetic algorithm and the results of the first step. Considering the reduced search space, the algorithm can find the optimal points (i.e. the solution for the damage detection problem) with less computation cost. In this step, the Efficient Correlation Based Index (ECBI), that considers the structure's first few frequencies in both damaged and healthy states, is used as the objective function and some examples have been provided to check the efficiency of the proposed method; results have shown that the method is innovatively capable of detecting damage in truss structures.

• Journal of Navigation and Port Research
• /
• v.30 no.2
• /
• pp.137-143
• /
• 2006

The optimum grillage design belongs to nonlinear constrained optimization problem. The determination of beam scantlings for the grillage structure is a very crucial matter out of whole structural design process. The performance of optimization methods, based on penalty functions, is highly problem-dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm ($R{\mu}GA$) is proposed to find the optimum beam scantlings of the grillage structure without handling any of penalty functions. $R{\mu}GA$ can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. Direct stiffness method is used as a numerical tool for the grillage analysis. In optimization study to find minimum weight, sensitivity study is carried out with varying beam configurations. From the simulation results, it has been concluded that the proposed $R{\mu}GA$ is an effective optimization tool for solving continuous and/or discrete nonlinear real-world optimization problems.

• Korean Journal of Materials Research
• /
• v.27 no.6
• /
• pp.301-306
• /
• 2017

The discovery of new luminescent materials for use in light-emitting diodes(LEDs) has been of great interest, since LED-based solid state lighting applications are attracting a lot of attention in the energy saving and environmental fields. Recent research trends have centered on the discovery of new luminescent materials rather than on fine changes in well-known luminescent materials. In a sense, the novelty of our study beyond simple modification or improvement of existing phosphors. A good strategy for the discovery of new fluorescent materials is to introduce activators that are appropriate for conventional inorganic compounds, that have well-defined structures in the crystal structure database, but have not been considered as phosphor hosts. Another strategy is to discover new host compounds with structures that cannot be found in any existing databases. We have pursued these two strategies at the same time using composite search technology with particle swarm optimization(PSO). In this study, using PSO, we have tracked down a search space composed of Sr-Al-Si-O-N and have discovered a new phosphor structure with yellow luminescence; this material is a potential candidate for UV-LED applications.