• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.876-877
• /
• 1995

The techniques for the estimation of motion vector from the image sequence assume implicitly that the intensity of image is constant through the time. But this assumption can be distored by such causes as the added noises and the sub-pel motion following the sampling, and the errors can be generated on the motion estimation by the change of intensity. In this paper, we analyzed theoretically the effect of the change of intensity by the noise on the motion estimation with the white Gaussian noise. We know a fact that the signal may be fluctuated to reduce the effect of the noise and so the sampling rate have to make down. Also we confirmed the theoretically analysis through the experiments which investigated the relation between the noises and the sampling rates.

• Proceedings of the KSME Conference
• /
• 2001.11b
• /
• pp.410-416
• /
• 2001

An algorithm of 3-D particle image velocimetry(3D-PIV) was developed for the measurement of 3-D velocity field of complex flows. The measurement system consists of two or three CCD camera and one RGB image grabber. In this study, stereo photogrammetty was applied for the 3-D matching of tracer particles. Epipolar line was used to decect the stereo pair. 3-D CFD data was used to estimate algorithm. 3-D position data of the first frame and the second frame was used to find velocity vector. Continuity equation was applied to extract error vector. The algorithm result involved error vecotor of about 0.13 %. In Pentium III 450MHz processor, the calculation time of cross-correlation for 1500 particles needed about 1 minute.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.37-40
• /
• 2000

A fast method of Hangul address word verification is presented in this Paper. Pre-segmentation and recognition by DP matching is adopted in this paper. An address line image is over-segmented by analyzing the topology of connected components and the projection profile. A fast individual Hangul character verifier was developed by applying SVM (Support Vector Machine). The segmentation hypothesis was represented by lattice structure, and a best path search by dynamic programming generates the most probable segmentation path and the final verification score. The word verifier was tested on 310 address image DB, and it show the possibility of improvements of this method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1091-1098
• /
• 1995

This paper proposes an efficient noiseless encoding method of vector quantization(VQ) index using a dynamic index mapping. Using high interblock correlation, the proposed index mapper transforms an index into a new one with lower entropy. In order to achieve good performance with low computational complexity, we adopt 'the sum of differences in pixel values on the block boundaries' as the cost function for index mapping. Simulation results show that the proposed scheme reduces the average bitrate by 40 - 50 % in ordinary VQ system for image compression. In addition, it is shown that the proposed index mapping method can be also applied to mean-residual VQ system, which allows the reduction of bitrate for VQ index by 20 - 30 %(10 - 20 % reduction in total bitrate). Since the proposed scheme is one for noiseless encoding of VQ index, it provides the same quality of the reconstructed image as the conventional VQ system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.1
• /
• pp.39-47
• /
• 2001

A blocked zerotree coding algorithm for compression of subband image is proposed. Significance of blocks with respect to a certain threshold are coded with a set of transition rules for the significance of blocks. Significant blocks are quantized by vector quantization. The basic idea for this coding approach are: 1) Subband images are coded by blocks, 2) Important blocks based on the significance of blocks are coded and quantized, 3) Multiband codebook which is composed of sub-codebooks dedicated for each threshold and subband level is adapted to produce good reproduction vectors for vector quantization. The compression results are similar to Shapiro's zerotree coding even though ours are obtained without entropy coding of bit streams from blocked zerotree encoder. If an entropy coding is applied to the bitstream, PSNR will be improved.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.6
• /
• pp.581-590
• /
• 2014

With rapid land development, land category should be updated on a regular basis. However, manual field surveys have certain limitations. In this study, attempts were made to extract a feature vector considering spectral signature by parcel, PIMP (Percent Imperviousness), texture, and VIs (Vegetation Indices) based on RapidEye satellite image and cadastral map. A total of nine land categories in which feature vectors were significantly extracted from the images were selected and classified using SVM (Support Vector Machine). According to accuracy assessment, by comparing the cadastral map and classification result, the overall accuracy was 0.74. In the paddy-field category, in particular, PO acc. (producer's accuracy) and US acc. (user's accuracy) were highest at 0.85 and 0.86, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2341-2348
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on mean-residual metod. Sub-blocks of an image are encoded using mean-residual method where mean value is predicted according to that of neighboring blocks. Projection scheme with 8 directions is applied to the compression of residual signals of blocks. Projection vectors are finite-state vector quantized according to the projection angle of nighboring blocks in order to exploit the correlation among them. Side information to represent the repetition of projection is run-length coded while the information for projection direction is compressed using entropy encoding. The proposed scheme apears to be better in PSNR performance when compared with conventional projection scheme as well as in subjective quality preserving the edges of images better than most tranform methods which usually require heavy computation load.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.1
• /
• pp.42-50
• /
• 1997

Vector quantization has shown to be useful for compressing data related with a wide rnage of applications such as image processing, speech processing, and weather satellite. Neural networks of images this paper propses a efficient neural network learning algorithm, called learning count control algorithm based on the frquency sensitive learning algorithm. This algorithm can train a results more codewords can be assigned to the sensitive region of the human visual system and the quality of the reconstructed imate can be improved. We use a human visual systrem model that is a cascade of a nonlinear intensity mapping function and a modulation transfer function with a bandpass characteristic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.240-248
• /
• 2002

This paper presents a new motion-based segmentation algorithm of moving objects in image sequences. The procedure toward complete segmentation consists of two steps: pixel labeling and motion segmentation. In the first step, we assign a label to each pixel according to magnitude of velocity vector. And velocity vector is generated by optical flow. And, in the second step, we have modeled motion field as a markov random field for noise canceling and make a segmentation of motion through energy minimization. We have demonstrated the efficiency of the presented method through experimental results.