WO2000056056A2 - Procede d'optimisation de reportage televise - Google Patents

Procede d'optimisation de reportage televise Download PDF

Info

Publication number
WO2000056056A2
WO2000056056A2 PCT/US2000/040011 US0040011W WO0056056A2 WO 2000056056 A2 WO2000056056 A2 WO 2000056056A2 US 0040011 W US0040011 W US 0040011W WO 0056056 A2 WO0056056 A2 WO 0056056A2
Authority
WO
WIPO (PCT)
Prior art keywords
solutions
cameras
solution
mutated
recombined
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2000/040011
Other languages
English (en)
Other versions
WO2000056056A3 (fr
Inventor
Moshe Levin
Ido Ben Mordechai
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHOWBITES Inc
Original Assignee
SHOWBITES Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SHOWBITES Inc filed Critical SHOWBITES Inc
Priority to AU32496/00A priority Critical patent/AU3249600A/en
Publication of WO2000056056A2 publication Critical patent/WO2000056056A2/fr
Publication of WO2000056056A3 publication Critical patent/WO2000056056A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00—Details of television systems
    • H04N5/222—Studio circuitry; Studio devices; Studio equipment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N23/00—Cameras or camera modules comprising electronic image sensors; Control thereof
    • H04N23/60—Control of cameras or camera modules

Definitions

  • the present invention relates to video coverage of a given space using fixed cameras
  • each camera has a predetermined three-dimensional orientation (azimuth and
  • Real and still remote video systems cover a given space by a multiplicity of video
  • each camera has a location and
  • angular orientation that may be defined by the vector (x, y, z, ⁇ , ⁇ ) where x, y, z are the three-
  • ⁇ and ⁇ are the azimuth and elevation of the camera line of sight
  • a set of N cameras will be defined by M, an Nx 8 matrix. Mobility is defined as a
  • the level of mobility is a measure of mobility
  • a coverage priority level is defined such that for each point (xj> ,z ) a priority of
  • orientation for a given set of cameras best covering a predetermined three-dimensional area.
  • the invention is based on building a computerized three-dimensional model (like a DTM
  • It is a second object of this invention is to determine the best subset of cameras
  • the present invention provides a method of selecting a plurality of fixed camera
  • the cameras are capable of optical zoom in
  • the method determines the number of cameras required to cover a predetermined space (hall, sports field or any other defined location) within required
  • the method provides a mechanical mounting location for each
  • the cameras can be of the sort that have electronic navigation capabilities only. This is
  • invention can be used with remote access real and still video applications.
  • the optimization problem for a given space is to find the number N of cameras out of
  • the optimization technique will optimize the
  • the optimization technique utilized is a combination of genetic algorithms and
  • Simulated annealing is a simulated technique, which allows to provide an efficient
  • Fig. 1 is a view for describing the three-dimensional model of the area to be covered
  • Fig. 2 is a view of the three-dimensional model describing the ceiling of the above
  • the ceiling here means the maximum allowable height of the camera.
  • Fig. 3 is a view of all the parameters of the camera.
  • Fig. 4 depicts a high-level flowchart of the suggested method.
  • Fig. 5 depicts the camera footprint calculation.
  • Fig. 6 describes the recombination process.
  • Fig. 1 is a view for describing the three-dimensional model 100 of the area to be
  • the vector (x,y,z) defines a point in space which is the surface to be covered.
  • the surface here can describe the ground level or the outside of the building which the system has to
  • Fig. 2 is a view of the three-dimensional model 200 describing the ceiling 202 of the
  • the ceiling means the maximum allowable height of the camera.
  • This value can be set from the actual height of the area roof, the maximum height determined
  • the ceiling is
  • Fig. 3 is a view of all the parameters of the camera 102: x The x location of the camera. y The y location of the camera,
  • Fig. 4 is a high level description of the method according to either of the preferred embodiment
  • the genetic algorithm is activated to produce several solutions (step 408). For each
  • Fig. 5 describes the method by which the coverage of a single camera is calculated.
  • the areas to be covered are defined by a three-dimensional model.
  • the model is a set
  • the model is typically (but not necessarily)
  • An intermediate set is defined as L(x,y,z). For each point in the model, and a given
  • L(x,y,z) is defined as the number of cameras
  • the coverage quality will be calculated by the following formula:
  • k, and k 2 are calibration factors used to calibrate the relevant importance of the various
  • a large k optimizes the coverage with emphasis on coverage diversity, i.e., several
  • a small ⁇ _ optimizes the system to have at least one
  • the optimization parameters to be set are:
  • mutation_probability the probability that a specific value will be changed in the
  • Urv intermediate parameter, random variable.
  • power_of_bias the urv defined earlier is raised to the power of power of bias and
  • Step 0 - init
  • Step 1 local search
  • New_value Old_value + random number.
  • each pair of matrixes create a new matrix according to any of several combination
  • the first Bj elements will be taken from the matrix M, and the following 5- B j elements will be taken from the matrix M 2 .
  • Fig. 6 depicts the recombination process for a matrix of 5 cameras.
  • Step 4 Survivor selection
  • Steps 2 and 3 created a set of up to 2S+S 2 possible matrixes which stands for the
  • the highest rank solution (matrix) is the selected solution for the given number of cameras.
  • Search_radius search radius around the reference solution.
  • Step 1 Generate randomly a matrix in a distance (per variable) less than search_radius from
  • Step 2 - Calculate the resulting coverage level CL new .
  • Step 3 - if CL new is lower then CL then the new matrix will be the new reference. Otherwise,
  • the new matrix will be selected as the reference matrix with a probability of e "(C ne 'CL) T .
  • selection mechanism allows actual searching of global minimum and prevents locking in
  • the genetic algorithm is modified to handle selection of a subset of
  • the coverage level to include costs:
  • CL C is the generalized quality of coverage.
  • CL is the previously defined quality of coverage.
  • TC is the total cost of the cameras.
  • TC 0 is a threshold level of the cost.
  • r depicts the relative influence of the quality of coverage as measured earlier.
  • Step 0 - init
  • N an initial guess on the required number of cameras to meet the coverage
  • Step 1 local search
  • new_value old_value - differential_step*(CL new -
  • This step is the first step in the creation of matrixes with different sizes (variable
  • New_value Old_value + random
  • This step creates matrixes with different sizes (variable numbers of cameras).
  • M 2 can be of different sizes, N, and N 2 From each pair of matrixes create a new matrix
  • Step 4 Survivor selection
  • the above described process results in a variable size population, i.e., coverage
  • variable numbers of cameras as well.
  • Steps 2 and 3 created a set of size of up to 2S+S 2 possible matrixes which stand for
  • the simulated annealing procedure is done separately on each of the genetic algorithm
  • An output e.g., a display or a
  • printout can provide the optimized positions and angular orientations of the cameras, as well

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Studio Devices (AREA)
  • Image Processing (AREA)

Abstract

La présente invention concerne un procédé par laquelle les positions et orientations des caméras utilisés pour couvrir un volume telle une salle de spectacle ou un terrain de jeux sont optimisées par la combinaison d'un algorithme génétique et un algorithme de recuit simulé. En premier lieu on génère dans l'algorithme génétique des solution initiales aléatoires. On effectue une recherche locale autour de chacune des solutions initiales aléatoires afin de trouver une solution localement optimisée. On applique une mutation aléatoire à chacune des solutions localement optimisées en vue d'obtenir une solution mutée. On effectue une recombinaison des solutions mutées pour obtenir des solutions recombinées, qui sont triées par le niveau de la couverture. On sélectionne les solutions recombinées ayant les niveaux de couverture les plus élevés pour l'algorithme de recuit simulé. L'algorithme de recuit simulé débute par la génération aléatoire d'une nouvelle solution qui est séparée des la solution recombinée par moins d'un rayon d'exploration prédéterminée. On calcule un niveau de couverture pour la nouvelle solution. On effectue une répétition de l'algorithme de recuit simulé jusqu'à ce que soit atteinte une optimisation globale plutôt que simplement locale. Dans les algorithmes, chacune des solutions est présentée au niveau de chaque état par une matrice dont les valeurs sont égales au nombre de caméras à être placées et les cinq degrés de liberté de chaque caméra (trois coordonnées de position et deux coordonnées d'orientation angulaire). On peut utiliser la mutation peut également pour optimiser le nombre de caméras.
PCT/US2000/040011 1999-03-18 2000-03-17 Procede d'optimisation de reportage televise Ceased WO2000056056A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU32496/00A AU3249600A (en) 1999-03-18 2000-03-17 Method for optimization of video coverage

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12493199P 1999-03-18 1999-03-18
US60/124,931 1999-03-18

Publications (2)

Publication Number Publication Date
WO2000056056A2 true WO2000056056A2 (fr) 2000-09-21
WO2000056056A3 WO2000056056A3 (fr) 2001-01-04

Family

ID=22417483

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/040011 Ceased WO2000056056A2 (fr) 1999-03-18 2000-03-17 Procede d'optimisation de reportage televise

Country Status (2)

Country Link
AU (1) AU3249600A (fr)
WO (1) WO2000056056A2 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003005792A1 (fr) * 2001-07-04 2003-01-16 Koninklijke Philips Electronics N.V. Optimisation de la selection de marquages de repere utilises pour estimer la position d'un dispositif d'imagerie
WO2002056596A3 (fr) * 2001-01-10 2003-09-12 Koninkl Philips Electronics Nv Systeme et procede pour optimiser des reglages de parametres de commande dans une chaine d'algorithmes de traitement video
DE102004016077B4 (de) * 2004-03-30 2008-05-08 Daimler Ag Positionieren einer Komponente eines optischen Systems
ITMI20100741A1 (it) * 2010-04-29 2011-10-30 March Networks Corp Configurazione e comunicazione di elementi di rete video
US20120127175A1 (en) * 2010-11-18 2012-05-24 Technion Research & Development Foundation Ltd. Methods and systems for selecting object covering model fragments
EP2163094B1 (fr) * 2007-05-19 2012-11-07 Videotec S.p.a. Procédé et système pour surveiller un environnement
CN103630072A (zh) * 2013-10-25 2014-03-12 大连理工大学 双目视觉测量系统中摄像机的布局优化方法
EP2835792A1 (fr) * 2013-08-07 2015-02-11 Axis AB Procédé et système de sélection de position et d'orientation d'une caméra de surveillance

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110615293B (zh) * 2018-06-19 2021-09-14 佛山市顺德区美的电热电器制造有限公司 图像数据自动采集系统、自动采集方法以及自动识别系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6016389A (en) * 1996-05-09 2000-01-18 Musco Corporation Apparatus and method for lighting large areas for television
US6005610A (en) * 1998-01-23 1999-12-21 Lucent Technologies Inc. Audio-visual object localization and tracking system and method therefor

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002056596A3 (fr) * 2001-01-10 2003-09-12 Koninkl Philips Electronics Nv Systeme et procede pour optimiser des reglages de parametres de commande dans une chaine d'algorithmes de traitement video
US7082222B2 (en) 2001-01-10 2006-07-25 Koninklije Philips Electronics N.V. System and method for optimizing control parameter settings in a chain of video processing algorithms
WO2003005792A1 (fr) * 2001-07-04 2003-01-16 Koninklijke Philips Electronics N.V. Optimisation de la selection de marquages de repere utilises pour estimer la position d'un dispositif d'imagerie
DE102004016077B4 (de) * 2004-03-30 2008-05-08 Daimler Ag Positionieren einer Komponente eines optischen Systems
EP2163094B1 (fr) * 2007-05-19 2012-11-07 Videotec S.p.a. Procédé et système pour surveiller un environnement
EP2533535A1 (fr) * 2007-05-19 2012-12-12 Videotec S.p.a. Procédé et système pour surveiller un environnement
US8350911B2 (en) 2007-05-19 2013-01-08 Videotec S.P.A. Method and system for monitoring an environment
RU2494567C2 (ru) * 2007-05-19 2013-09-27 Видеотек С.П.А. Способ и система для контроля окружающей среды
ITMI20100741A1 (it) * 2010-04-29 2011-10-30 March Networks Corp Configurazione e comunicazione di elementi di rete video
US20120127175A1 (en) * 2010-11-18 2012-05-24 Technion Research & Development Foundation Ltd. Methods and systems for selecting object covering model fragments
EP2835792A1 (fr) * 2013-08-07 2015-02-11 Axis AB Procédé et système de sélection de position et d'orientation d'une caméra de surveillance
CN103630072A (zh) * 2013-10-25 2014-03-12 大连理工大学 双目视觉测量系统中摄像机的布局优化方法

Also Published As

Publication number Publication date
WO2000056056A3 (fr) 2001-01-04
AU3249600A (en) 2000-10-04

Similar Documents

Publication Publication Date Title
CN111836358B (zh) 定位方法、电子设备和计算机可读存储介质
Doctor et al. Optimal PSO for collective robotic search applications
JP4251545B2 (ja) 移動ロボット用経路計画システム
Haralampidis et al. Multi‐objective framework for structural model identification
US20020035419A1 (en) Autonomous navigation, guidance and control using LDRI
CN106952208A (zh) 犯罪自动预测方法及系统
Lund et al. Models for point processes observed with noise
Konakoglu et al. 2D coordinate transformation using artificial neural networks
CN114599004B (zh) 一种基站布局方法和装置
Doma Particle swarm optimization in comparison with classical optimization for GPS network design
Fatlawi et al. Optimal camera placement using sine-cosine algorithm
CN110113815B (zh) 一种改进的基于iwo的无线传感器网络定位方法
CN111289999A (zh) 一种基于遗传算法的伪卫星布设方法
CN118780476A (zh) 电网工程选站方法、装置、设备及计算机可读存储介质
Min et al. Heuristic optimization techniques for self-orientation of directional antennas in long-distance point-to-point broadband networks
CN119648790B (zh) 基于无人机的水稻田间杂草检测定位方法、装置、设备及介质
CN118898105A (zh) 屋顶光伏板安装布局优化方法、装置、设备及介质
CN117202237B (zh) 针对无人机的基站天线位置和上倾角的优化方法及系统
CN116070807B (zh) 一种基于空间关系的电站巡检路径规划方法及装置
Thyagarajan et al. Planning dissimilar paths for military units
CN116579288A (zh) 一种模拟集成电路版图布局方法及系统
CN114554403A (zh) 一种探测盲区的补盲方法及装置
Liang et al. Improved grey wolf optimizer and their applications
CN120991882B (zh) 一种基于改进教与学算法的路径规划方法及系统
CN110019329B (zh) 一种数据预测的方法及装置

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 09936787

Country of ref document: US

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase