• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.4
• /
• pp.369-379
• /
• 2022

In weighted k-nearest neighbor (WkNN)-based Fingerprinting positioning step, a process of comparing the requested positioning signal with signal information for each reference point stored in the fingerprint DB is performed. At this time, the higher the number of matched base station identifiers, the higher the possibility that the terminal exists in the corresponding location, and in fact, an additional weight is added to the location in proportion to the number of matching base stations. On the other hand, if the matching number of base stations is small, the selected candidate reference point has high dependence on the similarity value of the signal. But one problem arises here. The positioning signal can be compared with the repeater signal in the signal information stored on the DB, and the corresponding reference point can be selected as a candidate location. The selected reference point is likely to be an outlier, and if a certain weight is applied to the corresponding location, the error of the estimated location information increases. In order to solve this problem, this paper proposes a WkNN technique including an outlier removal function. To this end, it is first determined whether the repeater signal is included in the DB information of the matched base station. If the reference point for the repeater signal is selected as the candidate position, the reference position corresponding to the outlier is removed based on the clustering technique. The performance of the proposed technique is verified through data acquired in Seocho 1 and 2 dongs in Seoul.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.837-847
• /
• 2016

Tone mapping for High Dynamic Range(HDR) image provides matching human visual perception between real world scene and displayable devices. Recently, a tone mapping algorithm based on localized gamma correction is proposed. This algorithm is using human visual properties of contrast and colorfulness with background intensity, generating a weight map for gamma correction. However, this method have limitations of controlling enhancement region as well as generating halo artifacts caused by the weight map construction. To overcome aforementioned limitations, proposed algorithm in this paper modifies previous weight map, considering base layer intensity of input luminance channel. By determining enhancement region locally and globally based on base layer intensity, gamma values are corrected accordingly. Therefore, proposed algorithm selectively enhances local brightness and controls strength of edges. Subjective evaluation using z-score shows that our proposed algorithm outperforms the conventional methods.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.2
• /
• pp.259-266
• /
• 2005

Steers (n=335) of known genetic backgrounds from four fundamentally different growth types were subjected to two production systems to study differences in carcass traits. Growth types were animals with genetic potential for large mature weight-late maturing, intermediate mature weight-late maturing, intermediate mature weight-early maturing and small mature weight-early maturing. Each year, in a nine-year study, calves of each growth type were weaned and five steers of each growth type were developed on pasture or feedlot and slaughtered at approximately 20 and 14 months of age, respectively. Data collected were pre-slaughter shrunk body weight (SBW); hot carcass weight (HCW); dressing percentage (DRESS); fat thickness at the $12^{th}$ and $13^{th}$ rib interface (FAT); percentage kidney, pelvic, and heart fat (KPH); longissimus muscle area (LMA); marbling score (MARB); quality grade (QG); and yield grade (YG). Year and growth type were significant for all carcass traits. The growth type${\times}$production system interaction was an important source of variation in SBW, HCW; FAT, YG and MARB. The same interaction was non-significant for DRESS, KPH, LMA and QG. Carcass differences in measures of fatness were greater in the feedlot system than in the pasture system. These data could aid producers in matching beef growth type to the production system most suitable for efficient use of resources.

• Toxicological Research
• /
• v.25 no.3
• /
• pp.132-139
• /
• 2009

The toxicity test of ammonium persulfate was conducted to ensure of its potential toxic effects according to the single-dose acute oral toxicity study (OECD Guideline 423) and 90-day repeated dose sub-chronic oral toxicity study guideline (OECD Guideline 408) for establishing national chemical management system, and matching in the Globally Harmonized Classification System (GHS) category. In acute oral toxicity study, pasty stool, perineal contamination and temporary body weight decrease were observed after dosing 1st and 2nd challenge (300 mg/kg body weight). All test animals were dead within 6 hours after dosing at 3rd challenge (2000 mg/kg body weight). Therefore, the GHS class of test substance is considered class 4. In sub-chronic toxicity study, body weight changes, food consumptions, hematological, biochemical and pathological examination did not show any noticeable and significant differences between the administered (5, 20, 80 mg/kg body weight) and control (vehicle only) group animals. Based on these results, the no observed adverse effect level (NOAEL) is considered above 80 mg/kg body weight.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.111-117
• /
• 2014

