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

The building information should be up-to-date information and propagated rapidly for urban modeling, terrain analysis, life information, navigational system, and location-based services(LBS), hence the most recent and updated data of the building information have been required of researchers. This paper presents the developed system to extract the 3-dimension spatial information from aerial orthoimage and LiDAR data of HSI color model. In particular, this paper presents the image processing algorithm to extract the outline of specific buildings and generate the building polygon from the image using HIS color model, recursive backtracking algorithm and the search maze algorithm. Also, this paper shows the effectivity of the HIS color model in the image segmentation.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.401-410
• /
• 2009

In order to derive hidden information (concept subsumption, concept satisfiability and realization) of OWL ontology, a number of OWL reasoners have been introduced. The most of these ontology reasoners were implemented using the tableau algorithm. However most reasoners simply report this information without providing a justification for any arbitrary entailment and unsatisfiable concept derived from OWL ontologies. The purpose of this paper is to investigate an optimized method for non-deterministic rule of the tableau algorithm and finding axioms to cause inconsistency in ontology. In this paper, therefore, we propose an optimized method for non-deterministic rule and finding axiom to cause inconsistency using NATMS. In the first place, we introduce Dependency Directed Backtracking to deal non-deterministic rule, a tableau-based decision procedure to find unsatisfiable axiom Furthermore we propose an improved method adapting NATMS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1169-1181
• /
• 1994

The Gamma Network contains the redundant path thereby is provides the ability to tolerate the faults occured. However, in case of identical the source and destination number, only a single path exists, therefore there is no way of connecting for the fault situation. In addition, for the dynamic packet routing strategy, it shoed perform backtracking analysis to find the redundant path. In this paper we proposed a new network, Dual Network, to resolve these drawbacks. The Dual Network uses switching elements about the same network size as the Gamma Network except first and last stage, and it is more efficient than the Gamma Network, for it has reduced the switching stage by one. And since is used a destination tag routing scheme for the control algorithm, it has on advantage of becoming of simpler and faster routing control.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.6
• /
• pp.32-39
• /
• 2011

Even if the traffic light is green, if vehicles enter a jammed intersection, they are violation of the law. The police is enforcing law as a part of a nation wide campaign. Because, using the camcorder, the police can not do enforcement the offending vehicle, there are other techniques. Our research group proposed automated photographic equipment enable to enforce moving violation in intersection. Using new license plate recognition technology and backtracking technology to trace the offending vehicle, once the system detects a violator, it records 8 wide pictures and 1picture from the front vehicle, showing it enter and proceed through the intersection. Field experimental results obtained in the system, the following conclusions. The three measures of effectiveness investigated were recognition rate 83.5, mis-match recognition rate 1.5%.

• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2005

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. A CSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CPSs. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-marking. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.3
• /
• pp.83-89
• /
• 2015

Connected component labeling (CCL) is a mandatory step in image segmentation where objects are extracted and uniquely labeled. CCL is a computationally expensive operation and thus is often done in parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZ-LE) method, modified 8 directional label selection (M8DLS) method, HYBRID1 method, and HYBRID2 method. Soh et al. showed that HYBRID2 outperforms the others and is the best so far. In this paper we propose a new hybrid parallel CCL algorithm termed as HYBRID3 that combines selective four directional label search (S4DLS) with label backtracking (LB). We show that the average percentage speedup of the proposed over M8DLS is around 60% more than that of HYBRID2 over M8DLS for various kinds of images.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.299-310
• /
• 2002

This paper describes an integrated network management framework for providing point-to-multipoint reservation service (PMRS) in an ATM network. There are two major issues confronting the network service provider in relation to this service: one is to rapidly confirm the acceptability of the subscriber's reservation at subscription time, and the other is to punctually activate the reserved point-to-multipoint service. To meet these requirements, we developed a service provision model (SPM) and a network resource model of a bandwidth allocation timetable (BATT). We propose a point-to-multipoint routing algorithm composed of ordering and backtracking procedures, which can find the best branch point under the complex network topology and can add more destinations to the existing point-to-multipoint route. We demonstrate the feasibility of the SPM, the BATT, and the point-to-multipoint routing algorithm by implementing our schemes and analyzing their performance under the operational ATM network of KT(Korea Telecom).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.253-261
• /
• 1996

In optimizing the layout design of a multi-product assembly environment, tile analysis of the material flow is a vital ingredient. In flexible assembly systems, assembly time is usually very short thus the transfer time is relatively more important Therefore operations sequence must be so determined, that have no backtracking operations as possible as, It is important to form cells, so that they have no intercell movement in curring much processing delay, and to arrange machines as possible as densly. This study presents a independent cell formation method considering operation sequences and machine capacity in flexible assembly systems.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.43-62
• /
• 1995

For a complex scheduling system like time table construction, its optimal solution, if exists, is hard to obtain. In this paper, the scheduling environment is reasonably confined as where objects have their own events competing for better slots on boards, and objects have their own board slot preferences and belong to one or more classes of the society which globally constrains them. Here, two phase method is suggested, where the first phase is human-like preference driven and the second phase is for fine tuning by considering all the factors given. Designed and implemented in our system HI-SCHED are dynamic object switching, temporal-constraint-driven intelligent backtracking, case-based revisions, object-based approach, and so on. Some satisfaction degrees are also defined to measure the usefulness of our method. In addition, look-ahead dynamic object switching is considered, and additional global constraints are introduced and processed. A simple scheme is also used to verify the usefulness of the post processing scheme.