• Title/Summary/Keyword: Search space

Search Result 1,433, Processing Time 0.03 seconds

A Study on the Visitor's Visual Behavior and Isovist Area in Museum Exhibition Space - Focus on the Busan Museum, Gimhae National Museum - (박물관 전시공간에서의 관람자 시각행동과 가시영역에 관한 조사 연구 - 부산박물관, 국립김해박물관을 중심으로 -)

  • Yoo, Jae-Yub;Choi, Jun-Huck;Lim, Che-Zinn
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.197-205
    • /
    • 2010
  • For the spatial experience of spectators visiting a museum, the route search of trying to follow the spatial structure or production of exhibition and the information search of trying to see are accomplished at the same time. In such process, the spectator's reaction of visual perception produces the result of emotional reaction and action exchanged between human and space by going through the recognition and perception on the target of environment factor. For the spatial experience of a spectator, the reaction of visual perception which interacts according to the exhibit and exhibition environment within space according to viewing purpose, interest and concern of spectator comes out as visual activity which is an activity to understand the spatial information shown as various activities according to spatial structure and unfolding characteristics of the display. The purpose of this study is to identify The Correlation of Spectator Movement Created According to Structural Form of Exhibition Area Based on Interaction between Exhibition Area Structure and Spectator to utilize as basic material while designing museum exhibition using isovist field which is a quantitative analysis tool of spectator's visual behavior and spatial structure at each exhibition area.

Data Retrieval by Multi-Dimensional Signal Space Partitioning (다차원 신호공간 분할을 이용한 데이터 복원)

  • Jeon, Taehyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.6
    • /
    • pp.674-677
    • /
    • 2004
  • This paper deals with a systematic approach for the construction of the fixed-delay tree search (FDTS) detector in the intersymbol interference channel. The approach is based on the efficient multi-dimensional space partitioning. The Voronoi diagram (VoD) and the Delaunay tessellation (DT) of the multi-dimensional space are applied to implement the algorithm. In the proposed approach, utilizing the geometric information contained in the VOD/DT, the relative location of the observation sequence is determined which has been shown to reduce the implementation complexity. Detailed construction procedures are discussed followed by an example from the intersymbol interference communication channel.

Search for extrasolar planets around K-giants: $\alpha$ Arietis - planet or surface features?

  • Lee, Byeong-Cheol;Mkrtichian, David E.;Han, In-Woo;Kim, Kang-Min;Park, Myeong-Gu
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.2
    • /
    • pp.78.2-78.2
    • /
    • 2010
  • We report the detection of a low-amplitude 380.8-day radial velocity (RV) variations in oscillating K2 III star ${\alpha}$ Ari (HD 12929). We do not found the correlation between RV variations and equivalent widths of chromospheric activity indicators ($H{\alpha}$ and CaII 8662 ${\AA}line$). The bisector analysis shows that bisector velocity span (BVS) and RV variations are not strongly correlated with each other. These result suggest that the RV variations could have been produced either by planetary companion or by the surface spots. If this RV variation is indeed caused by a planetary companion, an orbital solution with a period of P = 381 days, a semi-amplitude of K = 41 m/s, and an eccentricity of e = 0.25 fits the data best. Assuming a possible stellar mass of $M_{\bigstar} = 1.4-5.6 M\odot$, we estimate the minimum mass for the companion of m sini = 1.8-4.5 $M_{Jup}$ with an orbital semi-major axis of 1.2-1.9 AU. If confirmed, our finding gives a support to search for exoplanets around giant stars with multi-periodic oscillations.

  • PDF

Face Detection Using Fusion of Heterogeneous Template Matching (이질적 템플릿 매칭의 융합을 이용한 얼굴 영역 검출)

  • Lee, Kyoung-Mi
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.311-321
    • /
    • 2007
  • For fast and robust face detection, this paper proposes an approach for face detection using fusion of heterogeneous template matching. First, we detect skin regions using a model of skin color which covers various illumination and races. After reducing a search space by region labelling and filtering, we apply template matching with skin color and edge to the detected regions. Finally, we detect a face by finding the best choice of template fusion. Experimental results show the proposed approach is more robust in skin color-like environments than with a single template matching and is fast by reducing a search space to face candidate regions. Also, using a global accumulator can reduce excessive space requirements of template matching.

Depth-first branch-and-bound-based decoder with low complexity (검출 복잡도를 감소 시키는 Depth-first branch and bound 알고리즘 기반 디코더)

  • Lee, Eun-Ju;Kabir, S.M.Humayun;Yoon, Gi-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2525-2532
    • /
    • 2009
  • In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.

