• Title/Summary/Keyword: Convex Function

Search Result 446, Processing Time 0.025 seconds

Cascade Network Based Bolt Inspection In High-Speed Train

  • Gu, Xiaodong;Ding, Ji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3608-3626
    • /
    • 2021
  • The detection of bolts is an important task in high-speed train inspection systems, and it is frequently performed to ensure the safety of trains. The difficulty of the vision-based bolt inspection system lies in small sample defect detection, which makes the end-to-end network ineffective. In this paper, the problem is resolved in two stages, which includes the detection network and cascaded classification networks. For small bolt detection, all bolts including defective bolts and normal bolts are put together for conducting annotation training, a new loss function and a new boundingbox selection based on the smallest axis-aligned convex set are proposed. These allow YOLOv3 network to obtain the accurate position and bounding box of the various bolts. The average precision has been greatly improved on PASCAL VOC, MS COCO and actual data set. After that, the Siamese network is employed for estimating the status of the bolts. Using the convolutional Siamese network, we are able to get strong results on few-shot classification. Extensive experiments and comparisons on actual data set show that the system outperforms state-of-the-art algorithms in bolt inspection.

Development of Radiation Thermometer using InSb Photo-detector (인듐안티모나이드(InSb) 소자를 이용한 적외선 방사온도 계측시스템의 개발연구)

  • Hwang, Byeong-Oc;Lee, Won-Sik;Jhang, Kyung-Young
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.7
    • /
    • pp.46-52
    • /
    • 1995
  • This paper proposes methodologies for the development of radiation thermometer using InSb photo-detector of which spectral sensitivity is excellent over the wave length range of 2 .mu. m .approx. 5 .mu. m. The proposed radiation thermometer has broad measurement range from normal to high, up to more than 1000 .deg. C, with high accuracy, and can measure temperature on the material surface or heat emission noncontactely with high speed. Optical system was consisted of two convex lens with foruslength of 15.2mm for infrared lay focusing, Ge filter to cut the short wave length components and sapphire filter to cut the long wave length components. The cold shielded was installed in the whole surface of the light-absorbing element to remove the error- mometer, calibration using black body furnace which has temperature range of 90 .deg. C .approx. 1100 .deg. C was carried out, and temperature calaibration curve was obtained by exponential function curvefitting. The result shows maximum error less than 0.24%(640K .+-. 1.6K) over the measurement range of 90 .deg. C .approx. 700 .deg. C, and from this result the usefulness of the developed thermometer has been confirmed.

  • PDF

INTRODUCTION OF T -HARMONIC MAPS

  • Mehran Aminian
    • The Pure and Applied Mathematics
    • /
    • v.30 no.2
    • /
    • pp.109-129
    • /
    • 2023
  • In this paper, we introduce a second order linear differential operator T□: C (M) → C (M) as a natural generalization of Cheng-Yau operator, [8], where T is a (1, 1)-tensor on Riemannian manifold (M, h), and then we show on compact Riemannian manifolds, divT = divTt, and if divT = 0, and f be a smooth function on M, the condition T□ f = 0 implies that f is constant. Hereafter, we introduce T-energy functionals and by deriving variations of these functionals, we define T-harmonic maps between Riemannian manifolds, which is a generalization of Lk-harmonic maps introduced in [3]. Also we have studied fT-harmonic maps for conformal immersions and as application of it, we consider fLk-harmonic hypersurfaces in space forms, and after that we classify complete fL1-harmonic surfaces, some fLk-harmonic isoparametric hypersurfaces, fLk-harmonic weakly convex hypersurfaces, and we show that there exists no compact fLk-harmonic hypersurface either in the Euclidean space or in the hyperbolic space or in the Euclidean hemisphere. As well, some properties and examples of these definitions are given.

Stability Evaluation of Cut Slope in Forest Roads by Forest Environment Factors (산림환경인자에 의한 임도 절토비탈면의 안정성 평가)

  • Jeon, Kwon-Seok;Oh, Sung-Yoon;Ma, Ho-Seop
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.6 no.4
    • /
    • pp.43-51
    • /
    • 2003
  • The purpose of this study was evaluate to the stability on cut slope of forest roads by forest environmental factors. The total of 19 environmental factors on cut slope of forest roads were investigated in about 42.74km constructed during 1987 to 1993 in Gyeongnam and Jeonnam province. The evaluation of slope stability in forest roads were conducted by the discriment analysis. The main factors influencing the stability of cut slope were significant in order of coverage, soil hardness, degree of slope, altitude, silt loam, convex(凸) and compound(凹凸). The centroids value of discriminant function in the stability and unstability area estimated to -1.194 and 1.127, respectively. The boundary value between two groups related to slope stability was -0.072. The prediction rate of discriminant function for stability evaluation of was as high as 90.4%.

