• 대한원격탐사학회지
• /
• 제7권1호
• /
• pp.69-86
• /
• 1991

An unsupervised region based image segmentation algorithm implemented with a pyramid structure has been developed. Rather than depending on thraditional local splitting and merging of regions with a similarity test of region statistics, the algorithm identifies the homogenous and boundary regions at each level of pyramid, then the global parameters of esch class are estimated and updated with values of the homogenous regions represented at the level of the pyramid using the mixture distribution estimation. The image is then classified through the pyramid structure. Classification results obtained for both simulated and SPOT imagery are presented.

• 전자공학회논문지B
• /
• 제28B권7호
• /
• pp.566-577
• /
• 1991

In this paper, the method of image segmentation based on a pyramid of reduced resolution versions of the input input image is persented. In a pyramid structure, two regions (a given pixel and its mother pixels) are compared by the proposed inverse-mother-son variance ratio (IMSVR) method for the detection of an optinal object pixel and are determined whether they are similar enough to be viewed as one region or disparate to be viewed as ditinct regions By the proposed method, an l`timal object pixel has been setectedat some level, it is necessary to retrieve its boundary precisely. Moving down the pyramid to levels of higher resolution is requires. In this paper, the top-sown pyramid traversing algorithm for an image segmentation using a pyrmid structure is presented. Using the computer simulation, the results by the proposed statistical method and object traversing method are investigated for the binary image and the real image at the results of computer simulation, the proposed method of image segmentation based on a pyramid structure seem to have useful properties and deserve consideration as a possible alternative to existing methods of omage segmentation. The computation for the proposed method is required 0 (log n), for an TEX>$n{\times}n$ input image.

• 전기학회논문지
• /
• 제59권3호
• /
• pp.664-668
• /
• 2010

This paper presents a System-On-a-chip (SoC) for embedded image processing and pattern recognition applications that need Gaussian Pyramid structure. The system is fully implemented into Field-Programmable Gate Array (FPGA) based on the prototyping platform. The SoC consists of embedded processor core and a hardware accelerator for Gaussian Pyramid construction. The performance of the implementation is benchmarked against software implementations on different platforms.

• 한국멀티미디어학회논문지
• /
• 제19권7호
• /
• pp.1154-1158
• /
• 2016

This paper presents a System-On-a-chip for embedded image processing applications that need Gaussian Pyramid structure. The system is fully implemented into Field-Programmable Gate Array (FPGA) based on the prototyping platform. The SoC consists of embedded processor core and a hardware accelerator for Gaussian Pyramid construction. The performance of the implementation is benchmarked against software implementations on different platforms.

• 한국통신학회논문지
• /
• 제21권12호
• /
• pp.3033-3045
• /
• 1996

In this paper, we propse an object-oriented coding method in low bit-rate channels using pyramid structure and residual image compensation. In the motion estimation step, global motion is estimated using a set of multiresolution images constructed in a pyramid structure. We split an input image into two regions based on the gradient value. Regions with larte motions obtain observation points at low resolution level to guarantee robustness to noise and to satisfy a motion constraint equation whereas regions with local motions such as eye, and lips get observation points at the original resolution level. Local motion variations and intesity variations of an image reconstructed by the golbal motion are compensated additionally by using the previous residual image component. Finally, the model failure (MF) region is compensated by the pyramid mapping of the previous displaced frame difference (DFD). Computer simulation results show that the proposed method gives better performance that the convnetional one in terms of the peak signal to noise ratio (PSNR), compression ratio (CR), and computational complexity.

• 대한전자공학회논문지
• /
• 제26권8호
• /
• pp.1227-1237
• /
• 1989

In this paper, we propose a lossless progressive image transmission scheme using hierarchical pyramid structure and classified vector quantizer in DCT domain. By adopting DCT to the hierarchical pyramid signals, we can reduce the spatial redundance. Moreover, the DCT coefficients can be encoded efficiently by using classified vector quantizer in DCT domain. The classifier is simply based on the variance of a subblock. Also, the mirror set of training set of images can improve the robustness of codebooks. Progressive image transmission can be achieved through following processes: from top to bottom level of planes in a pyramid, and from high to low AC variance class in a plane. Some simulation results with real images show that the proposed coding scheme yields a good performance at below 0.3 bpp and an excellent result at 0.409 bpp. The proposed coding scheme is well suited for lossless progressive image transmission as well as image data compression.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1988년도 추계학술발표회 논문집
• /
• pp.257-261
• /
• 1988

• 대한전자공학회논문지
• /
• 제26권10호
• /
• pp.1561-1570
• /
• 1989

In this paper, we propose an image coding scheme which combines the Laplacian pyramid structure and a hierarchical finite state classified vector quantizer in the DCT domain, namely FSDCT-CTQ. First, an optimal bit allocation problem for fixed rates DCT-CVQ on the Laplacian pyramid structure is described. In an asymptotic case, with an optimal bit allocation, a coding gain over scalar quantization of each Laplacian plane is derived. Second, it is experimentallhy shown that the Laplacian pyramid structure provides a considerable codng gain in the sense of total MMSE (minimum mean squared error). Finally, we propose an FS-DCT-CVQ which exploits the hierarchicla correlation between the Laplacian planes. Simulation results on real images show that the proposed coding scheme can reconstruct an image with 30.33 dB at 0.192 bpp, 32.45 dB at 0.385 bpp, respectively.

• 방송공학회논문지
• /
• 제27권3호
• /
• pp.283-294
• /
• 2022

딥 러닝 네트워크에서 사용되는 특징 맵은 일반적으로 영상보다 데이터가 크며 특징 맵을 전송하기 위해서는 영상의 압축률보다 더 높은 압축률이 요구된다. 본 논문은 딥러닝 기반의 영상처리에서 객체의 크기에 대한 강인성을 가지는 FPN 구조의 네트워크에서 사용되는 피라미드 특징 맵을 높은 압축률로 전송하기 위해 제안한 복원-예측 네트워크를 통해 전송된 일부 계층의 피라미드 특징 맵으로 전송하지 않은 계층의 피라미드 특징 맵을 예측하며, 압축으로 인한 손상을 복원하는 구조를 제안한다. 제안한 방법의 COCO 데이터셋 2017 Train images에 대한 객체 탐지의 성능은 rate-precision 그래프에서 VTM12.0을 통해 특징 맵을 압축한 결과 대비 BD-rate 31.25%의 성능향상을 보였고, PCA와 DeepCABAC을 통한 압축을 수행한 방법 대비 BD-rate 57.79%의 성능향상을 보였다.

• 전자공학회논문지B
• /
• 제30B권5호
• /
• pp.90-102
• /
• 1993

In this paper, we propose a prgressive image transmission technique using hierarchical pyramid data structure which is constructed based on the projection data of an image. To construct hierarchical Gaussian pyramids, we first divide an image into 4$\times$4 subblocks and generate the projection data of each block along the horizontal, vertical, diagonal, and antidiagonal directions. Among images reconstructed by backprojecting the projection data along a single direction, the one giving the minimum distortion is selected. The Gaussian pyramid is recursively generated by the proposed algorithm and the proposed Gaussian images are shown to preserve edge information well. Also, based on the projection concept a new transmission scheme of the lowest Laplacian plane is presented. Computer simulation shows that the quantitative performance of the proposed pyramid coding technique using projection concept is similar to those of the conventional methods with transmission rate reduced by 0.1 ~ 0.2 bpp and its subjective performance is shown to be better due to the edge preserving property of a projection operation.