In this paper I propose a simple optimal solution seeking algorithm to a stable marriage problem. The proposed algorithm firstly constructs an $n{\times}n$ matrix of the sum of each gender's preference of the other gender $p_{ij}$. It then selects the minimum sum preference $_{min}p_{ij}$ in the constructed matrix and deletes its corresponding row i and column j. This process is repeated until $i=0{\cap}j=0$, after which the algorithm compares initially or last chosen $_{min}p_{ij}$ its alternatives to finally determine one that yields the maximum marginal increase in preference. When applied to 7 stable marriage problems, the proposed algorithm has improved on initial solutions of existing algorithms.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.13-23
• /
• 2009

In this paper we propose an approach for localizing objects in satellite images. Our method exploits matching features based on description vectors. We applied Scale Invariant Feature Transform (SIFT) to object localization. First, we find keypoints of the satellite images and the objects and generate description vectors of the keypoints. Next, we calculate the similarity between description vectors, and obtain matched keypoints. Finally, we weight the adjacent pixels to the keypoints and determine the location of the matched object. The experiments of object localization by using SIFT show good results on various scale and affine transformed images. In this paper the proposed methods use Google Earth satellite images.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.259-264
• /
• 2006

It is well known that the uncertainty of the covariance parameters of the process noise (Q) and the observation errors (R) has a significant impact on Kalman filtering performance. Q and R influence the weight that the filter applies between the existing process information and the latest measurements. Errors in any of them may result in the filter being suboptimal or even cause it to diverge. The conventional way of determining Q and R requires good a priori knowledge of the process noises and measurement errors, which normally comes from intensive empirical analysis. Many adaptive methods have been developed to overcome the conventional Kalman filter's limitations. Starting from covariance matching principles, an innovative adaptive process noise scaling algorithm has been proposed in this paper. Without artificial or empirical parameters to be set, the proposed adaptive mechanism drives the filter autonomously to the optimal mode. The proposed algorithm has been tested using road test data, showing significant improvements to filtering performance.

• Smart Media Journal
• /
• v.11 no.8
• /
• pp.84-92
• /
• 2022

Precision livestock monitoring promises greater management efficiency for farmers and higher welfare standards for animals. Recent studies on video-based animal activity recognition and tracking have shown promising solutions for understanding animal behavior. To achieve that, surveillance cameras are installed diagonally above the barn in a typical cattle farm setup to monitor animals constantly. Under these circumstances, tracking individuals requires addressing challenges such as occlusion and visual appearance, which are the main reasons for track breakage and increased misidentification of animals. This paper presents a framework for multi-cattle tracking in closed barns with appearance and motion models. To overcome the above challenges, we modify the DeepSORT algorithm to achieve higher tracking accuracy by three contributions. First, we reduce the weight of appearance information. Second, we use an Ensemble Kalman Filter to predict the random motion information of cattle. Third, we propose a supplementary matching algorithm that compares the absolute cattle position in the barn to reassign lost tracks. The main idea of the matching algorithm assumes that the number of cattle is fixed in the barn, so the edge of the barn is where new trajectories are most likely to emerge. Experimental results are performed on our dataset collected on two cattle farms. Our algorithm achieves 70.37%, 77.39%, and 81.74% performance on HOTA, AssA, and IDF1, representing an improvement of 1.53%, 4.17%, and 0.96%, respectively, compared to the original method.

• Journal of the Korean Society for information Management
• /
• v.29 no.4
• /
• pp.101-121
• /
• 2012

Since IR systems which adopt only Boolean IR model can not provide ranked search result, users have to conduct time-consuming checking process for huge result sets one by one. This study proposes a method to provide search results ranked by using coupling information between tags instead of index weight information in Boolean IR model. Because document queries are used instead of general user queries in the proposed method, key tags used as queries in a relevant document are extracted. A variety of groups of Boolean queries based on tag couplings are created in the process of extracting queries. Ranked search result can be extracted through the process of matching conducted with differential information among the query groups and tag significance information. To prove the usability of the proposed method, the experiment was conducted to find research trend analysis information on selected research information. Aslo, the service based on the proposed methods was provided to get user feedback for a year. The result showed high user satisfaction.