• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5179-5196
• /
• 2019

To explore an effective non-invasion medical imaging diagnostics approach for hepatocellular carcinoma (HCC), we propose a method based on adopting the multiple technologies with the multi-parametric data fusion, transfer learning, and multi-scale deep feature extraction. Firstly, to make full use of complementary and enhancing the contribution of different modalities viz. multi-parametric MRI images in the lesion diagnosis, we propose a data-level fusion strategy. Secondly, based on the fusion data as the input, the multi-scale residual neural network with SPP (Spatial Pyramid Pooling) is utilized for the discriminative feature representation learning. Thirdly, to mitigate the impact of the lack of training samples, we do the pre-training of the proposed multi-scale residual neural network model on the natural image dataset and the fine-tuning with the chosen multi-parametric MRI images as complementary data. The comparative experiment results on the dataset from the clinical cases show that our proposed approach by employing the multiple strategies achieves the highest accuracy of 0.847±0.023 in the classification problem on the HCC differentiation. In the problem of discriminating the HCC lesion from the non-tumor area, we achieve a good performance with accuracy, sensitivity, specificity and AUC (area under the ROC curve) being 0.981±0.002, 0.981±0.002, 0.991±0.007 and 0.999±0.0008, respectively.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.4
• /
• pp.143-150
• /
• 2013

The purpose of this study is to suggest the methodology to develop variable-scale network model, which is able to induce large-scale road network in detailed level corresponding to small-scale linear objects with various abstraction in higher level. For this purpose, the definition of terms, the benefits and the specific procedures related with a variable-scale model were examined. Second, representation level and the components of layer to design the variable-scale map were presented. In addition, rule-based data generating method and indexing structure for higher LoD were defined. Finally, the implementation and verification of the model were performed to road network in study area (Jeju -do) so that the proposed algorithm can be practical. That is, generated variable scale road network were saved and managed in spatial database (Oracle Spatial) and performance analysis were carried out for the effectiveness and feasibility of the model.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1851-1863
• /
• 2015

– In the paper, to handle the problem of traditional bag-of-features model ignoring the spatial relationship of local features in human action recognition, we proposed a Multiscale Spatial Position Coding under Locality Constraint method. Specifically, to describe this spatial relationship, we proposed a mixed feature combining motion feature and multi-spatial-scale configuration. To utilize temporal information between features, sub spatial-temporal-volumes are built. Next, the pooled features of sub-STVs are obtained via max-pooling method. In classification stage, the Locality-Constrained Group Sparse Representation is adopted to utilize the intrinsic group information of the sub-STV features. The experimental results on the KTH, Weizmann, and UCF sports datasets show that our action recognition system outperforms the classical local ST feature-based recognition systems published recently.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.293-304
• /
• 2007

In this paper, we present a Krylov subspace based projection method for reduced-order modeling of large scale bilinear multi-input multi-output (MIMO) systems. The reduced-order bilinear system is constructed in such a way that it can match a desired number of moments of multi-variable transfer functions corresponding to the kernels of Volterra series representation of the original system. Numerical examples report the effectiveness of this method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3762-3781
• /
• 2020

Infrared pedestrian target recognition is a vital problem of significant interest in computer vision. In this work, a novel infrared pedestrian target recognition method that uses heterogeneous features with multi-kernel transfer learning is proposed. Firstly, to exploit the characteristics of infrared pedestrian targets fully, a novel multi-scale monogenic filtering-based completed local binary pattern descriptor, referred to as MSMF-CLBP, is designed to extract the texture information, and then an improved histogram of oriented gradient-fisher vector descriptor, referred to as HOG-FV, is proposed to extract the shape information. Second, to enrich the semantic content of feature expression, these two heterogeneous features are integrated to get more complete representation for infrared pedestrian targets. Third, to overcome the defects, such as poor generalization, scarcity of tagged infrared samples, distributional and semantic deviations between the training and testing samples, of the state-of-the-art classifiers, an effective multi-kernel transfer learning classifier called MK-TrAdaBoost is designed. Experimental results show that the proposed method outperforms many state-of-the-art recognition approaches for infrared pedestrian targets.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.79-88
• /
• 1997

This paper introduces a new energy function, as maximum a posteriori(MAP) estimate of binocular disparity, that can deal with both random dot stereo-gram(RDS) and natural scenes. The energy function uses phase-magnitude as features to detect only the shift for a pair of corrupted conjugate images. Also we adopted Fleet singularity that effectively detects unstable areas of image plant and thus eliminates in advance error-prone stereo mathcing. The multi-scale concept is applied to the multi laser architecture that can search the solutions systematically from coarse to fine details and thereby avoids drastically the local minima. Using mean field approximation, we obtained a compact representation that is suitable for fast computation. In this manner, the energy function satisfies major natural constraints and requirements for implementing parallel relaxation. As an experiment, the proposed algorithm is applied to RDS and natural stereo images. As a result we will see that it reveals good performance in terms of recognition errors, parallel implementation, and noise characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4513-4532
• /
• 2014

Motivated by the Weber's Law, this paper proposes an efficient and robust shape descriptor based on the perceptual stimulus model, called Weber's Law Shape Descriptor (WLSD). It is based on the theory that human perception of a pattern depends not only on the change of stimulus intensity, but also on the original stimulus intensity. Invariant to scale and rotation is the intrinsic properties of WLSD. As a global shape descriptor, WLSD has far lower computation complexity while is as discriminative as state-of-art shape descriptors. Experimental results demonstrate the strong capability of the proposed method in handling shape retrieval.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• Computers and Concrete
• /
• v.30 no.5
• /
• pp.339-355
• /
• 2022

The high cost of ultra-high-performance engineered cementitious composite (UHP-ECC) is currently a crucial issue, especially in terms of the polyethylene (PE) fibers use. In this paper, cheap calcium carbonate whiskers (CW) were evaluated on the feasibility of hybrid with PE fibers. Diverse combinations of PE fibers and CW were employed to investigate the multi-scale enhancement on the UHP-ECC performance. A probabilistic-based UHP-ECC tensile strain reliability analysis approach was utilized, which was in general agreement with the experimental results. Furthermore, a multi-dimensional integrated representation was conducted for the comprehensive assessment of UHP-ECC. Results illustrated that CW improved the compressive strength and energy dissipation capacity of UHP-ECC owing to the microscopic strengthening mechanism. CW and PE fiber further promoted the saturated cracking of composite by multi-scale crack arresting effect. In particular, PE1.75-CW0.5 specimen possessed the best overall performance. The ultimate cracking width of PE1.75-CW0.5 group had 98 ㎛, which was 46.18% lower compared to PE2-CW0 group, the 28d compressive strength were slightly improved, the tensile strain capacity was comparable to that of PE2-CW0 group. The results above demonstrated that combinations of PE fiber and CW could significantly enhance the comprehensive performance of UHP-ECC, which was beneficial for large-scale engineering applications.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2011

Recently, demand for the use of cadastral map is increasing in both public and private area. To use cadastral map in web or mobile environment, construction of the multi-representation database(MRDB) that is the compressed into multiple scale from the original map data is recommended. In this study, the map generalization methodology for the cadastral map by applying overlay with topographic map and polygon generalization technique is suggested. This process is composed of three steps, re-constructing the network data of topographic map, polygon merging of parcel lines according to network degree, and applying line simplification techniques. Proposed methodologies are applied to the cadastral map in Suwon area. The result map was generalized into 1:5,000, 1:20,000, 1:100,000 scale, and data compression ratio was shown in 15% 8% 1% level respectively.