• 전기학회논문지
• /
• 제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.

• 대한원격탐사학회지
• /
• 제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.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.88-96
• /
• 1994

In this paper, we propose a subband pyramid image coding scheme that uses ECVQ (ntropy Constrained Vector Quantizer). In subband pyramid image coding, each subband can be encoded with a coder matched to the statistics of that particular subband, and available versions of the original image at different resolution are easily obtained. ECVQ, aiming at the minimization of the distortion for a fixed entropy of the quantizer output, is well combined with the subband pyramid image coding which yields high compression ratio and good image quality. The optimum bit allocation to each subbands corresponds to the points where the individual distortion rate curves are of particular slope, weighted to the number of samples in that subband, in designing ECVQ.

• 대한전자공학회논문지
• /
• 제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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2006년도 춘계학술대회 논문집
• /
• pp.483-484
• /
• 2006

This paper introduces an improved surface matching algorithm that can be used to reconstruct the surface topography of an object that is scanned from multiple overlapping regions by an AFM. The essence of the image matching technique is stitching two neighboring images intentionally overlapped with each other. To enhance the computational efficiency, this paper introduces a pyramid matching algorithm which makes use of reduced images for primary images. The results show that the proposed image pyramid matching algorithm is useful fer enhancing the computational efficiency.

• 한국멀티미디어학회논문지
• /
• 제22권10호
• /
• pp.1160-1167
• /
• 2019

Because of the dynamic range limitation of digital equipment, it is impossible to obtain dark and bright areas at the same time with one shot. In order to solve this problem, an exposure fusion technique for fusing a plurality of images photographed at different exposure amounts into one is being studied. Among them, Laplacian pyramid decomposition based fusion method can generate natural HDR image by fusing images of various scales. But this requires a lot of computation time. Therefore, in this paper, we propose an approximation technique that achieves similar performance and greatly shortens computation time. The concept of vanishing point image for approximation is introduced, and the validity of the proposed approach is verified by comparing the computation time with the resultant image.

• 반도체디스플레이기술학회지
• /
• 제19권1호
• /
• pp.6-10
• /
• 2020

Unlike modern photography technology, in the early days, efforts to physically compose an image with a concept similar to the current photograph have not been popular or commercially successful. The limitation of the use of images as artistic media or recordings has reached the stage of introducing the technology of image analysis to automate the function that humans recognize and judge through vision. In addition, the accuracy of the image has exceeded the human visual ability, enabling the technology that enables the step of recognizing and informing the fact that the human is not aware of it. Based on such a base, the range that can be applied through the image data in the future era can be said to be unpredictable, and the technology that targets large scale image database instead of an image is also expanding the possibilities as a new application technology. In order to identify a particular image from a massive database, different methodologies have been introduced. In this paper, we discuss image identifier production methods based on multi-resolution pyramid.

• 한국통신학회논문지
• /
• 제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.