• Title/Summary/Keyword: Neighborhood method

Search Result 509, Processing Time 0.034 seconds

The Roof Construction Method of Urban Hanok in Bukchon, Seoul (북촌도시한옥의 지붕가구(架構) 특징에 관한 연구)

  • Song, In-He;Kim, Young-Soo
    • Journal of architectural history
    • /
    • v.14 no.4 s.44
    • /
    • pp.87-100
    • /
    • 2005
  • We have focused on the roof construction method of Urban Hanok in Bukchon, Seoul. The Urban Hanok, urban traditional housing type, had been evolved In modern context from 1930's to 1960's. We have confused Urban Hanok with traditional Hanok, because they have similar figures. But Urban Hanok have the characteristics as a result of the roof construction method. The purpose of this paper is to define Urban Hanok more concretely, thus we payed attention to the roof structure, specially to the comer that each roof structure meets. So we got some characteristics of the roof construction method of Urban Hanok in Bukchon. First, the roof construction methods of the roof are transformed at the corner parts, where three purlin structure and five purlin structure meet. The collision of the different roof structure has made a lot of types. Second, the roof slope of Urban Hanok is more gentle than traditional Hanok, that is caused by ornamental double eaves and awnings. Finally these characteristics are results of the compact lot size in urban neighborhood. The construction method is a inclusive word that contain materials, composition, ornament and social common sense. With the understanding on the roof construction method of Urban Hanok, we can define the identity and the value of Urban Hanok, And we can suggest the policy and the design guidelines for the reservation and rehabilitation for Urban Hanok of Bukchon, Seoul.

  • PDF

An Evaluation of the Neighborhood Walking Environment Using GIS Method -Focusing on the Case Study of Changwon City- (GIS기법을 이용한 근린주구 보행환경평가 -창원시를 사례지역으로-)

  • Park, Kyung-Hun;Lee, Woo-Sung;Byeon, Ji-Hye
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.13 no.4
    • /
    • pp.78-90
    • /
    • 2010
  • This research tried to suggest a method of DB construction in the field using evaluation variables and Mobile GIS focusing on Changwon City as a leading study to encourage walking and biking in everyday life. First, twenty evaluation variables of WEs(walking environments) were selected through the literature review, and also scored separately. Second, the field survey-DB of each variable was built effectively using Mobile GIS. Finally, WEs were evaluated synthetically based on the obtained data. The results of this research are summarized as follows. While the WE of the zones located in the fringe of Changwon square were generally got a high score as over 42, other zones located in detached or row house area were evaluated relatively highly bad. Findings from this research will help in determining the zone required improvement of WEs or easy access to main destination such as a park, shopping center, school, etc. and also selecting variables of WEs, needed an intensive improvement, in the selected zone after comparing the results of field and questionnaire survey. Furthermore, those will be used as a means of decision making support for planing, designing and maintaining of WEs to promote people's physical activity in their daily lives.

Basic Research for the Recognition Algorithm of Tongue Coatings for Implementing a Digital Automatic Diagnosis System (디지털 자동 설진 시스템 구축을 위한 설태 인식 알고리즘 기초 연구)

  • Kim, Keun-Ho;Ryu, Hyun-Hee;Kim, Jong-Yeol
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.1
    • /
    • pp.97-103
    • /
    • 2009
  • The status and the property of a tongue are the important indicators to diagnose one's health like physiological and clinicopathological changes of inner organs. However, the tongue diagnosis is affected by examination circumstances like a light source, patient's posture, and doctor's condition. To develop an automatic tongue diagnosis system for an objective and standardized diagnosis, classifying tongue coating is inevitable but difficult since the features like color and texture of the tongue coatings and substance have little difference, especially in the neighborhood on the tongue surface. The proposed method has two procedures; the first is to acquire the color table to classify tongue coatings and substance by automatically separating coating regions marked by oriental medical doctors, decomposing the color components of the region into hue, saturation and brightness and obtaining the 2nd order discriminant with statistical data of hue and saturation corresponding to each kind of tongue coatings, and the other is to apply the tongue region in an input image to the color table, resulting in separating the regions of tongue coatings and classifying them automatically. As a result, kinds of tongue coatings and substance were segmented from a face image corresponding to regions marked by oriental medical doctors and the color table for classification took hue and saturation values as inputs and produced the classification of the values into white coating, yellow coating and substance in a digital tongue diagnosis system. The coating regions classified by the proposed method were almost the same to the marked regions. The exactness of classification was 83%, which is the degree of correspondence between what Oriental medical doctors diagnosed and what the proposed method classified. Since the classified regions provide effective information, the proposed method can be used to make an objective and standardized diagnosis and applied to an ubiquitous healthcare system. Therefore, the method will be able to be widely used in Oriental medicine.

Continuous K-Nearest Neighbor Query Processing Considering Peer Mobilities in Mobile P2P Networks (모바일 P2P 네트워크에서 피어의 이동성을 고려한 연속적인 k-최근접 질의 처리)

  • Bok, Kyoung-Soo;Lee, Hyun-Jung;Park, Young-Hun;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.47-58
    • /
    • 2012
  • In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

