• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.388-399
• /
• 2012

In the paper, we propose enhanced feature extraction and matching methods for a mobile environment based on modified SURF. We propose three methods to reduce the computational complexity in a mobile environment. The first is to reduce the dimensions of the SURF descriptor. We compare the performance of existing 64-dimensional SURF with several other dimensional SURFs. The second is to improve the performance using the sign of the trace of the Hessian matrix. In other words, feature points are considered as matched if they have the same sign for the trace of the Hessian matrix, otherwise considered not matched. The last one is to find the best distance-ratio which is used to determine the matching points. We find the best distance-ratio through experiments, and it gives the relatively high accuracy. Finally, existing system which is based on normal SURF method is compared with our proposed system which is based on these three proposed methods. We present that our proposed system shows reduced response time while preserving reasonably good matching accuracy.

• The Journal of Society for e-Business Studies
• /
• v.22 no.1
• /
• pp.37-49
• /
• 2017

In order to maximize the efficiency and the quality of care in a hospital, hospitals in general operate by appointments. Patient no-shows or missed appointments waste the time of staffs who prepare for appointments, deprive patients of needed care, and increase burden on clinic capacity. The purpose of this study is to examine the importance and significance of factors that affect patient no-shows. The actual data of 50,000 outpatient appointments is compiled and analyzed from a VAMC in the United States with aims to identify the factors that contribute to outpatient no-shows and to draw meaningful implications. Random forest along with logistic regression analysis identify the factors affecting no-shows; appointment leadtime, show-up rate, travel distance, no-show rate in previous period, patient age, severity, complexity of disease, chronic pain, depression, drug dependence. The appointment leadtime, show-up rate, travel distance and previous no-show rate can be improved by enhancing SMS pre-notification and by improving afterwards telephone counseling. For other factors, it needs to study on the service differentiation with the characteristics of each patient group.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.670-675
• /
• 2012

If the region of interest (ROI) is set within the picture of image and video and the high quality is provided in ROI compared to Non ROI, then overall subjective picture quality can be increased. ROI extracted by the color camera only increases the calculation complexity and reduces the extraction accuracy. In this paper, we use depth camera to set the ROI and calculate the object distance from camera, then propose a method that the different picture quality is controlled by depending on the distance of an object. That is, we apply a high quantization step size to the far object, but relatively a low quantization step size to the close object, so better picture quality can be provided. Simulation results show that applying the differential quantization step size to the distance of objects by the proposed method can improve the subjective picture quality.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.119-124
• /
• 2014

Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.

• Development and Reproduction
• /
• v.19 no.4
• /
• pp.259-264
• /
• 2015

Genomic DNA samples isolated from geographical purplish Washington clam (Saxidomus purpuratus) were obtained from three different regions in the Korean Peninsula: Geoje (Geoje population; GJP), Gunsan (Gunsan population; GSP) and a site of North Korea (North Korea population; NKP). The seven primers generated the total 369 loci that can be scored from the GSP clam population. 356 fragments were generated from the NKP clam population. The complexity of the banding patterns varies dramatically between the primers and three localities. In this study, 319 loci were identified in the purplish Washington clam from Geoje and 369 in the clam population from Gunsan: 221 specific loci (69.3%) in the GJP clam population and 300 (81.3%) in the GSP population. These results demonstrate that the primer detected a large quantity of specific fragments, suggesting that the genetic variation in the GSP is higher than in the GJP population. In particular, the BION-28 primer gave DNA profiles with more fragments than the other six primers in the NKP population. The oligonucleotides primer BION-75 produced 21 unique loci to each population, which were ascertaining each population, approximately 250 bp, 300 bp and 400 bp, in the GJP population. Outstandingly, the primer BION-50 detected 21 shared loci by the three populations, major and/or minor fragments of sizes 150 bp, which were matching in all samples. With regard to average bandsharing value (BS) results, individuals from GJP population (0.743) displayed higher bandsharing values than did individuals from GSP population (0.606). In the present study, the dendrogram gained by the seven oligonucleotides primers indicates three genetic clusters: cluster 1 (GEOJE 01 ~ GEOJE 07), cluster 2 (GUNSAN 08 ~ GUNSAN 14), cluster 3 (N.KOREA 15 ~ N.KOREA 21). Among the twenty one clams, the shortest genetic distance that revealed significant molecular differences was between individuals 08 and 09 from the NKP population (genetic distance = 0.073), while the longest genetic distance among the twenty-one individuals that demonstrated significant molecular differences was between individuals GEOJE no. 03 and GUNSAN no. 09 (genetic distance = 0.669). Comparatively, individuals of GJP population were properly closely related to that of NKP population, as revealed in the hierarchical dendrogram of genetic distances. In due course, PCR analysis has revealed the significant genetic distance among three purplish Washington clam populations. PCR fragments discovered in this study could be valuable as a DNA marker of the three geographical clam populations to distinguish.

• Journal of the Economic Geographical Society of Korea
• /
• v.11 no.3
• /
• pp.459-475
• /
• 2008

This study analyzes the network structure of the Metropolitan Seoul subway system by applying complex network analysis methods. For the purpose, we construct the Metropolitan Seoul subway system as a network graph, and then calculate various indices introduced in complex network analysis. Structural characteristics of Metropolitan Seoul subway network are discussed by these indices. In particular, this study determines the shortest paths between nodes based on the weighted distance (physical and time distance) as well as topological network distance, since urban travel movements are more sensitive for them. We introduce an accessibility measurement based on the shortest distance both in terms of physical distance and network distance, and then compare the spatial structure between two. Accessibility levels of the system have been getting up overall, and thus the accessibility gaps have been getting lessen between center located subway stops and remote ones during the last 10 years. Passenger traffic volumes are explored from real passenger transaction databases by utilizing data mining techniques, and mapped by GIS. Clear differences reveal between the spatial patterns of real passenger flows and accessibility. That is, passenger flows of the Metropolitan Seoul subway system are related with population distribution and land use around subway stops as well as the accessibility supported by the subway network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.762-768
• /
• 2015

D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.585-592
• /
• 2009

This paper presents a method for decoding high minimal distance ($d_{min}$) short codes, termed Cortex codes. These codes are systematic block codes of rate 1/2 and can have higher$d_{min}$ than turbo codes. Despite this characteristic, these codes have been impossible to decode with good performance because, to reach high $d_{min}$, several encoding stages are connected through interleavers. This generates a large number of hidden variables and increases the complexity of the scheduling and initialization. However, the structure of the encoder is well suited for analog decoding. A proof-of-concept Cortex decoder for the (8, 4, 4) Hamming code is implemented in subthreshold 0.25-${\mu}m$ CMOS. It outperforms an equivalent LDPC-like decoder by 1 dB at BER=$10^{-5}$ and is 44 percent smaller and consumes 28 percent less energy per decoded bit.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2669-2688
• /
• 2016

An efficient and effective unsupervised single moving object detection framework is presented in this paper. Given the sparsely labelled trajectory points, we adopt a coarse-to-fine strategy to detect and segment the foreground from the background. The superpixel level coarse segmentation reduces the complexity of subsequent processing, and the pixel level refinement improves the segmentation accuracy. A distance measurement is devised in the coarse segmentation stage to measure the similarities between generated superpixels, which can then be used for clustering. Moreover, a Quadmap is introduced to facilitate the refinement in the fine segmentation stage. According to the experiments, our algorithm is effective and efficient, and favorable results can be achieved compared with state-of-the-art methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1122-1129
• /
• 2007

For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.