• Journal of Chest Surgery
• /
• v.57 no.2
• /
• pp.217-219
• /
• 2024

Matching for the rhesus (Rh) blood group is currently not taken into account in the organ allocation system. However, in Rh-mismatched transplantation, the primary concern is the potential for RhD-negative recipients to develop sensitization and produce anti-D antibodies if they receive a transfusion of RhD-positive blood. It is estimated that over 80% of RhD-negative recipients may experience Rh allosensitization when exposed to RhD-positive blood, although this occurrence is less common in recipients of solid organs. In theory, RhD-negative recipients who receive organs from RhD-positive donors are at risk of alloimmunization and the production of anti-D antibodies, which could complicate future blood product transfusions. However, our understanding of the impact of donor-recipient Rh mismatch on transplant outcomes, particularly in heart transplantation, is limited. We report a case of successful Rh-mismatched heart transplantation, which was effectively managed through the use of preoperative RhD immunoglobulin and plasmapheresis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2663-2678
• /
• 2012

Due to sharp depth transition, big holes may be found in the novel view that is synthesized by depth-image-based rendering (DIBR). A hole-filling method based on disparity map is proposed. One important aspect of the method is that the disparity map of destination image is used for hole-filling, instead of the depth image of reference image. Firstly, the big hole detection based on disparity map is conducted, and the start point and the end point of the hole are recorded. Then foreground pixels and background pixels are distinguished for hole-dilating according to disparity map, so that areas with matching errors can be determined and eliminated. In addition, parallaxes of pixels in the area with holes and matching errors are changed to new values. Finally, holes are filled with background pixels from reference image according to these new parallaxes. Experimental results show that the quality of the new view after hole-filling is quite well; and geometric distortions are avoided in destination image, in contrast to the virtual view generated by depth-smoothing methods and image inpainting methods. Moreover, this method is easy for hardware implementation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.966-974
• /
• 1999

완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.77-85
• /
• 2010

Fingerprint image quality checking is one of the most important issues in on-line fingerprint recognition because the recognition performance is largely affected by the quality of fingerprint images. In the past, many related fingerprint quality checking methods have typically considered the local quality of fingerprint. However, It is necessary to estimate the global quality of fingerprint to judge whether the fingerprint can be used or not in on-line recognition systems. Therefore, in this paper, we propose both local and global-based methods to calculate the fingerprint quality. Local fingerprint quality checking algorithm considers both the condition of the input fingerprints and orientation estimation errors. The 2D gradients of the fingerprint images were first separated into two sets of 1D gradients. Then，the shapes of the PDFs(Probability Density Functions) of these gradients were measured in order to determine fingerprint quality. And global fingerprint quality checking method uses neural network to estimate the global fingerprint quality based on local quality values. We also analyze the matching performance using FVC2002 database. Experimental results showed that proposed quality check method has better matching performance than NFIQ(NIST Fingerprint Image Quality) method.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.7
• /
• pp.167-176
• /
• 2019

Recently, as the types of services that can be enjoyed in mobile telecommunication networks such as social networks and video streaming are increasing, mobile users(MUs) can access mobile contents easily by consuming mobile data. However, under a mobile telecommunication environment, MUs have to pay a high data fee to a network service provider(SP) in order to enjoy contents. The 'data sponsor' technique, introduced as a way to solve this problem, has attracted attention as a breakthrough method for enhancing contents accessibility of MUs. In this paper, we propose an algorithm that determines the optimal discount rate through the Stackelberg game in the data sponsor environment. We also propose an algorithm to design edge caching, which caches highly popular content for MUs on edge server, through many-to-many matching game. Simulation results clearly indicate that the profit for CP's content consumption is improved by about 6~11%, and the profit of CP according to the ratio of edge caching is improved by about 12% than the other existing schemes under data sponsor environment.

• The Journal of the Korea Contents Association
• /
• v.22 no.3
• /
• pp.54-61
• /
• 2022

Ship is a huge system including a variety of pipe arrangements. Pipes are installed according to the design layout, however the end poistion of pipes are not well matched owing to its measurement and construction errors. In this situation, the customized pipe fitting is frequently designed to connect with both pipes, the position of which are manually measured. This paper focused that these two coordinates are measured by point cloud from RGBD sensor and the relative transformation induced by positional and orientational differences is calculated by inverse kinematics in robotics theory. Therefore, the result applies for the methodology of the pipe connection design. The pipe coordinate that is estimated by the matching and the probabilistic RANSAC method will be verified by experiments. The kinematic design parameters are computationally calculated by using the minimum degree of freedom that connects both pipe coordinates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.157-162
• /
• 2023

