• Journal of Biosystems Engineering
• /
• v.42 no.2
• /
• pp.117-125
• /
• 2017

Purpose: Damage to pulse crops by wild birds is a serious problem. The damage is to such an extent that the rate of damage during the period between seeding and cotyledon stages reaches 54.6% on an average. In this study, a crop-position detection method was developed wherein infrared (IR) sensors were used to determine the cotyledon position under a vinyl mulch. Methods: IR sensors that helped measure the temperature were used to locate the cotyledons below the vinyl mulch. A single IR sensor module was installed at three locations of the crops (peanut, red lettuce, and crown daisy) in the cotyledon stage. The representative thermal response of a $16{\times}4$ pixel area was detected using this sensor in the case where the distance from the target was 25 cm. A spatial image was applied to the two-dimensional temperature distribution using a non-integral moving-average method. The collected data were first processed by taking the moving average via interpolation to determine the frame where the variance was the lowest for a resolution unit of 1.02 cm. Results: The temperature distribution was plotted corresponding to a distance of 10 cm between the crops. A clear leaf pattern of the crop was visually confirmed. However, the temperature distribution after the normalization was unclear. The image conversion and frequency-conversion graphs were obtained based on the moving average by averaging the points corresponding to a frequency of 40 Hz for 8 pixels. The most optimized resolutions at locations 1, 2, and 3 were found on 3.4, 4.1, and 5.6 Pixels, respectively. Conclusions: In this study, to solve the problem of damage caused by birds to crops in the cotyledon stage after seeding, the vinyl mulch is punched after seeding. The crops in the cotyledon stage could be accurately located using the proposed method. By conducting the experiments using the single IR sensor and a sliding mechanical device with the help of a non-integral interpolation method, the crops in the cotyledon stage could be precisely located.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.421-427
• /
• 2011

The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.

• Korean Journal of Optics and Photonics
• /
• v.9 no.6
• /
• pp.428-432
• /
• 1998

We fabricated 1$\times$8 array of GaAs/AlGaAs quantum well infrared photodetectors for the long wavelength infrared detection which is based on the bound-continuum intersubband transition, and characterized its electrical and optical properties. The device was grown on SI-GaAs(100) by the molecular beam epitaxy and consisted of 25 period of 40 ${\AA} $ GaAs well and 500 ${\AA} $ $Al_{0.28} Ga_{0.72}$ As barrier. To reduce the possibility of interface states only the center 20 ${\AA} $ of the well was doped with Si ($N_D=2{\times}10^{18} cm^{-3}$). We etched the sample to make square mesas of 200$\times$200 $\mu\textrm{m}^2$ and made an ohmic contact on each pixel with Au/Ge. Current-voltage characteristics and photoresponse spectrum of each detector reveal that the array was highly uniform and stable. The spectral responsivity and the detectivity $D^＊$ were measured to be 180,260 V/W and $4.9{\times}10^9cm\sqrt{Hz}/W$ respectively at the peak wavelength of $\lambda$ =7.8 $\mu\textrm{m}$ and at T=10 K.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.1-8
• /
• 2008

The belief propagation method that has been studied recently yields good performance in disparity extraction. The method in which a target function is modeled as an energy function based on Markov random field(MRF), solves the stereo matching problem by finding the disparity to minimize the energy function. MRF models provide robust and unified framework for vision problem such as stereo and image restoration. the belief propagation method produces quite correct results, but it has difficulty in real time implementation because of higher computational complexity than other stereo methods. To relieve this problem, in this paper, we propose a fast algorithm of the belief propagation method. Energy function consists of a data term and a smoothness tern. The data term usually corresponds to the difference in brightness between correspondences, and smoothness term indicates the continuity of adjacent pixels. Smoothness information is created from messages, which are assigned using four different message arrays for the pixel positions adjacent in four directions. The processing time for four message arrays dominates 80 percent of the whole program execution time. In the proposed method, we propose an algorithm that dramatically reduces the processing time require in message calculation, since the message.; are not produced in four arrays but in a single array. Tn the last step of disparity extraction process, the messages are called in the single integrated array and this algorithm requires 1/4 computational complexity of the conventional method. Our method is evaluated by comparing the disparity error rates of our method and the conventional method. Experimental results show that the proposed method remarkably reduces the execution time while it rarely increases disparity error.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.361-368
• /
• 2014

The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.4
• /
• pp.287-293
• /
• 2018

It is prerequisite to generate epipolar resampled images by reducing the y-parallax for accurate and efficient processing of satellite stereo images. Minimizing y-parallax requires the accurate sensor modeling that is carried out with ground control points. However, the approach is not feasible over inaccessible areas where control points cannot be easily acquired. For the case, a relative orientation can be utilized only with conjugate points, but its accuracy for satellite sensor should be studied because the sensor has different geometry compared to well-known frame type cameras. Therefore, we carried out the bias-compensation of RPCs (Rational Polynomial Coefficients) without any ground control points to study its precision and effects on the y-parallax in epipolar resampled images. The conjugate points were generated with stereo image matching with outlier removals. RPCs compensation was performed based on the affine and polynomial models. We analyzed the reprojection error of the compensated RPCs and the y-parallax in the resampled images. Experimental result showed one-pixel level of y-parallax for Kompsat-3 stereo data.

• Journal of the Korean earth science society
• /
• v.30 no.2
• /
• pp.234-246
• /
• 2009

