CN105786331A - Improved focus navigation algorithm based on browser - Google Patents
Improved focus navigation algorithm based on browser Download PDFInfo
- Publication number
- CN105786331A CN105786331A CN201610159025.5A CN201610159025A CN105786331A CN 105786331 A CN105786331 A CN 105786331A CN 201610159025 A CN201610159025 A CN 201610159025A CN 105786331 A CN105786331 A CN 105786331A
- Authority
- CN
- China
- Prior art keywords
- focus
- candidate
- frame
- current
- exitpoint
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
- G06F3/0483—Interaction with page-structured environments, e.g. book metaphor
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention discloses an improved focus navigation algorithm based on a browser. The algorithm comprises steps as follows: step 1, coordinate values of a current focus and a candidate focus are read, and widths and heights of a current focus frame and a candidate focus frame are read; step 2, coordinate values of exitPoint and entryPoint are calculated; step 3, an overlap ratio of the current focus frame to the candidate focus frame is calculated and taken as a parameter for selection of a target focus; step 4, a logic distance between the current focus and the candidate focus is calculated and taken as another parameter for selection of the target focus. With the adoption of the algorithm, the focus navigation accuracy can be remarkably improved, a user can customize a personal focus shift algorithm to a certain extent according to own habits, and the user experience is substantially improved.
Description
Technical field
The present invention relates to Computer Browser technical field, be specifically related to a kind of improvement focus navigation algorithm based on browser.
Background technology
3C convergence era arrives, in consumer electronics product, embedding browser is also more and more frequent, man-machine, people's browser becomes more and more important alternately, and mutual and cognitive science, psychology, engineering field are all closely related, and the quality of interactive experience will directly affect user's fancy grade to product.
Popularizing of intelligent electronic device, the application of built-in browser is also very general.For being currently applied to such as the browser of intelligent television, intelligence box, it is all controlled by convenient remote controller, needing a set of user habit simultaneously efficient focus navigation method or algorithm of meeting to be necessary for this kind of browser, the focus navigation algorithm even can being adjusted according to user's request will be popular with users.
Current intelligent television, intelligence box pass through access internet through browsers, in the Internet, form web page is various, and structure of web page numerous and complicated, accurately control focus by convenient remote controller and meet user's request, still have the suitable difficulty, existing problem main forms to be, focus moving process is lost, focus moves more chaotic, and focus can not move quickly into the focus that user wishes to arrive, and user can not customize the focus navigation mechanism of oneself.Based on this situation, the present invention proposes a kind of improvement navigation algorithm based on browser focus, can significantly improve focus navigation accuracy, and user also can customize the focus moving algorithm of individual to a certain extent according to oneself custom, and Consumer's Experience is increased dramatically.
Summary of the invention
Instant invention overcomes the deficiencies in the prior art, it is provided that a kind of improvement focus navigation algorithm based on browser.
Consider the problems referred to above of prior art, according to an aspect disclosed by the invention, the present invention by the following technical solutions:
A kind of improvement focus navigation algorithm based on browser, described algorithm comprises the following steps:
Step 1, read out current focus and the coordinate figure of candidate's focus, read out width and the height of current focus frame and candidate's focus frame；
Step 2, the coordinate figure respectively (exitP.x, exitP.y) calculating exitPoint and entryPoint and (entryP.x, entryP.y)；
Step 3, calculate the registration of current focus frame and candidate's focus frame, it is alternatively that a parameter of goal-focus；
Step 4, according to calculated two coordinate figures of step 2, calculate the current focus logical reach to candidate's focus, it is alternatively that another parameter of goal-focus；
Wherein:
ExitPoint and entryPoint is two points that current focus frame is closest with on candidate's focus frame, and exitPoint is the point on current focus frame, and entrypoint is the point on candidate's focus frame；
Current focus described in step 4 to the computing formula of the logical reach of candidate's focus is:
Dis=k1*euclideandis+k2*sameaxisdis+k3*otheraxisdis
Wherein,
Sameaxisdis=| entryP.y-exitP.y |；
Otheraxisdis=| entryP.x-exitP.x |；
Euclideandis is the Euclidean distance of exitPoint to entryPoint, and sameaxisdis is the vertical dimension of the moving direction of exitPoint to entryPoint, and otheraxisdis is the horizontal range of the moving direction of exitPoint to entryPoint；K1, k2, k3 are variable parameter, and 0 < k1 < 1,0 < k2 < 1,0 < k3 < 1, k1+k2+k3=1.
In order to realize the present invention better, further technical scheme is:
According to one embodiment of the invention, the registration described in step 3 has: is completely superposed, partially overlaps and misaligned.
Further technical scheme: user can in foregrounding variable parameter, and system automatically updates, it is achieved user individual is arranged.
Further technical scheme again: by the logical reach of registration with candidate's focus frame of the current focus frame that calculates and current focus to candidate's focus, first select candidate's focus of maximal degree of coincidence, then selecting candidate's focus that logical reach is the shortest in the candidate's focus selected, the candidate's focus finally selected is goal-focus.
Compared with prior art, one of beneficial effects of the present invention is:
The algorithm of the present invention, can significantly improve focus navigation accuracy, and user also can customize the focus moving algorithm of individual to a certain extent according to oneself custom, and Consumer's Experience is increased dramatically.
Accompanying drawing explanation
For clearer explanation present specification embodiment or technical scheme of the prior art, below the accompanying drawing used required in the description to embodiment or prior art is briefly described, apparently, the accompanying drawing that the following describes is only to the reference of some embodiments in present specification, for those skilled in the art, when not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 illustrates the workflow diagram of improvement focus navigation algorithm based on browser according to an embodiment of the invention.
Fig. 2 is a kind of location diagram of the current focus in the embodiment of the present invention and candidate's focus.
Detailed description of the invention
Below in conjunction with embodiment, the present invention is described in further detail, but embodiments of the present invention are not limited to this.
Embodiment
A kind of improvement focus navigation algorithm based on browser, referring to shown in Fig. 1 and Fig. 2, according to one embodiment of present invention, this algorithm comprises the following steps:
Step 1, read out current focus and the coordinate figure of candidate's focus, read out width and the height of current focus frame and candidate's focus frame.
Focus navigation, is select the next highlighted focus frame of target for user, when focus moves, focus on focus moving direction is joined candidate's focus collection, not focus in one direction, will not be the focus needed for user, so foreclosing, increase the efficiency that algorithm performs.First the coordinate figure of current focus is read out, focus is to exist with the form of rectangle frame, it is possible to read current focus width and height simultaneously, then choose this algorithm according to necessarily rule in candidate's focus concentration and calculate candidate's focus used, obtain its coordinate figure and width, height equally.
Here concentrate from candidate's focus and choose candidate's focus, it is according to certain rule, particularly as follows: the rule be the form existed in kernel with focus being benchmark, have with dom tree, have with chained list exist, but all candidate's focuses in focus Candidate Set all can be chosen out and calculate registration and logical reach, then compare optimal objective focus.It is move down for focus to be described in detail in the present embodiment.
Step 2, the coordinate figure respectively (exitP.x, exitP.y) calculating exitPoint and entryPoint and (entryP.x, entryP.y).
Wherein, exitPoint and entryPoint is two points that current focus frame is closest with on candidate's focus frame, and exitPoint is the point on current focus frame, and entrypoint is the point on candidate's focus frame.
Step 3, calculate the registration of current focus frame and candidate's focus frame, it is alternatively that a parameter of goal-focus.
Relation between two focuses has three kinds: is completely superposed (Full), partially overlaps (Partial) and misaligned (None).This step there is also in conventional focal navigation algorithm, and embodiment given here adopts one to be concisely and efficiently computational methods, and its principle is: 1) central point of a focus drops in another focus, is Full；2) two focuses exist crossing in one direction, are Partial；3) when satisfying condition 1) time no longer Rule of judgment 2), condition 1), 2) be all unsatisfactory for, then be None.
Registration calculate in focus navigation also it is critical that, because registration high to be clearly superior to registration low, choosing of focus can be accelerated in algorithm realizes, the judgement priority of registration is also an advantage over logical reach.
Step 4, according to calculated two coordinate figures of step 2, calculate the current focus logical reach to candidate's focus, it is alternatively that another parameter of goal-focus.
Current focus to the computing formula of the logical reach dis of candidate's focus is:
Dis=k1*euclideandis+k2*sameaxisdis+k3*otheraxisdis
Wherein:
Sameaxisdis=| entryP.y-exitP.y |；
Otheraxisdis=| entryP.x-exitP.x |；
Euclideandis is the Euclidean distance of exitPoint to entryPoint, and sameaxisdis is the vertical dimension of the moving direction of exitPoint to entryPoint, and otheraxisdis is the horizontal range of the moving direction of exitPoint to entryPoint；K1, k2, k3 are variable parameter, and 0 < k1 < 1,0 < k2 < 1,0 < k3 < 1, k1+k2+k3=1.
By this three classes distance union, and with variable parameter k1, k2, k3, these three variable parameter can be that algorithm pre-sets, it is also possible to being the setting according to user foreground, system has automatically updated, and then realizes user individual and arranges.And the difference of these three variable parameter could alter that its ratio that each distance is shared in final logical reach, and then change bifocal selection, in algorithm, variable parameter value is more little, the ratio accounted in final logical reach dis is more little, then represent and this kind of distance is more paid close attention to, be more likely to focus to shift to this direction.
Logical reach by registration with candidate's focus frame of the current focus frame that calculates and current focus to candidate's focus, first select candidate's focus of maximal degree of coincidence, then selecting candidate's focus that logical reach is the shortest in the candidate's focus selected, the candidate's focus finally selected is goal-focus.
The algorithm of the present embodiment, can significantly improve focus navigation accuracy, and user also can customize the focus moving algorithm of individual to a certain extent according to oneself custom, and Consumer's Experience is increased dramatically.
In this specification, each embodiment adopts the mode gone forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, identical similar portion cross-reference between each embodiment.
Than that described above, it can further be stated that, " embodiment ", " another embodiment ", " embodiment " spoken of in this manual etc., refer to the specific features, structure or the feature that describe in conjunction with this embodiment and include at least one embodiment that the application generality describes.Multiple local appearance statement of the same race is not necessarily refer to same embodiment in the description.Furthermore, it is understood that when describing a specific features, structure or feature in conjunction with any embodiment, what advocate is also fall within the scope of the present invention to realize this feature, structure or feature in conjunction with other embodiments.
Although reference be made herein to invention has been described for the multiple explanatory embodiment of the present invention, but, it should be understood that those skilled in the art can be designed that a lot of other amendments and embodiment, these amendments and embodiment will drop within spirit disclosed in the present application and spirit.More specifically, in disclosure and scope of the claims, it is possible to building block and/or layout to theme composite configuration carry out multiple modification and improvement.Except the modification that building block and/or layout are carried out and improvement, to those skilled in the art, other purposes also will be apparent from.
Claims (4)
1. the improvement focus navigation algorithm based on browser, it is characterised in that described algorithm comprises the following steps:
Step 1, read out current focus and the coordinate figure of candidate's focus, read out width and the height of current focus frame and candidate's focus frame；
Step 2, the coordinate figure respectively (exitP.x, exitP.y) calculating exitPoint and entryPoint and (entryP.x, entryP.y)；
Step 3, calculate the registration of current focus frame and candidate's focus frame, it is alternatively that a parameter of goal-focus；
Step 4, according to calculated two coordinate figures of step 2, calculate the current focus logical reach to candidate's focus, it is alternatively that another parameter of goal-focus；
Wherein:
ExitPoint and entryPoint is two points that current focus frame is closest with on candidate's focus frame, and exitPoint is the point on current focus frame, and entrypoint is the point on candidate's focus frame；
Current focus described in step 4 to the computing formula of the logical reach of candidate's focus is:
Dis=k1*euclideandis+k2*sameaxisdis+k3*otheraxisdis
Wherein,
Sameaxisdis=| entryP.y-exitP.y |；
Otheraxisdis=| entryP.x-exitP.x |；
Euclideandis is the Euclidean distance of exitPoint to entryPoint, and sameaxisdis is the vertical dimension of the moving direction of exitPoint to entryPoint, and otheraxisdis is the horizontal range of the moving direction of exitPoint to entryPoint；K1, k2, k3 are variable parameter, and 0 < k1 < 1,0 < k2 < 1,0 < k3 < 1, k1+k2+k3=1.
2. the improvement focus navigation algorithm based on browser according to claim 1, it is characterised in that: the registration described in step 3 has: is completely superposed, partially overlaps and misaligned.
3. the improvement focus navigation algorithm based on browser according to claim 1, it is characterised in that: user can in foregrounding variable parameter, and system automatically updates, it is achieved user individual is arranged.
4. the improvement focus navigation algorithm based on browser according to claim 1, it is characterized in that: by the logical reach of registration with candidate's focus frame of the current focus frame that calculates and current focus to candidate's focus, first select candidate's focus of maximal degree of coincidence, then selecting candidate's focus that logical reach is the shortest in the candidate's focus selected, the candidate's focus finally selected is goal-focus.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610159025.5A CN105786331A (en) | 2016-03-18 | 2016-03-18 | Improved focus navigation algorithm based on browser |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610159025.5A CN105786331A (en) | 2016-03-18 | 2016-03-18 | Improved focus navigation algorithm based on browser |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105786331A true CN105786331A (en) | 2016-07-20 |
Family
ID=56393121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610159025.5A Pending CN105786331A (en) | 2016-03-18 | 2016-03-18 | Improved focus navigation algorithm based on browser |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105786331A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109445619A (en) * | 2018-09-07 | 2019-03-08 | 苏宁智能终端有限公司 | A kind of focus searching method applied to intelligent display terminal and seek coke installation |
| CN110704146A (en) * | 2019-08-30 | 2020-01-17 | 华为技术有限公司 | Focus management method applied to electronic equipment and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008016561A1 (en) * | 2006-07-31 | 2008-02-07 | Microsoft Corporation | User interface for navigating through images |
| CN102202240A (en) * | 2011-05-19 | 2011-09-28 | 广东星海数字家庭产业技术研究院有限公司 | Set-top box browser control focus skip method |
| CN102402601A (en) * | 2011-11-18 | 2012-04-04 | 四川长虹电器股份有限公司 | Focus navigation method based on embedded full-functional browser |
| CN104301796A (en) * | 2014-09-26 | 2015-01-21 | 四川长虹电器股份有限公司 | Method for automatically controlling focus of master shot of smart television |
| CN104778239A (en) * | 2015-04-03 | 2015-07-15 | 中国科学院声学研究所 | Focus query method for embedded browser |
| CN105307048A (en) * | 2015-10-15 | 2016-02-03 | 中国科学院声学研究所 | WebKit kernel based focus query method of smart television |
-
2016
- 2016-03-18 CN CN201610159025.5A patent/CN105786331A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008016561A1 (en) * | 2006-07-31 | 2008-02-07 | Microsoft Corporation | User interface for navigating through images |
| CN102202240A (en) * | 2011-05-19 | 2011-09-28 | 广东星海数字家庭产业技术研究院有限公司 | Set-top box browser control focus skip method |
| CN102402601A (en) * | 2011-11-18 | 2012-04-04 | 四川长虹电器股份有限公司 | Focus navigation method based on embedded full-functional browser |
| CN104301796A (en) * | 2014-09-26 | 2015-01-21 | 四川长虹电器股份有限公司 | Method for automatically controlling focus of master shot of smart television |
| CN104778239A (en) * | 2015-04-03 | 2015-07-15 | 中国科学院声学研究所 | Focus query method for embedded browser |
| CN105307048A (en) * | 2015-10-15 | 2016-02-03 | 中国科学院声学研究所 | WebKit kernel based focus query method of smart television |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109445619A (en) * | 2018-09-07 | 2019-03-08 | 苏宁智能终端有限公司 | A kind of focus searching method applied to intelligent display terminal and seek coke installation |
| CN110704146A (en) * | 2019-08-30 | 2020-01-17 | 华为技术有限公司 | Focus management method applied to electronic equipment and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102402601B (en) | Focus navigation method based on embedded full-functional browser | |
| CN107169411B (en) | A kind of real-time dynamic gesture identification method based on key frame and boundary constraint DTW | |
| Arkin | Path planning for a vision-based autonomous robot | |
| CN106155644B (en) | Webpage focal point control implementation method suitable for smart television browser | |
| US20110310088A1 (en) | Personalized navigation through virtual 3d environments | |
| US9015633B2 (en) | Data management apparatus and method for organizing data elements into multiple categories for display | |
| CN106874296A (en) | A kind of style recognition methods of commodity and device | |
| CN107292234A (en) | It is a kind of that method of estimation is laid out based on information edge and the indoor scene of multi-modal feature | |
| CN101763439A (en) | Hypervideo construction method based on rough drawings | |
| CN105354881B (en) | Distortion of the mesh optimized algorithm based on Category Attributes data | |
| CN102622225A (en) | Multipoint touch application program development method supporting user defined gestures | |
| CN104200240A (en) | Sketch retrieval method based on content adaptive Hash encoding | |
| CN107870990A (en) | A kind of automobile recommends method and device | |
| CN103617247B (en) | Adsorption intelligent information mask method and device for CAD system | |
| CN105354335B (en) | For the time-varying tree graph layout method of time-varying hierarchical data and application | |
| CN105786331A (en) | Improved focus navigation algorithm based on browser | |
| CN106293409A (en) | A kind of beautification method of lightweight scroll bar | |
| CN103236077A (en) | Feature enhancement line drawing method for three-dimensional model | |
| Caramiaux et al. | Beyond recognition: using gesture variation for continuous interaction | |
| CN109271079A (en) | Moving method, device and the computer readable storage medium of screen focus | |
| CN106017494B (en) | Paths planning method and device based on apprentice's study | |
| Lemonari et al. | Authoring virtual crowds: A survey | |
| US11449662B2 (en) | Automatic generation of layout variations based on visual flow | |
| Deng et al. | Citygen: Infinite and controllable 3d city layout generation | |
| Sang et al. | Mstcnn: multi-modal spatio-temporal convolutional neural network for pedestrian trajectory prediction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160720 |