• Korean Journal of Remote Sensing
• /
• v.27 no.6
• /
• pp.717-728
• /
• 2011

An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.128-139
• /
• 2005

Moving object boundary is very important for moving object segmentation. But the moving object boundary shows broken boundary We invent a novel space-oriented boundary linking algorithm to link the broken boundary The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundary and searches forward other terminating pixel to link within a radius. The boundary linking algorithm guarantees shortest distance linking. We also register the background from image sequence. We construct two object masks, one from the result of boundary linking and the other from the registered background, and use these two complementary object masks together for moving object segmentation. We also suppress the moving cast shadow using Roberts gradient operator. The major advantages of the proposed algorithms are more accurate moving object segmentation and the segmentation of the object which has holes in its region using these two object masks. We experiment the algorithms using the standard MPEG-4 test sequences and real video sequence. The proposed algorithms are very efficient and can process QCIF image more than 48 fps and CIF image more than 19 fps using a 2.0GHz Pentium-4 computer.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1048-1052
• /
• 2004

In this work, we have investigated a role of linking parameter in Pulse-Coupled Neural Network(PCNN) which is suggested to explain the synchronous activities among neurons in the cat cortex. Then we have found a method to determine the linking parameter for a satisfactory face detection performance in a given color image. Face detection algorithm which uses the color information is independent on pose, size and obstruction of a face. But the use of color information encounters some problems arising from skin-tone color in the background, intensity variation within faces, and presence of random noise and so on. Depending on these conditions, PCNN's linking parameters should be selected an appropriate values. First we obtained the mean and variance of the skin-tone colors by experiments. Then, we introduced a preprocess that the pixel with a mean value of skin-tone colors has the highest level value (255) and the other pixels have values between 0 and 255 according to normal distribution with a variance. This preprocessing leads to an easy decision of the linking parameter of the Pulse-Coupled Neural Network. Through experiments, it is verified that the proposed method can improve the face detection performance compared to the existing methods.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.105-107
• /
• 2004

In this work, we suggested the method which improves the efficiency of the face detection algorithm using Pulse-Coupled Neural Network. Face detection algorithm which uses the color information is independent on size, angle, and obstruction of a face. But the use of color information encounters some problems arising from skin-tone color in the background, intensity variation within faces, and presence of random noise, and so on. Depending on these conditions, we obtained the mean and variance of skin-tone colors by experiments. Then we introduce a preprocess that the pixel with a mean value of skin-tone colors has highest level value(255) and the other pixels in the skin-tone region have values between 0 and 255 according to a normal distribution with a variance. This preprocess leads to an easy decision of the linking parameters.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.255-274
• /
• 2006

Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.3
• /
• pp.146-155
• /
• 2006

A handful of previous studies have attempted to integrate socioeconomic data and remotely sensed data for urban quality of life assessment with their spatial dimension in a zonal unit. However, such a zone-based approach not only has the unrealistic assumption that all attributes of a zone are uniformly spatially distributed throughout the zone, but also has resulted in serious methodological difficulties such as the modifiable areal unit problem and the incompatibility problem with environmental data. An alternative to the zone-based approach can be a pixel-based approach which gets its spatial dimension through a pixel. This paper proposes a pixel-based approach to linking remotely sensed data with socioeconomic data in GIS for urban quality of life assessment. The pixel-based approach uses dasymetric mapping and spatial interpolation to spatially disaggregate socioeconomic data and integrates remotely sensed data with spatially disaggregated socioeconomic data for the quality of life assessment. This approach was implemented and compared with a zone-based approach using a case study of Fulton County, Georgia. Results indicate that the pixel-based approach allows for the calculation of a microscale indicator in the urban quality of life assessment and facilitates efficient data integration and visualization in the assessment although it costs an intermediate step with more processing time such as the disaggregation of zonal data. The results also demonstrate that the pixel-based approach opens up the potential for the development of new database and increased analytical capabilities in urban analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1718-1734
• /
• 2012

The proposed method in this paper is derived from Mielikainen's hiding method. However, there exist some significant differences between two methods. In Mielikainen's method, pixels are partitioned into pairs and a LSB matching function is applied to two pixels for hiding. On the contrary, the proposed method partitions pixels into groups with three pixels in each group. The bits of pixels in each group are linked by using an exclusive OR (XOR) operator in a circular way. If the number of different values between the calculated XOR values and the secret bits is smaller than or equal to 2 in a group, the proposed method can guarantee that at most one pixel is needed to be modified by adding/subtracting its value to/from one, and three secret bits can be embedded to three pixels. Through theoretical analysis, the amount of the embedded secret data in the proposed method is larger than those in other methods under the same amount of pixel modifications. Taking real images in our experiments, the quality of stego-images in the proposed method is higher than those in other methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.617-622
• /
• 2004

In this work, we suggested the method which improves the efficiency of the face detection algorithm using Pulse-Coupled Neural Network. Face detection algorithm which uses the color information is independent on pose, size and obstruction of a face. But the use of color information encounters some problems arising from skin-tone color in the background, intensity variation within faces, and presence of random noise, and so on. Depending on these conditions, we obtained the mean and variance of the skin-tone colors by experiments. Then we introduce a preprocess that the pixel with a mean value of skin-tone colors has highest level value (255) and the other pixels in the skin-tone region have values between 0 and 255 according to a normal distribution with a variance. This preprocess leads to an easy decision of the linking coefficient of Pulse-Coupled Neural Network.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.411-420
• /
• 1999

In geology, lineament features have been used to identify geological events, and many of scientists have been developed the algorithm that can be applied with the computer to recognize the lineaments. We choose several edge detection filter, line detection filters and Hough transform to detect an edge, line, and to vectorize the extracted lineament features, respectively. firstly the edge detection filter using a first-order derivative is applied to the original image In this step, rough lineament image is created Secondly, line detection filter is used to refine the previous image for further processing, where the wrong detected lines are, to some extents, excluded by using the variance of the pixel values that is composed of each line Thirdly, the thinning process is carried out to control the thickness of the line. At last, we use the Hough transform to convert the raster image to the vector one. A Landsat image is selected to extract lineament features. The result shows the lineament well regardless of directions. However, the degree of extraction of linear feature depends on the values of parameters and patterns of filters, therefore the development of new filter and the reduction of the number of parameter are required for the further study.

• 한국지형공간정보학회:학술대회논문집
• /
• 2002.11a
• /
• pp.133-140
• /
• 2002

This paper presents a method for line segment grouping used for detection of various building roofs. First, by using edge preserving filtering. noise is eliminated and then images are segmented by watershed algorithm, which preserves location of edge pixels. To extract line segments between control points from boundary of each region, we calculate curvature of each pixel on the boundary and then find the control points. Line linking is performed according to direction and length of line segments and finally the location of line segments is adjusted using gradient magnitudes of all pixels of the line segment. The algorithm has been applied to aerial imagery and the results show accurate building roof detection.