Characteristics of speckle errors of Sea-viewing Wide Field-of-view Sensor (SeaWiFS) chlorophyll-${\alpha}$ concentration were analyzed, and its causes were investigated by using SeaWiFS data in the East Sea from September 1997 to December 2007. The speckles with anomalously high concentrations were randomly distributed and showed remarkably high bias of greater than $10mg/m^3$, compared with their neighboring pixels. The speckles tended to appear frequently in winter, which might be related to cloud distribution. Ten-year averaged cloudiness of winter was much higher over the southeastern part, with frequent speckles, than the northwestern part of the East Sea. Statistical analysis results showed that the number of the speckles was increased as cloudiness increased. Normalized water-leaving radiance of the speckle pixel was considerably low at the short wavelengths (443, 490, and 510 nm), whereas the radiance at 555 nm band was normal. These low measurements produced extraordinarily high concentration from the chlorophyll-${\alpha}$ estimation formula. This study presented the speckle errors of SeaWiFS chlorophyll-${\alpha}$ concentration in the East Sea and suggested that more reliable chlorophyll-${\alpha}$ data based on appropriate ocean color remote sensing techniques should be used for the oceanic application researches.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.65-65
• /
• 2002

In remote sensing, images are acquired over the same area by sensors of different spectral ranges (from the visible to the microwave) and/or with different number, position, and width of spectral bands. These images are generally partially redundant, as they represent the same scene, and partially complementary. For many applications of image classification, the information provided by a single sensor is often incomplete or imprecise resulting in misclassification. Fusion with redundant data can draw more consistent inferences for the interpretation of the scene, and can then improve classification accuracy. The common approach to the classification of multisensor data as a data fusion scheme at pixel level is to concatenate the data into one vector as if they were measurements from a single sensor. The multiband data acquired by a single multispectral sensor or by two or more different sensors are not completely independent, and a certain degree of informative overlap may exist between the observation spaces of the different bands. This dependence may make the data less informative and should be properly modeled in the analysis so that its effect can be eliminated. For modeling and eliminating the effect of such dependence, this study employs a strategy using self and conditional information variation measures. The self information variation reflects the self certainty of the individual bands, while the conditional information variation reflects the degree of dependence of the different bands. One data set might be very less reliable than others in the analysis and even exacerbate the classification results. The unreliable data set should be excluded in the analysis. To account for this, the self information variation is utilized to measure the degrees of reliability. The team of positively dependent bands can gather more information jointly than the team of independent ones. But, when bands are negatively dependent, the combined analysis of these bands may give worse information. Using the conditional information variation measure, the multiband data are split into two or more subsets according the dependence between the bands. Each subsets are classified separately, and a data fusion scheme at decision level is applied to integrate the individual classification results. In this study. a two-level algorithm using hierarchical clustering procedure is used for unsupervised image classification. Hierarchical clustering algorithm is based on similarity measures between all pairs of candidates being considered for merging. In the first level, the image is partitioned as any number of regions which are sets of spatially contiguous pixels so that no union of adjacent regions is statistically uniform. The regions resulted from the low level are clustered into a parsimonious number of groups according to their statistical characteristics. The algorithm has been applied to satellite multispectral data and airbone SAR data.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.99-111
• /
• 2009

The result of Image segmentation, an indispensable process in image processing, significantly affects the analysis of an image. Despite the significance of image segmentation, it produces some problems when the variation of pixel values is large, or the boundary between background and an object is not clear. Also, these problems occur frequently when many objects in an image are placed very close by. In this paper, when the shape of objects in an image is circular, we proposed an algorithm which segment an each object in an image using the geometric characteristic of circular shape. The proposed algorithm is composed of 4 steps. First is the boundary edge extraction of whole object. Second step is to find the candidate points for further segmentation using the boundary edge in the first step. Calculating the representative circles using the candidate points is the third step. Final step is to draw the line connecting the overlapped points produced by the several erosions and dilations of the representative circles. To verify the efficiency of the proposed algorithm, the algorithm is compared with the three well-known cell segmentation algorithms. Comparison is conducted by the number of segmented region and the correctness of the inner segment line. As the result, the proposed algorithm is better than the well-known algorithms in both the number of segmented region and the correctness of the inner segment line by 16.7% and 21.8%, respectively.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.4_1
• /
• pp.319-326
• /
• 2014

The accurate geo-referencing processes that apply ground control points is prerequisite for effective end use of HRSI (High-resolution satellite imagery). Since the conventional control point acquisition by human operator takes long time, demands for the automated matching to existing reference data has been increasing its popularity. Among many options of reference data, the airborne LiDAR (Light Detection And Ranging) data shows high potential due to its high spatial resolution and vertical accuracy. Additionally, it is in the form of 3-dimensional point cloud free from the relief displacement. Recently, a new matching method between LiDAR data and HRSI was proposed that is based on the image projection of whole LiDAR data into HRSI domain, however, importing and processing the large amount of LiDAR data considered as time-consuming. Therefore, we wmotivated to ere propose a local LiDAR chip generation for the HRSI geo-referencing. In the procedure, a LiDAR point cloud was rasterized into an ortho image with the digital elevation model. After then, we selected local areas, which of containing meaningful amount of edge information to create LiDAR chips of small data size. We tested the LiDAR chips for fully-automated geo-referencing with Kompsat-2 and Kompsat-3 data. Finally, the experimental results showed one-pixel level of mean accuracy.