• Title/Summary/Keyword: Pixel Space

Search Result 291, Processing Time 0.033 seconds

BATHYMETRIC MODULATION ON WAVE SPECTRA

  • Liu, Cho-Teng;Doong, Dong-Jiing
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • pp.344-347
    • /
    • 2008
  • Ocean surface waves may be modified by ocean current and their observation may be severely distorted if the observer is on a moving platform with changing speed. Tidal current near a sill varies inversely with the water depth, and results spatially inhomogeneous modulation on the surface waves near the sill. For waves propagating upstream, they will encounter stronger current before reaching the sill, and therefore, they will shorten their wavelength with frequency unchanged, increase its amplitude, and it may break if the wave height is larger than 1/7 of the wavelength. These small scale (${\sim}$ 1 km changes is not suitable for satellite radar observation. Spatial distribution of wave-height spectra S(x, y) can not be acquired from wave gauges that are designed for collecting 2-D wave spectra at fixed locations, nor from satellite radar image which is more suitable for observing long swells. Optical images collected from cameras on-board a ship, over high-ground, or onboard an unmanned auto-piloting vehicle (UAV) may have pixel size that is small enough to resolve decimeter-scale short gravity waves. If diffuse sky light is the only source of lighting and it is uniform in camera-viewing directions, then the image intensity is proportional to the surface reflectance R(x, y) of diffuse light, and R is directly related to the surface slope. The slope spectrum and wave-height spectra S(x, y) may then be derived from R(x, y). The results are compared with the in situ measurement of wave spectra over Keelung Sill from a research vessel. The application of this method is for analysis and interpretation of satellite images on studies of current and wave interaction that often require fine scale information of wave-height spectra S(x, y) that changes dynamically with time and space.

  • PDF

An Effective Mixed Steganography Based on LSB and LDR (LSB와 LDR을 기반한 효과적인 혼합 스테가노그래피)

  • Ji, Seon-Su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.6
    • /
    • pp.561-566
    • /
    • 2019
  • In the Internet space, integrity and security must be maintained for secure and confidential communication, which ensures reliability between sender and receiver. Cryptography is an important factor in maintaining robustness against external attacks. For this purpose, encryption and steganography methods are used. Steganography is a method of hiding confidential information without making statistically significant changes to digital media. I propose a method of transforming the Hangul-Jamo consisting of choseong, jungseong and jongseong, and inserting them into RGB pixel values of the cover image. In order to improve security, a new blending method was used to hide the altered information in the lowest region. In this case, a mixture of LSB and LDR techniques was applied. PSNR was calculated for image quality. The PSNR of the proposed method is 43.225dB, which satisfies the lowest level.

A Moving Picture Coding Method Based on Region Segmentation Using Genetic Algorithm (유전적 알고리즘을 이용한 동화상의 영역분할 부호화 방법)

  • Jung, Nam-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.32-39
    • /
    • 2009
  • In this paper, the method of region segmentation using genetic algorithm is proposed for an improvement of efficiency in moving picture coding. A genetic algorithm is the method that searches a large probing space using only a function value for a optimal combination consecutively. By progressing both motion presumption and region segmentation at once, we can assign the motion vector in a image to a small block or a pixel respectively, and transform the capacity of coding and a signal to noise rate into a problem of optimization. That is to say, there is close correlation between region segmentation and motion presumption in motion-compensated prediction coding. This is to optimize the capacity of coding and a S/N ratio. This is to arrange the motion vector in each block of picture according to the state of optimization. Therefore, we examined both the data type of genetic algorithm and the method of data processing to obtain the results of optimal region segmentation in this paper. And we confirmed the validity of a proposed method using the test pictures by means of computer simulation.

  • PDF

The Analysis of 3-Dimensional Shape Using Non-Metric Cameras (비측량용 카메라를 이용한 3차원 형상 해석)

  • Jeong, Soo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.17 no.2
    • /
    • pp.91-99
    • /
    • 2009
  • In the field of geospatial information, 3D shape information has been considered as a frame data for GIS. Many kind of physical shape information is, especially, required for the works related with space, such as planning, maintenance, management, etc. Conventional photogrammetry was implemented under the conditions with expensive metric cameras and analytical plotters operated by experts. Nowadays, however, the metric cameras and analytical plotters are replaced by low price non-metric digital cameras and personal computers by virtue of the progress in digital photogrammetry. This study aims to investigate the technology to easily and promptly produce 3D shape information required in geospatial information system using close-range photogrammetry with non-metric digital cameras. As the results of this study, 3D shape of an experimental object was made out with a common compact digital camera and only a known length of a line component in the object and the accuracy of the dimension of 3D shape was analyzed to be less than one pixel.

  • PDF

A Spatial Multicriteria Analysis Approach to Urban Quality of Life Assessment (공간적 다기준평가 기법을 이용한 도시의 삶의 질 분석)

  • Jun, Byong-Woon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.11 no.4
    • /
    • pp.122-138
    • /
    • 2008
  • A pixel-based approach to urban quality of life assessment can be regarded as a spatial decision problem under the condition of complexity because it searches the urban space for evidence of hot spots of quality of life based on multiple and differentially weighted evaluation criteria. Such an assessment involves inappropriate scaling of several incommensurate criteria, much unstructured subjectivity in the decision maker's judgment, and the large data handling in a raster GIS environment. There is a need for identifying alternative approaches to tackle the ill-structured problem in urban quality of life assessment. In this context, this research proposes and implements a spatial multicriteria analysis approach to evaluate urban quality of life in a raster GIS environment. The implementation of this methodology is illustrated with a case study of the Atlanta metropolitan area. Results indicate that the proposed methodology may provide an alternative approach for evaluating the quality of life in an urban environment.

  • PDF

Identification of two common types of forest cover, Pinus densiflora(Pd) and Querqus mongolica(Qm), using the 1st harmonics of a Discrete Fourier Transform

  • Cha, Su-Young;Pi, Ung-Hwan;Yi, Jong-Hyuk;Park, Chong-Hwa
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.3
    • /
    • pp.329-338
    • /
    • 2011
  • The time-series normalized difference vegetation index (NDVI) product has proven to be a powerful tool to investigate the phenological information because it can monitor the change of the forests with very high time-resolution, This study described the application of the DFT analysis over the 9 year MODIS data for the identification of the two types of vegetation cover, Pinus densiflora(Pd) and Querqus mongolica(Qm) which are dominant species of evergreen and broadleaved deciduous forest, respectively, The total number of samples was 5148 reference cycles which consist of 2160 Pd and 2988 Qm. They were extracted from the pixel-based MODIS scenes over the 9 years from 2000 to 2008 of South Korea. The DFT analysis was mainly focused on the 0th and $1^{st}$ harmonic components, each of which represents the mean value and the variation amplitude of the NDVI over the years, respectively. The $0^{th}$ harmonic values of the vegetation Pd and Qm averaged over the 9 years were 0.74 and 0.65, respectively. This implies that Pd has a higher NDVI than Qm. Similarly obtained $1^{st}$ harmonic values of Pd and Qm were 0.19 and 0.27, respectively. This can be intuitively understood considering that the seasonal variation of Qm is much larger than Pd. This distinctive difference of the $1^{st}$ harmonic value has been used to identify evergreen and deciduous forests. Overall agreement between the Fourier analysis-based map and the actal vegetation map has been estimated to be as high as 75%. This study found that the DFT analysis can be a concise and repeatable method to separate and trace the changes of evergreen and deciduous forest using the annual NDVI cycles.

Data Hiding Using Sequential Hamming + k with m Overlapped Pixels

  • Kim, Cheonshik;Shin, Dongkyoo;Yang, Ching-Nung;Chen, Yi-Cheng;Wu, Song-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6159-6174
    • /
    • 2019
  • Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n - k) and HC (n, n - k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n = 2k -1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

A block-based face detection algorithm for the efficient video coding of a videophone (효율적인 화상회의 동영상 압축을 위한 블록기반 얼굴 검출 방식)

  • Kim, Ki-Ju;Bang, Kyoung-Gu;Moon, Jeong-Mee;Kim, Jae-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9C
    • /
    • pp.1258-1268
    • /
    • 2004
  • We propose a new fast, algorithm which is used for detecting frontal face in the frequency domain based on human skin-color using OCT coefficient of dynamic image compression and skin color information. The region where each pixel has a value of skin-color were extracted from U and V value based on DCT coefficient obtained in the process of Image compression using skin-color map in the Y, U, V color space A morphological filter and labeling method are used to eliminate noise in the resulting image We propose the algorithm to detect fastly human face that estimate the directional feature and variance of luminance block of human skin-color Then Extraction of face was completed adaptively on both background have the object analogous to skin-color and background is simple in the proposed algorithm The performance of face detection algorithm is illustrated by some simulation results earned out on various races We confined that a success rate of 94 % was achieved from the experimental results.

Design of a Real-time Algorithm Using Block-DCT for the Recognition of Speed Limit Signs (Block-DCT를 이용한 속도 제한 표지판 실시간 인식 알고리듬의 설계)

  • Han, Seung-Wha;Cho, Han-Min;Kim, Kwang-Soo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12B
    • /
    • pp.1574-1585
    • /
    • 2011
  • This paper proposes a real-time algorithm for speed limit sign recognition for advanced safety vehicle system. The proposed algorithm uses Block-DCT in extracting features from a given ROI(Region Of Interest) instead of using entire pixel values as in previous works. The proposed algorithm chooses parts of the DCT coefficients according to the proposed discriminant factor, uses correlation coefficients and variances among ROIs from training samples to reduce amount of arithmetic operations without performance degradation in classification process. The algorithm recognizes the speed limit signs using the information obtained during training process by calculating LDA and Mahalanobis Distance. To increase the hit rate of recognition, it uses accumulated classification results computed for a sequence of frames. Experimental results show that the hit rate of recognition for sequential frames reaches up to 100 %. When compared with previous works, numbers of multiply and add operations are reduced by 69.3 % and 67.9 %, respectively. Start after striking space key 2 times.

Comparison between Possibilistic c-Means (PCM) and Artificial Neural Network (ANN) Classification Algorithms in Land use/ Land cover Classification

  • Ganbold, Ganchimeg;Chasia, Stanley
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.7 no.1
    • /
    • pp.57-78
    • /
    • 2017
  • There are several statistical classification algorithms available for land use/land cover classification. However, each has a certain bias or compromise. Some methods like the parallel piped approach in supervised classification, cannot classify continuous regions within a feature. On the other hand, while unsupervised classification method takes maximum advantage of spectral variability in an image, the maximally separable clusters in spectral space may not do much for our perception of important classes in a given study area. In this research, the output of an ANN algorithm was compared with the Possibilistic c-Means an improvement of the fuzzy c-Means on both moderate resolutions Landsat8 and a high resolution Formosat 2 images. The Formosat 2 image comes with an 8m spectral resolution on the multispectral data. This multispectral image data was resampled to 10m in order to maintain a uniform ratio of 1:3 against Landsat 8 image. Six classes were chosen for analysis including: Dense forest, eucalyptus, water, grassland, wheat and riverine sand. Using a standard false color composite (FCC), the six features reflected differently in the infrared region with wheat producing the brightest pixel values. Signature collection per class was therefore easily obtained for all classifications. The output of both ANN and FCM, were analyzed separately for accuracy and an error matrix generated to assess the quality and accuracy of the classification algorithms. When you compare the results of the two methods on a per-class-basis, ANN had a crisper output compared to PCM which yielded clusters with pixels especially on the moderate resolution Landsat 8 imagery.