• 제목/요약/키워드: MV Candidates

검색결과 16건 처리시간 0.029초

다 해상도 프레임 구조에 기반한 고속 움직임 추정 기법 (A FAST MOTION ESTIMATION ALGORITHM BASED ON MULTI-RESOLUTION FRAME STRUCTURE)

  • 송병철;나종범
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • 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.

  • PDF

클러스터를 이용한 손실된 움직임 벡터 복원 방법 (Recovery Method of missing Motion Vector using Cluster)

  • 손남례;이귀상
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • 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.

  • PDF

Critical Care before Lung Transplantation

  • Lee, Jin Gu;Park, Moo Suk;Jeong, Su Jin;Kim, Song Yee;Na, Sungwon;Kim, Jeongmin;Paik, Hyo Chae
    • Acute and Critical Care
    • /
    • 제33권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.

New Dwarf Galaxies in the Nearby NGC 2784 Galaxy Group Discovered in the KMTNet Supernova Program

  • Park, Hong Soo;Moon, Dae-Sik;Lee, Jae-Joon;Pak, Mina;Kim, Sang Chul
    • 천문학회보
    • /
    • 제41권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.

  • PDF

저대역폭 통신망에서의 시간적 에러 은닉에 관한 연구 (A Study of Temporal Error Concealment in Low Bandwidth Network)

  • 박성찬;이귀상
    • 대한전자공학회논문지SP
    • /
    • 제39권6호
    • /
    • pp.612-622
    • /
    • 2002
  • 본 논문에서는 압축된 비디오 비트스트림이 전송시 전송 에러에 의해 발생되는 화질 열화를 복원하기 위한 시간적 에러 은닉 기법에 대해 논의한다. 또한, 손실된 블록의 주변 블록이 가지는 움직임을 동일 움직임 여부에 따라 분류함으로써 손실된 블록의 움직임 벡터를 복원하는 새로운 알고리즘을 제안한다. 본 논문에서는 손실 블록의 주변 블록들의 동일 움직임을 분석하여 손실 블록의 움직임을 잘 예측할 수 있도록 하기 위해서, 손실 블록의 이웃 블록들의 움직임 벡터는 각 움직임 벡터의 방향에 따라 분류되고, 각 분류된 클래스의 대표 움직임 벡터는 후보 움직임 벡터군에 포함된다. 후보 움직임 벡터군에 속한 각 움직임 벡터에 의해 예측된 블록과 손실 블록 주변간의 왜곡을 측정하여, 최소의 왜곡을 가지는 블록의 움직임 벡터가 선택된다. 실험 결과는 제안된 방법이 다른 손실 블록 복구 알고리즘보다 더 좋은 결과를 나타낸다.

영역별 특성을 이용한 적응적 움직임 벡터 추정 기법 (Adaptive Motion Vector Estimation Using the Regional Feature)

  • 박태희;이동욱;김재민;김영태
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1995년도 추계학술대회 논문집 학회본부
    • /
    • 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.

  • PDF

Novel Model Predictive Control Method to Eliminate Common-mode Voltage for Three-level T-type Inverters Considering Dead-time Effects

  • Wang, Xiaodong;Zou, Jianxiao;Dong, Zhenhua;Xie, Chuan;Li, Kai;Guerrero, Josep M.
    • Journal of Power Electronics
    • /
    • 제18권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.

후보벡터 분류에 의한 영상 에러 복원 (Error Recovery by the Classification of Candidate Motion Vectors for H.263 Video Communications)

  • 손남례;이귀상
    • 정보처리학회논문지B
    • /
    • 제10B권2호
    • /
    • pp.163-168
    • /
    • 2003
  • 이동 통신 채널과 같은 저대역 통신망에서는 비디오 전송을 위해서는 높은 압축율을 갖는 부호화 방법들이 사용된다. 본 논문에서는 저대역 폭 통신을 위한 비디오 부호화 표준인 H.263 부호화를 기반으로 전송도중 손상된 움직임 벡터의 복원기법을 제안하고 실험하였다. 공간적으로 인접한 블록간에는 움직임 벡터의 상관성이 높기 때문에 손실블록 또한 이 블록들과 움직임이 비슷할 가능성이 높다. 이러한 특성을 이용하여 손실블록의 주변블록 중에서 같은 방향으로 움직임을 갖는 블록들로 구성된 동일 움직임 영역을 추출하고, 이 블록들을 이용하여 손실블록의 움직임벡터를 복구한다. 본 논문에서 제안한 알고리즘은 정확한 손실블록의 움직임 벡터를 찾아 거의 완벽하게 복원하기도 하지만 정확한 움직임벡터를 찾지 못한 경우에는 주변블록과 가장 비슷한 움직임벡터를 찾아서 에러를 은닉하는 효과가 있다. 제안한 방법으로 복원한 영상은 전체적으로 눈에 거슬리는 오류가 생기지 않으므로 주관적인 화질이 좋았다. 또한 객관적인 척도인 PSNR 측면에서는 영상의 움직임 정도에 따라 기존 BMA 방법보다 약 0.5㏈∼l㏈까지의 향상이 있었다.

THE GALACTIC OPEN CLUSTER NGC 6531 (M21)

  • PARK BYEONG-GON;SUNG HWANKYUNG;KANG YONG HEE
    • 천문학회지
    • /
    • 제34권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.

  • PDF

수정된 ALA 클러스터링 알고리즘을 이용한 손실된 움직임 벡터 복원 방법 (Recovery of Missing Motion Vectors Using Modified ALA Clustering Algorithm)

  • 손남례;이귀상
    • 정보처리학회논문지B
    • /
    • 제12B권7호
    • /
    • pp.755-760
    • /
    • 2005
  • 이동통신 채널과 같은 저대역 통신망에서는 비디오 전송을 위해서 H.263+와 같이 압축율이 높은 부호화 방법이 사용된다. 저대역폭을 통해 고압축 비디오 비트스트림을 전송할 경우, 패킷이 손실되면 영상의 품질이 심각하게 떨어진다. 본 논문에서는 H.263+ 부호화영상이 전송될 때 손상되는 움직임 벡터의 복원기법을 제안하였다. 본 논문에서는 손실된 블록의 움직임 벡터는 인접한 블록의 움직임 벡터와 높은 상관성을 갖는 다는 사실에 착안하여, 시공간적 오류은닉(Temporal-Spatial Error Concealment) 방법을 제안한다. 제안된 방법에서는 손실된 모션벡터를 인접한 블록의 움직임을 클러스터링하여 복원한다. 인접한 블록의 모션벡터는 ALA(Average Linkage Algorithm) 클러스터링 알고리즘에 따라 클러스터링되며, 각 클러스터의 대표값을 계산하여 후보 움직임 벡터 집합을 얻은 다음, 이들 후보의 움직임의 왜곡정도를 계산하여 왜곡이 최소인 움직임 벡터를 선택한다. 제안한 방법으로 복원한 영상의 화질에 대한 객관적, 주관적 평가에서 개선된 결과를 확인하였다.