• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.678-691
• /
• 2000

A variety of multimedia applications require multimedia database management systems to manage multimedia data, such as text, image, and video, as well as t support content-based image or video retrieval. In this paper we design and implement a content-based image retrieval system, BADA-IV/I$^2$R(Image Information Retrieval), which is developed based on BADA-IV multimedia database management system. In this system image databases can be efficiently constructed and retrieved with the visual features, such as color, shape, and texture, of image. we extend SQL statements to define image query based on both annotations and visual features of image together. A high-dimensional index structure, called CIR-tree, is also employed in the system to provide an efficient access method to image databases. We show that BADA-IV/I$^2$R provides a flexible way to define query for image retrieval and retrieves image data fast and effectively: the effectiveness and performance of image retrieval are shown by BEP(Bull's Eye Performance) that is used to measure the retrieval effectiveness in MPEG-7 and comparing the performance of CIR-tree with those of X-tree and TV-tree, respectively.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.6
• /
• pp.460-466
• /
• 2010

These days, it is getting important to have more chances to visit natural environment for the wellbeing life. The advancement of digital technologies allows us to get useful information regardless of time and location. In this paper, we investigate a way of improving user experience in the natural green environment using the digital technologies. This paper proposes a system called Green-UX-Story which supports users to create and share their story through the online and offline green experience. The system consists of two main systems: the "Story-Field" and the "Story-Tree". The Story-Field consists of a certain number of the Story-Trees allocated to a certain green site. In the Story-Field, users can see the Story-Trees that are owned by other users and share their stories. The Story-Tree contains the user-story in each branch and green information that are captured by the user on the web. The Story-Tree is generated using the L-system algorithm as the user adds stories. The main purpose of the system is to enable users to write their green stories from the both online and offline experiences. This paper describes the system configuration and the user scenario of the Green-UX-story.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.134-144
• /
• 1996

In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.127-130
• /
• 2005

Internal cities such as gray level been enclosed to building forest are paying a lot of efforts and expenses to change to green city that park and street tree get put together. By the example, 'GREEN CITY of PUSAN 21' progress to decorate army facilities like the park, and to plant street trees in several places of city plan in Pusan. And urban environment that big cities of advanced nation are agreeable is making in the large park and road street trees at several places in downtown. Because price of tree for the park is very expensive, tree management system was all-important. In this paper, Motes deliver the sensor information in each tree through radio sensor network by server side. This information can use in state grasping of tree, harmful insects courtesy call etc and this system design was suggested to inform to mode of life administration scholars.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.21 no.6
• /
• pp.1-13
• /
• 2018

Mapping radiation heat flux of urban area is essential for urban design and landscape planning. Because controlling urban geometry and generating green space are important urban design strategies for reducing urban heat, urban planner and designer need to recognize the micro urban heat distribution for adequate urban planning. This study suggests a new methodology for mapping urban radiation heat flux in a micro scale considering buildings and trees' shade. For doing that, firstly, we calculate net radiation for each urban surfaces (building, road (not shaded, building shaded, tree shaded), ground (not shaded, building shaded, tree shaded), tree (not shaded, building shaded)). Then, by multiplying the area ratio of surfaces to the net radiation, we can obtain the radiation heat flux in micro-scale. The estimated net radiation results were found to be robust with a $R^2$ of 90%, which indicates a strong explanatory power of the model. The radiation heat flux map for 12h $17^{th}$ August explains that areas under the building and tree have lower net radiation heat flux, indicating that shading is a good strategy for reducing incident radiation. This method can be used for developing thermal friendly urban plan.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1537-1544
• /
• 2022

When designing chip, it considers design specification, timing problem, and clock synchronization on place & route (P&R) process. P&R process is complicated because of considering various factors. Chip uses clock tree synthesis (CTS) to reduce clock path delay. The purpose of this study is to examine shallow-CTS algorithm for checking clock tree synthesizable. Using open source Parser-Verilog, register transfer level (RTL) synthesizable Verilog file is parsed and it uses Pre-CTS and Post-CTS process that is included shallow-CTS. Based on longest clock path in the Pre-CTS and Post-CTS stages, the standard deviation before and after buffer insertion is compared and analyzed for the accuracy of CTS. In this paper, It is expected that the cost and time problem could be reduced by providing a pre-clock tree synthesis verification method at the RTL level without confirming the CTS result using the time-consuming licensed EDA tool.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.51 no.1
• /
• pp.42-55
• /
• 2023

A methodology to predict the carbon performance of newly created urban greening plans is required as policies based on quantifying carbon performance are rapidly being introduced in the face of the climate crisis caused by global warming. This study developed a tree carbon calculator that can be used for carbon reduction designs in landscaping and attempted to verify its effectiveness in landscape design. For practical operability, MS Excel was selected as a format, and carbon absorption and storage by tree type and size were extracted from 93 representative species to reflect plant design characteristics. The database, including tree unit prices, was established to reflect cost limitations. A plantation experimental design to verify the performance of the tree carbon calculator was conducted by simulating the design of parks in the central region for four landscape design, and the causal relationship was analyzed by conducting semi-structured interviews before and after. As a result, carbon absorption and carbon storage in the design using the tree carbon calculator were about 17-82% and about 14-85% higher, respectively, compared to not using it. It was confirmed that the reason for the increase in carbon performance efficiency was that additional planting was actively carried out within a given budget, along with the replacement of excellent carbon performance species. Pre-interviews revealed that designers distrusted data and the burdens caused by new programs before using the arboreal carbon calculator but tended to change positively because of its usefulness and ease of use. In order to implement carbon reduction design in the landscaping field, it is necessary to develop it into a carbon calculator for trees and landscaping performance. This study is expected to present a useful direction for ntroducing carbon reduction designs based on quantitative data in landscape design.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.107-118
• /
• 2006

In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.