Unsupervised Machine Learning based on Neighborhood Interaction Function for BCI(Brain-Computer Interface) (BCI(Brain-Computer Interface)에 적용 가능한 상호작용함수 기반 자율적 기계학습)

  • Kim, Gui-Jung;Han, Jung-Soo
    • Journal of Digital Convergence
    • /
    • v.13 no.8
    • /
    • pp.289-294
    • /
    • 2015
  • This paper proposes an autonomous machine learning method applicable to the BCI(Brain-Computer Interface) is based on the self-organizing Kohonen method, one of the exemplary method of unsupervised learning. In addition we propose control method of learning region and self machine learning rule using an interactive function. The learning region control and machine learning was used to control the side effects caused by interaction function that is based on the self-organizing Kohonen method. After determining the winner neuron, we decided to adjust the connection weights based on the learning rules, and learning region is gradually decreased as the number of learning is increased by the learning. So we proposed the autonomous machine learning to reach to the network equilibrium state by reducing the flow toward the input to weights of output layer neurons.

A Study on the Preprocessing Method Using Construction of Watershed for Character Image segmentation

  • Nam Sang Yep;Choi Young Kyoo;Kwon Yun Jung;Lee Sung Chang
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.814-818
    • /
    • 2004
  • Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

  • PDF

Enhanced Image Magnification Using Edge Information (에지정보를 이용한 개선된 영상확대기법)

  • Je, Sung-Kwan;Cho, Jae-Hyun;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2343-2348
    • /
    • 2006
  • Image magnification is among the basic image processing operations. The most commonly used technique for image magnification are based on interpolation method(such as nearest neighbor, bilinear and cubic interpolation). However, the magnified images produced by the techniques that often appear a variety of undesirable image artifacts such as 'blocking' and 'blurring' or too takes the processing time into the several processing for image magnification. In this paper, we propose image magnification method which uses input image's sub-band information such as edge information to enhance the image magnification method. We use the whole image and not use the one's neighborhood pixels to detect the edge information of the image that isn't occurred the blocking phenomenon. And then we emphasized edge information to remove the blurring phenomenon which incited of edge information. Our method, which improves the performance of the traditional image magnification methods in the processing time, is presented. Experiment results show that the proposed method solves the drawbacks of the image magnification such as blocking and blurring phenomenon, and has a higher PSNR and Correlation than the traditional methods.

Image Segmentation Using Anisotropic Diffusion Based on Diagonal Pixels (대각선 방향 픽셀에 기반한 이방성 확산을 이용한 영상 분할)

  • Kim Hye-Suk;Yoon Hyo-Sun;Toan Nguyen Dinh;Yoo Jae-Myung;Lee Guee-Sang
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.21-29
    • /
    • 2007
  • Anisotropic diffusion is one of the widely used techniques in the field of image segmentation. In the conventional anisotropic diffusion [1]-[6], usually 4-neighborhood directions are used: north, south, west and east, except the image diagonal directions, which results in the loss of image details and causes false contours. Existing methods for image segmentation using conventional anisotroplc diffusion can't preserve contour information, or noises with high gradients become more salient as the umber of times of the diffusion increases, resulting in over-segmentation when applied to watershed. In this paper, to overcome the shortcoming of the conventional anisotropic diffusion method, a new arusotropic diffusion method based on diagonal edges is proposed. And a method of watershed segmentation is applied to the proposed method. Experimental results show that the process time of the proposed method including diagonal edges over conventional methods can be up to 2 times faster and the Circle image quality improvement can be better up to $0.45{\sim}2.33(dB)$. Experiments also show that images are segmented very effectively without over segmentation.

Improved Shape Extraction Using Inward and Outward Curve Evolution (양방향 곡선 전개를 이용한 개선된 형태 추출)

  • Kim Ha-Hyoung;Kim Seong-Kon;Kim Doo-Young
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.1
    • /
    • pp.23-31
    • /
    • 2000
  • Iterative curve evolution techniques are powerful methods for image segmentation. Classical methods proposed curve evolutions which guarantee close contours at convergence and, combined with the level set method, they easily handled curve topology changes. In this paper, we present a new geometric active contour model based on level set methods introduced by Osher & Sethian for detection of object boundaries or shape and we adopt anisotropic diffusion filtering method for removing noise from original image. Classical methods allow only one-way curve evolutions : shrinking or expanding of the curve. Thus, the initial curve must encircle all the objects to be segmented or several curves must be used, each one totally inside one object. But our method allows a two-way curve evolution : parts of the curve evolve in the outward direction while others evolve in the inward direction. It offers much more freedom in the initial curve position than with a classical geodesic search method. Our algorithm performs accurate and precise segmentations from noisy images with complex objects(jncluding sharp angles, deep concavities or holes), Besides it easily handled curve topology changes. In order to minimize the processing time, we use the narrow band method which allows us to perform calculations in the neighborhood of the contour and not in the whole image.

  • PDF

Tabu search Algorithm for Maximizing Network Lifetime in Wireless Broadcast Ad-hoc Networks (무선 브로드캐스트 애드혹 네트워크에서 네트워크 수명을 최대화하기 위한 타부서치 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.8
    • /
    • pp.1196-1204
    • /
    • 2022
  • In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.