• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.032 seconds

On the Hardness of the Maximum Lot Grouping Problem (최대 로트 그룹핑 문제의 복잡성)

  • Hwang, Hark-Chin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.4
    • /
    • pp.253-258
    • /
    • 2003
  • We consider the problem of grouping orders into lots. The problem is modelled by a graph G=(V,E), where each node ${\nu}{\in}V$ denotes order specification and its weight ${\omega}(\nu)$ the orders on hand for the specification. We can construct a lot simply from orders of single specification. For a set of nodes (specifications) ${\theta}{\subseteq}V$, if the distance of any two nodes in $\theta$ is at most d, it is also possible to make a lot using orders on the nodes. The objective is to maximize the number of lots with size exactly $\lambda$. In this paper, we prove that our problem is NP-Complete when $d=2,{\lambda}=3$ and each weight is 0 or 1. Moreover, it is also shown to be NP-Complete when $d=1,{\lambda}=3$ and each weight is 1,2 or 3.

Construction of Efficient Panoramic Image (효율적인 파노라믹 영상 구축)

  • Shin, Seong-Yoon;Baek, Jeong-Uk;Rhee, Yang-Won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.155-156
    • /
    • 2010
  • `Panoramic image' is called generally 'mosaic image', to create a new image by matching the number of relevant images. In this paper, we are entering data through the camera. Therefore, perspective model was used for recognition of camera parameters, minimizing the discrepancies by proposing measure of discrepancy between the frames. In addition, how to create panoramic images is proposed by fixed reference and time-varying reference in order to create panoramic images.

  • PDF

A Bilateral Symmetry Average Method for Robust Face Detection against Illumination Variation (조명 변화에 강인한 얼굴 검출을 위한 좌우대칭 평균화 기법)

  • Cho Chi-Young;Kim Soo-Hwang
    • Journal of Game and Entertainment
    • /
    • v.2 no.2
    • /
    • pp.45-50
    • /
    • 2006
  • In a face detection system based on template matching, histogram equalization or log transform is applied to an input image for the intensity normalization and the image improvement. It is known that they are noneffective in improving an image with intensity distortion by illumination variation. In this paper, we propose an efficient image improvement method called as a bilateral symmetry average for images with intensity distortion by illumination variation. Experimental results show that our method delivers the detection performance better than previous methods and also remarkably reduces the number of face candidates.

  • PDF

Image Mosaicking Considering Pairwise Registrability in Structure Inspection with Underwater Robots (수중 로봇을 이용한 구조물 검사에서의 상호 정합도를 고려한 영상 모자이킹)

  • Hong, Seonghun
    • The Journal of Korea Robotics Society
    • /
    • v.16 no.3
    • /
    • pp.238-244
    • /
    • 2021
  • Image mosaicking is a common and useful technique to visualize a global map by stitching a large number of local images obtained from visual surveys in underwater environments. In particular, visual inspection of underwater structures using underwater robots can be a potential application for image mosaicking. Feature-based pairwise image registration is a commonly employed process in most image mosaicking algorithms to estimate visual odometry information between compared images. However, visual features are not always uniformly distributed on the surface of underwater structures, and thus the performance of image registration can vary significantly, which results in unnecessary computations in image matching for poor-conditioned image pairs. This study proposes a pairwise registrability measure to select informative image pairs and to improve the overall computational efficiency of underwater image mosaicking algorithms. The validity and effectiveness of the image mosaicking algorithm considering the pairwise registrability are demonstrated using an experimental dataset obtained with a full-scale ship in a real sea environment.

Moment-Curvature behavior of steel and GFRP reinforced beam using AE and DIC Techniques

  • Sharma, Gaurav;Sharma, Shruti;Sharma, Sandeep K.
    • Structural Engineering and Mechanics
    • /
    • v.84 no.2
    • /
    • pp.253-268
    • /
    • 2022
  • Using non-destructive Acoustic Emission (AE) and optical Digital Image Correlation (DIC) methods, the moment-curvature behavior of steel and GFRP bars reinforced concrete beams under flexure was explored in this study. In the tension zone, laboratory studies were carried out on steel-RC and GFRP-RC beams with varying percentages of longitudinal reinforcement ratios of 0.33 %, 0.52%, and 1.11%. The distinct mechanism of cracking initiation and fracture progression of failure in steel-RC and GFRP-RC beams were effectively correlated and picked up using AE waveform characteristics of the number of AE hits and their amplitudes, AE energy as well as average frequency and duration. AE XY event plots and longitudinal strain profiles using DIC gives an online and real-time visual display of progressive AE activity and strains respectively to efficaciously depict the crack evolution and their advancement in steel-RC and GFRP-RC beams. They display a close matching with the micro and macro-cracks visually observed in the actual beams at various stages of loading.

The study of Tang Zong Hai's Medica-change thought (당종해(唐宗海)의 의역사상(醫易思想)에 관(關)한 연구(硏究))

  • Kim, Gi-Uk;Park, Hyeon-Guk
    • Journal of Korean Medical classics
    • /
    • v.12 no.2
    • /
    • pp.56-71
    • /
    • 1999
  • 1. In the recohnition of cosmos true form, It is compared to the Boundless(無極) the Great Absolute(太極),Yin and Yang(兩儀) throungh the fertilazation process of spermatozoon and ovum. 2. It is explained that principle of unchange through the Form and Action(體 用) relation of the outer appearances and Number (象數) with matching the number of nine and ten to HaDoo(河圖) and RakSye(洛書). 3. Eigth divinations(八卦) being compared to the human body, Care presevation of pregnancy(養胎) is explained that head forms firstly(Gun-I 1乾一), secondly lung(Tae-E 兌二), heart(E-Sam 離三), liver(Jin-Sa 震四), gall bladder(Son-Oo 巽五), kidney(Gam-Yuk 坎六), intestines and stomach(Gan-Chill 艮七), lastly flesh forms(Gon-Pal 坤八). 4. It is explained that process of physiological change of $\ll$Nei Ching The Natural Truth in Ancient Times$\gg$(內經 上古天眞論) by matching boy at the age of 8 to Gan-divination(艮卦), and girl at the age of 7 to Tae-divination(兌卦). 5. The theory of six sons from Gun-Gon(乾坤六子論) is explained by relation of Apriority Eight-divination(先天八卦) obedience and disobedience-left and right. 6. It is explained that form of the human-body and the relationship of the Heart - the Kidney through the Gam(坎) Li(離) - divination 7. The effort of interpretating time and space of the Twelve Horary signs is explanined by season, direction, Five elements(五行), rise and decline, the Three Sum(三合), the Six Sum (六合), the six crash(六衡)'s relation. 8. the process of change from apriority(先天) to postery(後天) in the book of Changes(周易) is explanined by comparing to the phenomenum of nature and the human body. 9. The Energy Satus(氣位) are different from the direction of Eight-divination(八卦) and the properties of the good or bad of herb-drugs are differnt from the place of production. 10. The rightness of realizating the Overlapping-divinations(重卦) are compared to the phenomenum of nature through the Divination Virture(卦德). 11. The dependence-relations of The Twelve Meridians(十二經脈) are explained by-matching January with liver meridian, February with gall bladder meridian, march with heart pericardium meridiam, April with small intestine meridkan, August with lung spleen meridian, jury with stomach meridian, August with lung meridian, September with large intestine meridian, October with urinary bladder meridianm November with kidney meridian. December with triple energizer meridian throng The Twelve Byuk-divination. 12. The process of menstration cycle is explained by The Month symbolizing-divination(月候卦). 13. Through The Trade(交易) prove the reason of feverish sympotoms to use feverish Drug, mill sympotoms to use mill drug of prescription and Heart-Kidneys Consensus(心賢相交) and through The Change(變易), prove the chill and feverish consensus of forechill after feverish, fore feverish after chill and through. The Non-Change(不易) explain the reason of chill sympotoms to use feverish drug, feverish sympotoms to use chill drug of prscription. 14. Ho-divination(互卦) applicate Jxa Sa(佐使) herb drug match of Kun Sin Jwa Sa() theory. 15. According to the Hyo-position(爻位) match the ages, body form and drug by matching Ehight-divination(八卦) to the human body form and function in medicine and the book of Changes(周易) application emphasize the human body Ehight-divination(人身八卦). 16. Throgh the Order-divination(序卦) explain the rightness of Divination Image(卦象) arrangement and all things take shape by cosmo-energy conseusus(宇宙氣交). 17. Throgh the Mixing-divination(難卦) supply the vacancy of medicine and the book of Changes(周易) relationship in the foreword explian the human energy movements, sleep, vomitting, the energy arrival(逮氣), heart pericardium(心包), lung membrane(肺膜) etc.... Like the above sentence medicine and the book of Changes(周易) theory of scholar Tang on the viewpoint of easten-the way Western appliance(東道西器) researching abyss of medicine impart to descendants, so I think that the achievement of medicine and the book of Changes(周易) study is very excellant and I expect that the study Korean Oriental Medicine(韓醫學) theory by means of medicine the book of Changes(周易) reference, will be accelarated.

  • PDF

Semantic Process Retrieval with Similarity Algorithms (유사도 알고리즘을 활용한 시맨틱 프로세스 검색방안)

  • Lee, Hong-Joo;Klein, Mark
    • Asia pacific journal of information systems
    • /
    • v.18 no.1
    • /
    • pp.79-96
    • /
    • 2008
  • One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

A Construction of the Multistep Optimal Three-Dimensional Finite Elements for the Mandible Structure Analysis (하악 구조체 분석을 위한 다단계 최적 3 차원 유한 요소 형성)

  • Lee, Hyeong-U;;Lee, Seong-Hwan;Kim, Chang-Heon;Kim, Tae-Yun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1906-1916
    • /
    • 1996
  • For the medical analysis of the three-dimensional structure such as the mandible, it is necessary to reconstruct the structure into the finite number of analyzable elements. The information of the three-dimensional structure can be obtained from the cross-sections of the magnetic resonance image (MRI). A region corresponding to the structure is extracted from the inner part of the cross- section. By the triangulation of the sampled cross-section image, two-dimensional finite elements are generated. Three-dimensional finite elements are constructed by matching the two dimensional finite elements each other in space. In this paper a construction method of the optimal three-dimensional finite elements has been suggested, which uses the adjacent information abstracted from the triangulated two-dimensional finite elements. The elements are classified into the identical property sets by using the adjacent information of the traingulated two-dimensional elements. After applying the multistep matching algorithm to the classified two-dimensional finite elements, the optimal three-dimensional finite elements can be construccted. By analyzing the constructed finite elements, it is possible to get much more useful medical information about the three-dimensional struture of mandible.

  • PDF

Fast Fingerprint Alignment Method and Weighted Feature Vector Extraction Method in Filterbank-Based Fingerprint Matching (필터뱅크 기반 지문정합에서 빠른 지문 정렬 방법 및 가중치를 부여한 특징 벡터 추출 방법)

  • 정석재;김동윤
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.1
    • /
    • pp.71-81
    • /
    • 2004
  • Minutiae-based fingerprint identification systems use minutiae points, which cannot completely characterize local ridge structures. Further, this method requires many methods for matching two fingerprint images containing different number of minutiae points. Therefore, to represent the fired length information for one fingerprint image, the filterbank-based method was proposed as an alternative to minutiae-based fingerprint representation. However, it has two shortcomings. One shortcoming is that similar feature vectors are extracted from the different fingerprints which have the same fingerprint type. Another shortcoming is that this method has overload to reduce the rotation error in the fingerprint image acquisition. In this paper, we propose the minutia-weighted feature vector extraction method that gives more weight in extracting feature value, if the region has minutiae points. Also, we Propose new fingerprint alignment method that uses the average local orientations around the reference point. These methods improve the fingerprint system's Performance and speed, respectively. Experimental results indicate that the proposed methods can reduce the FRR of the filterbank-based fingerprint matcher by approximately 0.524% at a FAR of 0.967%, and improve the matching performance by 5% in ERR. The system speed is over 1.28 times faster.

Automatic Interface Synthesis based on IP Categorization and Characteristics Matching (IP 범주화와 특성 대응을 통한 인터페이스 회로 자동 합성)

  • Yun, Chang-Ryul;Jhang, Kyoung-Son
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.10 s.352
    • /
    • pp.34-44
    • /
    • 2006
  • A system-on-a-chip (SoC) design uses pre-verified IP hardware blocks in order to reduce design time. We need interface circuits to connect IPs with different protocols. In SoC design we should design interface circuits frequently and these tasks are somewhat time-consuming and error-prone. So it is necessary to generate the interface circuits automatically. Several studies have been made on generating interface circuits only from the communication protocols of IPs. With existing approaches, it is not easy to generate interface circuits connecting two IPs only from communication protocols: connection between IP with address and W without address, connection between IP with only one port to transfer address/data and IP with different ports for address and data connection between IP that transfer address and data together and IP that transfer only one address with a number of data in a burst. No consideration of various characteristics of IPs and no changed algorithm are responsible for it. In order to solve this problem, the proposed approach categorizes communication protocols of IPs, and takes characteristics matching of IPs into account during the interface synthesis. In experiments, we show that we could correctly generate and verify interface circuits for IPs with different characteristics.