• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.887-890
• /
• 1998

We present a novel multi-resolution block matching algorithm (BMA) for fast motion estimation. At the coarsest level, a full search BMA (FSBMA) is performed for searching complex or random motion. Concurrently, spatial correlation of motion vector (MV) field is used for searching continuous motion. Here we present an efficient method for searching full resolution MVs without MV decimation even at the coarsest leve. After the coarsest level search, two or three initial MV candidates are chosen for the next level. At the further levels, the MV candidates are refined within much smaller search areas. Simulation results show that in comparison with FSBMA, the proposed BMA achieves a speed-up factor over 710 with minor PSNR degradation of 0.2dB at most, under a normal MPEG2 coding environment. Furthermore, our scheme is also suitable for hardware implementation due to regular data-flow.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2371-2374
• /
• 2003

In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image qualify In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by clustering the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

• Acute and Critical Care
• /
• v.33 no.4
• /
• pp.197-205
• /
• 2018

Lung transplantation is widely accepted as the only viable treatment option for patients with end-stage lung disease. However, the imbalance between the number of suitable donor lungs available and the number of possible candidates often results in intensive care unit (ICU) admission for the latter. In the ICU setting, critical care is essential to keep these patients alive and to successfully bridge to lung transplantation. Proper management in the ICU is also one of the key factors supporting long-term success following transplantation. Critical care includes the provision of respiratory support such as mechanical ventilation (MV) and extracorporeal life support (ECLS). Accordingly, a working knowledge of the common critical care issues related to these unique patients and the early recognition and management of problems that arise before and after transplantation in the ICU setting are crucial for long-term success. In this review, we discuss the management and selection of candidates for lung transplantation as well as existing respiratory support strategies that involve MV and ECLS in the ICU setting.

• The Bulletin of The Korean Astronomical Society
• /
• v.41 no.1
• /
• pp.53.2-53.2
• /
• 2016

We present surface photometry results of the dwarf galaxies in the nearby NGC 2784 galaxy group. We newly detected about 30 dwarf galaxy candidates at about 30 square degree area around the nearby NGC 2784 galaxy (D~10 Mpc and MV=-20.5) applying a visual inspection technique on the wide-field optical images taken by the KMTNet Supernova Program (KSP). Surface brightnesses of the objects estimated from the stacked-images with total exposure time of about 6 hours reach approximately ${\mu}V$ ~28.5 mag/arcsec2 around $3{\sigma}$ above sky background. The central surface brightness and the total absolute magnitude for the faintest candidate dwarf galaxy among about 40 galaxies including the previously known ones is ${\mu}0$, V~26.1 mag/arcsec2 and MV~-9.5 mag, respectively. The effective radii of the candidates are larger than ~200 pc. The radial number density of the dwarf galaxy candidates from the center of NGC 2784 is decreasing. The mean color (<(B-V)0>~0.7) and $S{\acute{e}}rsic$ structure parameters of the dwarfs, assuming them to be located in the NGC 2784 group, are well consistent with those of the dwarf galaxies in other groups (e.g. M83 group and the Local Group (LG)). The faint-end slope of the cumulative luminosity function (CLF) of the galaxies in NGC 2784 group is about ${\alpha}=-1.2$, which is steeper than that of the LG galaxies, but is much flatter than that of the CLF expected by a ${\Lambda}CDM$ model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.612-622
• /
• 2002

In this paper, we review temporal error concealment for video transport over unreliable networks, and a new approach for the recovery of lost or erroneous motion vection(MV)s by classifying the movements of neighboring blocks by their homogeneity is proposed. MVs of the neighboring blocks are classified according to the direction of MVs and a representative value for each class is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.502-504
• /
• 1995

In video image compression, it is important to extract the exact notion information from image sequence in order to perform the data compression, the field rate conversion, and the motion compensated interpolation effectively. It is well known that the location of the smallest sum of absolute difference(SAD) does not always give the true motion vector(MV) since the MV obtained via full block search is often corrupted by noise. In this paper, we first classifies the input blocks into 3 categories : the background, the shade-motion, and the edge-motion. According to the characteristics of the classified blocks, multiple locations of relatively small SAD are searched with an adaptive search window by using the proposed method. The proposed method picks MVs among those candidates by using temporal correlation. Since temporal correlation reveals the noise level in a particular region of the video image sequence, we are able to reduce the search are very effectively.

• Journal of Power Electronics
• /
• v.18 no.5
• /
• pp.1458-1469
• /
• 2018

This paper proposes a novel common-mode voltage (CMV) elimination (CMV-EL) method based on model predictive control (MPC) to eliminate CMV for three-level T-type inverters (3LT2Is). In the proposed MPC method, only six medium and one zero voltage vectors (VVs) (6MV1Z) that generate zero CMV are considered as candidates to perform the MPC. Moreover, the influence of dead-time effects on the CMV of the MPC-based 6MV1Z method is investigated, and the candidate VVs are redesigned by pre-excluding the VVs that will cause CMV fluctuations during the dead time from 6MV1Z. Only three or five VVs are included to perform optimization in every control period, which can significantly reduce the computational complexity. Thus, a small control period can be implemented in the practical applications to achieve improved grid current performance. With the proposed CMV-EL method, the CMV of the $3LT^2Is$ can be effectively eliminated. In addition, the proposed CMV-EL method can balance the neutral point potentials (NPPs) and yield satisfactory performance for grid current tracking in steady and dynamic states. Simulation and experimental results are presented to verify the effectiveness of the proposed method.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.163-168
• /
• 2003

In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image quality. In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by classifying the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are classified according to the direction of MVs and a representative value for each class is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

• Journal of The Korean Astronomical Society
• /
• v.34 no.3
• /
• pp.149-155
• /
• 2001

UBV RI and H$\alpha$ photometry has been performed for the open cluster NGC 6531. A total of 56 bright main sequence (MS) members were selected from their positions in photometric diagrams. We also classified 7 pre-main sequence (PMS) stars and 6 PMS candidates with Ha: emission from H$\alpha$ photometry. We determined a reddening of < E(B - V) >= 0.29 $\pm$ 0.03 and a distance modulus of Vo - Mv = 10.5 for the cluster. From the comparison of our photometric results to theoretical evolution models, we derived a MS turnoff age of 7.5 Myr and a PMS age spread of $\~$4 Myr. The IMF slope $\Gamma$, calculated in the mass range of 0.45 $\le$ log m $\le$ 1.35 is a steep value of $\Gamma$ = -1.8 $\pm$ 0.6.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.755-760
• /
• 2005

To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.