• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.785-793
• /
• 2009

This paper proposes a signature using dominant singular values for video sequence matching. By considering the input image as matrix A, a partition procedure is first performed to separate the matrix into non-overlapping sub-images of a fixed size. The SVD(Singular Value Decomposition) process decomposes matrix A into a singular value-singular vector factorization. As a result, singular values are obtained for each sub-image, then k dominant singular values which are sufficient to discriminate between different images and are robust to image size variation, are chosen and normalized as the signature for each block in an image frame for matching between the reference video clip and the query one. Experimental results show that the proposed video signature has a better performance than ordinal signature in ROC curve.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.4
• /
• pp.235-242
• /
• 2016

The emerging High-Efficiency Video Coding (HEVC) standard attempts to improve coding efficiency by a factor of two over H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation (ME) is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Thus, fast mode decisions are not only an important issue to be researched, but also an urgent one. Several schemes for fast mode decisions have been presented in reference software and in other studies. However, the conventional hierarchical mode decision can be useless when block-level parallelism is exploited. This paper proposes operation-level exploration that offers more chances for early termination. An early termination condition is checked between integer and fractional MEs and between the parts of one partition type. The fast decision points of the proposed algorithm do not overlap those in previous works. Thus, the proposed algorithms are easily used with other fast algorithms, and consequently, independent speed-up is possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.702-708
• /
• 2000

In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.972-974
• /
• 2009

This paper presents smart regional contrast enhancement technique of partitioned image for local dimming backlight on small-sized mobile display to reach two goals. One is to save the power consumption, and the other to improve contrast ratio of display image. Recently new advanced method is proposed, named local dimming method, that backlight LED is positioned on backside of the display panel. So it is important to partition an image by sub blocks and then post-processing independantly. This means regional contrast enhancement. After partitioning, we compare the mean luminance(Y) value of each sub-block image with the one of original whole image. If some blocks have the mean value lower than the one of whole image, they are processed with the proposed method and others are bypassed. Simultaneously the information of the processed blocks are transferred to BLC(Backlight LED Controller). And then the supply current of each backlight LED is reduced to realize the contrast ratio enhancement and at the same time to power consumption reduction. In addition, we verify this proposed method is free from blocking artifacts.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.53-56
• /
• 2016

본 논문에서는 HEVC 부호화시 코딩 트리 블록의 분할 구조를 고속 결정하는 방법을 제안한다. 코딩 트리블록은 다양한 크기의 코딩 블록으로 구성되어 부호화 효율을 향상시키지만, 구성되는 코딩 블록을 결정하기 위한 과정에서 많은 계산량을 필요로 하게 되어 부호화 시간을 증가시킨다. 제안하는 방법에서는 부호화 과정에서 복원된 잔차신호와 코딩 트리 블록의 분할 구조의 상관성을 이용하여 코딩 트리 블록의 분할 구조를 고속으로 결정하는 방법을 제시한다. 실험 결과를 통해 제안된 방법이 HM16.0 에 비해 random-access configuration 에서 50.98%, low-delay configuration 에서 43.77%의 부호화 시간을 감소시키는 것을 확인하였다. 이때, $BD-rate_{YUV}$ 증가는 각각 2.42%와 2.35%로 부호화 효율에는 미치는 영향은 낮았다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.67-75
• /
• 1993

In many practical applications of systolic array, it is common that the problem size(n) is larger than the array size(M). In this case, the problem has to be partitioned into block to fit into the array before it is processed. This paper presents a problem partition method for dynamic programming and 2-dimensional systolic array suitable for it. Designed array has two types of array configur-ation for processing the partitioned problem. The queue is designed for storing and recirculating the intermediate results in the correct location and time. The number of processing elements and queues required are M(3M+1)/2, 4M respectively. The total processing time is 2(M+1)+(n+10M+3)(n/M-1)(n/M-1)/6.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.47-50
• /
• 2003

본 논문에서는 동영상을 효율적으로 부호화하기 위한 새로운 다중해상도 움직임 보상 방법과 잉여 양자화 방법을 제안한다. 본 논문에서 제안하는 동영상 부호화기는 다단계 이산웨이브렛 분해 움직임 예측 및 움직임 보상 블록 Tree 의 구성 및 블록 분할. 적응적 산술 부호화기로 구성된다 제안된 동영상 부호화기는 단순하면서도 낮은 연산량을 필요로 하며, 임베디드 특성과 SNR 계위 부호화 특성과 같은 좋은 기능을 제공한다. 또한 기존에 제안되었던 이산웨이브렛변환을 이용하는 동영상 부호화 방법과 비교하여 우수한 성능을 제공한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.255-256
• /
• 2018

본 논문에서는 비디오 부호화 성능 향상을 위하여 QTBT (QuadTree Plus Binary Tree) 블록 구조에서 대각선 움직임 분할 (DMP: Diagonal Motion Partition) 방법을 제안한다. HEVC 이후의 비디오 압축 표준을 위한 탐색 과정에서 다양한 부호화 성능 향상 방법들이 제안되고 있으며, 그 중 제안하는 대각선 움직임 분할 방법은 하나의 정방형 혹은 직방형의 부호화 유닛 (CU: Coding Unit)을 두 개의 삼각형으로 분할하여 움직임 예측 및 보상을 수행하는 방법이다. 제안하는 방법에서는 두 가지 대각선 방향만을 사용하여 블록을 분할하지만, QTBT 블록 구조와 결합하여 다양한 임의의 블록 분할 형태를 표현하는 것이 가능하다. 본 논문에서는 제안하는 방법을 JEM-7.0에 구현하여 0.15%의 부호화 효율 향상 결과를 획득하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.361-362
• /
• 2021

본 논문에서는 VVC(Versatile Video Coding) 부호화 시간 감소를 위해 ISP(Intra Sub-Partition) 모드의 복잡도를 감소시키는 방법을 제안한다. 이 방법은 ISP 모드 적용을 위한 RDO(Rate-Distortion Optimization) 탐색을 수행할 때 현재 블록의 모양에 따라 특정 ISP 모드 방향을 사전에 제한하여 RDO 과정을 생략함으로써 부호화 시간을 단축한다. 실험 결과, 기존 VVC 방법 대비 BDBR(Bjøntegaard Delta Bit Rate) 측면에서 AI(All Intra) 구성하에 Y 채널에서 0.01%, Cb, Cr 채널에서 각각 -0.04%, -0.08% 변화로 2%의 부호화 시간 감소의 결과를 얻을 수 있었다.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.360-369
• /
• 2007

Since wireless sensor networks consist of nodes with the constrained battery, it is important to construct the topology performing energy-efficient routing while maximizing the whole network lifetime. Previous works related to this do not take into consideration the specific communication pattern in wireless sensor networks. In this paper, we propose a novel routing algorithm, called Up-Down Tree(UDT), which first constructs the tree topology based on distance and then adjusts the transmission range determined by the two different phases, tree setup and data gathering, to adapt the specific communication pattern in wireless sensor networks. Therefore, the UDT can improve energy efficiency, maximize the network lifetime, and block network partition Simulation results show that the UDT has the improved energy efficiency by constructing the optimal topology.