Optimization of Economic Load Dispatch Problem for Quadratic Fuel Cost Function with Prohibited Operating Zones (운전금지영역을 가진 이차 발전비용함수의 경제급전문제 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.155-162
    • /
    • 2015
  • This paper proposes a deterministic optimization algorithm to solve economic load dispatch problem with quadratic convex fuel cost function. The proposed algorithm primarily partitions a generator with prohibited zones into multiple generators so as to place them afield the prohibited zone. It then sets initial values to $P_i{\leftarrow}P_i^{max}$ and reduces power generation costs of those incurring the maximum unit power cost. It finally employs a swap optimization process of $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$ where $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_j+{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}=1.0,0.1,0.01,0.001$. When applied to 3 different 15-generator cases, the proposed algorithm has consistently yielded optimized results compared to those of heuristic algorithms.

Bayesian Model Selection in the Unbalanced Random Effect Model

  • Kim, Dal-Ho;Kang, Sang-Gil;Lee, Woo-Dong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.743-752
    • /
    • 2004
  • In this paper, we develop the Bayesian model selection procedure using the reference prior for comparing two nested model such as the independent and intraclass models using the distance or divergence between the two as the basis of comparison. A suitable criterion for this is the power divergence measure as introduced by Cressie and Read(1984). Such a measure includes the Kullback -Liebler divergence measures and the Hellinger divergence measure as special cases. For this problem, the power divergence measure turns out to be a function solely of $\rho$, the intraclass correlation coefficient. Also, this function is convex, and the minimum is attained at $\rho=0$. We use reference prior for $\rho$. Due to the duality between hypothesis tests and set estimation, the hypothesis testing problem can also be solved by solving a corresponding set estimation problem. The present paper develops Bayesian method based on the Kullback-Liebler and Hellinger divergence measures, rejecting $H_0:\rho=0$ when the specified divergence measure exceeds some number d. This number d is so chosen that the resulting credible interval for the divergence measure has specified coverage probability $1-{\alpha}$. The length of such an interval is compared with the equal two-tailed credible interval and the HPD credible interval for $\rho$ with the same coverage probability which can also be inverted into acceptance regions of $H_0:\rho=0$. Example is considered where the HPD interval based on the one-at- a-time reference prior turns out to be the shortest credible interval having the same coverage probability.

  • PDF

Coalitonal Game Theoretic Power Control for Delay-Constrained Wireless Sensor Networks (지연제약 무선 센서 네트워크를 위한 협력게임 기법에 기반한 전송 파워 제어 기법)

  • Byun, Sang-Seon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.107-110
    • /
    • 2015
  • In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

  • PDF

A Study on the Spatial Control Effect of Panjang in Donggwoldo (동궐도(東闕圖) 판장(板墻)의 공간통제 효과에 관한 연구)

  • HA Yujeong;KIM Choongsik
    • Korean Journal of Heritage: History & Science
    • /
    • v.55 no.4
    • /
    • pp.196-209
    • /
    • 2022
  • This study compared and analyzed the spatial division function and role of partitions by comparing the entire space and the spatial changes before and after the installation of partitions in <Donggwoldo>, which was manufactured in the late Joseon Dynasty. As a research method, a set standard was prepared to decompose the space of <Donggwoldo> into a unit space, and the standard was set according to the role and height of the space by classifying it into a main space, sub space, and transition space. Two convex maps were prepared according to before and after the installation of the Panjang, and the values of connectivity, control, and integration, which are spatial syntax variables, were calculated and analyzed. The results of the study are as follows. First, the partition in <Donggwoldo(東闕圖)> did not affect the overall spatial arrangement and control or connection of Donggwol, but the movement and access of space is limited to specific areas. Second, the partition was a facility intensively distributed in Naejeon(內殿) and Donggung(東宮) to be used actively in the way of space utilization. It shows that the unit space increased rapidly due to the installation of the partition. Since the partition was installed in the spaces that were open and under high control in the case of Naejeon(內殿), it helped to secure private spaces as closed ones under low control. On the other hand, for Donggung(東宮), the spaces were compartmented and divided with the partition to guide the movement path through narrow gates of the partition and increase the depth of the space. This helped to create spaces that are free and can be hidden as it increased the number of spaces coming through. Third, In addition to the functions of "eye blocking, space division, and movement path control" revealed in prior research, the partition has created a "space that is easy to control" within a specific area. The installation of the partition reduced the scale through the separation of spaces, but it occurred the expansion of the movement path and space. Also, the partition functioned to strengthen hiding and closure or increase openness as well through space division. This study is significant in that it revealed the value of the spatial control function of panjang through the analysis of spatial control and depth by analyzing the function of the partition with a mathematical model in addition to the analysis and study of the function and role of panjang. In addition, it is valuable in that it has prepared a framework for analysis tools that can be applied to traditional residential complexes similar to palaces by applying space syntax to <Donggungdo> to create convex spaces according to unit space division and connection types of palace architecture and landscape elements.

Exploring a Hypothetical Learning Trajectory of Linear Programming by the Didactical Analysis (선형계획법의 교수학적 분석을 통한 가설 학습 경로 탐색)

  • Choi, Ji-Sun;Lee, Kyeong-Hwa;Kim, Suh-Ryung
    • Journal of Educational Research in Mathematics
    • /
    • v.20 no.1
    • /
    • pp.85-102
    • /
    • 2010
  • Linear programming(LP) is useful for finding the best way in a given condition for some list of requirements represented as linear equations. This study analysed LP in mathematics contexts and LP in school mathematics contexts, considered learning process of LP from an epistemological point of view, and explored a hypothetical learning trajectory of LP. The differences between mathematics contexts and school mathematics contexts are whether they considered that the convex polytope $\Omega$ is feasible/infeasible or bounded/unbounded or not, and whether they prove the theorem that the optimum is always attained at a vertex of the polyhedronor not. And there is a possibility that students could not understand what is maximum and minimum of a linear function when the domain of the function is limited. By considering these three aspects, we constructed hypothetical learning trajectory consisted of 4 steps. The first step is to see a given linear expression as linear function, the second step is to partition a given domain by straight lines, the third step is to construct the conception of y-intercept by relating lines and the range of k, and the forth step is to identify whether there exists the optimum in a given domain or not.

  • PDF

Dynamic Traffic Assignment Using Genetic Algorithm (유전자 알고리즘을 이용한 동적통행배정에 관한 연구)

  • Park, Kyung-Chul;Park, Chang-Ho;Chon, Kyung-Soo;Rhee, Sung-Mo
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.8 no.1 s.15
    • /
    • pp.51-63
    • /
    • 2000
  • Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

  • PDF