Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Computing Science and Engineering
Journal Basic Information
Journal DOI :
Korean Institute of Information Scientists and Engineers
Editor in Chief :
In-Sup Lee / Il-Yeol Song / Jong C. Park / Tae-Whan Kim
Volume & Issues
Volume 8, Issue 4 - Dec 2014
Volume 8, Issue 3 - Sep 2014
Volume 8, Issue 2 - Jun 2014
Volume 8, Issue 1 - Mar 2014
Selecting the target year
An Object-Level Feature Representation Model for the Multi-target Retrieval of Remote Sensing Images
Zeng, Zhi ; Du, Zhenhong ; Liu, Renyi ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 65~77
DOI : 10.5626/JCSE.2014.8.2.65
To address the problem of multi-target retrieval (MTR) of remote sensing images, this study proposes a new object-level feature representation model. The model provides an enhanced application image representation that improves the efficiency of MTR. Generating the model in our scheme includes processes, such as object-oriented image segmentation, feature parameter calculation, and symbolic image database construction. The proposed model uses the spatial representation method of the extended nine-direction lower-triangular (9DLT) matrix to combine spatial relationships among objects, and organizes the image features according to MPEG-7 standards. A similarity metric method is proposed that improves the precision of similarity retrieval. Our method provides a trade-off strategy that supports flexible matching on the target features, or the spatial relationship between the query target and the image database. We implement this retrieval framework on a dataset of remote sensing images. Experimental results show that the proposed model achieves competitive and high-retrieval precision.
A Regular Expression Matching Algorithm Based on High-Efficient Finite Automaton
Wang, Jianhua ; Cheng, Lianglun ; Liu, Jun ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 78~86
DOI : 10.5626/JCSE.2014.8.2.78
Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.
CADICA: Diagnosis of Coronary Artery Disease Using the Imperialist Competitive Algorithm
Mahmoodabadi, Zahra ; Abadeh, Mohammad Saniee ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 87~93
DOI : 10.5626/JCSE.2014.8.2.87
Coronary artery disease (CAD) is currently a prevalent disease from which many people suffer. Early detection and treatment could reduce the risk of heart attack. Currently, the golden standard for the diagnosis of CAD is angiography, which is an invasive procedure. In this article, we propose an algorithm that uses data mining techniques, a fuzzy expert system, and the imperialist competitive algorithm (ICA), to make CAD diagnosis by a non-invasive procedure. The ICA is used to adjust the fuzzy membership functions. The proposed method has been evaluated with the Cleveland and Hungarian datasets. The advantage of this method, compared with others, is the interpretability. The accuracy of the proposed method is 94.92% by 11 rules, and the average length of 4. To compare the colonial competitive algorithm with other metaheuristic algorithms, the proposed method has been implemented with the particle swarm optimization (PSO) algorithm. The results indicate that the colonial competition algorithm is more efficient than the PSO algorithm.
Appearance-Order-Based Schema Matching
Ding, Guohui ; Cao, Keyan ; Wang, Guoren ; Han, Dong ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 94~106
DOI : 10.5626/JCSE.2014.8.2.94
Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.
Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc Networks
Matoba, Akihisa ; Hanada, Masaki ; Kanemitsu, Hidehiro ; Kim, Moo Wan ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 107~118
DOI : 10.5626/JCSE.2014.8.2.107
One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.
Automatic Segmentation of Retinal Blood Vessels Based on Improved Multiscale Line Detection
Hou, Yanli ;
Journal of Computing Science and Engineering, volume 8, issue 2, 2014, Pages 119~128
DOI : 10.5626/JCSE.2014.8.2.119
The appearance of retinal blood vessels is an important diagnostic indicator of serious disease, such as hypertension, diabetes, cardiovascular disease, and stroke. Automatic segmentation of the retinal vasculature is a primary step towards automatic assessment of the retinal blood vessel features. This paper presents an automated method for the enhancement and segmentation of blood vessels in fundus images. To decrease the influence of the optic disk, and emphasize the vessels for each retinal image, a multidirectional morphological top-hat transform with rotating structuring elements is first applied to the background homogenized retinal image. Then, an improved multiscale line detector is presented to produce a vessel response image, and yield the retinal blood vessel tree for each retinal image. Since different line detectors at varying scales have different line responses in the multiscale detector, the line detectors with longer length produce more vessel responses than the ones with shorter length; the improved multiscale detector combines all the responses at different scales by setting different weights for each scale. The methodology is evaluated on two publicly available databases, DRIVE and STARE. Experimental results demonstrate an excellent performance that approximates the average accuracy of a human observer. Moreover, the method is simple, fast, and robust to noise, so it is suitable for being integrated into a computer-assisted diagnostic system for ophthalmic disorders.