• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.725-733
• /
• 2000

In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.228-240
• /
• 2012

Morphing is a geometric interpolation technique that is often used by the animation industry to transform one form into another seemingly seamlessly. It does this by producing a large number of 'intermediate' forms between the two 'extreme' or 'parent' forms. It has already been shown that morphing technique can be a powerful tool for form design and as such can be a useful addition to the armoury of product designers. Morphing procedure itself is simple and consists of straightforward linear interpolation. However, establishing the correspondence between vertices of the parent models is one of the most difficult and important tasks during a morphing process. This paper discusses the mesh-merging method employed for this process as against the already established mesh-regularising method. It has been found that the merging method minimises the need for manual manipulation, allowing automation to a large extent.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.154-154
• /
• 2019

Characterization of reliable field-scale root-zone soil moisture (RZSM) variability contribute to effective hydro-meterological monitoring. Although a promising cosmic-ray neutron probe (CRNP) holds the pontential for field-scale RZSM measurement, it is often restricted at deeper depths due to the non-unique sensitivity of CRNP-measured fast neutron signal to other hydrogen pools. In this study, a merging framework relied on coupling cosmic-ray soil moisture with a representative additional RZSM, was introduced to scale shallower CRNP effective depth to represent root-zone layer. We tested our proposed framework over a densely vegetated region in South Korea covering a network of one CRNP and nine in-situ point measurements. In particular, cosmic-ray soil moisture and ancillary RZSM retrieved from the most time stable location were considered as input datasets; whereas the remaining point locations were used to generate a reference RZSM product. The errors between these two input datasets and the reference were forecasted by a linear autoregressive model. A linear combination of forecasts was then employed to compute a suitable weight for merging two input products from the predicted errors. The performance of merging framework was evaluated against reference RZSM in comparison to the two original products and a commonly used exponential filter technique. The results of this study showed that merging framework outperformed other products, demonstrating its robustness in improving field-scale RZSM. Moreover, a strong relationship between the quality of input data and the performance merging framework in light of CRNP effective depth variation has been also underlined via the merging framework.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.223-234
• /
• 2006

Branching and merging have been being the outstanding methods for SCM in terms of supporting parallel developments. Since well-known commercial merging tools based on textual merging have not detecting semantics conflicts, they can cause semantic errors in the result of merging. Although a lot of researches for detecting semantic conflict and merging up to recently, these researches have been doing individually. Therefore, it is necessary for a research detecting semantic conflict on textual merging and solving it. In this paper, we propose a new method for merging which preserve semantics on textual merging. The method merging two revisions from a source program is as follows : 1) defining changing operations, which include Update, Delete, and Insert operation, per line on two revisions corresponding to the line in source program, 2) detecting textual conflicts and semantic conflict in terms of executional behaviors, 3) solving these conflicts before merging. So, the proposed method can be regarded as a hybrid method that combines a method of textual merging and a behavioral semantic merging.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1177-1182
• /
• 2007

Recently, IEC61850 supports the standardized communication technique in both station bus and process bus, and presents the substation automation model. In this paper, we propose the required techniques to develop the Merging Unit (MU), which is one of the important data acquisition equipment in substation automation, under IEC61850 communication protocol. Especially, we also propose the precision time synchronization technique using GPS(Global Positioning System) for the MU. IEC61850-9-2 SV (Sampled Value) service is applied to the MU which is designed using microprocessor. In order to evaluate the performance of the proposed MU, the playback program, which can reconstruct the transmitted sampled value data on the basis of time information, is developed and the performance of the IEC61850 SV service for MU is verified experimentally.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.106-114
• /
• 1994

A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1564-1574
• /
• 1999

In order to improve the efficiency of optimizing compilers, integration of register allocation and instruction scheduling has been extensively studied. One of the promising integration techniques is register allocation based on register-reuse chains. However, the generation of register-reuse chains in the previous approach was not completely systematic and consequently it creates unnecessarily dependencies that restrict instruction scheduling. This paper proposes a new register allocation technique based on a systematic generation of register-reuse chains. The first phase of the proposed technique is to generate register-reuse chains that are optimal in the sense that no additional dependencies are created. Thus, register allocation can be done without restricting instruction scheduling. For the case when the optimal register-reuse chains require more than available registers, the second phase reduces the number of required registers by merging the register-reuse chains. Chain merging always generates additional dependencies and consequently enforces the execution order of instructions. A heuristic is developed for the second phase in order to reduce additional dependencies created by merging chains. For matrix multiplication program, the number of registers resulting from the first phase is small enough to fit into available registers for most basic blocks. In addition, it is shown that the restriction to instruction scheduling is reduced by the proposed merging heuristic of the second phase.

• Journal of the Korean GEO-environmental Society
• /
• v.17 no.8
• /
• pp.39-44
• /
• 2016

Ground deformation around construction site in urban area where typically adjacent structures are located needs to be strictly controlled. Accordingly, it is very important to precisely monitor the ground deformation. Settlement beacon is typically employed to measure the ground deformation, but meanwhile the rapid development in electronic technology enables 3D image scanner to become available for measuring the ground deformation profile in usual construction sites. With respect to the profile measurement, the 3D scanner has an advantage, whereas its accuracy is somewhat limited because it does not measure the displacement directly. In this paper, we developed a conditional merging technique to combine the ground displacement measured from settlement beacon and the profile measured by the 3D scanner. Synthetic ground deformation profile was generated to validate the proposed technique. It is found that the ground deformation measurement error can be reduced significantly via the conditional merging technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1661-1667
• /
• 1999

In this paper, we propose an efficient VP extension algorithm for ABR multipoint-to-point connection in ATM networks. The VC merging or VP merging is used to implement ABR multipoint-to-point connection. We use the VP merging technique. To solve the scarcity problem of VP resources, we propose an efficient VP extension algorithm. Since the proposed scheme follows the standard VPI/VCI format, it doesn’t require another table according to the VP extension. We compare the proposed scheme with VC merging algorithm. The result shows that the proposed method can provide fair bandwidth allocation among the sources in multipoint-to-point connection.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.819-828
• /
• 2007

In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.