A highly sensitive refractive index bio-sensor based on grating-assisted strip directional coupler (GASDC) is proposed. The sensor is designed using two asymmetric strip waveguides with a top-loaded grating structure in one of the waveguides. Maximum light couples from one waveguide to the other at the resonance wavelength satisfying phase-matching condition (PMC), and it shows that the change in phase-matching condition with the change in refractive index of the analyte medium in the cover region can be used as a measure of the sensitivity. The proposed sensor will be an on-chip device with a high refractive index sensitivity, and the sensor configuration offers a low propagation loss, thereby enhancing the sensitivity. Furthermore, variation of the sensitivity with the waveguide parameters of sensor is evaluated to optimize the design.

• Journal of Information Science Theory and Practice
• /
• v.12 no.3
• /
• pp.49-62
• /
• 2024

Strategy monitoring is essential for business management and for administrators, including managers and executives, to build a data-driven organization. Having a tool that is able to visualize strategic data is significant for business intelligence. Unfortunately, there are gaps between business users and information technology departments or business intelligence experts that need to be filled to meet user requirements. For example, business users want to be self-reliant when using business intelligence systems, but they are too inexperienced to deal with the technical difficulties of the business intelligence systems. This research aims to create an automatic matching framework between the key performance indicators (KPI) formula and the data in database systems, based on ontology concepts, in the case study of Prince of Songkla University. The mapping data schema with ontology (MapDSOnto) framework is created through knowledge adaptation from the literature review and is evaluated using sample data from the case study. String similarity methods are compared to find the best fit for this framework. The research results reveal that the "fuzz.token_set_ratio" method is suitable for this study, with a 91.50 similarity score. The two main algorithms, database schema mapping and domain schema mapping, present the process of the MapDS-Onto framework using the "fuzz.token_set_ratio" method and database structure ontology to match the correct data of each factor in the KPI formula. The MapDS-Onto framework contributes to increasing self-reliance by reducing the amount of database knowledge that business users need to use semantic business intelligence.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.17 no.6
• /
• pp.39-50
• /
• 2022

Based on the signaling theory, this study examined whether startups are more likely to attract venture investment when receiving government R&D subsidies. First, we reviewed previous studies of the investment decision-making process of venture capitalists and understood the conditions that influence investment decisions. Based on previous studies on the signal effect of government subsidies, particularly government R&D grants, on inducing private fund investment, this study revealed a mechanism to induce venture investment by startups. In addition, in order to verify whether government R&D subsidies have the effect of inducing venture investment, an empirical analysis was conducted based on data from startups under seven years and certified as a venture companies in 2021. This paper used PSM(Propensity Score Matching) method and DID(Difference In Difference) analysis for an empirical study to analyze the average treatment effect on the treated group(beneficiary startups of government R&D grants). As a result of empirical analysis, companies that receive more government R&D subsidies after starting a business are more likely to attract venture investment. From two to three years after conducting the first government R&D project, startups that received government R&D grants attracted more venture investment than those that did not. The results of this paper demonstrate that government R&D projects can also affect the venture investment ecosystem, giving policy implications to government R&D projects targeting startups. It is also expected to suggest strategic implications to startups that need new funding.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.4
• /
• pp.318-327
• /
• 2009

In this paper, we propose a 3-D geometric localization method for near-field broadband source in shallow water environments. According to the waveguide invariant theory, slope of the interference pattern which is seen in a sensor spectrogram directly proportional to a range of the source. The relative ratio of the range between source and sensors was estimated by matching of two interference patterns in spectrogram. Then this ratio is applied to the Apollonius's circle which shows the locus of a source whose range ratio from two sensors is constant. Two Apollonius's circles from three sensors make the intersection point that means the horizontal range and the azimuth angle of the source. And this intersection point is constant with source depth. Therefore the source depth can be estimated using 3-D hyperboloid equation whose range difference from two sensors is constant. To evaluate a performance of the proposed localization algorithm, simulation is performed using acoustic propagation program and analysis of localization error is demonstrated. From simulation results, error estimate for range and depth is described within 50 m and 15 m respectively.