Clustering Technique for Sequence Data Sets in Multidimensional Data Space (다차원 데이타 공간에서 시뭔스 데이타 세트를 위한 클러스터링 기법)

  • Lee, Seok-Lyong;LiIm, Tong-Hyeok;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.655-664
    • /
    • 2001
  • The continuous data such as video streams and voice analog signals can be modeled as multidimensional data sequences(MDS's) in the feature space, In this paper, we investigate the clustering technique for multidimensional data sequence, Each sequence is represented by a small number by hyper rectangular clusters for subsequent storage and similarity search processing. We present a linear clustering algorithm that guarantees a predefined level of clustering quality and show its effectiveness via experiments on various video data sets.

  • PDF

Multiobjective Space Search Optimization and Information Granulation in the Design of Fuzzy Radial Basis Function Neural Networks

  • Huang, Wei;Oh, Sung-Kwun;Zhang, Honghao
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.636-645
    • /
    • 2012
  • This study introduces an information granular-based fuzzy radial basis function neural networks (FRBFNN) based on multiobjective optimization and weighted least square (WLS). An improved multiobjective space search algorithm (IMSSA) is proposed to optimize the FRBFNN. In the design of FRBFNN, the premise part of the rules is constructed with the aid of Fuzzy C-Means (FCM) clustering while the consequent part of the fuzzy rules is developed by using four types of polynomials, namely constant, linear, quadratic, and modified quadratic. Information granulation realized with C-Means clustering helps determine the initial values of the apex parameters of the membership function of the fuzzy neural network. To enhance the flexibility of neural network, we use the WLS learning to estimate the coefficients of the polynomials. In comparison with ordinary least square commonly used in the design of fuzzy radial basis function neural networks, WLS could come with a different type of the local model in each rule when dealing with the FRBFNN. Since the performance of the FRBFNN model is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials present in the consequent parts of the rules, we carry out both structural as well as parametric optimization of the network. The proposed IMSSA that aims at the simultaneous minimization of complexity and the maximization of accuracy is exploited here to optimize the parameters of the model. Experimental results illustrate that the proposed neural network leads to better performance in comparison with some existing neurofuzzy models encountered in the literature.

A Method for Extracting Relationships Between Terms Using Pattern-Based Technique (패턴 기반 기법을 사용한 용어 간 관계 추출 방법)

  • Kim, Young Tae;Kim, Chi Su
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.8
    • /
    • pp.281-286
    • /
    • 2018
  • With recent increase in complexity and variety of information and massively available information, interest in and necessity of ontology has been on the rise as a method of extracting a meaningful search result from massive data. Although there have been proposed many methods of extracting the ontology from a given text of a natural language, the extraction based on most of the current methods is not consistent with the structure of the ontology. In this paper, we propose a method of automatically creating ontology by distinguishing a term needed for establishing the ontology from a text given in a specific domain and extracting various relationships between the terms based on the pattern-based method. To extract the relationship between the terms, there is proposed a method of reducing the size of a searching space by taking a matching set of patterns into account and connecting a join-set concept and a pattern array. The result is that this method reduces the size of the search space by 50-95% without removing any useful patterns from the search space.

A Path-Finding Algorithm on an Abstract Graph for Extracting Estimated Search Space (탐색 영역 추출을 위한 추상 그래프 탐색 알고리즘 설계)

  • Kim, Ji-Soo;Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.147-150
    • /
    • 2008
  • The real road network is regarded as a grid, and the grid is divided by fixed-sized cells. The path-finding is composed of two step searching. First searching travels on the abstract graph which is composed of a set of psuedo vertexes and a set of psuedo edges that are created by real road network and fixed-sized cells. The result of the first searching is a psuedo path which is composed of a set of selected psuedo edges. The cells intersected with the psuedo path are called as valid cells. The second searching travels with $A^*$ algorithm on valid cells. As pruning search space by removing the invalid cells, it would be possible to reduce the cost of exploring on real road network. In this paper, we present the method of creating the abstract graph and propose a path-finding algorithm on the abstract graph for extracting search space before traveling on real road network.

  • PDF

Content-based Image Retrieval Using HSI Color Space and Neural Networks (HSI 컬러 공간과 신경망을 이용한 내용 기반 이미지 검색)

  • Kim, Kwang-Baek;Woo, Young-Woon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.2
    • /
    • pp.152-157
    • /
    • 2010
  • The development of computer and internet has introduced various types of media - such as, image, audio, video, and voice - to the traditional text-based information. However, most of the information retrieval systems are based only on text, which results in the absence of ability to use available information. By utilizing the available media, one can improve the performance of search system, which is commonly called content-based retrieval and content-based image retrieval system specifically tries to incorporate the analysis of images into search systems. In this paper, a content-based image retrieval system using HSI color space, ART2 algorithm, and SOM algorithm is introduced. First, images are analyzed in the HSI color space to generate several sets of features describing the images and an SOM algorithm is used to provide candidates of training features to a user. The features that are selected by a user are fed to the training part of a search system, which uses an ART2 algorithm. The proposed system can handle the case in which an image belongs to several groups and showed better performance than other systems.